Previous Guy now racketeering sedition with Lindsey’s ‘riots in the streets’ but in even hotter water. The House Oversight Committee will finally receive Trump’s financial records but not his tax returns (yet), demanded by House Ways & Means. Even Lindsey now has to testify in front of a Georgia grand jury. Trump now claims that the DoJ ‘raid’ at Mar-a-lago was looking for … wait for it, Hillary’s emails. Who knew? All that trumpian lawfare couldn’t be construed as obstruction, could it? Distraction, deflection, and the most absurd misdirection comes when the going gets weird for the orange tough guy. No ruling yet on on Donald Trump’s request for a third-party special master to sift through the classified documents seized by the FBI. https://t.co/q8dsJiijqX
ugh. but hard to see how she could even write this up. and doesn’t just slow case down and interfere w/ ODNI process. it provides Trump an overall argument and defense to suggest that executive privilege even could be an issue. https://t.co/i9Ko4YEU6v
Again, what would happen if a special master found executive privilege in the docs? wd have to return to archives etc. if Cannon ‘s opinion indicates Trump would have some interest in them, that’s a practical and legal disaster and DOJ would have to appeal. WEST PALM BEACH, Fla. — A federal judge indicated Thursday that she’s seriously considering temporarily barring Justice Department investigators from reviewing material seized from Donald Trump’s Mar-a-Lago estate. U.S. District Court Judge Aileen Cannon suggested that she’s mulling imposing that restriction, while potentially allowing an exception for the intelligence community to continue reviewing national security risks from the potential exposure of the seized documents. Justice Department attorneys pushed back sharply against that outcome, warning against any disruption to their ongoing criminal investigation of Trump’s handling of classified documents. Cannon, who previously said she’s inclined to appoint an outside review of the materials seized form Trump’s estate, appeared undeterred during a 90-minute hearing that featured arguments from DOJ counterintelligence officials and Trump’s legal team. Justice Department attorneys repeatedly pleaded with Cannon not to interrupt their ongoing criminal probe, emphasizing that the search warrant executed on Aug. 8 was clearly valid and authorized to obtain “evidence of three significant federal crimes.” “He is no longer the president and because he is no longer the president he did not have the right to take those documents,” said Jay Bratt, the chief of the Justice Department’s counterintelligence division. “He was unlawfully in possession of them…This plaintiff does not have an interest in the classified and other presidential records.” Cannon, a Trump appointee, said she was concerned about a couple of instances in which the investigative team had flagged potentially privileged material that was not screened out during the initial review of records by the DOJ “filter team” assigned to prevent such occurrences. She also indicated she might support a special master with broad purview to screen documents for any potentially subject to executive privilege claims by Trump — despite DOJ’s argument that no such claim could ever be upheld. “It would be unprecedented for the executive to be able to successfully assert privilege against the executive branch,” said Julie Edelstein, Bratt’s deputy. If Cannon ultimately issues an order that embraces these positions, it could cause significant disruption to DOJ’s investigation. Although DOJ warned that such a disruption would also harm the intelligence community’s review of the seized records for risks to national security, Cannon said she envisioned a potential carveout to allow that review to continue, even while DOJ would lack access. Bratt said that if Cannon opted to deploy a wide-ranging special master and prevent DOJ from accessing the materials during the review, she should issue a formal injunction. The Justice Department would be allowed to appeal such an order. www.politico.com/…
She may even allow Trump’s team to see the seized records while DOJ can’t. Prosecutors tried to maneuver the judge, if she does that, to issue a ruling that DOJ could immediately appeal.
This morning the House Oversight Committee announced that it will finally,finallyget its hands on Donald Trump’s financial records. And it only took three bloody years! “After numerous court victories, I am pleased that my Committee has now reached an agreement to obtain key financial documents that former President Trump fought for years to hide from Congress,”Chair Carolyn Maloneysaidthis morning. Trump’s decision to finally tap out, a full two years after the Supreme Courtrejectedhis screeching about the president’s magic invisibility cloak of total immunity, marks an end to a battle that has raged virtually every second since Democrats took back the House in 2019. In February of that year, Michael Cohen, the president’s former attorney and fixer, gave Congress partial financial statements prepared for Trump by the accounting firm Mazars USA, LLP, which appeared to show conflicting representations to lenders about his assets. After an informal request the following month, the House Oversight Committeeissued a subpoenain April of 2019 to the company for all the then-president’s financial records on the grounds that they were relevant to federal ethics laws, since Uncle Sam was the landlord for Trump’s DC hotel. […] And today Trump finally agreed to quit throwing his stupid tantrum so Mazars could hand over the subpoenaed documents. “Under the agreement reached by the Committee, former President Trump has agreed not to further appeal the D.C. Circuit’s ruling, and Mazars USA has agreed to comply with the court’s order and produce responsive documents to the Committee as expeditiously as possible,” the committee said in a statement on its website. So, after all this time, does it matter? The subpoena was two impeachments, one insurrection, one federal search warrant, and hundreds of pages of purloined classified documents ago — not to mention the Mueller Report. Trump appears to haveescapedcriminal prosecution by Manhattan District Attorney Alvin Bragg, and his company is likely to get off with aslap on the wristfor effectively paying executive Alan Weisselberg under the table. So many of those things that we obsessed about for four years (it me, Mueller comin’!) failed to move the needle, much less bring the old crook to justice. Right now, he’s closer than he ever has been to facing serious legal consequences for his crimes, thanks to Attorney General Merrick Garland. (Who had that one on their prediction list, right?) www.wonkette.com/… All his life he has been convinced he can commit crimes and count on lawyers to help him obfuscate, delay and otherwise avoid consequences. That string of corruption and criminality—now including taking top-secret & refusing to return them— looks to finally be coming to an end.
The former president then suggested he was working behind the scenes to get McConnell ousted as Senate GOP leader. “He’s not good,” Trump said. “And we’re going to go through him. And then we’ll have to, later on, we’ll have to do something with him.” www.rawstory.com/… In a new interview, Trump says he believes DOJ was really looking for Russiagate material and Hillary Clinton emails during the search. pic.twitter.com/PtLBIQKjwp
While aggregating threads/articles for a book project, I came across a 9/30/19 thread responding to Trump retweeting “pastor” @robertjeffress stating there would be “civil war like fracture” if Trump was held accountable for high crimes & misdemeanors. 1/https://t.co/2pKLVeyop5
Damning op-ed by former Trump booster & judge Andrew Napolitano https://t.co/826rnY1RXw The newest aspect of the case against Mr. Trump that we learned from the redacted affidavit is the obstruction allegation. This is not the obstruction that Robert Mueller claimed he found Mr. Trump committed during the Russia investigation. This is a newer obstruction statute, signed by President George W. Bush in 2002, that places far fewer burdens on the feds to prove. The older statute is the one Mr. Mueller alleged. It characterizes any material interference with a judicial function as criminal. Thus, one who lies to a grand jury or prevents a witness from testifying commits this variant of obstruction. But the Bush-era statute, the one the feds contemplate charging Mr. Trump with having violated, makes it a crime of obstruction by failing to return government property or by sending the FBI on a wild goose chase looking for something that belongs to the government and that you know that you have. This statute does not require the preexistence of a judicial proceeding. It only requires that the defendant has the government’s property, knows that he has it and baselessly resists efforts by the government to get it back. Where does all this leave Mr. Trump? The short answer is: in hot water. The longer answer is: He is confronting yet again the federal law enforcement and intelligence communities for which he has rightly expressed such public disdain. He had valid points of expression during the Russia investigation. He has little ground upon which to stand today. m.washingtontimes.com/…
On Hannity’s show, Trump’s lawyers are *not even asked* basic questions like these:
Did Trump direct you to swear on his behalf that all docs had been retrieved when they hadn’t?
Trump has a version of “winning” here: Stall endlessly in court and deceive millions into believing he’s the victim. Then muddle through to getting away with it all.
The #FBI is serving a search warrant of a #Russian oligarch questioned in the investigation into Russian interference in the 2016 U.S. presidential election a week after top secret documents were found at #Trump’s #MarALago residence. Could get interesting https://t.co/MPTWSxvJwO
“As such, Senator Graham may be questioned about any alleged efforts to encourage Secretary Raffensperger or others to throw out ballots or otherwise alter Georgia’s election practices and procedures,” May wrote. “Likewise, the grand jury may inquire into Senator Graham’s alleged communications and coordination with the Trump Campaign and its post-election efforts in Georgia, as well as into Senator Graham’s public statements related to Georgia’s 2020 elections.” www.rawstory.com/…
Featured Shows MSNBC TV More Follow msnbc More Brands More Shows By Steve Benen Before launching a Republican U.S. Senate campaign in Pennsylvania, Mehmet Oz didn’t explicitly say he supported abortion rights, but it was easy to get that impression. As recently as 2019, for example, the celebrity doctor said he was “really worried“ about the harmful consequences for women’s health if the Supreme Court overturned Roe v. Wade. He went on to question whether it was “logical” to believe that life begins at conception. It’s against this backdrop that the first-time GOP candidate took a surprisingly far-right line on the issue ahead of his primary election. NBC News reported: Pennsylvania Senate candidate Dr. Mehmet Oz said in May that abortion at any stage of pregnancy is “still murder” because he believes that life begins at conception, according to newly obtained audio.
Advertisement Supported by The federal judge in Florida also indicated that she would unseal a more detailed inventory of the materials seized in the search of the former president’s Mar-a-Lago home. Send any friend a story As a subscriber, you have 10 gift articles to give each month. Anyone can read what you share. By Patricia Mazzei, Alan Feuer and Charlie Savage WEST PALM BEACH, Fla. — A federal judge signaled on Thursday that she remained open to granting former President Donald J. Trump’s request to appoint an independent arbiter to go through documents the F.B.I. seized from him last month, but stopped short of making a final decision. After a nearly two-hour hearing, the judge, Aileen M. Cannon of the Federal District Court for the Southern District of Florida, reserved judgment on the question of whether to appoint a so-called special master in the case, saying she would issue a written order “in due course.” Notably, Judge Cannon did not direct the F.B.I. to stop working with the files, which the Justice Department has said have already undergone a preliminary review by law enforcement officials. Judge Cannon, who was appointed by Mr. Trump in 2020, also indicated that she would unseal a more detailed list of the documents the F.B.I. took during its Aug. 8 search of Mar-a-Lago, Mr. Trump’s private club and residence in Florida. She had earlier ordered the Justice Department to provide the list to Mr. Trump’s legal team at its request. It was not clear when it would become public. During the hearing, Judge Cannon pressed the government to explain what harm could come from appointing a special master. Jay I. Bratt, the head of the Justice Department’s counterintelligence section, told her that a special master could slow down an assessment of the risk and damage to national security being conducted by the Office of the Director of National Intelligence — as well as an assessment of whether the seized documents contain the sort of national security secrets whose unauthorized retention is a crime under the Espionage Act. “We are dealing with over 300 records here” that had classification markings on them, Mr. Bratt said. “That process has begun. That process needs to continue.” But Judge Cannon appeared to suggest that if she did appoint a special master, she would do so in a way that would not hinder the security risk assessment. The judge also left unclear whether she would limit the scope of any special master’s work to setting aside a small number of documents that may be subject to attorney-client privilege. The F.B.I. has said it has already identified and set aside about 60 of such documents, suggesting that a special master focused on that topic would not disrupt the Justice Department’s inquiry. But Mr. Trump’s legal team also wants a potential special master to scrutinize the seized materials for any shielded by executive privilege, which protects confidential internal executive branch communications from disclosure. The Justice Department has said that executive privilege cannot be used to keep a part of the executive branch, like the department itself, from reviewing government files as part of its official responsibilities. During the hearing, one of Mr. Trump’s lawyers, James Trusty, called the appointment of a special master a “really modest idea.” But one of the Justice Department lawyers, Julie Edelstein, countered that if a special master went beyond setting aside attorney-client privileged files and delved into executive privilege issues, “it would not be modest — it would be unprecedented.” “There is no role for a special master to play in executive privilege,” Ms. Edelstein added. Judge Cannon appeared less certain, however, telling Ms. Edelstein: “I’m not sure it’s as cut and dried” as the government has argued. At another point, Mr. Trusty sought to play down the gravity of the Justice Department’s investigation of Mr. Trump, comparing his client’s repeated failures to return government-owned documents to the National Archives or to fully respond to the grand jury subpoena seeking the return of those marked as classified to having an “overdue library book.” Mr. Trusty also said that the Trump legal team did not concede that the documents were classified. But he did not put forward the claim, which Mr. Trump has made on his social media platform and in interviews with conservative news outlets, that he had declassified everything he took with him from the Oval Office. No meaningful evidence has emerged to support the existence of such an order by Mr. Trump, who made the claim after the F.B.I. search. The Justice Department has said that Mr. Trump’s lawyers did not assert that the documents had been declassified during earlier interactions with the government, including over the subpoena requiring the return of the materials. That disconnect echoed a pattern from Mr. Trump’s unsuccessful efforts to challenge the results of the 2020 election, when he and his lawyers proclaimed wild conspiracy theories to the public but were more cautious in court, where there are professional consequences for lawyers who lie. While the appointment of a special master is a not-uncommon procedural step in complex cases, the hearing in front of Judge Cannon followed a battle waged this week in court papers, reflecting the extraordinary nature of the investigation. The papers filed by both sides often seemed to be as much about courting public opinion as about the underlying legal issues. In a filing on Tuesday night, for instance, prosecutors included a striking photograph, taken to catalog the evidence they had seized, of folders labeled “Top Secret,” which the F.B.I. had taken from Mr. Trump’s personal office at Mar-a-Lago and arrayed on a carpet. The filing also detailed how Mr. Trump and his lawyers had repeatedly frustrated the government’s attempts to get the materials back, including evidence that Mr. Trump’s circle had concealed some files marked as classified and falsely said that all were turned over in response to a subpoena. On Wednesday night, Mr. Trump’s lawyers shot back with a filing that described the Mar-a-Lago search as “unprecedented, unnecessary and legally unsupported” and suggested that the photo had been staged “for dramatic effect.” They also argued that Mr. Trump had done nothing wrong by holding onto White House records because they were “his own presidential records.” But that characterization clashed with the Presidential Records Act of 1978, which makes clear that the government, not the president or a former president, owns White House files generated during his time in office. The hearing was the first time that lawyers for Mr. Trump had appeared in court for a proceeding related to the Mar-a-Lago search. His legal team chose to remain on the sidelines last month, when lawyers for several news organizations sought to unseal the affidavit used to obtain the search warrant for Mar-a-Lago, a move that the Justice Department opposed. Advertisement
Monarda Thrasher loved Mixed Precipitation’s traveling production of “The Magic Flute” when they saw it earlier this month in Grand Marais, and they highly recommend this fun, modern take on Mozart’s opera. Mixed Precipitation calls its traveling series “The Pickup Truck Opera” because the truck and trailer are both the mode of travel and part of the set design. Set in Strange Land Middle School, this production explores teacher shortages, burnout and toxic positivity. Papageno and Papagena are janitors, and the raging Queen of the Night is recast as an education administrator. The dialogue is in English, and performers slip easily from German arias to pop songs and back again. As an opera lover, Thrasher worried that this shortened production might leave them wanting more, but they said there was enough of the original music to satisfy, danced and sung in a way that kept their whole family entertained. The outdoor production takes place Saturday and Sunday at 2 p.m. at Alexis Bailly Vineyard in Hastings, as well as Sept. 10 at Swede Hollow Park in St. Paul and Sept. 11 at JD Rivers’ Children’s Garden in Minneapolis. Minneapolis comedian Robert Fones plans to spend his Labor Day weekend at Prairie Fyre music festival in Wood Lake in southwestern Minnesota. The camping/music festival runs Friday evening through Monday, with a line-up of over 50 bands and performers. Fones says the space that will hold the event is beautiful, and he’s intrigued by the line-up of music, burlesque, comedy, and poetry. Festival attendees can also join in on glitch art workshops Saturday and Sunday mornings in nearby Granite Falls and get back in time for the musical events that start at 2 pm. Friday evening’s opening event features a Q&A with comic book author Rob Sheridan, who is best known for his art work with Nine Inch Nails. Will Dykes of the band Montclair really enjoys the sound of the Rat Castle Jazz Ensemble. He says the Minneapolis group has a unique sound that doesn’t pander and they collaborate and connect with other local bands. You can find the Rat Castle Jazz Ensemble’s work on all streaming platforms as well performing across the Twin Cities. Here they are at the White Squirrel bar in St. Paul: MPR News is made by Members. Gifts from individuals fuel the programs that you and your neighbors rely on. Donate today to power news, analysis, and community conversations for all. Donate today. A gift of $17 makes a difference.
PANAMA CITY, Fla. (WJHG/WECP) – Crime and Safety Analyst Paul Vecker stopped by the studio to explain how to avoid telephone scams that have been on the rise lately. He advised to be cautious in giving out your information and if the call doesn’t seem right, simply hang up the phone. To learn more, watch the video attached. Copyright 2022 WJHG. All rights reserved.
Nelly Cheboi, 29, lived the American dream. Born in a poor family in Mogotio, Baringo County, her fortunes changed when she secured a scholarship through Zawadi Africa to study computer science at Augustana College in Illinois, graduating in 2015. Thereafter, Cheboi worked as a business analyst and lead software engineer for two US firms – New World Van Lines and User-Hero. But she left all that behind and came back to her village in 2019 with the sole aim of empowering her community borrowing from her experiences in the US.
Ms Cheboi co-founded Technologically Literate Africa (TechLit Africa), a company that uses recycled computers to create tech labs in schools. She serves as its CEO. But her first mission while still in campus was to uplift her family. Through a work-study programme, she secured a job as a janitor, which her Sh40,000 a month thanks to the extra hours she put in. Out of her earnings, she saved 80 per cent over one year and came back to Kenya.
“After a year, I returned home. I first went to a local market in Nairobi and did some shopping for my mother, showed up in our village with a pick up full of shopping and relocated my mother to a better place and for the first time, we were able to invite our friends to visit. I continued to work and upgrade the lives of my family and my neighbours,” says Ms Cheboi. Sustain operations She decided to buy a plot and build a school, which she named Zawadi Yetu, where children would study more about technology with parents only paying a small fee monthly to sustain operations.
When The Saturday Standard caught up with her at the firm’s offices in Mogotio town, she was in a room with over 10 children – all glued on computer screens. Cheboi, who was listed in the Forbes 30 under 30 list in April, ushered us into the room as she excused herself from the children, who looked eager to learn from her. “This is something I love to do,” she says as she leads us to an adjacent office. She continues with a grin on her face; “Here, we are teaching these children how to be software engineers, graphic designers, marketers, make money online, music production, video production, coding.”
Nelly Cheboi at Zawadi Academy in Mogotio, Baringo County on August 31, 2022. She resigned from a job in the USA and relocated to her village to fight poverty using Technology. [Harun Wathari, Standard]
Ms Cheboi says her joy is to see the children in the remote village learn and make their own money because the country’s education system has failed many. Most of the 4,000 children, aged between 10 and four, are from needy families but well-off parents with children in private schools have also shown interest.
“I have partnered with 10 schools in Baringo, Nakuru and Mombasa to help them learn technology as part of their curriculum by using recycled computer technology,” she says. The schools rely on donations to collect, ship and import donated computers, as well as to develop curriculum and administer digital skills education. Techlit Africa, she said, has a vision of reaching 100 schools with 40,000 pupils across the country. Initially, it targeted adults to learn basic computer skills to enable them stay relevant and connected with the outside world. However, Ms Cheboi faced rejection from the same people who should have benefited, forcing her to shift focus to children who were ready and yearning to acquire computer skills. She said it was difficult for her to convince parents to pay Sh100 per child in targeted schools with many accusing her for scamming them. But Cheboi reveals that even after returning to Kenya, she continued to remotely work for a US firm earning Sh1 million a month. “I was employed by an American company and earned Sh1 million monthly. When Covid-19 pandemic hit, I was working at night but I resigned in July to take time off. The point is with computer skills one can work anywhere globally,” she says. Ms Cheboi has employed over 20 staff in both schools and her salon school, which empowers women with skills. But why did she make such a major career switch? When Cheboi was growing up, she never imagined that one day she would redeem her family from the shackles of poverty. “I grew up in a very poor family. My mother was struggling with everything, food, clothing and our education. She had to do odd jobs in the village to make ends meet,” she recalls and reveals it is her mother’s resilience that inspired her and other members of the family. Educating girls “We would go to bed on empty stomachs but she was hopeful that everything will be okay. She kept on telling us that one day, things will change for the better and our family will uplift not only our living standards but the entire community,” she recalls. “With what was happening, I took upon myself to study with the intention of building a house for my mother who put up with ridicule to see us get education. Neighbours would tell her that she was wasting her time educating girls who eventually will be married but she gave them a deaf ear,” Cheboi says, adding she relied on a security light at a nearby shop to study. Your experience on this site will be improved by allowing cookies. Subscribe to our newsletter and stay updated on the latest developments and special offers! Pick your favourite topics below for a tailor made homepage just for you
Pandaily Everything about China's Innovation Tencent Music Entertainment Group (TME), the leading online music and audio entertainment platform in China, announced on August 31 a new partnership with global music media brand Billboard. This partnership leverages TME’s technological prowess and local music industry insights with Billboard’s global brand authority to promote the impact of Chinese music around the world. The two parties will launch the “Chinese Music Gravity Project,” a first-of-its-kind initiative dedicated to championing Chinese music across an international audience. Through a series of engaging content collaborations and features, TME and Billboard will shine a light on the diverse stories of Chinese music artists before the expansive world stage. Under this partnership, TME and Billboard will combine their expertise to highlight China’s music industry and share Billboard’s global content across TME’s wide-ranging channels. This will include TME’s own platforms – QQ Music, Kugou Music, Kuwo Music, and WeSing. All will feature Billboard’s high-quality content, authoritative charts, global music news coverage, and expert recommendations. SEE ALSO: Tencent Music to Launch One-Stop Music Production Services Platform Billboard powers the ultimate global music destination and magazine, featuring unrivaled reporting on music news, issues, trends, and the industry’s definitive charts, encompassing the most complete database of charts across all music genres. This cooperation with TME follows Billboard’s official entry into the Chinese market earlier in August. At that time, Billboard said it would seek cooperation with local industry partners in China to create a series of blockbuster content tailored to domestic music lovers, as well as spreading and promoting the country’s artists and music around the world. On August 9, world-renowned music content platform Billboard announced its official entry into the Chinese market, further expanding its global influence and bringing rich global music trends and content to music lovers in the country. On July 5, State Power Investment Corporation Limited (SPIC) and Alibaba Group signed a strategic cooperation agreement along with eight implementation agreements. An Indian court lifted a freeze on smartphone maker vivo’s bank accounts imposed by the country’s financial crime agency and ordered the Chinese company to provide a bank guarantee of $119 million. Stellantis, a multinational automotive manufacturer, announced on July 18 that the company will adopt an asset-light approach to develop its Jeep brand in China.
Pandaily is a tech media based in Beijing. Our mission is to deliver premium content and contextual insights on China’s technology scene to the worldwide tech community. The automated manchine translation of regional languages is powered by NiuTrans. We also support Hindi language, do you want change to it? हम यह भी हिन्दी भाषा का समर्थन है, आप इसे करने के लिए परिवर्तन करना चाहते हैं? We also support Punjabi language, do you want change to it? ਸਾਨੂੰ ਇਹ ਵੀ ਪੰਜਾਬੀ ਭਾਸ਼ਾ ਨੂੰ ਸਹਿਯੋਗ ਹੈ, ਤੁਹਾਨੂੰ ਇਸ ਨੂੰ ਕਰਨ ਲਈ ਤਬਦੀਲੀ ਚਾਹੁੰਦੇ ਹੋ? We also support Bengali language, do you want change to it? আমরা বাংলা ভাষা সমর্থন, আপনি এটি পরিবর্তন করতে চান? We also support Burmese language, do you want change to it? ငါတို့သည်လည်း, မြန်မာဘာသာစကားကိုထောကျပံ့သငျသညျကအပြောင်းအလဲလိုသလဲ We also support Nepali language, do you want change to it? हामी पनि नेपाली भाषा समर्थन, तपाईं यसलाई परिवर्तन गर्न चाहनुहुन्छ? We also support Tagalog language, do you want change to it? Sinusuportahan din namin ang Tagalog wika, ang gusto mong pagbabago dito? We also support Malay language, do you want change to it? Kami juga menyokong bahasa Melayu, adakah anda mahu perubahan kepadanya? We also support Indonesian language, do you want change to it? Kami juga mendukung bahasa Indonesia, apakah Anda ingin perubahan untuk itu? We also support Thai language, do you want change to it? นอกจากนี้เรายังสนับสนุนภาษาไทย, คุณต้องการที่เปลี่ยนแปลงไปได้หรือไม่
Update your browser to view this website correctly. Update my browser now × Home›Business Used for recording iconic albums by Soundgarden, Marilyn Manson, Hole, Ozzy Osbourne and Korn, Michael Beinhorn’s rack of vintage Neve 1057 mic preamp and EQ modules heads to auction. By Steve Harvey ⋅
Los Angeles, CA (August 31, 2022)—The promise that you can “own a piece of history” with the purchase of this or that item of vintage recording equipment has almost become a cliché, but in the case of a rack of Neve modules currently for sale on one auction site, history was made twice. Producer, engineer, musician, composer and author Michael Beinhorn recently announced the availability of his rack of 16 Neve 1057 mic preamp and EQ modules on the online consignment, private sale and auction site, ANALOGr.com. The modules came from a 16-in, 8-out Neve mixing console shipped to the manufacturer’s reported first US client, Sound Studios in Chicago. Beinhorn subsequently purchased the modules and used them to redefine the sound of hard rock — drums, in particular — while recording some of the most iconic albums of the Nineties by the likes of Soundgarden, Marilyn Manson, Hole, Ozzy Osbourne and Korn.
From a primary school teacher to a contractor, to an RJD MLC — to the Bihar law minister for 15 days. This is a tale of rise and rise of Kartik Kumar a.k.a. Kartikeya Singh that also has a twist: A kidnapping case dogging him since 2014 that finally led to his resignation as minister in the Nitish Kumar-led Mahagathbandhan (Grand Alliance) government on Wednesday — the first among its “tainted” ministers to do so — after the JD(U) and the RJD top brass deliberated on his case threadbare and decided against his continuance in the government. Kartik, 53, who faced a warrant in the 2014 kidnapping case against him, was prevented from getting arrested till Thursday following an order of the Danapur District and Sessions Court. Yet, the pending arrest warrant against him along with the uncertainty over his anticipatory bail is believed to be a key reason behind his resignation late on Wednesday evening, barely a few hours after his law portfolio was swapped with his RJD colleague and sugarcane industries minister Shamim Ahmad, which was considered to be Kartik’s “demotion”. Kartik Kumar had to step down because of various other reasons too. Before him, four other ministers who had worked under CM and JD(U) supremo Nitish during his multiple terms at the head of various coalition governments since 2005, had to resign due to pending criminal cases or some other controversies surrounding them. While Jitan Ram Manjhi had to resign in 2005 a few days after taking oath as minister over an education scam probe, BJP minister Ramadhar Singh had to step down in 2011 due to a pending warrant against him. The JD(U)’s minister Manju Verma resigned in 2018 soon after her husband was named in an Arms Act case and the party’s another minister Mewalal Choudhary quit his post a few days after taking charge of the education department in 2020 over a probe in corruption charges against him during his tenure as the vice-chancellor (V-C) of the Bihar Agricultural University, Sabour (Bhagalpur). Kartik’s resignation was thus said to be in accordance with several precedents seen during the tenures of CM Nitish, who has often talked about not compromising with triple Cs (crime, corruption and communalism). Another reason being cited for Kartik’s resignation is linked to Nitish’s need for ensuring the “right optics” before taking a plunge into national politics. During his meeting with the visiting Telangana CM and TRS supremo K Chandrashekar Rao in Patna on Wednesday, Nitish went on to appeal to the media to give them due attention rather than “giving publicity to one side only”. “With Nitish Kumar now all set to travel outside Bihar in coming months, he wanted to avoid a bad Press back home,” said a JD(U) source. An RJD leader said, “We also want to avoid unnecessary criticism of the government. The Opposition BJP has already launched an onslaught on us because of inclusion of some ministers with controversial backgrounds. While the RJD has to take sundry factors including social balancing and the clout of leaders in their respective areas before selecting ministers, the party also wants to be talked about for its good governance initiatives.” RJD president Lalu Prasad and Deputy CM Tejashwi Prasad Yadav reportedly discussed Kartik’s case thoroughly and advised him to get his legal matter resolved before he could be considered for a ministerial position again. Nitish, who had to face embarrassment for not checking the backgrounds of the RJD ministers, reportedly nudged the RJD to take a call on Kartik. Besides, other Mahagathbandhan partners such as the Congress and CPI (ML) also urged the coalition leadership for considering the removal of Kartik from the ministry. Kartik’s induction into the Bihar Cabinet was attributed to a couple of reasons. The RJD was looking for an upper caste Bhumihar face and also seeking to keep the party’s Mokama strongman Anant Singh, who had just lost his membership in the Assembly because of his conviction in an Arms Act case, in good humour. Kartik is known to have been a close aide of Anant Singh for years. Kartik’s rise and the jump in his fortune over the last two decades has also been linked to his association with Anant Singh and his elder brother and ex-minister Dilip Singh. Kartik’s 2022 MLC poll affidavit shows that he and his wife Ranjana Kumari have moveable and immoveable assets worth over Rs 22 crore. Kartik started off as a primary school teacher in Ladma, the paternal village of Singh brothers. He reportedly first came in contact with Dilip and started getting petty contracts. Later, he not only became a big contractor for works under the MLA local area fund but also started looking after Anant’s business. His wife Ranjana is the second-term mukhiya from Mokama’s Shivnar Panchayat. RJD sources said Kartik was made a party MLC and subsequently a minister due to his proximity with Anant, who reportedly wanted more power by proxy. Kartik, also known as “Masterji”, was considered to be “his master’s voice”. Meanwhile, the court of additional sessions judge III, Danapur, on Thursday rejected Kartik’s anticipatory bail plea, mainly on the count of the Patna High Court earlier rejecting his similar plea in the Bihta police case (859/2014). In this case pertaining to the kidnapping of one Rajiv Ranjan alias Raju Singh, a Mokama resident, the police named Kartik in its supplementary FIR. Once close to Anant Singh, Ranjan was abducted after he had fallen out with the Mokama strongman over some business transaction. He was later recovered by the police. Bajaj Auto total vehicle sales rise 8% to 4,01,595 units in August Santosh Singh… read more
The latest breaking updates, delivered straight to your email inbox. A Black pastor in Alabama says he was arrested while watering his neighbor’s flowers — and his attorney has called the incident “irrational, irresponsible, and illegal.” In police body camera footage from May and released last week, an officer is seen approaching the man, Michael Jennings, who tells the officer he has been asked to water the flowers while a neighbor is gone. Watch the video in the player above In the video that has since gone viral, Jennings, of Childersburg, Alabama, is asked by the officer what he is doing at the house and whose car is in the driveway. He says it’s the neighbor’s vehicle and identifies himself as “Pastor Jennings” without being asked. Jennings tells the officer, “I’m supposed to be here. I’m Pastor Jennings. I live across the street.” An officer responds, “You’re Pastor Jennings?” And he responds, “Yes, I’m looking after their house while they’re gone, looking after their flowers.” The officer then asks Jennings for identification and Jennings says he will not give any identification to the officer. Less than a minute and a half later, as Jennings tries to make a call on his phone, officers handcuff him, the body camera footage shows. The officers in the video later speak with the neighbor who called 911, who is not identified by name. “They are friends, and they went out of town today, so he may be watering their flowers, and it could be completely normal,” she tells the officers about Jennings and the homeowner. “He would be watering their flowers, this is probably my fault,” she says. Later in the video, Jennings’ wife arrives and provides the officer with his identification. “She does tell us it’s a mistake and all that stuff, but at this point he’s already collected the charge,” the officer tells her. “Once we place him under arrest we can’t unarrest him,” the officer says. He was arrested for “Obstructing Governmental Operations,” but charges were later dropped, according to a police statement from June 1, 2022. Police were responding to a 911 call about a “suspicious” car parked at the residence and a person “the caller did not recognize,” Richard McClelland, chief of police for the city of Childersburg, said in the statement. The caller stated that her neighbors who lived at the residence were out of town and advised that the suspicious person might be inside the residence, according to the police chief’s statement. In an email to CNN on Tuesday, an attorney for the city said the audio of the 911 call provides “vital” information for the incident. CNN has requested a copy of the transcript of this call. “This video makes it clear that these officers decided they were going to arrest Pastor Jennings less than five minutes after pulling up and then tried to rewrite history claiming he hadn’t identified himself when that was the first thing he did,” attorney Harry Daniels said in a news release last week. Midway through the video, officers can be heard discussing charges for Jennings. “We’re here to investigate a call and he wouldn’t give us his name, or or any other thing,” an officer says. “He told me he was trying to call the owner, but still I need his name,” he says. “The 911 audio recording from the call and officer body camera footage was reviewed and interviews were conducted with the officers involved as part of my own investigation of the incident,” McClelland said in the statement. “As result of my investigation, I have recommended to the Municipal Judge of The City of Childersburg that the warrant be dismissed with prejudice,” McClelland said. Hearst Television participates in various affiliate marketing programs, which means we may get paid commissions on editorially chosen products purchased through our links to retailer sites.
The Nebraska Master Gardener Program provides science-based horticulture education to volunteers. Participants complete 40 hours of training in integrated pest management, weeds, insects, plant selection, soil fertility and other related topics. 40 hours of volunteer service in the first year completes the certification. For more information visit mastergardener.unl.edu. What volunteering opportunities are there as a Master Gardener? Volunteers are encouraged to help manage demonstration gardens in the area, help with county and state fair activities, answer plant-related questions from the community, and participate in other educational opportunities. These Master Gardener PSAs are all done by current Master Gardeners. They put a lot of time and effort into their PSAs to ensure they are correct and informative What does it take to be a Master Gardener? Nebraska Master Gardener certification begins with completing 40 hours of educational training, followed by 40 hours of volunteer work. Educational training includes topics such as weed management, plant morphology, insect management, and other related topics. Content tends to be geared toward the home gardener, but all levels of experience are welcome. How can I become a Master Gardener? Nebraska Master Gardener registration opens in late 2022/early 2023. Classes begin in February or March. Classes cover topics such as plant selection for vegetable gardens and landscape beds, pest management, tree health, and more. Master Gardener Interns are required to attend at least 40 hours of educational courses. After passing the open-book test, participants become Master Gardener Trainees. Upon completion of the 40 hours of volunteer activities, participants are Volunteers in the Master Gardener Program. Why should I consider being a Master Gardener? Gardeners are volunteers who are curious about science-based horticulture and want to share that knowledge with the rest of the state. With multiple volunteer opportunities and a variety of educational topics to learn about, Master Gardeners become well-versed in integrated pest management, gardening and related topics. There’s an opportunity for everyone to get involved if they have an interest in plants and horticulture. For more information, visit http://mastergardener.unl.edu. 105 Ag Communications Building University of Nebraska-Lincoln Lincoln, NE 68583 402-472-4398 [email protected] Submit News Some parts of this site work best with JavaScript enabled.
Filed under: Andrei Van Roon will head League of Legends, Wild Rift, and Teamfight Tactics The League of Legends franchise has inexorably expanded over the past few years, growing from just being a MOBA to having a multiverse full of colorful takes on familiar characters — there’s a stand-alone RPG, a mobile port, a critically acclaimed animated show on Netflix, and a forthcoming novel. League of Legends itself is 10 years old, and despite these new additions, it has remained, at its core, League — a competitive 5v5 game that takes place across a map with three lanes and a jungle full of dangerous monsters. On Wednesday, Riot announced that Andrei Van Roon, a veteran of the studio who has designed champions like Ziggs and Lissandra, would be taking on the role of head of League Studio. Van Roon will oversee production of League of Legends, its mobile port Wild Rift, and the auto-chess spinoff Teamfight Tactics. As of 2022, the League franchise has dozens of characters spread across its mainline titles, each of whom has their own needs in terms of both technical maintenance and new content. Riot is faced with the daunting task of keeping things fresh, all while working on a title that has accrued a decade of various visual and technical debts. Polygon spoke with Van Roon about how League will grow in the coming years. League of Legends has a two-week patch cycle; there’s consistently something coming out, even if it’s just balance adjustments or smaller changes. This cadence is popular with fans; Van Roon says it’s critical to both League’s success and to avoiding a culture of continual crunch. “I found out fairly recently that before League launched, one of the requirements that Marc Merrill and Brandon Beck had was that they were willing to sacrifice quite a lot of other functionality to get the ability to patch every two weeks,” says Van Roon in a call with Polygon. He notes that the smaller patches also allow the developers to shift project timelines around with relative flexibility. “We’re not always going to get things right the first time — but we’ve got a bunch of chances to get it right, and a willingness to keep stepping into problems until we find out what the good stuff does look like.” League has a roster of over 160 champions; there are nearly 80 ported to Wild Rift. While champions generally get freshened up with new models for Wild Rift, League of Legends on PC is where fans see major overhauls to champions like Udyr, Volibear, or Fiddlesticks. Champion updates are handled across three teams: There’s one group for Summoner’s Rift that handles the major patches and pre-season adjustments; one group of champion designers that overhauls old champions and recreates them from the ground up; and one group on the Skins team that does art and sustainability updates to bring older, janky characters like Ahri and Caitlyn into the modern era. While it can be frustrating to watch older characters, like Rammus, languish with their old models and animations while newer, shinier champions like Nilah rock up, Van Roon says there’s a balance to strike when it comes to revisiting old, beloved champions. “We have some groups of players who don’t want new stuff, they like the current state of the game, or they don’t enjoy new champions and want the older ones updated,” he says. “We also see some groups of players and regions who have hunger for new stuff. Meeting the needs of those different players is a balancing act. The other thing we see is an attitude of ‘I want more updates — except for my champions, go do something to the champions I don’t like and don’t touch my stuff.’” Change is hard, and sometimes an update — even if it brings an old, dusty champion back into the mainstream — can scare away its old mains. “I think we’ve gotten better with our updates of preserving the core of what a player was there for in the first place. But we’re always going to miss for some particular players,” says Van Roon. In the meantime, League releases smaller, mid-scope updates to help old champions keep up. With a roster so large, it’s impossible to give everyone some love, but regular patches and multiple teams keep League afloat. While other games change and evolve, introducing new modes or transforming their core concept, League is still played on a very similar map, and some of the game’s earliest champions still exist in mostly the same form. Limited-time PvE events, like Star Guardian: Invasion or Odyssey: Extraction, struggle with player retention, according to Van Roon. “I think one of the reasons the idea is popular, and I share this feeling, is the idea of ‘I want to play my favorite champion in a PvE thing,” he says. “Sweet, that sounds great — but how much in a MOBA is the bones you want to build that experience on?” Riot has experimented with adding things onto and around League, where playing games is just a way to unlock new chapters in a visual novel or get cosmetic rewards. As Van Roon notes, a 5v5 competitive MOBA isn’t the best avenue for storytelling. Wild Rift has included more storytelling elements with its events and Guilds vs. Guilds feature, through which players uncover small-scale narratives and rivalries between champions. On PC, there are the big events — first Spirit Blossom, then the big Sentinels of Light event, and the recent alternate universe magical girl Star Guardians story. “Overall, we’re still figuring [events] out, especially now that we have more places we can do storytelling than just League, and what stories to tell through League,” says Van Roon. “Like, how much we should do Act One introductions for characters versus how much should we try and conclude large epic plots? I think we’re seeing that the visual novel is probably something we shouldn’t be doing this often. It was great for Spirit Blossom, it’s a great tool to have in our repertoire, but it’s not something to lean on constantly.” Riot will continue to support League of Legends, Wild Rift, and Teamfight Tactics, and the success of these modes can lead to interesting experiments; the comics, Riot Forge titles, and Legends of Runeterra are all proof of that. As the universe of the franchise continues to expand, there are more avenues for characters to appear and build out the world — and there’s room for surprises. “A few years down the road, once we’ve got everyone’s favorite champions over and so on, but then we’ll want to explore — what does a Wild Rift-unique champion look like?” asks Van Roon. A weekly roundup of the best things from Polygon Please check your email to find a confirmation email, and follow the steps to confirm your humanity. Oops. Something went wrong. Please enter a valid email and try again. Please check your email to find a confirmation email, and follow the steps to confirm your humanity. Oops. Something went wrong. Please enter a valid email and try again.
Hammer of The Last Two, who has produced some of Ghana’s best musicians of all time, has stopped doing music. The renowned Ghanaian record producer left the Ghanaian music production industry years ago and ventured into bread sales and other businesses as an entrepreneur. Hammer is behind music icons like Tinny, Obrafour, Sarkodie and Tee Phlow, among others. Explaining why he threw in the towel on music production, Hammer said he was stuck in his studio day in day out, eating late, barely walking outside just to make beats for musicians. “I was bored, I felt like a prisoner. For 15-plus years, I was locked up in a room with no window. The artistes come and go….these boys were out on stage jumping around, when they come back, you are still in that space,” he said. Speaking on the GTV Breakfast show with Kafui Dey the host, he added that “I sat down for eight hours playing, making beats, producing and it got boring at some point. So, I became like an uncaged dog when I got the chance to get out. That’s why you see me on the street.” Hammer also revealed that his he gained weight through the endless hours he spent in the studio because he rarely get any form of exercise. “My name is ‘Slim The Hammer’ I wasn’t fat, I was an athlete in Presec. So, this business of becoming big was the studio,” Hammer said. According to Hammer, he hasn’t touched any sound engineering equipment in the past seven years. “I have a small set up at home that my children use, so after the playing around, I want to get the thing back to my fingers. I’m gonna need some help though. It’s been seven years since I touched equipment,” he told Kafui Dey. Ever since pausing his music production career, Hammer got into other businesses including partnering with a baker to introduce one of Accra’s popular bread brands and most recently Ekumfi juice. Welcome to the Pulse Community! We will now be sending you a daily newsletter on news, entertainment and more. Also join us across all of our other channels – we love to be connected! Eyewitness? Submit your stories now via social or: Email: [email protected]
Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript. Advertisement Scientific Reportsvolume 12, Article number: 14861 (2022) Cite this article Metrics details Metaheuristic algorithms have a wide range of applications in handling optimization problems. In this study, a new metaheuristic algorithm, called the chef-based optimization algorithm (CBOA), is developed. The fundamental inspiration employed in CBOA design is the process of learning cooking skills in training courses. The stages of the cooking training process in various phases are mathematically modeled with the aim of increasing the ability of global search in exploration and the ability of local search in exploitation. A collection of 52 standard objective functions is utilized to assess the CBOA’s performance in addressing optimization issues. The optimization results show that the CBOA is capable of providing acceptable solutions by creating a balance between exploration and exploitation and is highly efficient in the treatment of optimization problems. In addition, the CBOA’s effectiveness in dealing with real-world applications is tested on four engineering problems. Twelve well-known metaheuristic algorithms have been selected for comparison with the CBOA. The simulation results show that CBOA performs much better than competing algorithms and is more effective in solving optimization problems. The technique of finding the best feasible solution among all existing ones is known as optimization. Optimization is used in designing and maintaining many engineering, economic, and even social systems to minimize the necessary costs or maximize profits. Due to the wide application of optimization in different sciences, this topic has grown a lot, so it is studied in management, mathematics, industry, and many branches of science1. If we want to solve a real optimization problem, we must first build the corresponding mathematical model. Setting up a model, of course, means creating a complete description of the problem with variables and mathematical relationships so that all the details of the optimization problem are simulated2. Deterministic optimization methods can be divided into gradient-based and non-gradient methods, which effectively solve linear, convex, and derivable optimization problems and have a continuous search space. On the other hand, many real-world optimization problems have features such as nonlinear, non-convex objective functions, discrete search spaces, non-differentiable, high dimensions, and high complexity3. The inability of deterministic methods to address such optimization challenges has led to the emergence of effective stochastic approaches in such cases. Metaheuristic algorithms, as the most prominent stochastic method, are capable of tackling optimization problems based on a random search, random operators, and trial-and-error processes4. The simplicity of concepts, easy implementation, efficiency in nonlinear and non-convex environments, and independence of the type of problem are the features that have led to the widespread use and popularity of metaheuristic algorithms5. The primary source in the design of metaheuristic algorithms is inspiration from various natural phenomena, swarm intelligence, animal life, biological sciences, physical laws, rules of the game, and so on. Among the most famous metaheuristic algorithms are the genetic algorithm (GA)6, inspired by biology, the particle swarm optimization (PSO)7, the ant colony optimization (ACO)8, the Artificial bee colony (ABC)9, and the Northern Goshawk optimization8, inspired by animal life. The critical issue with metaheuristic algorithms is that these methods do not guarantee that they will be able to find the optimal global solution. However, the solutions obtained from metaheuristic algorithms are close to the global optimal. The desire to achieve better solutions has led to the development of numerous metaheuristic algorithms. Given the development of numerous metaheuristic algorithms, the main research question is, is there still a need to design newer algorithms? In answer to this question, the No Free Lunch (NFL) theorem10 states that the success of an algorithm in handling a set of optimization problems cannot be a reason for the successful performance of this algorithm in dealing with other optimization problems. There is no presumption of the success or failure of a method in optimizing a problem. The NFL theorem explains that no particular algorithm can be introduced as the best optimizer in all optimization applications. The NFL theorem is a source of motivation for researchers come up with better solutions to optimization problems by designing newer metaheuristic algorithms. The innovation and novelty of the proposed chef-based optimization algorithm (CBOA) are: This paper introduces a new metaheuristic algorithm based on the description of a training process. Every educational process in different types of schools has certain usual properties, forms and stages. In this paper, we were concretely motivated by all specifics of the process of learning the cooking skills of a new chief. The paper provides a mathematical model of two-phase description of the preparation of a new chef, according to the principles of a real cooking school. Both phases are typical of all art schools (including cooking courses) because every student wants to learn from the best chef, but on the other hand, the greatest chefs will not want to prepare weak students. So, in the first phase, the chefs compete with each other so that a table of their quality ranking can be created. Similarly, in the second phase, students compete with each other so that their qualitative ranking can be created according to their cooking abilities. In the mathematical modeling of the first phase, we implemented two master chef strategies. These strategies model the fact that even chefs learn new cooking recipes by observing the teaching of other chefs (Strategy 1), and then they try to improve these observed recipes even more through their autonomous experimentation (Strategy 2). In the mathematical modeling of the first phase, we implemented three student strategies. The first strategy of each student is to choose a chef and learn all of his/her skills. The second strategy of each student is to choose another chef and learn from him/her one skill (one concrete recipe). In the third strategy, students try to improve all their skills by self-experimentation. CBOA ability to handle optimization problems is tested on fifty-two standard benchmark functions and compared with twelve well-known meta-heuristic algorithms. In doing so, CBOA achieves much better results than these competing programs. The rest of the structure of the paper is as follows; the literature review is presented in the “Lecture review’’ section. The proposed CBOA is introduced and modeled in the “Chef-based optimization algorithm’’ section. The simulation studies and results are presented in the “Simulation studies and results’’ section. A discussion of results and performance of the proposed CBOA is presented in the “Discussion’’ section. CBOA implementation on CEC 2017 test suite is presented in “Evaluation CEC 2017 test suite” section. The efficiency of CBOA in handling real-world applications is evaluated in “CBOA for real world applications” section. Conclusions and several suggestions for future research are provided in the “Conclusions and future works’’ section. Metaheuristic algorithms, according to the primary source of design inspiration, are classified into five groups: (i) swarm-based, (ii) evolutionary-based, (iii) physics-based, (iv) game-based, and (v) human-based methods. Theorizing on swarming activities and behaviors in the lives of birds, animals, aquatic animals, insects, and other living things in nature has been the main source of inspiration in the development of swarm-based algorithms. PSO, ACO, and ABC are among the most widely used and popular swarm-based algorithms. The natural behavior of the crowds of birds or fish in search of food have been the main idea of the PSO. Discovering the shortest path between the nest and the food source based on the collective intelligence of ants has been main idea of ACO. Hierarchical efforts and activities of bee colonies in search of food has been the main idea of the ABC. The idea of the ability of living organisms to find food sources in nature has led to the design of several swarm-based metaheuristic algorithms, such as: the tunicate swarm algorithm (TSA)11, the African vultures optimization algorithm (AVOA)12, and the snake optimizer (SO)13. The strategy of living things in nature when hunting and trapping prey has been the main idea in designing algorithms such as the grey wolf optimizer (GWO)14, the Golden Jackal optimization (GJO)15, the whale optimization algorithm (WOA)16, the reptile search algorithm (RSA)17, the marine predator algorithm (MPA)18. The concepts of natural selection, Darwin’s theory of evolution, and stochastic operators such as selection, crossover, and mutation have been used in the design of evolutionary algorithms. GA and differential evolution (DE)19 are among the most famous evolutionary algorithms whose main design idea is the reproduction process and its concepts. The laws, concepts, and phenomena of physics have been a source of inspiration in designing of numerous methods that fall into the category of physics-based algorithms. Simulated annealing (SA) is the most significant physics-based algorithm produced based on the physical phenomenon of metal annealing20. Physical forces and Newton’s laws of motion have been the main idea behind the design of methods such as the gravitational search algorithm (GSA) based on gravity force21 and the spring search algorithm (SSA) based on spring force22. Mathematical modeling of the natural water cycle in nature has led to the design of the water cycle algorithm (WCA)23. Cosmological studies and space holes have been the inspiration in designing the multi-verse optimizer (MVO)24. Archimedes principle concepts have been the main idea in the design of the archimedes optimization algorithm (AOA)24. The rules of the game, the behavior of the players, the coaches, and the referees have been a source of inspiration for designing game-based algorithms. Football game based optimization (FGBO)24 and the volleyball premier league (VPL)25 are two game-based approaches designed based on the modeling of football and volleyball league, respectively. The strategy of the players to put the pieces together has been the design idea of the puzzle optimization algorithm (POA)26. Human activities and behaviors in individual and social life have become the idea of designing approaches that fall into the category of human-based algorithms. Teaching–learning-based optimization (TLBO) is one of the most famous human-based algorithms that has been developed based on the simulation of interactions between a teacher and students in the classroom27. The treatment process that the doctor performs to treat patients has been the main idea in the design of the doctor and patient optimization (DPO)28. The cooperation of the members of a team to achieve success and the common goal of that team has been the main idea in the design of the teamwork optimization algorithm (TOA)29. The City Councils Evolution (CCE) is a human-based approach that is produced based on modeling the evolution of city councils30. The strategic movement of army troops during the war has been the idea employed in the design of the war strategy optimization (WSO)31. Based on the best knowledge gained from the literature review, no metaheuristic algorithm inspired by the culinary education process has been designed. However, teaching cooking to people who attend training courses is an intelligent process that can be a motivation to design a new metaheuristic algorithm. Consequently, in this study, a new optimization approach has been developed by mathematical modeling the cooking education process, which is discussed in the next section. This article does not contain any studies with human participants or animals performed by any of the authors. Informed consent was not required as no human or animals were involved. This part is devoted to the introduction and mathematical modeling of the proposed algorithm called the Chef-based optimization algorithm (CBOA). Cooking students and young cooks participate in training courses to improve their cooking skills and become chefs. This concept is analogous to metaheuristic algorithms, where several candidate solutions are initialized and then improved through an iterative process to determine the best candidate solution as the solution to the problem at the end of the algorithm implementation. Thus, the process of transforming a cooking student into a chef in a culinary school is a source of inspiration for the design of the proposed CBOA. It is assumed that a certain number of chef instructors are present in a culinary school. Each chef instructor is responsible for teaching a class. Each cooking student can choose which of these classes to attend. The chef instructor teaches students cooking skills and techniques. However, chef instructors also try to improve their skills based on the instructions of the best chef instructor in the school and individual exercises. Cooking students try to learn and imitate the skills of the chef instructor. In addition, cooking students try to improve the skills they have learned through practice. At the end of the course, cooking students become skilled chefs under the training they have received. Mathematical modeling of the above concepts is used in designing the CBOA, which is discussed in the following subsections. The proposed CBOA approach is a population-based algorithm whose members consist of two groups of people, namely cooking students and chef instructors. Each CBOA member is a candidate solution that contains information about the problem variables. From a mathematical point of view, each member of the CBOA is a vector, and the set of CBOA members can be modeled using a matrix according to Eq. (1). where (X) is the CBOA population matrix, ({X}_{i}=left({x}_{i,1},{x}_{i,2},dots ,{x}_{i,m}right)) is the (i)th CBOA member (candidate solution), ({x}_{i,j}) is its (j)th coordinate (i.e., the value of the (j)th problem variable for the (i)th CBOA member), (N) is the population size, and (m) is the number of problem variables of the objective function (dimension of the problem). The position of the CBOA members at the beginning of the algorithm implementation is randomly initialized for (i=text{1,2}, dots , N text{and} j=text{1,2}, dots ,m) using Eq. (2). where (r) is a random number in the interval (left[text{0,1}right]), (l{b}_{j}) and (u{b}_{j}) are the lower and the upper bounds of the (j)th problem variable, respectively. By inserting the suggested values of each CBOA member into the variables, a corresponding objective function value is evaluated. As a result, the objective function is evaluated in (N) turns (where (N) is the number of CBOA members) and (N) values are calculated for the objective function. These values can be represented using a vector corresponding to Eq. (3). where (F) is the vector of values of the objective function and ({F}_{i}) is the value of the objective function obtained for the (i)th member of CBOA, where (i=text{1,2}, dots , N.) The values of the objective functions provide essential information about the quality of the candidate solutions. The value of the objective function is the decision criterion for selecting the best candidate solution. Among CBOA members, the member with the best value for the objective function is recognized as the best member of the population and the best candidate solution. During the running of the algorithm, in each iteration, the members of the CBOA are updated, and the corresponding values of the objective function are calculated. It is, therefore, necessary to update the best member in each iteration based on comparing the values of the objective function. After the algorithm is initialized, the CBOA steps are gradually applied to the candidate solutions to improve them. CBOA members consist of a group of instructing chefs and a group of cooking students. The update process for each of these groups is different. Based on comparing the values of the objective function, some CBOA members with better values of the objective function are selected as the chef instructor. Therefore, if the rows of the CBOA population matrix are sorted in ascending order according to the value of the objective function (thus, the member in the first row is the best member), then the group of the first ({N}_{C}) members is selected as the group of chef instructors and the rest group of ({N-N}_{C}) members is chosen as the group of cooking students. The CBOA sorted population matrix and the sorted objective function vector are specified in Eqs. (4) and (5). where ({N}_{C}) is the number of chef instructors, (XS) is the sorted population matrix of CBOA, and (FS) is a vector of ascending objective function values. In the matrix (XS), members from ({XS}_{1}) to (X{S}_{{N}_{C}}) represent the group of chef instructors, and members from (X{S}_{{N}_{C}+1}) to (X{S}_{N}) represent the group of cooking students. The vector (FS) i includes successively the values of the objective functions corresponding to ({XS}_{1}) to (X{S}_{N}). In a culinary school, it is assumed that several chef instructors are responsible for teaching cooking skills to students. Chef instructors follow two strategies to improve their cooking skills. In the first strategy, they emulate the best chef instructor and try to learn the chef instructor techniques. This strategy demonstrates the global search and CBOA exploration capabilities. The advantage of updating the chef instructors based on this strategy is that the top chefs (top population members) improve their skills based on the best chef (best population member) before they start teaching students. Hence, there is no direct dependence on updating the students’ position only on the base of the best member of the population in CBOA design. Furthermore, this approach prevents the algorithm from getting stuck in local optima and causes different areas of the search space to be scanned more accurately and effectively. Based on this strategy, a new position for each chef instructor is first calculated for (i=text{1,2}, dots , {N}_{C} ,text{and}, j=text{1,2}, dots ,m) using the following equation where ({XS}_{i}^{C/S1}) is the new calculated status for the (i)th sorted member of CBOA (that is ({XS}_{i})) based on the first strategy ((C/S1)) of updating the chef instructor, ({xs}_{i,j}^{C/S1}) is its (j)th coordinate, (BC) is the best chef instructor (denoted as ({XS}_{1}) in the matrix (XS)), ({BC}_{j}) is the (j)th coordinate of the best chef instructor, (r) is a random number from the interval (left[text{0,1}right]), and (I) is a number that is selected randomly during execution from the set (left{text{1,2}right}). This new position is acceptable to the CBOA if it improves the value of the objective function. This condition is modeled using Eq. (7). where ({FS}_{i}^{C/S1}) is the value of the objective function of the member ({XS}_{i}^{C/S1}.) In the second strategy, each chef instructor tries to improve his cooking skills based on individual activities and exercises. This strategy represents the local search and the CBOA’s exploitation ability. If each problem variable is considered a cooking skill, a chef instructor will try to improve all of those skills to achieve a better objective function value. The advantage of updating based on individual activities and exercises is that each member, regardless of the position of other population members, seeks to discover better solutions near the position where it is located. There is a possibility that better solutions can be obtained based on local search and exploitation, with minor changes in the position of population members in the search space. According to this concept, around each chef instructor in the search space, a random position is generated for (j=text{1,2}, dots ,m) using Eqs. (8) to (10). If this random position improves the value of the objective function, it is acceptable for updating, which this condition is modeled using Eq. (11). where (l{b}_{j}^{local}) and (u{b}_{j}^{local}) are the lower and upper local bound of the (j)th problem variable, respectively, and the variable (t) represents the iteration counter. where ({XS}_{i}^{C/S2}) is the new calculated status for the (i)th CBOA sorted member (i.e., ({XS}_{i})) based on the second strategy ((C/S2)) of chef instructors updating, ({xs}_{i,j}^{C/S2}) is its (j)th coordinate, and ({FS}_{i}^{C/S2}) is its value of the objective function. Cooking students attend culinary school to learn cooking skills and become a chef. In the design of CBOA, it is assumed that cooking students follow three strategies to learn cooking skills. According to the first strategy, each cooking student randomly chooses a class taught by one of the chefs, and then he is taught cooking skills by this chef instructor. The advantage of updating cooking students based on this strategy is that there are different chef instructors available to lead them, resulting in cooking students learning different skills (i.e., population members moving to other areas of the search space) based on the guidance of the chosen chef instructor. On the other hand, if all cooking students learn only from the best chef-instructor (all members of the population moved towards the best member), then an efficient global search in the problem-solving space would not be possible. This strategy is simulated in the CBOA in such a way that first for each cooking student, a new position is calculated based on the training and guidance of the chef instructor, for (i={N}_{C}+1, {N}_{C}+2, dots , N, j=text{1,2}, dots ,m,) using Eq. (12). where ({XS}_{i}^{S/S1}) is the new calculated status for the (i)th sorted member of CBOA (i.e., ({XS}_{i})) based on the first strategy ((S/S1)) of the updating of cooking students, ({xs}_{i,j}^{S/S1}) is its (j)th coordinate, and ({CI}_{{k}_{i},j}) is the selected chef instructor by the (i)th cooking student, where ({k}_{i}) is randomly selected from the set (left{text{1,2}, dots , {N}_{C}right}) (where ({CI}_{{k}_{i},j}) denotes the value ({xs}_{{k}_{i},j})). This new position replaces the previous position for each CBOA member, if it improves the value of the objective function. This concept is modeled for (i={N}_{C}+1, {N}_{C}+2, dots , N) by Eq. (13). where ({FS}_{i}^{S/S1}) is the value of the objective function of ({XS}_{i}^{S/S1}.) In the second strategy, since each problem variable in the CBOA is assumed to be a cooking skill, each cooking student tries to learn one of the skills of the chef instructor completely and fully imitate the chef instructor (therefore, by “skill’’, we mean a recipe for one great meal). This strategy enhances the global search and exploration capabilities of the CBOA. The advantage of this strategy is that instead of updating all candidate solution variables (i.e., all cooking student skills), only one variable (one skill, i.e., one recipe) changes. It may not be necessary to update all member position coordinates to achieve better solutions. In the design of CBOA, this “skill’’ represents a certain component of a vector of cooking skills of a randomly selected chef instructor ({CI}_{k}) ((kin left{text{1,2},dots ,{N}_{c}right})). Hence, the second strategy is mathematically simulated in such a way that for each cooking student ({XS}_{i}) (members of CBOA with (i={N}_{C}+1, {N}_{C}+2, dots , N)), first one chief instructor, which is represented by the vector ({CI}_{{k}_{i}}=left({CI}_{{k}_{i,1}}, dots , {CI}_{{k}_{i,m}}right),) is randomly selected (a member of CBOA with the index ({k}_{i}), which is randomly selected from the set ({1,…, {N}_{C}})), then it is randomly selected his (mathcal{l})th coordinate (thus a number (mathcal{l}) from the set (left{1,… mright},) which represents a “skill’’ of this selected chief instructor) and by this value ({CI}_{{k}_{i,mathcal{l}}}) we replace the (mathcal{l})th coordinate of the vector of the (i)th cooking student ({XS}_{i}) (thus, ({xs}_{i,mathcal{l}})). According to this concept, a new position is calculated for each CBOA cooking student member using Eq. (14). where (mathcal{l}) is a randomly selected number from the set (left{text{1,2}, dots ,mright},)(i={N}_{C}+1, {N}_{C}+2, dots , N,)(j=text{1,2}, dots ,m.) Then, it is replaced with the previous position based on Eq. (15) if it improves the target value of the objective function. where ({XS}_{i}^{S/S2}) is the new calculated status for the (i)th sorted member of CBOA (i.e., ({XS}_{i})) based on the second strategy ((S/S2)) of updating cooking students, ({xs}_{i,j}^{S/S2}) is its (j)th coordinate, ({FS}_{i}^{S/S2}) is its objective function value. In the third strategy, each cooking student tries to improve his cooking skills based on his individual activities and exercises. In fact, this strategy represents the local search and the CBOA’s exploitation ability. The advantage of updating cooking students based on the strategy of individual activities and exercises is that it increases the power of local search and exploitation of the algorithm in achieving better possible solutions near the discovered solutions. In this strategy, similar to the local search strategy of chef instructors, cooking students try to converge to better solutions with small and precise steps. If each problem variable is considered a cooking skill, a cooking student will try to improve all of those skills to achieve a better objective function value. According to this concept, around each cooking student in the search space, a random position is generated by Eqs. (8), and (9) and a new position is calculated using Eq. (16). where ({XS}_{i}^{S/S3}) is the new calculated status for the (i)th sorted member of CBOA (that is ({XS}_{i})) based on the third strategy ((S/S3)) of updating cooking students, ({xs}_{i,j}^{S/S3}) is its (j)th coordinate, and (q) is randomly selected number from the set (left{text{1,2}, dots ,mright}), (i={N}_{C}+1, {N}_{C}+2, dots , N), and (j=text{1,2}, dots ,m.) If this new random position improves the value of the objective function, it is acceptable for updating of ({XS}_{i}), which is modeled by Eq. (17). where ({FS}_{i}^{S/S3}) is the value of the objective function of ({XS}_{i}^{S/S3}.) A CBOA iteration is completed by updating all members of the population. The CBOA enters the next iteration with these new statuses, and the groups of chef instructors and cooking students are respecified. The population members are updated based on the implementation of the CBOA steps according to Eqs. (4) to (17) until the last iteration of the algorithm. After reaching the maximum value of the iteration variable CBOA, the best candidate solution obtained during the implementation process is presented as the solution to the problem. Various steps of CBOA implementation are presented in the form of a flowchart in Fig. 1 and its pseudocode in Algorithm 1. Flowchart of CBOA. In this subsection, the computational complexity of the CBOA is analyzed. Preparing and initializing the CBOA for an optimization problem, with the number of decision variables (m), has a computational complexity of (O(Nm)), where (N) is the number of CBOA members. Updating the group of chef instructors in two strategies has a computational complexity equal to (O(2{N}_{C}mT)), where T is the maximum number of CBOA iterations and ({N}_{C}) is the number of chef instructors. Updating the student cooking group in three strategies has a computational complexity equal to (O(3 (N-{N}_{C}) mT)). Thus, the total computational complexity of CBOA is equal to (O(m(N + 2{N}_{C}T + 3 left(N-{N}_{C}right)T ))). This section presents simulation studies and an evaluation of the ability of CBOA to solve optimization problems and real practice tasks. For this purpose, a set of 23 standard benchmark objective functions has been employed. For this purpose, a set of 23 standard benchmark objective functions has been employed. The reason for choosing this collection is as follows. Seven unimodal functions ({F}_{1}) to ({F}_{7}), which have only one main extremum and lack local optimal solutions, have been selected. Therefore, unimodal functions are employed to challenge the exploitation and local search ability of the proposed CBOA algorithm in convergence to global optimal. The six functions in this set, ({F}_{8}) to ({F}_{13}), are the high-dimensional multimodal type, which, in addition to the main extremum, has several local extremums and local optimal solutions. Thus, high-dimensional multimodal functions are employed to test the CBOA’s exploration and global search capability in accurately scanning the search space, passing local optimal areas, and discovering the main optimal area. The ten functions in this set, ({F}_{14}) to ({F}_{23}), are selected from the fixed-dimensional multimodal type, whose dimensions and the number of local extremes are less than those of the high-dimensional multimodal functions. These functions are employed to analyze the ability of the proposed CBOA algorithm to strike a balance between exploration and exploitation. The information on this set of benchmark functions is specified in Tables 1, 2 and 3. The performance of the proposed CBOA approach in optimization is compared with the results of 12 well-known metaheuristic algorithms. The criterion for selecting these 12 competitor algorithms is as follows. PSO, GA, and DE are three prevalent algorithms that have been employed in many optimization applications. CMA, GSA, TLBO, GWO, MVO, and WOA are the six most cited algorithms that always have interested researchers. Finally, the three algorithms, MPA, TSA, and HBO, are the algorithms that have been released recently and have received a lot of attention and application in this short period. The values adopted for the control parameters of the competitor algorithms are specified in Table 4. The CBOA and each of the competing algorithms are tested on benchmark functions in twenty independent implementations while each execution contains 1000 iterations. Optimization results are reported using six indicators: mean, best, standard deviation (std), median, execution time (ET), and rank. The CBOA and each competing algorithm are tested on benchmark functions in twenty independent implementations, while each execution contains 1000 iterations. Optimization results are reported using six indicators: mean, best, standard deviation (std), median, execution time (ET), and rank. The optimization results of the unimodal functions ({F}_{1}) to ({F}_{7}) using CBOA and competitor algorithms are given in Table 5. The optimization results show that the CBOA has performed very well in optimizing ({F}_{1}), ({F}_{2}), ({F}_{3}), ({F}_{4}), and ({F}_{6}) and has been able to converge to the global optimal of these functions. In optimizing the functions ({F}_{5}) and ({F}_{7}), the CBOA has been able to deliver good results and rank the best optimizer among the compared algorithms. The simulation results show that CBOA has a self-evident superiority over competitor algorithms and, with high exploitation ability, has converged to very suitable solutions. Results of CBOA and all competitor algorithms on high-dimensional multimodal functions of ({F}_{8}) to ({F}_{13}) are reported in Table 6. CBOA has achieved precisely the global optimal solution for ({F}_{9}) and ({F}_{11}), which shows us the high exploration power of CBOA. In optimizing the function ({F}_{10}), the proposed CBOA has performed well, and for this function is ranked as the first best optimizer in competition with the compared algorithms. The simulation results indicate the high exploration power of CBOA in identifying the best optimal region and the superiority of CBOA compared to competitor algorithms. The results of the CBOA and competitor algorithms for the fixed-dimensional multimodal functions ({F}_{14}) to ({F}_{23}) are presented in Table 7. The optimization results show that the CBOA, based on the “mean index’’, alone is the best optimizer to tackle the functions ({F}_{14}), ({F}_{20}), and ({F}_{18}). In the other cases where the CBOA has the same conditions in terms of the “mean index’’, it performs more efficiently than the alternative algorithms due to better values for the “std index’’. Analysis of the simulation results shows that the CBOA performs better than competitor algorithms and has a remarkable ability to strike a balance between exploration and exploitation. In other cases where the CBOA has the same conditions in terms of the “mean index’’, it has more efficient performance than the alternative algorithms due to better values for the “std index’’. Analysis of the simulation results shows that the CBOA performs better than competitor algorithms and has a remarkable ability to strike a balance between exploration and exploitation. The performance of CBOA and competitor algorithms in evaluating the benchmark functions ({F}_{1}) to ({F}_{23}) is shown in Fig. 2 using the box plot diagrams. The boxplot diagram of CBOA and competitor algorithms performances on ({F}_{1}) to ({F}_{23}). In this subsection, a statistical analysis of the performance of the CBOA compared to competitor algorithms is provided to determine whether the superiority of the CBOA is statistically significant. To provide this analysis, the Wilcoxon test of rank sums32 with the significance level (5%) has been used. In this test, the values of the “(p)-value’’ indicate whether there is a significant difference between the means of the two data samples (thus, if the “(p)-value’’ is less than 0.05, then between two data samples is significant difference). The results of the Wilcoxon test of rank sums for the CBOA and competitor algorithms are released in Table 8. Consequently, since all values obtained for the (p)-value are less than 0.05, the CBOA has a significant statistical superiority over all twelve compared algorithms. The proposed CBOA is a stochastic optimizer that can achieve the optimal solution by using its members’ search power in an iteration-based process. Therefore, the values of the parameters (N) and (T), which represent the number of CBOA members and the total number of iterations of the algorithm, respectively, affect the performance of the CBOA. To study this effect, we analyze the sensitivity of CBOA to changes in values of the (N) and (T) parameters in this subsection. In the first study, to analyze the sensitivity of CBOA to the parameter (N), the proposed algorithm in independent performance for different values of the parameter (N) equal to 20, 30, 50, and 100 is used to optimize the functions of ({F}_{1}) to ({F}_{23}). Results of this analysis are presented in Table 9, and CBOA convergence curves to optimize these objective functions under the influence of the changes of the parameter (N) are shown in Fig. 3. Based on simulation results obtained from the sensitivity analysis of the parameter (N), it is clear that CBOA presents similar results in most objective functions when the parameter (N) is changed, indicating that the CBOA is less affected by the parameter (N). In other cases of the objective functions, it can be seen that when the value of the parameter (N) increases, then the values of objective functions decrease. CBOA convergence curves in the study of sensitivity analysis to parameter (N). In the second study, to analyze the sensitivity of CBOA to the parameter (T), the proposed method is implemented in independent performances for different values of the parameter (T) equal to 200, 500, 800, and 1000 on the objective functions ({F}_{1}) to ({F}_{23}). The results of this analysis are reported in Table 10, and the CBOA convergence curves affected by this study are plotted in Fig. 4. What is clear from the results of the CBOA sensitivity analysis to changes in the parameter (T) is that by increasing the values of the parameter (T), the performance of CBOA is improved and as a result, the values of objective functions are decreased. CBOA convergence curves in the study of sensitivity analysis to parameter (T). Metaheuristic algorithms are random approaches with which their main idea employed in the optimization process is random search in the problem-solving space. This random search at both local and global levels is the key to the success of metaheuristic algorithms. In optimization studies, the local search power, which indicates the potential for exploitation, causes the algorithm to look for better solutions around promising candidate solutions and move closer to the optimal global solution. The capability of the “exploitation phase’’ in metaheuristic algorithms is best tested when implemented on functions that have only one main solution. Unimodal functions with this feature are good options for evaluating the exploitation ability. The optimization results of unimodal functions ({F}_{1}) to ({F}_{7}) indicate the high exploitation capability of CBOA, especially in handling ({F}_{1}) to ({F}_{4}), and ({F}_{6}). Therefore, the simulation finding from the results of the unimodal functions is that the CBOA has high efficiency in local search and a high potential for exploitation. The power of global search, which demonstrates the exploration potential of metaheuristic algorithms, allows the algorithm to scan different areas of the search space to discover the optimal global area. The capability of the “exploration phase’’ in metaheuristic algorithms designed for optimization can best be evaluated using optimization problems with several local optimal solutions. Therefore, high-dimensional multimodal functions are a good choice for evaluating exploration ability. The implementation results of CBOA and competitor algorithms on functions ({F}_{8}) to ({F}_{13}) show the high exploration ability of CBOA to global search in various areas of the problem-solving space. This CBOA capability is especially evident in the optimization results of the functions ({F}_{9}) and ({F}_{11}). The finding from simulations of the CBOA and competitor algorithms on the fixed-dimensional multimodal functions ({F}_{8}) to ({F}_{13}) is that the CBOA, with its high power in global search and exploration, can avoid getting stuck in locally optimal solutions and identify the main optimal region. The critical point in the capability of metaheuristic algorithms is that in addition to having the desired ability in exploitation and exploration, there must be a balance between these two capabilities so that the algorithm can find the main optimal region and converge towards the global optimal. Fixed-dimensional multimodal functions are good options for testing the ability of metaheuristic algorithms to strike a balance between exploitation and exploration. Optimizing the ({F}_{14}) to ({F}_{23}) functions shows that the CBOA has a high potential to strike a balance between exploitation and exploration. Based on the fixed-dimension multimodal function optimization results, CBOA, with its ability to balance exploitation and exploration, can first discover the main optimal region by global search without getting entangled in locally optimal solutions, then converge to the global optimum by local search. The execution time of CBOA and competing algorithms in optimizing each objective function shows that CBOA is faster than some competing algorithms. But some other competing algorithms, although faster, did not converge to the desired results. Therefore, CBOA has an acceptable execution time when optimizing the objective functions. The simulation findings show that CBOA has a high quality in exploitation, exploration, and balance between them, which has led to its superior performance compared to similar competing algorithms. To analyze the capability of the proposed CBOA approach in complex optimization problems, the proposed algorithm is implemented on the CEC 2017 test suite. This set includes three unimodal objective functions ({C}_{1}) to ({C}_{3}), seven multimodal objective functions ({C}_{4}) to ({C}_{10}), ten hybrid objective functions ({C}_{11}) to ({C}_{20}), and ten composition objective functions ({C}_{21}) to ({C}_{30}). Complete information and details of the CEC 2017 test suite are described in Ref.33. The ({C}_{2}) function has been removed from the CEC 2017 set due to its unstable behavior. The implementation results of CBOA and competitor algorithms on the CEC 2017 test suite are published in Table 11. Based on the analysis of simulation results, it is clear that the proposed CBOA approach is the first best optimizer for ({C}_{1}), ({C}_{3}), ({C}_{4}), ({C}_{6}) to ({C}_{8}), ({C}_{10}) to ({C}_{20}), ({C}_{22}), ({C}_{24}), ({C}_{25}), ({C}_{27}), and ({C}_{28}) functions compared to competitor algorithms. In this section, we will show the effectiveness of CBOA in solving real-world problems. To this end, CBOA and competing algorithms are used in the optimization of four engineering applications: (i) pressure vessel design (PVD), (ii) speed reducer design (SRD), (iii) welded beam design (WBD), and (iv) structural tension/compression springs (TCSD). Mathematical models, details, and information about these technical challenges are expressed for PVD in Ref.34, for SRD in Refs.35,36, and for WBD and TCSD in Ref.16. The optimization results of these four engineering optimization problems are published in Table 12. Based on the analysis of the results, it is clear that the CBOA approach is the first best optimizer in solving all four studied problems compared to competing algorithms. This paper introduced a new human-based metaheuristic algorithm called the chef-based optimization algorithm (CBOA) and designed it to address optimization issues. The process of learning cooking skills by people who attend training cooking courses inspired the implementation of the proposed CBOA. Different phases of the cooking training process were mathematically modeled to design the CBOA implementation. The CBOA’s performance was evaluated on fifty-two benchmark functions, including seven unimodal functions, six high-dimensional multimodal functions, ten fixed-dimensional multimodal functions, and 29 functions of the CEC 2017 test suite The optimization results showed that CBOA could be used effectively in solving optimization problems due to its ability to maintain a balance between exploration and exploitation. Moreover, the simulation results showed that CBOA is more efficient and competitive than the twelve compared algorithms because it usually provides better solutions. In addition, the employment of the CBOA on four engineering optimization issues demonstrated the high ability of the proposed approach to address real-world applications. The proposed CBOA algorithm is a stochastic approach and therefore has some shortages and limitations. As with all metaheuristic algorithms, there is no guarantee that the solutions obtained from the CBOA for optimization problems are equal to the global optima of those problems. Although the CBOA has provided reasonable solutions to most of the objective functions studied in this paper, according to the NFL theorem, there are no preconditions for its successful implementation in all optimization applications Therefore, of course, there is a shortage and limitation of the proposed CBOA that its application may fail in some optimization problems. Also, it is always possible that researchers will design newer metaheuristic algorithms to provide better solutions to real optimization problems than existing algorithms, such as the proposed CBOA method. The introduction of the CBOA opens research directions and tasks for future work. The most specific research potential for the CBOA is the development of binary and multi-objective versions of this proposed approach. The employment of CBOA in optimization applications in various sciences and real-world challenges are other proposals in this paper. All data generated or analyzed during this study are included directly in the text of this submitted manuscript. There are no additional external files with datasets. The source code of the CBOA is available at: https://uk.mathworks.com/matlabcentral/fileexchange/114480-chef-based-optimization-algorithm-cboa. Dhiman, G. SSC: A hybrid nature-inspired meta-heuristic optimization algorithm for engineering applications. Knowl. Based Syst.222, 106926 (2021). Article Google Scholar Zeidabadi, F.-A. et al. SSABA: Search step adjustment based algorithm. Comput. Mater. Continua71, 4237–4256 (2022). Article Google Scholar Mohammadi-Balani, A., Nayeri, M. D., Azar, A. & Taghizadeh-Yazdi, M. Golden eagle optimizer: A nature-inspired metaheuristic algorithm. Comput. Ind. Eng.152, 107050 (2021). Article Google Scholar Cavazzuti, M. Optimization Methods: From Theory to Design Scientific and Technological Aspects in Mechanics, Chap. Deterministic Optimization 77–102 (Springer, 2013). Book Google Scholar Gonzalez, M., López-Espín, J. J., Aparicio, J. & Talbi, E.-G. A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis. PeerJ Comput. Sci.8, e828 (2022). Article Google Scholar Goldberg, D. E. & Holland, J. H. Genetic algorithms and machine learning. Mach. Learn.3, 95–99 (1988). Article Google Scholar Kennedy, J. & Eberhart, R. Particle swarm optimization. In Proc. ICNN’95—International Conference on Neural Networks, 1942–1948 (IEEE, 1995). Dorigo, M., Maniezzo, V. & Colorni, A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B (Cybern.)26, 29–41 (1996). CASArticle Google Scholar Karaboga, D. & Basturk, B. Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In Foundations of Fuzzy Logic and Soft Computing. IFSA 2007. Lecture Notes in Computer Science, 789–798 (Springer, 2007). Wolpert, D. H. & Macready, W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput.1, 67–82 (1997). Article Google Scholar Kaur, S., Awasthi, L. K., Sangal, A. L. & Dhiman, G. Tunicate swarm algorithm: A new bio-inspired based metaheuristic paradigm for global optimization. Eng. Appl. Artif. Intell.90, 103541 (2020). Article Google Scholar Abdollahzadeh, B., Gharehchopogh, F. S. & Mirjalili, S. African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems. Comput. Ind. Eng.158, 107408 (2021). Article Google Scholar Hashim, F. A. & Hussien, A. G. Snake optimizer: A novel meta-heuristic optimization algorithm. Knowl. Based Syst.242, 108320 (2022). Article Google Scholar Mirjalili, S., Mirjalili, S. M. & Lewis, A. Grey wolf optimizer. Adv. Eng. Softw.69, 46–61 (2014). Article Google Scholar Chopra, N. & Ansari, M. M. Golden jackal optimization: A novel nature-inspired optimizer for engineering applications. Expert Syst. Appl.198, 116924 (2022). Article Google Scholar Mirjalili, S. & Lewis, A. The whale optimization algorithm. Adv. Eng. Softw.95, 51–67 (2016). Article Google Scholar Abualigah, L., Elaziz, M. A., Sumari, P., Geem, Z. W. & Gandomi, A. H. Reptile search algorithm (rsa): A nature-inspired meta-heuristic optimizer. Expert Syst. Appl.191, 116158 (2022). Article Google Scholar Faramarzi, A., Heidarinejad, M., Mirjalili, S. & Gandomi, A. H. Marine predators algorithm: A nature-inspired metaheuristic. Expert Syst. Appl.152, 113377 (2020). Article Google Scholar Storn, R. & Price, K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim.11, 341–359 (1997). MathSciNetArticle Google Scholar Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science220, 671–680 (1983). ADSMathSciNetCASArticle Google Scholar Rashedi, E., Nezamabadi-Pour, H. & Saryazdi, S. G. S. A. A gravitational search algorithm. Inf. Sci.179, 2232–2248 (2009). Article Google Scholar Dehghani, M. et al. A spring search algorithm applied to engineering optimization problems. Appl. Sci.10, 6173 (2020). CASArticle Google Scholar Eskandar, H., Sadollah, A., Bahreininejad, A. & Hamdi, M. Water cycle algorithm—A novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput. Struct.110, 151–166 (2012). Article Google Scholar Ray, T. & Liew, K. M. Society and civilization: An optimization algorithm based on the simulation of social behavior. IEEE Trans. Evol. Comput.7, 386–396 (2003). Article Google Scholar Moghdani, R. & Salimifard, K. Volleyball premier league algorithm. Appl. Soft Comput.64, 161–185 (2018). Article Google Scholar Zeidabadi, F. A. & Dehghani, M. POA: Puzzle optimization algorithm. Int. J. Intell. Eng. Syst.15, 273–281 (2022). Google Scholar Rao, R. V., Savsani, V. J. & Vakharia, D. Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. Comput. Aided Des.43, 469–492 (2011). Article Google Scholar Dehghani, M. et al. A new doctor and patient optimization algorithm: An application to energy commitment problem. Appl. Sci.10, 5791 (2020). CASArticle Google Scholar Dehghani, M. & Trojovský, P. Teamwork optimization algorithm: A new optimization approach for function minimization/maximization. Sensors21, 4567 (2021). ADSArticle Google Scholar Pira, E. City councils evolution: A socio-inspired metaheuristic optimization algorithm. J. Ambient Intell. Hum. Comput.https://doi.org/10.1007/s12652-022-03765-5 (2022). Article Google Scholar Ayyarao, T. L. et al. War strategy optimization algorithm: A new effective metaheuristic algorithm for global optimization. IEEE Access10, 25073–25105 (2022). Article Google Scholar Wilcoxon, F. Individual comparisons by ranking methods. Biometr. Bull.1, 80–83 (1945). Article Google Scholar Awad, N., Ali, M., Liang, J., Qu, B. & Suganthan, P. Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization (Kyungpook National University, 2016). Google Scholar Kannan, B. & Kramer, S. N. An augmented Lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design. J. Mech. Des.116, 405–411 (1994). Article Google Scholar Gandomi, A. H. & Yang, X.-S. Computational Optimization, Methods and Algorithms. Studies in Computational Intelligence, Chap. Benchmark Problems in Structural Optimization 259–281 (Springer, 2011). MATH Google Scholar Mezura-Montes, E. & Coello, C.A.C. Useful infeasible solutions in engineering optimization with evolutionary algorithms. In Advances in Artificial Intelligence (MICAI 2005). Lecture Notes in Computer Science, 652–662 (Springer, 2005). Download references This work was supported by the Project of Specific Research, Faculty of Science, University of Hradec Králové, No. 2104/2022. Department of Mathematics, Faculty of Science, University of Hradec Králové, Rokitanského 62, Hradec Králové, 500 03, Czech Republic Eva Trojovská & Mohammad Dehghani You can also search for this author in PubMedGoogle Scholar You can also search for this author in PubMedGoogle Scholar Conceptualization, E.T.; methodology, E.T.; software, M.D.; validation, E.T. and M.D.; formal analysis, M.D.; investigation, E.T.; resources, E.T.; data curation, E.T. and M.D.; writing—original draft preparation, E.T. and M.D.; writing—review and editing, E.T. and M.D.; visualization, E.T.; supervision, E.T.; project administration, M.D.; funding acquisition, E.T. Correspondence to Eva Trojovská. The authors declare no competing interests. Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. Reprints and Permissions Trojovská, E., Dehghani, M. A new human-based metahurestic optimization method based on mimicking cooking training. Sci Rep12, 14861 (2022). https://doi.org/10.1038/s41598-022-19313-2 Download citation Received: Accepted: Published: DOI: https://doi.org/10.1038/s41598-022-19313-2 Anyone you share the following link with will be able to read this content: Sorry, a shareable link is not currently available for this article.
USC Thornton School of Music offers music teachers a master’s degree in teaching popular music For more than 100 years, music education programs have prepared elementary, middle and high school teachers to lead marching bands, choirs and orchestras. But in the past two decades, there’s been an explosion of new interest from students wanting to perform in pop groups and to learn other aspects of popular music such as songwriting, guitar and digital music production. While K-12 schools around the country embrace this growing interest, universities have been slow to meet the new demand with a structured pedagogy focused on popular music. To fill that need, the USC Thornton School of Music, which pioneered a highly successful Popular Music Performance program for undergraduates 15 years ago, is offering a new master’s degree in popular music teaching and learning. The new degree, which will begin enrolling students in fall 2023, is designed for working popular musicians wanting to transition into teaching, musicians with a bachelor’s degree in music performance or music education looking to expand into the popular music teaching arena, musicians seeking to emphasize this growing field as they advance into doctoral level work in education, as well as current K-12 teachers who want to immerse themselves in popular music pedagogy. “It’s a cutting-edge field,” said Brian Head, associate dean for academic affairs at USC Thornton. “At USC Thornton, when we inaugurated the Popular Music Performance program, the faculty developed its own pedagogy from the ground up. There weren’t many schools out there doing it and certainly none in the university conservatory environment. Over the last 15 years, we have created a proof of concept with tremendously successful graduates and a highly competitive, vibrant program. “Our faculty have assembled and refined a full pedagogical framework of how to teach songwriting, how to teach ensemble skills within popular band settings, how to train a voice to sing popular music styles, how to teach rhythm and groove in a variety of modern styles and how to integrate all of this into a comprehensive program.” Beatriz Ilari, associate professor of music education who was chair of the Thornton Music Teaching and Learning program when the new degree took shape, said the demand from students in middle and high schools for popular music instruction has been evident for some time, but it took music educators a longer time to embrace it. “There are students who love band or love choir, but there are students who want to be in rock bands or do mariachi or learn technology and DJ,” she said. Demographic research has shown that only about a fourth of U.S. high school students are actively involved in large school ensembles, she pointed out, “so this program will help teachers diversify to serve even more students.” Associate Professor Chris Sampson, who was the architect of the undergraduate Popular Music Performance program, said that educational institutions at all levels are expanding their offerings and are looking for qualified teachers who understand popular music. “Popular music is unique to music education,” he said. “It’s not the same approach that you would take in classical music.” Popular music instruction blends informal and formal education, and honors experimentation, jam sessions, playing by ear or sitting down at a computer workstation and coming up with new sounds. Popular music education also breaks down the master-to-student dynamic common to traditional music instruction, Sampson said, and can put the teacher side-by-side with students. “This takes tremendous courage on the teachers’ part not to present themselves as the 100 percent expert on everything,” he observed. Sampson, who will teach in the new graduate program as well as continue to teach songwriting and entrepreneurship to undergraduates, successfully piloted a graduate course in popular music teaching this past year. As a final project, the students each produced an episode of a podcast. One student’s topic was using strings in popular music. Another compared teaching improv comedy to teaching songwriting. A third examined gender equity issues in popular music. A link to all eight podcasts is here. The new Master of Music (MM) degree curriculum consists of 30 semester units, balancing professional practice, scholarship and research including academic courses in research methods, psychological, sociological and philosophical foundations blended with core courses in teaching popular songwriting, music technology and coaching popular music vocalists and ensembles. Elective courses include community engagement through music, world music pedagogy, cultural diversity in music teaching and learning and musicians’ health and wellness. The MM students will be able to closely observe Thornton’s undergraduate Popular Music Performance program, and all will author a capstone scholarly document and engage in supervised applied teaching. Head said that while the canonic ensembles of marching band, choir and orchestra remain vitally important in music education, teachers now want to have resources and a comprehensive pedagogy to address the dynamic world of popular music teaching. USC Thornton is pioneering that effort. A detailed description of the new Popular Music Teaching and Learning master’s degree, with admission and curriculum requirements, can be found here. Los Angeles, CA 90089-1441 Office: (213) 740-6935 Admission: (213) 740-8986
Come As You Are As the great Kurt Cobain* once said, “Come as you are.”BMG is committed to providing equal employment opportunities and we celebrate diversity in all forms. Equal opportunity runs deep in our core value of fairness and we are determined to create a truly inclusive work environment, where everyone can flourish. If you’re good at what you do, come as you are. All applicants to BMG will receive equal treatment regardless of age, disability, gender identity or expression, marital or civil partner status, pregnancy or maternity, race, color, nationality, ethnic or national origin, religion or belief, sex or sexual orientation. *BMG is the proud representative of Kurt Cobain’s publishing catalogue, including the 1992 single ‘Come As You Are’. Every day, BMG enters into new Administrative deals and Catalog purchases. All new signings and purchases are then carefully reviewed to determine redirection efforts required. As Manager, Income Tracking your primary mission is supporting income redirection efforts as related to newly BMG signed administrative deals and/or newly acquired catalogs. This position will also be responsible for Live Performance registrations on behalf of BMG writers/artists such as Aerosmith, Hall & Oates, ZZ top, Tool, The National and many more. Jingle Performance registrations as related to BMG content embodied in TV Commercials and Movie Trailers. This position will also support a number of additional income tracking efforts for both Publishing and Master related tasks. Are you driven and ready to grow a career in the music business? Are you interested in professional development and technological training on the job? Would you like to be part of a talented team of music professionals from around the world delivering the best to their clients? BMG’s Incoming Tracking team has a 360°view of the music business and works closely with a wide remit of departments and foreign affiliate offices. The successful candidate will gain invaluable exposure into the workings of a global music business. This is an excellent opportunity for someone who is eager to learn; if you are an organized, self-motivated music lover who enjoys detective work and deep-diving into data then this could be the dream job for you! It’s a plus if you have knowledge in SQL and/or BI software (e.g. Tableau, Looker, Power BI) BMG is a new kind of music company. Our mission is clear; to help artists and songwriters make the very most of their songs and recordings in the digital age. That’s why we offer the best creative support, provide the best access to platforms and work hard to maximize the value of each and every copyright, ensuring all our clients receive all payments promptly and accurately. We are not a technology company – though we use the best technology. We are not just a music publisher or a record label – although we offer both services. BMG is a company with service, transparency and fairness at its heart and a commitment to being the best international music company for songwriters, artists and everyone who works with us. Are you interested? Follow the link to apply! BMG – est. 2008 – is the world’s fourth-biggest music company, the first new global player in the music business of the streaming age, and a record label and music publisher in one. Named in 2020 one of the world’s Most Innovative Companies by Fast Company, BMG’s pitch is unique – a relentless focus on fairness and transparency and service to its artist and songwriter clients. BMG’s 20 offices across 12 core music markets now represent over three million songs and recordings, including many of the most renowned and successful catalogs in popular music history. BMG’s fresh approach includes production music, films, books, artist management, merchandise, neighboring rights, and live as well as music publishing and recordings off the same service platform. BMG is owned by international media, services and education company Bertelsmann, whose other content businesses include the broadcaster RTL Group, the trade book publisher Penguin Random House and the magazine publisher Gruner + Jahr. With its multi-platform perspective, integrated technology platform and commitment to help artists maximize their income, BMG aims to be the best company in music to do business with. www.bmg.com Company: BMG Rights Management (US) LLC Country: United States of America State/Region: Tennessee City: Nashville Postal Code: 37203 Music Business Jobs is the most effective way for the global music industry to find the best candidates for their open positions. In addition to being seen by over 300,000 monthly unique readers online, our listings are also emailed direct to more than 50,000 professional subscribers every week – across the US, UK, Europe, Asia-Pacific and beyond. Click through below for details on how to submit a Music Business Jobs listing – and learn why our advertisers ‘strongly recommend’ us to their peers…