text
stringlengths 16
1.72M
| meta
dict | __index_level_0__
int64 0
9.97k
|
|---|---|---|
Do you know what's difficult? Going to a networking event and having to explain what you're passionate about. Especially when your passion is along the lines of societal change. If you're passionate about the racial controversies plaguing our day to day, you're accused of being racist, supporting a racial divide (that some people are too stupid enough to see already exists), and your words become quickly twisted into statements of prejudice and hatred. Or if you share my passion, mental health awareness and radical self-love, you're automatically a kook.
Nope, I wasn't a kook. I was a fad.
A blank stare is all I could give her. I wanted to reply, "Yes, just like those, you ignorant turd," but it's 2016, and I have a business to run, and Aunty Oprah would never answer that way. But she did bring up a point I've been trying to ignore for the past year.
In the year 2015, community websites, and bandwagon bloggers, and money hungry "coaches", decided to turn self-care and self-love into a fad for the sake of viewership and "do-it-for-the-internet" care.
Yes. I said it. And though it has increased awareness, and encouraged more conversations around the forgotten art of putting oneself first, people still don't want to dive deeper into the root cause: Mental Illness. Nobody wants to touch that word. It stains. It causes controversy. It's a rough spot. But it's exactly where we need to go. Like yesterday.
In 2015, bandwagon bloggers, & "coaches", turned self-care and self-love into a fad.
And a blank stare is all she could give me. Clearly our conversation was over. Just as quickly as this self-care and self-love fad will be. Because these churned out quick lists of "Self-Care" won't tell you that more than 800,000 people commit suicide every year and that twice as many attempt it. They won't explain to you that depression and anxiety are the most common mental illnesses, and only a third of the 40 plus million people that have been diagnosed get treated. They also won't explain to you that most cases are formed in the adolescent years, and sometimes could have been prevented. And they certainly won't touch upon that there is a large number of little girls who have determined by the tender age of 9 that they are not pretty. I'm choosing to go beneath the surface of these tabooed issues because, there are twice as many women being diagnosed than men, and lord knows how many that are silently suffering due to a lack of mental health education and due to embarrassment and shame.
What Certified 10 is doing, and what many other organizations are doing are tackling the problems beneath the easy checklists. We're coming for the stigma. Don't lump us into a category of businesses and people who don't believe in the words and actions they're putting forth, and are barely scraping the surface. Mental Health Awareness, building a young woman's unbreakable belief system, reprogramming the way a society thinks? That is not a fad.
This is about opening the world to a conversation that is desperately needed. It's about raising awareness and getting our family members and friends the help they need, whether it be therapy, medication, or simply a listening ear. It's about those silently suffering because of their fear of the word "crazy" and what that label does to one's career, love-life… life in general. It's about creating a community where "me too" is proudly announced, and "I feel alone" is diminished. It's about less judging and more understanding, and realizing that there are many us that stand in the midst of you who have at some point not wanted to live another day. It's about options. Options outside of taking ones life and options outside of ignoring the problem.
It is more than just some short-lived craze. Much more.
So please, for the love of God, do not confuse my fire, my passion, and my purpose for an only here for the moment fad. Please and thank you.
10 day writing challenge. Word of the day: IGNITE.
I loved the passion behind this!!
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,418
|
Rachel Dolezal identifies as a black woman, even though she was born a white woman to evangelicals. If Caitlyn Jenner can be considered a woman, why can't Rachel Dolezal be black?
Rachel Dolezal, may have been born a white woman but by the time she was heading a local chapter of the NAACP in Washington state she identified as a black woman. She tells her story in her memoir In Full Color about finding belonging in the black community; and if Caitlyn Jenner can be a woman, the argument can certainly be made that Rachel can be black.
After all the accomplished artist and dedicated civil rights activist before setting off a media firestorm in 2015 had married a black man, beared his children, specialized in doing black hair, but most of all actually had studied the culture and made life choices aligned with support for the black community, which she showcases in her artwork.
Ryan Glover: One of the points you make in the book is that just because a family adopts black children doesn't mean they aren't racist as in the case of your own parents. Why do you think that many white people such as your parents portray a righteous image but seem oblivious to their own overt racism?
Rachel Dolezal: I can't really defend that. I don't know. It kind of boggles the mind right? Why would you say you have God on your side and your being abusive. Even following serial killers, it's a lot of really evil people in the world that thought they were doing God's work. Even the Klan or the Aryan Nation their white supremacy beliefs is that man was was made perfect in the Garden of Eden. A lot of white supremacist foundations were connected with Christianity.
Ryan Glover: You point out early on noticing the issues of colorism with the way your parents treated your adopted brother. Did you ever consider the idea that you would receive more favorable treatment by identifying as black?
Rachel Dolezal: Colorism does play out within the black community for sure. I would say I got the experience of a light skinned black woman or a mixed biracial "redbone" and I talk about all the things I was seen as in Mississippi. I didn't date my whole time in college and part of the reason was knowing it was so much emotion surrounding that colorism world within the circle of women.
Ryan Glover: I was struck by the harassment you detail in the book from white supremacists due to your civil rights work. Do you feel it was a white-supremacist agenda in the way the media has typically portrayed you?
Rachel Dolezal: Definitely. The story broke from that Idaho newspaper, the same area that is a stronghold of white supremacy!!
Ryan Glover: What does being a black woman mean to you?
Rachel Dolezal: Being black in my definition is being human because we all come from a black woman!! The human race started with a black woman and if society would own and honor that, we could start the view that we are one human race!!
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 88
|
Gloucestershire Arts & Crafts Centre 47 Westgate Street, Gloucester GL1 2NW
Contact us 01452 307161 info@glosartscrafts.co.uk
A Message from our Founder Helen Lomberg about what makes us rather unique:
"I set up the Gloucestershire Arts and Crafts Centre in April 2010 as a Not-For-Profit Company, with the help and encouragement of many local Artists and Creatives.
I wanted to find a way of offering customers the choice of buying beautiful local handmade work when they were out doing their shopping, instead of only the mass produced imported items offered in most High Street shops.. To do so at an affordable price - without the huge mark ups charged by galleries, making the work out of reach for most pockets, was the challenge. Also, how do we pass on such techniques and skills, to share the joy and resilience of creativity? I wanted to find a way to do that too. The idea was to share all the jobs needed to run such a shop, between us, so that the normal overheads were kept at a minimum. We run in as collaborative a way as possible, making a unique atmosphere, where customers can meet makers, and feel encouraged to explore their own creativity."
The Gloucestershire Arts and Crafts Centre opened in April 2010, located in the Lock Warehouse in the Gloucester Docks. In September 2011 plans began to change the Warehouse into flats and so we moved to College Street, a beautiful location beside the Cathedral. After 3 years trading in this beautiful location, our lease ran out and we looked around for the location for the third home for our Centre, and discovered the gorgeous premises in College Court, just around the corner. Then in November 2019 we moved to 47 Westgate Street.
Our shop is entirely run by, and filled with the work of Gloucestershire artists and makers. We pride ourselves on our 'localness'! You can visit the shop and the person inside will be one of the makers who may even be working on a piece at the time, so you can ask lots of questions and find out how a craft is done. We have workshops run by the artists so you can have a go at making something yourself.
So what now? How are we taking the project forward after successfully trading in Gloucester for over Ten Tears? How do we make ourselves even more resilient to shocks such as Covid 19? After trading for 10 Years in Gloucester, we calculated that we had spent over £150,000 in rent to various city landlords. During that time, we had endured heating systems which did not work, tenancies that were abruptly ended, damp walls and persistent leaks. We also couldn't afford to trade in the city's busiest Streets..
What if there was another way? We have been investigating buying our own premises. We are currently in the process of buying 47 Westgate Street between us, so we can fix the rent at an sustainable level. We want to keep the building in good repair for the pleasure of it's users and our customers and visitors to our Beloved Historic City. We aim to fit Solar Panels and restore natural lighting and our trademark 'flower bed', to trade in as Environmentally sensitive way as we can. We welcome your continued interest and custom in the months and years ahead."
Now for the first time we are selling some of our artists work on-line from this website.
Designed by Mithra Designs
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 4,604
|
Nenita Weather
, Northern Samar, PH
Time in Nenita is Thu 28th Jan 11:35 am |
Nenita Current weather report
Weather today in Nenita, Philippines is going to be Heavy rain with a maximum temperature of 26°c and minimum temperature of 24°c. Expected precipitation falling is 21.30 mm.
17 km/h NE
Weather tomorrow in Nenita, Philippines is going to be Moderate rain with a maximum temperature of 24°c and minimum temperature of 24°c. Expected precipitation falling is 17.30 mm.
23 km/h NNE
Weather in Nenita, Philippines
Today's weather is turning out to be heavy rain. The visibility is going to be around 8 km i.e. 4 miles and an atmospheric pressure of 1011 mb . The daytime temperature is going to reach 26 °c and the temperature is going to dip to 24 °c at night. We expect around 21.3 mm of precipitation to fall and cloud covering 69% of the sky, the humidity will be around 89%.
Tomorrow weather is forecasted to be moderate rain. The visibility is going to be around 9 km i.e. 5 miles and an atmospheric pressure of 1012 mb. The daytime temperature is going to reach 24 °c and the temperature is going to dip to 24 °c at night. We expect around 17.3 mm of precipitation to fall and cloud covering 90% of the sky, the humidity will be around 88%.
On Saturday weather will be moderate rain with daytime temperature reaching 26 °c. Night time temperature are expected to be 19 °c.We expect around 18.2 mm of precipitation to fall. The visibility is going to be around 9 km i.e. 5 miles and an atmospheric pressure of 1013 mb. We expect around 18.2 mm of precipitation to fall and cloud covering 74% of the sky, the humidity will be around 85%.
Book flights and hotels for Nenita
Please also visit Nenita Historical Weather, Weather widget and Weather Charts pages. Historical or past weather forecast page provides historical weather forecast from 1st July, 2008 till now in 3 hourly interval. Text weather page will allow you to get a weather text summary for next 14 days and weather chart page displays weather pattern like temperature, wind speed, gust, pressure, etc. in graphical mode for next 14 days. We hope you like it.
Looking to buy past/historical weather for Nenita, please visit Historical Weather Data section.
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 4,459
|
Q: Value of User field changed after copying to another list cross Site Collections The value of owner field of a document is beeing changed when I copy a document from a library to another library which belongs to another site collection than the original library. I copy the document by opening libraries in Explorer view and copy paste the document. the value of owner field which is a custom site column is changed from domain\user1 to domain\members group.
A: This is because User field value uses IDs that are Site Collection specific. There is a hidden list at the root of each site collection where one row per user is created the first time the user is introduced in that Site Collection (e.g., user adds some content). List is located at /_catalogs/users/simple.aspx. List contains ID for each item (as with every list in SharePoint), which is a running integer from 1. SharePoint uses that ID when binding users to items within that Site Collection.
Apparently when a user with that ID isn't found in the destination Site Collection, SharePoint changes the person field in the copied item to something that exists for sure.
See this answer for few ways you can force sync the hidden User Information lists across site collections before you copy any items.
|
{
"redpajama_set_name": "RedPajamaStackExchange"
}
| 1,516
|
We do not automatically cover winter sports in our policies, as that would drive up our prices, and we aim to keep our premiums as affordable as possible. We offer the option of adding winter sports insurance, at competitive rates, which will include cover for your ski equipment and pre-booked ski passes, and unlimited medical cover. There are limits and exclusions, so please check the product disclosure statement and search for key words (ctrl+F).
We provide competitive travel insurance for those travelling to Europe, and you can choose from a One-Trip, Multi-Trip, Backpackers or Cruise policy; we cover all sorts of travellers up to the age of 100, with all medical conditions considered.
1. Do you cover us if the slopes don't open?
Our Silver If all the lift systems are closed at your pre-booked resort for more than 12 hours while you are there, as a result of snow or high winds, then yes, you are covered.
3. Do you cover snow boarding?
With winter sports cover, you are covered for medical expenses related to snowboarding, but we don't cover permanent disablement or personal liability for this activity.
5. Do you cover my equipment if gets damaged?
With winter sports cover, items such as ski, poles, ski boots and bindings, ski helmets, snowboards and bindings are covered up to up to $600 per item/set, up to $1250 in total. We don't cover equipment that's damaged while in use.
7. Does having the winter sports cover, cover me for anything that can go wrong on my trip related to winter sports?
2. If I don't pay the additional premium am I covered for medical expenses?
You will need to add the winter sports cover option to be covered for medical expenses you may incur as a result of participating in winter sports activities.
4. Do you cover off-piste skiing?
Yes, off-piste skiing is covered provided you are with a professional snow sports instructor who has a backcountry and mountain safety qualification (mandatory for level 4 instructors).
6. Does your insurance cover damage to a rental car?
Our Silver and Gold policies cover your rental car excess up to $4000. However, you need to make sure that the rental car is insured (confirmed by the rental company), as we do not pay for full damages to a rental car, only your excess. Please note, motorbikes are excluded.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 2,922
|
January 28, 1929 – Two hundred passengers are shaken up, and forty-two are injured as a Rock Island commuter train crashes through the bumper at the La Salle Street station, the second serious train accident of the week. Four days earlier a passenger died and 39 others were injured when two Chicago and Northwestern passenger trains collided near Lake Street. In the Rock Island crash the vice-president of the railroad blames the cause of the accident on the engineer's failure to have his train, made up of seven steel coaches, under control as it entered the station. The engineer, J. Boyd, maintains that fog and steam inside the train shed clouded his view and that the wheels of the train slipped on the tracks as he applied the brakes.
January 28, 1901 -- WARNING . . . This one is not for the faint of heart, but it does demonstrate that in the days before O.S.H.A. danger was constantly lurking and peril was always at hand. It happened that Dr. B. L. Reise was administering vaccinations to women at the Young Woman's Christian Association Building on Michigan Avenue. Miss Stella Thomas of Burlington, Iowa, seeing that she would have to wait for some time because of the length of the line, headed for her room. There is speculation that the sight of the injections was disquieting to her, and as the elevator approached the fifth floor, Miss Thomas fainted and fell to the floor of the car in such a way that her head extended through the grate of the elevator's door and was caught between the bottom of the elevator car and the lower portion of the fifth floor. Miss Thomas, who had come to Chicago just three weeks earlier to enter the Sherwood Musical College in the Fine Arts Building, died within minutes. The second building from the middle left (next to the mansion on the corner) in the 1901 photo above is the YWCA building where the accident occurred.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 4,407
|
Today we're highlighting Syringa Hospital & Clinics in Grangeville, Idaho. Syringa Hospital & Clinics recruited a family medicine physician assistant through 3RNet! Congrats!
Tell us a bit about Syringa Hospital & Clinics.
Syringa Hospital & Clinics is comprised of an acute care, 15-bed Critical Assess Hospital (CAH) with an attached Rural Hospital Clinic (RHC) specializing in Family Medicine located in beautiful North Central Idaho. In addition to the Grangeville clinic there is also a clinic in Kooskia, Idaho. The facility employs approximately 160 Full and Part Time Employees who are "dedicated to providing the quality healthcare our patients deserve".
Our scope of services includes 24-hour ER services and ambulance, Inpatient and Outpatient Med/Surg, Physical Therapy, Swingbed Care, Obstetrics with two LDR rooms, Lab, Radiology, and Hospice care. Our radiology services include Ultrasound, CT and mobile MRI and Mammography. A surgeon travels from Lewiston to Syringa twice a month to perform minor surgeries including laparoscopic procedures.
What makes your community a great place to live and work?
Located at the edge of the Bitterroot Mountains to the south and the Camas Prairie to the north, Grangeville is located in beautiful Idaho County which has a population of 16,000 residents. The community of Grangeville and outskirts has approximately 3,800 residents and with an elevation of 3,500 feet, features warm summer days, mild winters and four seasons of outdoor recreation. Five major rivers cut through this diverse landscape offering a variety of seasonal recreation including world class fishing, hunting and superb whitewater rafting. Two national forests are right in your backyard with bird and game hunting, hiking, 4-wheeling, mountain biking and camping opportunities just minutes from town.
We opened our family medicine clinic in the spring of 2006 with one provider. With the resources of organizations like 3RNet we were able to build that provider base to where we are today with four full time physicians and three midlevel providers. 3RNet allows us to post positions for providers and get the same national exposure as other sites without the cost. Regardless of whether a provider is recruited directly from the site, Syringa benefits from the high profile and national outreach of the site.
Finding qualified candidates to fill all the needed positions in a rural setting is always difficult but Syringa has managed to recruit a robust medical staff as well as support personnel by offering a family centered work environment. Balancing the needs of the organization with the needs of a small community is also difficult. Our providers live and work right beside their family and neighbors making it challenging to "get away from work". They also have to provide night and weekend on call for the ER while working full time in the clinic. Offering flexible work opportunities, generous time off benefits, CME opportunities and other perks help with avoiding clinician burnout. Overstaffing with providers is another way to avoid burnout and turnover so that more providers are sharing the burden. The facility has to be willing to make that sacrifice as physicians are so highly compensated and not all small facilities can afford to do that.
The best advice I can offer a facility when recruiting is to be completely upfront about what a rural practice really looks like. Many providers think they want to "do it all" but then realize that to keep a healthy personal and work balance they really can't do it all without being willing to let others share the load. This may mean they give up some compensation incentives, but in the long run they will be better providers and stay in the community longer. That is the end goal for all facilities – hire the best fit and keep them in the community to build that rapport and trust with patients.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,104
|
Старый Ярычев () — село в Новоярычевской поселковой общине Львовского района Львовской области Украины.
Население по переписи 2001 года составляло 1746 человек. Занимает площадь 2,1 км². Почтовый индекс — 80463. Телефонный код — 3254.
Ссылки
Старый Ярычев на сайте Верховной рады Украины
|
{
"redpajama_set_name": "RedPajamaWikipedia"
}
| 1,684
|
Todd and his wife Michelle moved to Tauranga in 1999 and have 2 children, Aleisha and Josh. Todd worked in hospital medicine for over 4 years, with a particular interest in paediatrics, emergency medicine and cardiology, then moved into general practice at Fifth Avenue in 2003. He undertook vocational training in General Practice in 2004 and has been a partner at Fifth Avenue since 2005. Todd enjoys all aspects of general practice and family medicine and has a particular interest in paediatrics (children's health) and skin cancer medicine and surgery. Skin cancer management has become a special interest of Todd's' and through 2013 and 2014 he has undertaken post graduate diplomas in both skin cancer medicine and in dermoscopy (skin cancer diagnosis) through the Skin Cancer College of Australasia allowing him to undertake more advanced types of skin cancer surgery including skin flaps and grafts. Todd also offers a range of procedures including "No Scalpel Vasectomy", ingrown toe nails and joint and carpal tunnel injections. Dr Todd Hulbert has completed a Diploma of Dermoscopy (skin cancer detection) and a Diploma of Skin Cancer Medicine and Surgery, and is available for patients registered at Fifth Avenue Family Practice for skin cancer detection and management.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 9,601
|
You can bet, when those vacationing at Myrtle Beach, South Carolina, heard Florence was on the way, they got out of the way.
Some of those who call Myrtle Beach home didn't have that option. Or, at least, decided they didn't.
As The Guardian reports, 23% of them have income below the poverty level. They got it that they aren't able or perhaps willing to pay for a motel, perhaps for days and days. They feel they have no choice but to ride out the monster act of god. Their vehicles are parked on the street, not a garage. So, they are hoping for the best for that too.
Others who didn't follow the vacationers out believe their home is where they should be. In a sense it's a voodoo mindset. If they are inside, the evils of the outside won't dare enter.
The maternal part of my family, immigrants from Poland, thought that way. Their lives were ruled by old world hocus-pocus.
The adults and we pre-school children hunkered down in a flimsy bungalow during a brutal hurricane at the end of the 1940s. Mostly everyone else had fled Staten Island, New York.
The matriarch - my grandmother - lit candles and chanted. And that was that.
Maybe she had cast a spell which kept the ocean from engulfing us. But the odds were that we could have been swallowed by the sea. Somehow I understood that. Later I never stepped into the ocean or enjoyed a ride on a friend's boat.
More importantly, I was left with a curiosity about how human beings regard danger. By time I was 11 I regarded my family's assessment of it as constituting negligence.
For years I argued with my younger sister Anne that we should have gone to child protective services to become safe. She only smirked. Yeah, she would reply, and be put in a foster home and be molested.
How many children will emerge from the days of Florence recognizing that those legally responsible for protecting them didn't know how or couldn't give a damn? They could be among the families staying put in Myrtle Beach. Florence could produce a non-war generation of PTSD.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 5,601
|
Musical – forma teatralna, łącząca muzykę, piosenki, dialogi i taniec. Ładunek emocjonalny dzieła – humor, patos, miłość, gniew – podobnie jak sama opowieść, jest wyrażany poprzez słowa, muzykę, ruch i aspekty techniczne przedstawienia, tworząc jedną, spójną całość. Od początków XX wieku produkcje teatru muzycznego są nazywane po prostu "musicalami". Wcześniejszą podobną do musicalu formą widowiska była extravaganza.
Musicale są wykonywane na całym świecie. Mogą być wystawiane na wielkich scenach, jak wysokobudżetowe produkcje teatrów na West Endzie w Londynie czy Broadwayu w Nowym Jorku lub w mniejszych teatrach awangardowych, na Off-Broadwayu lub jako produkcje lokalne, wyjazdowe, w amatorskich grupach szkolnych, teatrach i innych przestrzeniach wykonawczych. Oprócz Wielkiej Brytanii i Ameryki Północnej istnieją inne dobrze działające sceny musicalowe w wielu krajach Europy, Ameryki Łacińskiej, Australii i Azji.
Definicja
Współczesny musical jest formą eklektyczną i wielotworzywową. Korzysta z różnych gatunków muzycznych (od hard rocka przez jazz, calypso, rap aż do muzyki poważnej) i różnych rodzajów tańca (od baletu klasycznego po taniec współczesny i stepowanie). W produkcjach musicalowych na porządku dziennym jest użycie efektownych i monumentalnych dekoracji, technik multimedialnych i pełnego nagłośnienia akustycznego. W musicalach występują różnorodne typy orkiestr – od niewielkich combo (np. Grease, Chicago, Rent), aż po duże orkiestry musicalowe (np. Miss Saigon, Taniec wampirów, Upiór w operze).
Musicale mają różny czas trwania. Wahają się od krótkich, jednoaktowych przedstawień, do wielu aktów i kilku godzin trwania (lub nawet przedstawień wielospektaklowych); jednakże większość musicali trwa od półtorej do 3 godzin. Musicale są zazwyczaj przedstawiane w dwóch aktach z jednym, 10-20-minutowym antraktem. Pierwszy akt jest najczęściej dłuższy od drugiego, wprowadza wszystkie główne postaci i większość warstwy muzycznej, często kończy się wstępem do konfliktu dramatycznego czy komplikacji fabuły. Drugi akt może wprowadzać kilka piosenek, jednak zazwyczaj tylko przywołuje ważne tematy muzyczne i rozwiązuje konflikty dramatyczne. Musical fabularny (ang. book musical) jest na ogół konstruowany na podstawie 4 do 6 głównych tematów muzycznych, które powracają w późniejszych etapach spektaklu, choć czasem może zawierać zbiór piosenek niezwiązanych ze sobą muzycznie w sposób bezpośredni. Dialogi mówione generalnie występują pomiędzy utworami muzycznymi, choć może mieć zastosowanie "dialog śpiewany", bądź recytatyw, zwłaszcza w musicalach śpiewanych w całości, jak Jesus Christ Superstar, Les Misérables i Evita. W ostatnich dekadach na Broadwayu i West Endzie wystawiono kilka krótszych musicali jednoaktowych.
Fabuła musicalu może być pomysłem własnym jednoaktowych autora lub adaptacją powieści (Wicked i Man of La Mancha), sztuki teatralnej (Hello, Dolly!), klasycznej legendy (Camelot), wydarzenia historycznego (Evita), czy też filmu (The Producers i Hairspray). Z drugiej strony wiele spośród popularnych teatralnych produkcji musicalowych zostało zaadaptowanych na film muzyczny, jak na przykład The Sound of Music, West Side Story, My Fair Lady, czy Chicago.
Musical fabularny
Musical XX wieku – musical fabularny (ang. book musical) definiuje się jako spektakl muzyczny, w którym piosenki i taniec są w pełni zintegrowane, tworząc dobrze napisaną historię z poważną dramaturgią, który jest zdolny do wywołania nie tylko śmiechu, ale i innych prawdziwych emocji.
Trzy główne składniki musicalu fabularnego to muzyka, teksty piosenek i scenariusz (ang. book). Pojęcie scenariusz odnosi się w musicalu do historii, rozwoju postaci, struktury dramatycznej wraz z dialogami mówionymi. Scenariusz może się jednak odnosić do dialogów i tekstów piosenek jednocześnie, używa się wówczas (na wzór opery) określenia libretto (wł. "mała książka"). Muzyka i teksty piosenek tworzą partyturę musicalu. Interpretacja musicalu przez kierownictwo artystyczne poszczególnych produkcji silnie wpływa na sposób jego prezentowania. W jego skład wchodzą: reżyser, kierownik muzyczny/dyrektor artystyczny, zwykle choreograf, a czasem także i orkiestrator. Musical kształtowany jest także przez techniczne jego aspekty, jak scenografia, kostiumy, rekwizyty, oświetlenie sceniczne i dźwięk, które zwykle ulegają zmianom w kolejnych produkcjach. Niektóre słynne elementy produkcji mogą jednak zostać zachowane z oryginału, jak na przykład choreografia Boba Fosse'a w musicalu Chicago.
W musicalu fabularnym najbardziej dramatyczne momenty wyraża się poprzez śpiew. Funkcjonuje zasada: "gdy emocje stają się zbyt silne, by je wypowiedzieć, zaśpiewaj; kiedy są zbyt silne, by je wyśpiewać, zatańcz." W musicalu fabularnym piosenka jest skrojona dla danej postaci i jej pozycji dramaturgicznej; były jednakże okresy w historii musicalu (np. od 1890 do 1920 roku), kiedy integracja opowieści z muzyką była osłabiona. Krytyk New York Times, Ben Brantley określił ideał piosenki musicalowej recenzując wznowienie musicalu Gypsy z 2008 roku: "Piosenki są idealnie scalone z postaciami, zdarza się to w tych rzadkich momentach, kiedy musicalom udaje się sięgnąć celów, dla których w ogóle istnieją". Zwykle znacznie mniej słów wyśpiewuje się w trakcie 5-minutowej piosenki, niż pada ich w 5-minutowym dialogu. Jako że musical generalnie poświęca więcej czasu muzyce, niż dialogom, jest mniej czasu na rozwój dramatu w musicalu, niż w zwykłej sztuce o podobnym czasie trwania. Pisarze są więc zmuszeni dokonać trudnej sztuki rozwoju postaci i fabuły wewnątrz skompresowanej natury musicalu.
Opera – różnice i podobieństwa
Musical jest powiązany z inną formą teatralną, operą. Obie formy zwykle odróżnia się na podstawie kilku czynników. W musicalu kładzie się większy nacisk na dialogi mówione (choć niektóre z musicali są w całości akompaniowane, bądź śpiewane); z drugiej strony, niektóre opery, jak np. "Czarodziejski flet" i większość operetek zawiera dialogi bez akompaniamentu; na taniec (wykonywany zarówno przez wiodących wykonawców, jak i chór); na użycie różnych gatunków muzyki popularnej (lub chociażby popularnych stylów śpiewania); unikanie użycia typowych konwencji operowych.
Musical jest prawie zawsze wykonywany w języku ojczystym jego odbiorców. Musicale wyprodukowane w Londynie i Nowym Jorku, są zawsze śpiewane po angielsku, nawet jeśli oryginalnie zapisano je w innym języku ("Les Misérables", stworzony w oryginale po francusku światową karierę zrobił w wersji anglojęzycznej). Podobnie sytuacja wygląda w polskiej praktyce musicalowej, gdzie wszystkie musicale wystawiane na scenach polskich tłumaczy się na język polski.
Podczas gdy śpiewak operowy jest przede wszystkim śpiewakiem, i dopiero w drugiej kolejności aktorem (i rzadko kiedy musi tańczyć), wykonawca musicalowy jest często przede wszystkim aktorem, a dopiero później śpiewakiem i tancerzem. Osobę, która doskonale opanowała te 3 umiejętności nazywa się w krajach anglojęzycznych "triple threat". Kompozytorzy muzyki musicalowej ustalając wokalne uwarunkowania ról zwykle biorą pod uwagę wykonawców. Współcześnie teatry wystawiające musicale stosują skale głosu aktorów w sposób, który w kontekście opery byłby dezaprobowany, czy nawet niedopuszczalny.
Aspekt ekonomiczny
Produkcja musicalu, w szczególności na Broadwayu i West Endzie to złożone przedsięwzięcie finansowe. Przypomina strukturę przedsiębiorstwa, które zakładane jest w celu wyprodukowania musicalu, zatrudniającego wiele dziesiątek pracowników. Przystępując do produkcji w USA producent zobowiązany jest zawrzeć umowy z organizacjami zrzeszającymi dramatopisarzy, aktorów, reżyserów, choreografów, dekoratorów, oświetlaczy, dźwiękowców i garderobianych. Właściciel sceny, na której wystawiany będzie spektakl musi podpisać umowy ze związkami pracowników technicznych sceny (IATSE), kasjerów, woźnych i sprzątaczy, operatorów ciężkiego sprzętu, odźwiernych i bileterów.
Producent najczęściej jest jedynie organizatorem – fundusze pozyskuje od inwestorów, a w razie odniesienia przez spektakl sukcesu ma swój udział w zyskach. Przedstawienia na Broadwayu są finansowane zwykle więcej niż przez jednego inwestora, na zasadach spółki z o.o. (limited partnership). W przeszłości, gdy koszty produkcji spektaklu muzycznego były znacznie niższe, w teatr inwestowali przeciętni obywatele – na zasadach lokaty czasem przynoszącej zysk, a zawsze dającej dreszcz emocji. W drugiej połowie lat 70. wystawienie musicalu kosztowało przeciętnie między 750 a 1 mln dolarów, na początku lat 80. koło 1,5 mln dolarów aż do ustanowienia rekordu przez musical Cats (5 mln dolarów).
Rzadko zdarza się, aby produkcja została sfinansowana w całości przez jednego inwestora. My Fair Lady został w całości sfinansowany przez stację CBS (400 tys. dolarów); w Annie (kosztującym 800 tys. dolarów) wniosła 100-tysięczny wkład wytwórnia filmowa Columbia.
Historia
Musical jest jedyną rdzennie amerykańską formą teatralną, która dzięki Stanom Zjednoczonym stała się popularna na całym świecie. U źródeł musicalu leżą przede wszystkim gatunki takie jak: wodewil, rewia, burleska i minstrel show. W latach 20. XX wieku teatr amerykański zyskuje swoją odrębną tożsamość (kształtuje się dramat amerykański). Po tym, jak w 1924 pojawił się pierwszy utwór George'a Gershwina "Lady Be Good", w 1943 powstał pierwszy musical fabularny (badacze określają go jako pierwszy prawdziwy musical) Oklahoma! Rodgersa i Hammersteina.
Musical filmowy
Musical filmowy to odmiana filmu muzycznego, w której "muzyka, piosenka i taniec stanowią dominantę dramaturgiczną dzieła".
Zobacz też
Broadway
West End
Ten cały musical
Przypisy
Linki zewnętrzne
The Cyber Encyclopedia of Musical Theatre, TV and Film
musical.pl – O musicalach – po polsku – najstarsza istniejąca polska witryna o musicalach
Moje-Musicale.pl
Muzyka
|
{
"redpajama_set_name": "RedPajamaWikipedia"
}
| 9,332
|
As Patient Numbers Surge, Hospitals Are Missing Staff To Help Them
Published August 21, 2021 at 6:39 AM MDT
Number of U.S. hospitals are running short of human resources, staff, just as patient loads surged this summer because of the delta variant of the coronavirus.
MELISSA WISE: We had four nurses who had to call in because they were ill themselves. And so while four doesn't sound like a big number, when you take four out of nine people who are supposed to be there to provide care, it has a tremendous impact.
SIMON: Melissa Wise is the nursing director of ICU and medicine at Our Lady of the Angels Hospital in Bogalusa, La. She usually manages 80 or so other nurses, but with some out sick and larger hospitals too overwhelmed to accept transfers, Melissa Wise pitched in to record vitals, give meds, check and keep charts on the rising number of patients.
WISE: We're not going to turn a patient away, but I think that if you ask any health care provider in this area, they will tell you that we are struggling to provide the quality of care that our patients in the United States typically receive.
WISE: A lot of days, it's just a matter of we can't see past today 'cause you're so overwhelmed with what the patients need in order to get to the best outcome that you can that sometimes you can only move minute to minute.
WISE: I will say that God has sustained us through this, and he does continue to give strength and energy that you're not quite sure you can muster. But one of the main things that I'm doing right now when I'm not at the bedside is actually constantly rounding on the units to support our staff.
WISE: You can look in their faces and see the defeat and the weariness that they're experiencing right now. What I have tried to do this entire year and a half that I feel like has been so critical is to make sure that their care and their family care is very important. And so when they've had events, be it a vacation or, you know, a couple of days off, whatever normalcy that they could bring to their life, we have done everything humanly possible to make sure they weren't scheduled for those shifts. And so I really think while we're all at some level of burnout, I believe the fact that we have been very attentive to making sure that they've had some time off has allowed them to endure this a little longer.
SIMON: And among those Melissa Wise has had to worry about is her 21-year-old daughter, a new nurse who's working at the hospital, and, in a twist of fate, her husband.
WISE: I had actually worked probably a 13- or 14-hour shift and got home around 9 o'clock one evening. And my husband and I went to bed at 10, and he made the comment that his foot and leg were going numb, and then it moved to his left arm and then to the left side of his face. So I immediately knew what that meant. And so we got into the car and came to the hospital, and it was determined that he did have a stroke. That diagnosis is an absolute automatic admission.
And at that point, of course, almost every patient in our ER and probably 90% of the patients in our inpatient beds are COVID-positive, and my husband was not. And so we were going to have to stay in the ER because there were no beds available in the hospital. So the physician and I had quite an extensive conversation, and we made the decision to just take him home, and I would stay home the following day to do all of the things that we would normally do in the hospital. And he has continued over the two weeks to recover. The outcome could've been much worse 'cause strokes do not always end well, as you know.
WISE: I do have a T-shirt on, and I'll tell you what it says. Our work is love made visible. And I see this over and over and over in our medical team that everything we're doing, love is shining through our actions. When we do have a bad moment or a bad day, we have to lift each other up in order to best get through this period.
SIMON: Melissa Wise - she's nursing director of ICU and medicine at Our Lady of the Angels Hospital in Bogalusa, La.
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 2,592
|
Which are the very best on the net essay creating solutions in kuwait?
The chief explanation is that while talking the dissertation if you find out your friend is far before you, you will receive frustrated. It is not straightforward to compose the ideal dissertation.
If you are uncertain of what topic to write on, you always have the option to take assistance from the on-line dissertation advisors. Deciding on a topic for your essay might appear no challenge, but actually, it's an arduous undertaking. After all if you don't understand the topic of the thesis you won't be in a position to rewrite it.
As an editorial writer, you have to do something between. Carefully proofread your rewritten text to make sure that your writing doesn't have any errors. Dissertation writing is a rather challenging job for those students. The true writer is someone who really writes. Our highly competent and professional writers will choose the work, do the mandatory research and compose an entirely original and plagiarism free essay or paper you will require for cheap. A seasoned editor may also help you with the portions of the proposal first-time authors may be somewhat mystified by, like the competing titles section, so you seem to be a confident and competent marketer of your work. In many instances, an acquiring editor who would like a proposal to be successful with reviewers and their editorial board will work with the author to ensure the submitted materials have the very best possibility of Perspective | Forget coding. It's the soft skills, stupid. And that's what schools should be teaching. success, and therefore the acquiring editor functions as the developmental editor too.
With the assistance of an on-line essay writer, you've got high probability of obtaining better grades in your assignment. Rewriting of your thesis can make sure your thesis is all up to the standard required in order for it to be accepted and gain you that degree which you were seeking. To make cheap on-line homework help readily available to students representing a variety of regions of study, we've hired experts from various domains. Discussing an individu work in a crucial fashion and analyzing plot, characters, and ideas related to that specific work is more challenging than it seems. The time in a person's life when they have to do their dissertation at university is most likely the most stressful thing that could happen.
You may be amazed at what the vast majority of universities provide, often at no cost. All pupils know there's not any talking permitted during the examination, but they're able to whisper into a secret procedure to a different student to obtain a response that is desired. Many pupils are already pressurized on account of the studies and so, they locate dissertation writing as an UDUSOK Academic Calendar Released additional burden. Pupils that are too lazy or uninterested in doing any true learning are likely to lose out from the international market. As a consequence, over half of colleges and universities graduates aren't working in their chosen specialty. Professors are very happy to see you making your research a priority and will offer you with advice and opinions that may significantly enhance your academic performance.
Over the span of your academic career, you'll be asked to compose a number of papers and essays on several different topics, based on the program. Thus, you commit to writing a paper of mediocre quality because you think's the best that you can do with the time you've got at hand. Before you even begin writing your literature paper you've got to ascertain the principal point which will be discussed throughout the job. Thesis papers and dissertations are for the most part conducted by gathering large number of data. For the reason, it's important that you keep concentrated on the dissertation paper and receive all the help necessary for your dissertation writing and thesis writing services. It is clear that you wish to turn over the ideal dissertation paper to your thesis advisor and because of this below are some heads-ups for you which is likely to make your job of dissertation writing a bit simpler.
A thesis could be a huge option, and therefore don't be unwilling to talk to faculty and friends. Read on the thesis or the part of the thesis which you want to rewrite to make sure you fully understand everything that's written. A thesis or a dissertation is a huge project that's typically presumed to be finished in a brief period of time, so deciding some things before can save you lots of time and pain afterwards. It's important to get a method of organizing your essay.
This entry was posted on Wednesday, February 13th, 2019 at 4:09 am and is filed under Uncategorized. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 4,580
|
Approximately 10% of patients following a variety of surgeries develop chronic postsurgical pain. Reducing chronic postoperative pain is especially important to reconstructive surgeons because common operations such as breast and limb reconstruction have even higher risk for developing chronic postsurgical pain. Animal studies of posttraumatic nerve injury pain demonstrate that there is a critical time frame before and immediately after nerve injury in which specific interventions can reduce the incidence and intensity of chronic neuropathic pain behaviors-so called "preventative analgesia.o" In animal models, perineural local anesthetic, systemic intravenous local anesthetic, perineural clonidine, systemic gabapentin, systemic tricyclic antidepressants, and minocycline have each been shown to reduce pain behaviors days to weeks after treatment. The translation of this work to humans also suggests that brief perioperative interventions may protect patients from developing new chronic postsurgical pain. Recent clinical trial data show that there is an opportunity during the perioperative period to dramatically reduce the incidence and severity of chronic postsurgical pain. The surgeon, working with the anesthesiologist, has the ability to modify both early and chronic postoperative pain by implementing an evidence-based preventative analgesia plan. Copyright © 2013 by Thieme Medical Publishers, Inc.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 3,860
|
11x Glazed Pots Garden Planter Round Plant collection only - concrete one is heavy . collection from halstead essex. Offered for sale is this lovely 11x Glazed Pots Garden Planter in Yeovil . lt is in very good condition and has never been removed from its packaging. Please take a close look at the photos as they form a large part of the description.
Four Metal Garden Planters/Troughs/Plant these will not be any good for the use of watering cans as they have holes drilled into them.
Hay rack design metal plant wall container. attractive large heavy round wicker basket with handles, plant/log/storage container. solid,sturdy and beautifully made bamboo plant stand with three containers,tripod legged,fully treated and varnished.
Check out these interesting ads related to "plant containers"
This is a very pretty tucked decoupage plant pot new, never been used, label remains attached. "Member since , with % feedback and many happy customers"
Vehicle Design Plant/Flower Pot/Candle cute plant pot holder, inner is lined with plastic. ideal for dyi projects or as flower pots/planters.
These have a nice design and are made from concrete and are fairly heavy. Hi, here we have a plant containers . It is in excellent condition, Please see the pictures. I will consider any offer above starting bid of 8.99 , so please don`t hesitate to ask.
wicker effect containers x 2only one used condition is used, two available you are bidding on one but if you'd like the pair please contact me and we'll agree a price.
4 garden troughs 3 baige Richard sankey terra a stylish hard wood round planter on 3 legs,originally purchased from arighi bianchi.
DM for more info. floral design ceramic plant container.
Attractive Cream Metal Container with pretty bow. hay rack design metal plant wall container. various metal planters - selling as a job lot #0.
Plant containers Tree Pots. also 2 troughs and a few pots. x2 soft wicker plant containers £5 for the pair #0. "If the items are no longer required, they may be returned within days for a full refund excluding postage costs"
Terracotta 19.5 x 13 inches tall, wicker effect containers x 2only one used excellent condition. 2 garden ornaments planters sold as seen,cash on collection from bolton only.
some cosmetics scratches 80cm×36cm 9 ins long x 5ins wide x 4.3/4 ins deep. large saucer shaped plant container nicely weathered . plant containers works perfectly, will combine postage. I am selling off my collection which will take me some time so if there's anything you're looking for in particular, please contact me and I'll put it up for acution.
Cash on collection only preferred. two pot container good condition. condition consistent with age and use.
Garden plant container large patterned.
Yellow/cream terracotta flower plant pot pots.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 2,133
|
The Tiger Tail residence in Palm Springs, California was purchased by a development group that wanted to take this home from the 70's and modernize it for today's market. Utilizing conventional methods would require that everything, but the frame would need to be demolished, but with the SEMCO X-Bond Seamless Stone, SEMCO was able to provide a modern finish directly over the existing surfaces. Reducing the construction duration and cost for renovation.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 4,412
|
#ifndef ZENUATICS_MTX_H
#define ZENUATICS_MTX_H
#ifdef __cplusplus
extern "C"
{
#endif
typedef int BOOL;
#ifndef FALSE
#define FALSE (0)
#endif
#ifndef TRUE
#define TRUE (1)
#endif
/// \brief A complex data struct.
typedef struct
{
double re; //!< The real part.
double im; //!< The imaginary part.
} stComplex;
/// \brief The deep level matrix struct. The matrix is either real or complex.
typedef struct
{
unsigned nrows; //!< The number of rows in the matrix.
unsigned ncols; //!< The number of columns in the matrix.
BOOL isReal; //!< This indicates if is the matrix real or complex.
double **data; //!< This is a pointer to an array of double column vectors.
stComplex **cplx; //!< Thsi is a pointer to an array of complex column vectors.
char *comment; //!< This is a comment string (if applicable).
} MTX;
/// \brief This function must be called first by users of cmatrix!
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Initialize_MTXEngine();
/// \brief This function is used to set if matrices that are single
/// elements (1x1) are treated as scalars for math operations
/// or whether the regular matrix rules apply. THIS IS ENABLED
/// BY DEFAULT.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Enable1x1MatricesForTreatmentAsScalars(BOOL enable);
/// \brief Is this a null matrix?
///
/// \return TRUE if the matrix is null, FALSE otherwise.
BOOL MTX_isNull(const MTX *M);
/// \brief Are matrices A & B conformal for multiplication, real * real
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_isConformalForMultiplication(const MTX *A, const MTX *B);
/// \brief Are matrices A & B conformat for addition/subtraction, real + real
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_isConformalForAddition(const MTX *A, const MTX *B);
/// \brief Is this a square matrix?
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_isSquare(const MTX *A);
/// \brief are A and B the same size?
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_isSameSize(const MTX *A, const MTX *B);
/// \brief Initialize a MTX matrix struct to appropriate zero values. This must always be called for proper operation!
/// \code
/// MTX matrix;
/// MTX_Init( &matrix );
/// \endcode
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Init(MTX *M);
/// \brief Set the matrix comment string
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetComment(MTX *M, const char *comment);
/// \brief Clear the matrix data from memory if dynamically allocated. Zero the struct members.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Free(MTX *M);
/// \brief Allocate matrix data (set to zero).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Calloc(MTX *M, const unsigned nrows, const unsigned ncols, const BOOL isReal);
/// \brief Allocate matrix data (not set to zero).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Malloc(MTX *M, const unsigned nrows, const unsigned ncols, const BOOL isReal);
/// \brief Set a scalar value in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetValue(MTX *M, const unsigned row, const unsigned col, const double value);
/// \brief Set a complex value in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetComplexValue(MTX *M, const unsigned row, const unsigned col, const double re, const double im);
/// \brief Matrix M = Re + Im*i, where Re and Im are real matrices.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Complex(MTX *M, const MTX *Re, const MTX *Im);
/// \brief Set the specified column in Matrix M to Re + Im*i, where Re and Im are real matrices.
/// The dimensions of M must already be valid.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetComplexColumn(MTX *M, const unsigned col, const MTX *Re, const MTX *Im);
/// \brief Convert a real matrix to a complex matrix
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ConvertRealToComplex(MTX *M);
/// \brief Convert a complex marix to a real matrix using only the imaginary component A = real(B).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ConvertComplexToReal(MTX *M);
/// \brief Convert a complex marix to a real matrix using only the imaginary component A = imag(B).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ConvertComplexToImag(MTX *M);
/// \brief Extract the real component of matrix M.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Real(const MTX *M, MTX *Re);
/// \brief Check if the matrix contains only real values.
/// Alter the matrix if it is stored as complex and only has real values.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_isReal(MTX *M, BOOL *isReal);
/// \brief Extract the real component of column col of matrix M.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RealColumn(const MTX *M, const unsigned col, MTX *Re);
/// \brief Extract the imaginary component of matrix M.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Imag(const MTX *M, MTX *Im);
/// \brief Extract the imaginary component of column col of matrix M.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ImagColumn(const MTX *M, const unsigned col, MTX *Im);
/// \brief If M is a real matrix, Magnitude is a copy.
/// If M is a complex matrix, Magnitude is a real matrix = sqrt( re*re + im*im ).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Magnitude(const MTX *M, MTX *Magnitude);
/// \brief If M is a real matrix, Phase is a zero matrix.
/// If M is a complex matrix, Phase is a real matrix = atan2(im,re).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Phase(const MTX *M, MTX *Phase);
/// \brief If M is a real matrix, nothing is done.
/// If M is a complex matrix, the conjugate is set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Conjugate(MTX *M);
/// \brief Remove a single column from the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RemoveColumn(MTX *M, const unsigned col);
/// \brief remove all the columns 'after' the column index given.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RemoveColumnsAfterIndex(MTX *dst, const unsigned col);
/// \brief insert a column into another matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_InsertColumn(MTX *dst, const MTX *src, const unsigned dst_col, const unsigned src_col);
/// \brief Add a column to the Matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_AddColumn(MTX *dst, const MTX *src, const unsigned src_col);
/// \brief Combine two matrices with the same nrows, A becomes A|B,
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Concatonate(MTX *dst, const MTX *src);
/// \brief A becomes A|0|0|0|.. etc
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_AddZeroValuedColumns(MTX *dst, const unsigned nr_new_cols);
/// \brief Redimension the matrix, original data is saved in place, new data is set to zero.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Redim(MTX *dst, const unsigned nrows, const unsigned ncols);
/// \brief Resize the matrix, original data is lost, new data is set to zero, must specify if the matrix is real or complex.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Resize(MTX *dst, const unsigned nrows, const unsigned ncols, const BOOL isReal);
/// \brief Copy the src data to dst matrix, resize dst if possible & necessary.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Copy(const MTX *src, MTX *dst);
/// \brief Copy the src matrix data [m cols x n rows] to dst vector [1 col x m*n rows], resize dst if possible & necessary.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_CopyIntoColumnWiseVector(const MTX *src, MTX *dst);
/// \brief Set the dst matrix from the static 'c' style matrix indexed by mat[i*ncols + j].
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetFromStaticMatrix(MTX *dst, const double mat[], const unsigned nrows, const unsigned ncols);
/// \brief Copy the src data in column col to dst matrix, resize dst if possible & necessary.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_CopyColumn(const MTX *src, const unsigned col, MTX *dst);
/// \brief Copy the src data in row, row, to dst matrix, resize dst if possible & necessary.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_CopyRow(const MTX *src, const unsigned row, MTX *dst);
/// \brief Copy the src data in row 'row' (1xn) to dst matrix (nx1), resize dst if possible & necessary.
/// dst becomes (nx1).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_CopyRowIntoAColumnMatrix(const MTX *src, const unsigned row, MTX *dst);
/// \brief Insert a submatrix (src) into dst, starting at indices dst(row,col).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_InsertSubMatrix(MTX *dst, const MTX *src, const unsigned dst_row, const unsigned dst_col);
/**
\brief Extract a submatrix (dst) from this matrix from (inclusive)
the rows and columns specified.
\code
MTX A;
MTX B;
BOOL result;
MTX_Init( &A );
MTX_Init( &B );
result = MTX_SetFromMatrixString( &A, "[1 2 3; 4 5 6; 7 8 9]" );
result = MTX_ExtractSubMatrix( &A, &B, 1, 0, 2, 2 );
// B == [4 5 6; 7 8 9]
\endcode
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_ExtractSubMatrix(
const MTX* src, //!< The source matrix.
MTX* dst, //!< The destination matrix to contain the submatrix.
const unsigned from_row, //!< The zero-based index for the from row.
const unsigned from_col, //!< The zero-based index for the from column.
const unsigned to_row, //!< The zero-based index for the to row.
const unsigned to_col //!< The zero-based index for the to column.
);
/// \brief Zero the entire matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Zero(MTX *dst);
/// \brief Zero all elements in a specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ZeroColumn(MTX *dst, const unsigned col);
/// \brief Zero all elements in a specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ZeroRow(MTX *dst, const unsigned row);
/// \brief Fill the matrix with the given value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Fill(MTX *dst, const double value);
/// \brief Fill the matrix with the given complex value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FillComplex(MTX *dst, const double re, const double im);
/// \brief Fill the matrix column with the given value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FillColumn(MTX *dst, const unsigned col, const double value);
/// \brief Fill the matrix column with the given complex value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FillColumnComplex(MTX *dst, const unsigned col, const double re, const double im);
/// \brief Fill the matrix row with the given value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FillRow(MTX *dst, const unsigned row, const double value);
/// \brief Fill the matrix row with the given complex value.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FillRowComplex(MTX *dst, const unsigned row, const double re, const double im);
/// \brief Reverse the order of elements of a column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FlipColumn(MTX *M, const unsigned col);
/// \brief Reverse the order of elements of a row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FlipRow(MTX *M, const unsigned row);
/// \brief Set the matrix to an identity.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Identity(MTX *dst);
/// \brief Force this square matrix to be symmetric
/// by M = (M + T.())/2 using minimal operations.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ForceSymmetric(MTX *M);
/// \brief Transpose the matrix src into the matris dst.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Transpose(const MTX *src, MTX *dst);
/// \brief Transpose the matrix as an inplace operation.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TransposeInplace(MTX *M);
/// \brief Round the matrix elements to the specified precision.\n
/// e.g. precision = 0 1.8 -> 2\n
/// e.g. precision = 1, 1.45 -> 1.5\n
/// e.g. precision = 2 1.456 -> 1.46\n
/// e.g. precision = 3, 1.4566 -> 1.457\n
/// precision has a maximum of 32. After which no rounding occurs.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Round(MTX *M, const unsigned precision);
/// \brief Round the matrix elements to the nearest integers towards minus infinity.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Floor(MTX *M);
/// \brief Round the matrix elements to the nearest integers towards infinity.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Ceil(MTX *M);
/// \brief Round the matrix elements to the nearest integers towards zero.
/// Sometimes known as trunc().
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Fix(MTX *M);
/// \brief Set the destination matrix to be 1.0 minus the source matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_OneMinus(const MTX* src, MTX *dst);
/// \brief Determine the matrix file delimiter and if a comment line is available.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DetermineFileDelimiter(
const char *path, //!< path to the input file
char *delimiter, //!< delimiter, 'b' is binary
BOOL *hasComment, //!< BOOL to indicate if a comment line is present
char **comment //!< pointer to a string to store the comment line, *comment memory must be freed later.
);
/// \brief Determine the size of a file.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DetermineFileSize(const char *path, unsigned *size);
/// \brief Determine the number of columns in the data string provided.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DetermineNumberOfColumnsInDataString(const char *datastr, unsigned *ncols);
/// \brief Determine the number of columns in the complex data string provided.
/// The delimiter is needed, 'w' indicates whitespace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DetermineNumberOfColumnsInDataStringCplx(const char *datastr, const char delimiter, unsigned *ncols);
/// \brief Read a real-only matrix from a file (ASCII formatted, any common delimiters).
/// This function will also read in MTX BINARY formatted files.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ReadFromFileRealOnly(MTX *M, const char *path);
/// \brief Read either a real or complex matrix from a file (ASCII formatted, any common delimiters).
/// This function will also read in MTX BINARY formatted files.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ReadFromFile(MTX *M, const char *path);
/// \brief Set the matrix from a matrix string.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetFromMatrixString(MTX *M, const char *strMatrix);
/// \brief Convert a value to a string with the specified width and precision.
/// analogous to sprintf( ValueBuffer, "%'blank''-'width.precision'g'", value );
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ValueToString(
const double value, //!< The double value to output.
const unsigned width, //!< The width of the field.
const unsigned precision, //!< The precision, %g style.
const BOOL isReal, //!< The the value the real part or the imaginary part.
const BOOL alignLeft, //!< Align the output left (for real data only).
char *ValueBuffer, //!< The output buffer.
const unsigned ValueBufferSize //!< The size of the output buffer.
);
/// \brief Print the matrix to a file with specifed width and precision.
/// MTX_PrintAutoWidth is recommended over this function, "%'blank''-'width.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Print(const MTX *M, const char *path, const unsigned width, const unsigned precision, const BOOL append);
/// \brief Print the matrix to a buffer of maxlength with specifed width and precision.
/// MTX_PrintAutoWidth is recommended over this function, "%'blank''-'width.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Print_ToBuffer(const MTX *M, char *buffer, const unsigned maxlength, const unsigned width, const unsigned precision);
/// \brief Print the matrix to a file with automatically determined column width.
/// and the specified precision, uses "%'blank''-'autowidth.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintAutoWidth(const MTX *M, const char *path, const unsigned precision, const BOOL append);
/// \brief Print the matrix to stdout with automatically determined column width.
/// and the specified precision, uses "%'blank''-'autowidth.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintStdoutAutoWidth(const MTX *M, const unsigned precision);
/// \brief Print the matrix to a buffer of maxlenth with automatically determined column width.
/// and the specified precision, uses "%'blank''-'autowidth.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintAutoWidth_ToBuffer(const MTX *M, char *buffer, const unsigned maxlength, const unsigned precision);
/// \brief Print the matrix to a file with specifed precision and delimiter.
/// Use MTX_PrintAutoWidth if print using whitespace as a delimiter is required, uses "%.precision'g'"
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintDelimited(const MTX *M, const char *path, const unsigned precision, const char delimiter, const BOOL append);
/// \brief Print the matrix to a file with specifed precision and delimiter.
/// Use MTX_PrintAutoWidth if print using whitespace as a delimiter is required, uses "%.precision'g'".
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintDelimited_ToBuffer(const MTX *M, char *buffer, const unsigned maxlength, const unsigned precision, const char delimiter);
/// \brief Print a row to a string buffer.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PrintRowToString(const MTX *M, const unsigned row, char *buffer, const unsigned maxlength, const int width, const int precision);
////
// Math operations
/// \brief Adds a scalar double to matrix M, ie: M += 5.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Add_Scalar(MTX *M, const double scalar);
/// \brief Adds a scalar complex to matrix M, ie: M += (5 + 3i).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Add_ScalarComplex(MTX *M, const double re, const double im);
/// \brief Subtracts a scalar double from matrix M, ie: M -= 5.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Subtract_Scalar(MTX *M, const double scalar);
/// \brief Subtracts a scaler complex from matrix M, ie: M -= (5+3i).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Subtract_ScalarComplex(MTX *M, const double re, const double im);
/// \brief Multiply M with a double scalar inplace, ie: M *= 5.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Multiply_Scalar(MTX *M, const double scalar);
/// \brief Multiply M with a complex scalar inplace, ie: M *= (5+3i).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Multiply_ScalarComplex(MTX *M, const double re, const double im);
/// \brief Divide M by scaler double inplace, ie: M /= 5.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Divide_Scalar(MTX *M, const double scalar);
/// \brief Divide M by scaler complex inplace, ie: M /= (5+3i).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Divide_ScalarComplex(MTX *M, const double re, const double im);
/// \brief Change the sign of all the data in the matrix. M *= -1.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Negate(MTX *M);
/// \brief Computes the absolute value of each element in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Abs(MTX *M);
/// \brief Compute the arc-cosine of each element of the matrix inplace.
/// Complex results are obtained if elements are greater than abs(1).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_acos(MTX *M);
/// \brief Compute the phase angle in radians of the elements in the matrix.
/// If all elements are real, the results are 0.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_angle(MTX *M);
/// \brief Compute the arc-sine of each element of the matrix inplace.
/// Complex results are obtained if elements are greater than abs(1).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_asin(MTX *M);
/// \brief Computes the value^2 of each element in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Sqr(MTX *M);
/// \brief Computes the sqrt(value) of each element in the matrix.
/// A real matrix is converted to complex if any elements are negative.
/// e.g. sqrt(-1) = -i.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Sqrt(MTX *M);
/// \brief If real, computes the exp(value) of each element in the matrix.
/// If complex, computes exp(M) = exp(real)*(cos(imag)+i*sin(imag)).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Exp(MTX *M);
/// \brief Create an indentity matrix with nrows and ncols.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Eye(MTX *M, const unsigned nrows, const unsigned ncols);
/// \brief Computes the natural logarithm, ln(value) of each element in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Ln(MTX *M);
/// \brief Raise all elements in src^(power_re + power_im*i) and store in dst.
/// If power is just real, power_im = 0.0.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Pow(const MTX *src, MTX *dst, const double power_re, const double power_im);
/// \brief Raise all elements in src^(power_re + power_im*i).
/// If power is just real, power_im = 0.0.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PowInplace(MTX *src, const double power_re, const double power_im);
/// \brief Computes the arctan, atan(value) of each element in the matrix
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_atan(MTX *M);
/// \brief Add +1.0 to all elements, e.g. M++.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Increment(MTX *M);
/// \brief Subtract 1.0 from all elements, e.g. M--.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Decrement(MTX *M);
/// \brief Add A += B, inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Add_Inplace(MTX *A, const MTX *B);
/// \brief Subtract A -= B, inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Subtract_Inplace(MTX *A, const MTX *B);
/// \brief Multiply A = B*A, inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PreMultiply_Inplace(MTX *A, const MTX *B); // A = B*A
/// \brief Multiply A = tranpose(B)*A, inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TransposePreMultiply_Inplace(MTX *A, const MTX *B); // A = tranpose(B)*A
/// \brief Multiply A = A*B, inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PostMultiply_Inplace(MTX *A, const MTX* B); // A = A*B
/// \brief Multiply A = A*transpose(B), inplace.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PostMultiplyTranspose_Inplace(MTX *A, const MTX* B); // A = A*tranpose(B)
/// \brief Dot multiply A .*= B, inplace (A.data[col][row] = A.data[col][row]*B.data[col][row]).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DotMultiply_Inplace(MTX *A, const MTX *B);
/// \brief Dot divide A ./= B, inplace (A.data[col][row] = A.data[col][row]/B.data[col][row]).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_DotDivide_Inplace(MTX *A, const MTX *B);
/// \brief Add A = B+C.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Add(MTX *A, const MTX *B, const MTX *C);
/// \brief Subtract A = B-C.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Subtract(MTX *A, const MTX *B, const MTX *C);
/// \brief Multiply A = B*C.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Multiply(MTX *A, const MTX *B, const MTX *C);
/// \brief Multiply A = transpose(B)*C.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TransposeMultiply(MTX *A, const MTX* B, const MTX* C);
/// \brief Multiply A = B*transpose(C).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MultiplyTranspose(MTX *A, const MTX* B, const MTX* C); // A = B*transpose(C)
/// \brief Rest if A == B to within the specified tolerance.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IsEqual(const MTX *A, const MTX *B, const double tolerance, BOOL *isEqual);
/// \brief Add this matrix and an identity matrix. Adds 1.0 to the diagonal even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_AddIdentity(const MTX *src, MTX *dst);
/// \brief Add this matrix and an identity matrix. Adds 1.0 to the diagonal even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_AddIdentity_Inplace(MTX *src);
/// \brief Subtract an identity matrix from this matrix. Subtracts 1.0 from the diagonal even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinusIdentity(const MTX *src, MTX *dst);
/// \brief Subtract an identity matrix from this matrix. Subtracts 1.0 from the diagonal even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinusIdentity_Inplace(MTX *src);
/// \brief Subtract this matrix from an identity matrix. Subtracts the diagonal from 1.0 even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IdentityMinus(const MTX *src, MTX *dst);
/// \brief Subtract this matrix from an identity matrix. Subtracts the diagonal from 1.0 even if not square.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IdentityMinus_Inplace(MTX *src);
/// \brief Difference and approximte derivative for column col.
/// The Diff is the column difference vector.
/// diff = col[1:N-2] - col[0:N-1].
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnDiff(const MTX *M, MTX *Diff, const unsigned col);
/// \brief Difference and approximate derivative.
/// The Diff matrix is composed of the column difference vectors.
/// for(i=0:M-1){ diff_i = col_i[1:N-2] - col_i[0:N-1] }
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Diff(const MTX *M, MTX *Diff);
////
// Statistics
/// \brief Computes the maximum element in the specified column and its index.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxColIndex(const MTX *M, const unsigned col, double *re, double *im, unsigned *row);
/// \brief Computes the maximum element in the specified row and its index.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxRowIndex(const MTX *M, const unsigned row, double *re, double *im, unsigned *col);
/// \brief Computes the minimum element in the specified column and its index.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinColIndex(const MTX *M, const unsigned col, double *re, double *im, unsigned *row);
/// \brief Computes the minimum element in the specified row and its index.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinRowIndex(const MTX *M, const unsigned row, double *re, double *im, unsigned *col);
/// \brief Computes the absolute maximum element in the specified column and its index.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbsColIndex(const MTX *M, const unsigned col, double *value, unsigned *row);
/// \brief Computes the absolue maximum element in the specified row and a its column index.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbsRowIndex(const MTX *M, const unsigned row, double *value, unsigned *col);
/// \brief Computes the absolute minimum element in the specified column and its index.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbsColIndex(const MTX *M, const unsigned col, double *value, unsigned *row);
/// \brief Computes the absolute minimum element in the specified row and its index.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbsRowIndex(const MTX *M, const unsigned row, double *value, unsigned *col);
/// \brief Computes the maximum element in the specified column.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxColumn(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the maximum element in the specified row.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxRow(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the minimum element in the specified column.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinColumn(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the minimum element in the specified row.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinRow(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the absolute maximum element in the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbsColumn(const MTX *M, const unsigned col, double *value);
/// \brief Computes the absolute maximum element in the specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbsRow(const MTX *M, const unsigned row, double *value);
/// \brief Computes the absolute minimum element in the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbsColumn(const MTX *M, const unsigned col, double *value);
/// \brief Computes the absolute minimum element in the specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbsRow(const MTX *M, const unsigned row, double *value);
/// \brief Computes the absolute maximum element for the entire matrix and its row and column index.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbsIndex(const MTX *M, double* value, unsigned *row, unsigned *col);
/// \brief Computes the maximum element for the entire matrix and its row and column index.
/// If there are several equal maximum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxIndex(const MTX *M, double *re, double *im, unsigned *row, unsigned *col);
/// \brief Computes the absolute maximum element for the entire matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MaxAbs(const MTX *M, double* value);
/// \brief Computes the maximum element for the entire matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Max(const MTX *M, double *re, double *im);
/// \brief Computes the absolute minimum element for the entire matrix and its row and column index.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbsIndex(const MTX *M, double* value, unsigned *row, unsigned *col);
/// \brief Computes the minimum element for the entire matrix and its row and column index.
/// If there are several equal minimum elements, the first index from the beginning is returned.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinIndex(const MTX *M, double *re, double *im, unsigned *row, unsigned *col);
/// \brief Computes the absolute minimum element for the entire matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MinAbs(const MTX *M, double* value);
/// \brief Computes the minimum element for the entire matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Min(const MTX *M, double *re, double *im);
/// \brief Computes the range of the data in the specified column.
/// Range = MaxVal - MinVal.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnRange(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the range of the data in the specified row.
/// Range = MaxVal - MinVal.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowRange(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the range of the data in the matrix.
/// Range = MaxVal - MinVal.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Range(const MTX *M, double *re, double *im);
/// \brief Computes the sum for the specified column.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnSum(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the sum of the absolute values for the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnSumAbs(const MTX *M, const unsigned col, double *value);
/// \brief Computes the sum for the specified row.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowSum(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the sum of the data in the matrix .
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Sum(const MTX *M, double *re, double *im);
/// \brief Computes the sample mean for the specified column.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnMean(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the sample mean for the specified row.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowMean(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the sample mean for the matrix.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Mean(const MTX *M, double *re, double *im);
/// \brief Computes the sample standard deviation for the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnStdev(const MTX *M, const unsigned col, double *value);
/// \brief Computes the sample standard deviation for the specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowStdev(const MTX *M, const unsigned row, double *value);
/// \brief Computes the sample standard deviation for the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Stdev(const MTX *M, double *value);
/// \brief Computes the sample variance for the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnVar(const MTX *M, const unsigned col, double *value);
/// \brief Computes the sample variance for the specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowVar(const MTX *M, const unsigned row, double *value);
/// \brief Computes the sample variance for the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Var(const MTX *M, double *value);
/// \brief Computes the norm of the specified column.
/// If real, norm = sqrt( sum( val*val ) ).
/// If complex, norm = sqrt( sum( val*conjugate(val) ) ).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnNorm(const MTX *M, const unsigned col, double *value);
/// \brief Computes the norm of the specified row.
/// If real, norm = sqrt( sum( val*val ) ).
/// If complex, norm = sqrt( sum( val*conjugate(val) ) ).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowNorm(const MTX *M, const unsigned row, double *value);
/// \brief Computes the norm of the matrix.
/// If real, norm = sqrt( sum( val*val ) ).
/// If complex, norm = sqrt( sum( val*conjugate(val) ) ).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Norm(const MTX *M, double *value);
/// \brief Computes the sample RMS value for the specified column.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnRMS(const MTX *M, const unsigned col, double *value);
/// \brief Computes the sample RMS value for the specified row.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowRMS(const MTX *M, const unsigned row, double *value);
/// \brief Computes the sample RMS value for the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RMS(const MTX *M, double *value);
/// \brief Computes the sample skewness value for the specified column.
/// The skewness is the third central moment divided by the cube of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnSkewness(const MTX *M, const unsigned col, double *re, double* im);
/// \brief Computes the sample skewness value for the specified row.
/// The skewness is the third central moment divided by the cube of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_RowSkewness(const MTX *M, const unsigned row, double *re, double* im);
/// \brief Computes the sample skewness value for the matrix.
/// The skewness is the third central moment divided by the cube of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Skewness(const MTX *M, double *re, double* im);
/// \brief Computes the sample kurtosis value for the specified column.
/// The kurtosis is the fourth central moment divided by fourth power of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// To adjust the computed kurtosis value for bias, subtract 3 from the real component.
/// Reference: http://en.wikipedia.org/wiki/Kurtosis.
/// Reference: http://mathworld.wolfram.com/Kurtosis.html (kurtosis proper is computed).
/// \return TRUE if successful, FALSE otherwise.
// g_2 = \frac{m_4}{m_{2}^2} = \frac{n\,\sum_{i=1}^n (x_i - \overline{x})^4}{\left(\sum_{i=1}^n (x_i - \overline{x})^2\right)^2}.
BOOL MTX_ColumnKurtosis(const MTX *M, const unsigned col, double *re, double *im);
/// \brief Computes the sample kurtosis value for the specified row.
/// The kurtosis is the fourth central moment divided by fourth power of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// To adjust the computed kurtosis value for bias, subtract 3 from the real component.
/// Reference: http://en.wikipedia.org/wiki/Kurtosis.
/// Reference: http://mathworld.wolfram.com/Kurtosis.html (kurtosis proper is computed).
///
/// \return TRUE if successful, FALSE otherwise.
// g_2 = \frac{m_4}{m_{2}^2} = \frac{n\,\sum_{i=1}^n (x_i - \overline{x})^4}{\left(\sum_{i=1}^n (x_i - \overline{x})^2\right)^2}.
BOOL MTX_RowKurtosis(const MTX *M, const unsigned row, double *re, double *im);
/// \brief Computes the sample kurtosis value for the matrix.
/// The kurtosis is the fourth central moment divided by fourth power of the standard deviation.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
/// To adjust the computed kurtosis value for bias, subtract 3 from the real component.
/// Reference: http://en.wikipedia.org/wiki/Kurtosis.
/// Reference: http://mathworld.wolfram.com/Kurtosis.html (kurtosis proper is computed).
///
/// \return TRUE if successful, FALSE otherwise.
// g_2 = \frac{m_4}{m_{2}^2} = \frac{n\,\sum_{i=1}^n (x_i - \overline{x})^4}{\left(\sum_{i=1}^n (x_i - \overline{x})^2\right)^2}.
BOOL MTX_Kurtosis(const MTX *M, double *re, double *im);
////
// Matrix specific
/// \brief Computes the trace of M where M is a square matrix.
/// Trace = Sum of diagonal elements.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Trace(const MTX *M, double *re, double *im);
/// \brief Sets the diagonal elements of M into D as a column vector
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Diagonal(const MTX *M, MTX *D);
/// \brief Sorts each column of M in ascending order.
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortAscending(MTX *M);
/// \brief Sorts each column of M in descending order.
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortDescending(MTX *M);
/// \brief Sorts a specific column in ascending order.
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortColumnAscending(MTX *M, const unsigned col);
/// \brief Sorts a specific column in descending order.
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortColumnDescending(MTX *M, const unsigned col);
/// \brief Sorts a specific column in ascending order and fills a MTX column vector with the sorted index.
/// The index vector will be resized if index->nrows != M->nrows
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortColumnIndexed(MTX *M, const unsigned col, MTX *index);
/// \brief Sorts the entire matrix by a specific column.
/// If complex, sorts based on magnitude.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SortByColumn(MTX *M, const unsigned col);
/// \brief Saves a matrix to the specified file path using a proprietary compressed format.
/// ADVANCED EDITION ONLY!
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SaveCompressed(const MTX *M, const char *path);
/// \brief Loads a binary compressed matrix that was saved using the MTX_SaveCompressed function.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ReadCompressed(MTX *M, const char *path);
/// \brief Get attributes of the compressed file.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_GetCompressedFileAttributes(
const char *path,
unsigned* nrows,
unsigned* ncols,
BOOL* isReal
);
/// \brief Read an ASCII matrix data file and save it using MTX_SaveCompressed.
/// ADVANCED EDITION ONLY!
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_LoadAndSave(const char* infilepath, const char* outfilepath);
/// \brief Read an ASCII matrix data file and save it using MTX_SaveCompressed.
/// This version saves the data to the same base filename and uses the .mtx extension.
/// ADVANCED EDITION ONLY!
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_LoadAndSaveQuick(const char* infilepath);
/// \brief Alter the matrix, M, so that its data is within the startTime to the startTime+duration
/// and compensate for any rollovers in the time system (e.g. GPS time in seconds rolls over
/// at 604800.0 s). This function assumes that time is one of the matrix columns and requires
/// this index, the timeColumn.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TimeWindow(
MTX* M, //!< Matrix to be altered
const unsigned timeColumn, //!< The column containing time
const double startTime, //!< The specified start time (inclusive)
const double duration, //!< The duration to include
const double rolloverTime); //!< The potential time at which system time rolls over
/// \brief Alter the matrix, M, so that its data is within [startTime endTime].
/// This function assumes that time is one of the matrix columns and requires
/// this index, the timeColumn.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TimeLimit(
MTX* M, //!< Matrix to be altered
const unsigned timeColumn, //!< The column containing time
const double startTime, //!< The specified start time (inclusive)
const double endTime); //!< The duration to include
/// \brief This function matches matrices in time with specified precision
/// where time is a column of each matrix. This function also
/// allows time to rollover at a specified interval.
///
/// precision 0 = match to whole number \n
/// precision 1 = match to nearest 0.1 \n
/// precision 2 = match to nearest 0.01 \n
/// etc. \n
/// rolloverTime examples \n
/// GPS time of week (s): rolloverTime= 604800.0 \n
/// hours : rolloverTime = 24.0 \n
/// minutes : rolloverTime = 60.0 \n
///
/// The time data must be non-decreasing but the time may rollover
/// by the specified amount.
/// e.g. rolloverTime = 60.0 \n
/// 0,1,2,3,4,...59,60,1,2,5,10,60,1,2,3... \n
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_TimeMatch(
MTX *A, //!< The matrix with interpolation times
const unsigned timeColumnA, //!< The zero based column index for matrix A
MTX *B, //!< The matrix to be interpolated
const unsigned timeColumnB, //!< The zero based column index for matrix B
const unsigned precision, //!< The rounding precision used for time matching, 0 = whole, 1 = 0.1, 2 = 0.01, etc
const double rolloverTime //!< The rollover time, e.g. 60 s for minute based timing, 0.0 means rollovers not allowed
);
/// \brief This function interpolates Matrix B values by the times defined
/// in the column in Matrix A. Time must be increasing but times can
/// rollover with the specified rolloverTime.
///
/// This function returns A and B with the same number of rows and
/// time aligned time columns.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Interpolate(
MTX *A, //!< The matrix with interpolation times
const unsigned timeColumnA, //!< The zero based column index for matrix A
MTX *B, //!< The matrix to be interpolated
const unsigned timeColumnB, //!< The zero based column index for matrix B
const double maxInterpolationInterval, //!< The largest interpolation interval allowed
const double rolloverTime //!< The rollover time, e.g. 60 s for minute based timing, 0.0 means rollovers not allowed
);
/// \brief Compute the inverse, 1.0/x, inplace for each element
/// of the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Inv(MTX *src);
/// \brief Compute the inplace inverse of the matrix.
/// Uses fast closed form solutions for:
/// Only for: 1x1, 2x2, 3x3
///
/// If the matrix is singular, the original matrix is unchanged.
///
/// \return TRUE if successful, FALSE if empty or has dimensions larger
/// than 3x3, false if singular or not square
BOOL MTX_InvertInPlaceClosedForm(MTX *M);
/// \brief Compute the inplace inverse of the matrix.
/// Uses fast closed form solutions for:
/// Only for: 1x1, 2x2, 3x3
///
/// \return TRUE if successful, FALSE if empty or has dimensions larger
/// than 3x3, false if singular or not square
BOOL MTX_InvertClosedForm(const MTX *M, MTX *dst);
/// \brief Compute the inplace inverse of a matrix.
///
/// The matrix is first tested to determine if it is a symmetric
/// positive-definite matrix. If so, Cholesky decomposition is used
/// to facilitate the inversion of a lower triangular matrix. If the
/// matrix is not symmetric and positive-definite robust inversion
/// using gaussing elimination is attempted.
///
/// 3x3 matrices or smaller dimensions are computed using
/// MTX_InvertInPlaceClosedForm.
///
/// If the matrix is singular, the original matrix is unchanged.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_InvertInPlace(MTX *M);
/// \brief Compute the inverse of a matrix.
///
/// The matrix is first tested to determine if it is a symmetric
/// positive-definite matrix. If so, Cholesky decomposition is used
/// to facilitate the inversion of a lower triangular matrix. If the
/// matrix is not symmetric and positive-definite robust inversion
/// using gaussing elimination is attempted.
///
/// 3x3 matrices or smaller dimensions are computed using
/// MTX_InvertClosedForm.
///
/// If the matrix is singular, the original matrix is unchanged.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Invert(const MTX *src, MTX *dst);
/// \brief Perfroms an inplace matrix inverse using Gaussian Elimination methods.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_InvertInPlaceRobust(MTX *M);
/// \brief Computes a moving average using N lead samples and M lagging samples
/// for the specified column and stores it in dst.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ColumnMovAvg(const MTX *src, const unsigned col, const unsigned lead, const unsigned lag, MTX *dst);
/// \brief Computes a moving average using N lead samples and M lagging samples
/// for the matrix and stores it in dst.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_MovAvg(const MTX *src, const unsigned lead, const unsigned lag, MTX *dst);
/// \brief Computes: InvATA = inverse( transpose(A) * A ).
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_ATAInverse(const MTX *A, MTX *InvATA);
/// \brief Compute the inplace inverse of a unit lower triangular matrix.
/// An example unit lower triangular matrix is: \n
/// A = [ 1 0 0; \n
/// -2 2 0; \n
/// 4 -3 3 ]; with \n
/// inv(A) = [ 1 0 0; \n
/// 1 1/2 0; \n
/// -1/3 1/2 1/3 ]; \n
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_LowerTriangularInverseInplace(MTX *src);
/// \brief Computes the determinatnt of the square matrix M.
/// If the matrix is real, only the real value, re is set, im = 0.
/// If the matrix is complex, both re and im are set.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Det(const MTX *M, double *re, double *im);
/// \brief LU factorization.
/// Performs a factorization to produce a unit lower triangular matrix, L,
/// an upper triangular matrix, U, and permutation matrix P so that
/// P*X = L*U.
/// P, L and U are copmuted correctly if IsFullRank is set to true.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_LUFactorization(const MTX *src, BOOL *IsFullRank, MTX *P, MTX *L, MTX *U);
/// \brief Retrieve the elements of the matrix specified by the index vectors.
/// The index vectors must be nx1 real vectors.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IndexedValues(const MTX *src, const MTX *row_index, const MTX *col_index, MTX *dst);
/// \brief Set the elements of the matrix specified by the index vectors.
/// The index vectors must be nx1 real vectors.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_SetIndexedValues(MTX *dst, const MTX *row_index, const MTX *col_index, const MTX *src);
/// \brief Compute the Fast Fourier Transform of each columns in the src matrix and
/// store it in the dst matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FFT(const MTX *src, MTX *dst);
/// \brief Compute the inverse Fast Fourier Transform of each columns in the src matrix and
/// store it in the dst matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IFFT(const MTX *src, MTX *dst);
/// \brief Compute the Two-Dimensional Fast Fourier Transform of the src matrix and
/// store it in the dst matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FFT2(const MTX *src, MTX *dst);
/// \brief Compute the Two-Dimensional Inverse Fast Fourier Transform of the src matrix and
/// store it in the dst matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IFFT2(const MTX *src, MTX *dst);
/// \brief Compute the inplace Fast Fourier Transform of each column of the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FFT_Inplace(MTX *src);
/// \brief Compute the inplace inverse Fast Fourier Transform of each column of the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IFFT_Inplace(MTX *src);
/// \brief Compute the inplace two dimensional Fast Fourier Transform of the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_FFT2_Inplace(MTX *src);
/// \brief Compute the inplace two dimensional inverse Fast Fourier Transform of the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_IFFT2_Inplace(MTX *src);
/// \brief Compute the sine of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_sin(MTX *src);
/// \brief Compute the sin(pi*x)/(pi*) of each element in the matrix.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_sinc(MTX *src);
/// \brief Compute the hyperbolic sine of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_sinh(MTX *src);
/// \brief Compute the inverse hyperbolic sine of each element in the matrix.
/// Results in radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_asinh(MTX *src);
/// \brief Compute the cosine of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_cos(MTX *src);
/// \brief Compute the hyperbolic cosine of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_cosh(MTX *src);
/// \brief Compute the inverse hyperbolic cosine of each element in the matrix.
/// Results in radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_acosh(MTX *src);
/// \brief Compute the tangent of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_tan(MTX *src);
/// \brief Compute the hyperbolic tangent of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_tanh(MTX *src);
/// \brief Compute the inverse hyperbolic tangent of each element in the matrix.
/// Results in radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_atanh(MTX *src);
/// \brief Compute the cotangent of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_cot(MTX *src);
/// \brief Compute the hyperbolic cotangent of each element in the matrix. Assumes elements are radians.
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_coth(MTX *src);
/// \brief Create a column vector [start:increment:end) beginning at start
/// with step size of increment until less than or equal to end.
/// Note that arguments must be real scalars. \n
/// e.g. a = 2:2:9 = [2; 4; 6; 8;] \n
/// e.g. b = 2:-2:-9 = [2; 0; -2; -4; -6; -9;] \n
///
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Colon(MTX *dst, const double start, const double increment, const double end);
/** \brief A very efficient method to remove rows and columns from the matrix.
*
* \code
* MTX A;
* unsigned rows[2];
* unsigned cols[2];
* MTX_Init(&A);
* MTX_Calloc( &A, 4, 4 );
* MTX_Identity( &A );
* A.data[0][0] = 100.0;
* A.data[2][1] = 10.0;
* A.data[1][2] = 20.0;
* // remove the first row and column and the third row and column.
* rows[0] = 0;
* rows[1] = 2;
* cols[0] = 0;
* cols[1] = 2;
* MTX_RemoveRowsAndColumns( &A, 2, (unsigned*)rows, 2 (unsigned*)cols );
* // A is now a 2x2 identity matrix.
* \endcode
*
* \return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_RemoveRowsAndColumns(
MTX *src, //!< The pointer to the matrix object.
const unsigned nrows, //!< The number of rows to remove (the length of the rows array).
const unsigned rows[], //!< The array of row indices to remove.
const unsigned ncols, //!< The number of columns to remove (the length of hte cols array).
const unsigned cols[]
);
/**
\brief Sets the matrix as the NxN hilbert matrix. H_ij = 1.0 / (i+j-1.0) for i=1:N, j=1:N.
\code
MTX H;
BOOL result;
MTX_Init( &H );
result = MTX_Hilbert( &H, 3);
// H == "[1 1/2 1/3; 1/2 1/3 1/4; 1/3 1/4 1/5]";
\endcode
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_Hilbert(MTX *src, const unsigned N);
/**
\brief Produce a matrix that is composed of pseudo-random numbers.
Values are elements are standard normal distribution with mean zero,
variance of one and standard of deviation one. N(0,1)
\code
MTX A;
MTX_Init(&A);
MTX_randn( 1000, 1 ); // create a standard-normal distributed random vector of 1000 rows by 1 column.
\endcode
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_randn(
MTX* M,
const unsigned nrows,
const unsigned ncols,
const unsigned seed
);
/**
\brief Produce a matrix that is composed of pseudo-random numbers.
Values are elements are uniform distribution [0,1].
\code
MTX A;
MTX_Init(&A);
MTX_rand( 1000, 1 ); // create a uniformly distributed random vector of 1000 rows by 1 column.
\endcode
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_rand(
MTX* M,
const unsigned nrows,
const unsigned ncols,
const unsigned seed
);
/// \brief Test if a double value is NaN.
BOOL MTX_IsNAN(double value);
/// \brief Test if a double value is +INF.
BOOL MTX_IsPostiveINF(double value);
/// \brief Test if a double value is -INF.
BOOL MTX_IsNegativeINF(double value);
/// \brief A quick plot, to a RLE compressed windows bitmap file, x_column vs y_column of the matrix M.
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_PlotQuick(MTX* M, const char* bmpfilename, const unsigned x_col, const unsigned y_col);
/// \brief These are the supported colors.
typedef enum
{
MTX_WHITE = 0,
MTX_BLACK = 1,
MTX_BLUE = 2,
MTX_GREEN = 3,
MTX_PURPLE = 4,
MTX_MAGENTA = 5,
MTX_DARKBLUE = 6,
MTX_INDIANRED = 7,
MTX_BABYBLUE = 8,
MTX_PAISLYBLUE = 9,
MTX_LIGHTPURPLE = 10,
MTX_DARKPURPLE = 11,
MTX_GREYPURPLE = 12,
MTX_BROWN = 13,
MTX_RED = 14,
MTX_PINK = 15,
MTX_YELLOW = 16,
MTX_ORANGE = 17,
MTX_CYAN = 18,
MTX_LIMEGREEN = 19,
MTX_GREY = 20,
MTX_LIGHTGREY = 21
} MTX_enumColor;
typedef struct
{
MTX* M; //!< A pointer to the series data matrix.
unsigned x_col; //!< The series x data column.
unsigned y_col; //!< The series y data column.
BOOL connected; //!< Are the data points connected.
MTX_enumColor color; //!< The color of the data points/line.
char* label; //!< The series label, NULL if none.
char* units; //!< The series units, NULL if none.
int precision; //!< The number of significant digits in the statistics.
BOOL markOutlierData; //!< Should the outlier data be marked.
} MTX_PLOT_structSeries;
/// \brief A container struct used in MTX_structAxisOptions.
typedef struct
{
BOOL doNotUseDefault;
double val;
} MTX_structAxisSubOption;
/// \brief A container struct for axis options.
typedef struct
{
MTX_structAxisSubOption lowerlimit;
MTX_structAxisSubOption upperlimit;
MTX_structAxisSubOption tickstart;
MTX_structAxisSubOption ticksize;
MTX_structAxisSubOption tickend;
}MTX_structAxisOptions;
/// \brief Plot up to 12 series on one figure directly to an RLE compressed BITMAP file.
/// \return TRUE if successful, FALSE otherwise.
BOOL MTX_Plot(
const char* bmpfilename, //!< The output RLE compressed BITMAP filename.
const char* title, //!< The plot title (NULL if not used).
const unsigned plot_height_cm, //!< The plot height in cm.
const unsigned plot_width_cm, //!< The plot width in cm.
const BOOL includeStats, //!< A boolean to indicate if statistics info should be included on the plot.
const BOOL isXGridOn, //!< A boolean to indicate if the x grid lines are on.
const BOOL isYGridOn, //!< A boolean to indicate if the y grid lines are on.
const char* xlabel, //!< The x axis label (NULL if not used).
const char* ylabel, //!< The y axis label (NULL if not used).
const MTX_structAxisOptions x, //!< Limits and ticks for x.
const MTX_structAxisOptions y, //!< Limits and ticks for y.
const MTX_PLOT_structSeries* series, //!< A pointer to an array of series structs.
const unsigned nrSeries //!< The number of series.
);
/**
\brief Swap the contents of matrix A with matrix B.
\code
MTX A,B;
MTX_Init( &A );
MTX_Init( &B );
MTX_Malloc( &A, 2, 2, TRUE );
MTX_Malloc( &B, 1, 1, TRUE );
MTX_Fill( &A, 88.0 );
MTX_Fill( &B, 44.0 );
MTX_Swap( &A, &B );
// A == [44], B == [88 88; 88 88]
MTX_Free( &A );
MTX_Free( &B );
\endcode
\return TRUE if succesful, FALSE otherwise.
*/
BOOL MTX_Swap(MTX* A, MTX *B);
#ifdef _DEBUG
/* Take a filename and return a pointer to its final element. This
function is called on __FILE__ to fix a MSVC nit where __FILE__
contains the full path to the file. This is bad, because it
confuses users to find the home directory of the person who
compiled the binary in their warrning messages. */
const char * _shortfile(const char *fname);
#define _SHORT_FILE_ _shortfile(__FILE__)
#if defined(_MSC_VER) && _MSC_VER < 1300 /* Windows compilers before VC7 don't have __FUNCTION__ or __LINE__. */
#define MTX_ERROR_MSG( msg ) { const char *themsg = msg; if( themsg != NULL ){ printf( "\n%s, %s\n", _SHORT_FILE_, themsg ); }else{ printf( "\n%s, %s, %d, Unknown Error\n", __FILE__, __FUNCTION__, __LINE__ ); } }
#else
#define MTX_ERROR_MSG( msg ) { const char *themsg = msg; if( themsg != NULL ){ printf( "\n%s, %s, %d, %s\n", _SHORT_FILE_, __FUNCTION__, __LINE__, themsg ); }else{ printf( "\n%s, %s, %d, Unknown Error\n", __FILE__, __FUNCTION__, __LINE__ ); } }
#endif
#else
const char* _shortfile(const char *fname);
#define _SHORT_FILE_ _shortfile(__FILE__)
#define MTX_ERROR_MSG( msg ) {}
#endif
/// \brief Compute the LDLt decomposition of a square matrix.
/// This method avoids using square roots and can be used
/// for any square, full rank, symmetrical matrix.
///
/// \return TRUE if succesful, FALSE otherwise. FALSE if not full rank.
BOOL MTX_LDLt(
MTX* src, //!< src = L*D*Lt
MTX *L, //!< src = L*D*Lt
MTX* d, //!< src = L*D*Lt, d it the vector diagonal of D.
BOOL checkSymmetric //!< Option to enable/disable checking the src matrix for symmetry. Runs faster if the input is known to be symmetric.
);
/// \brief Compute the UDUt decomposition of a square matrix.
/// This method avoids using square roots and can be used
/// for any square, full rank, symmetrical matrix.
///
/// \return TRUE if succesful, FALSE otherwise. FALSE if not full rank.
BOOL MTX_UDUt(
MTX* src, //!< src = U*D*Ut
MTX *U, //!< src = U*D*Ut
MTX* d, //!< src = U*D*Ut, d it the vector diagonal of D.
BOOL checkSymmetric //!< Option to enable/disable checking the src matrix for symmetry.
);
/**
\brief Compute the error function (erf) for all values in the matrix inplace. \n
erf(x) = 2/sqrt(pi) * [integral from 0 to x of]( e^(-t^2) )dt.
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_erf_Inplace(MTX* src);
/**
\brief Compute the inverse error function (erfinv) for all values in the matrix inplace. \n
y = erf(x), compute x given y, i.e. x = erfinv(y).
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_erfinv_Inplace(MTX* src);
/**
\brief Compute the complementary error function (erfc) for all values in the matrix inplace.
erfc(x) = 1 - erf(x) = 2/sqrt(pi) * [integral from x to inf of]( e^(-t^2) )dt.
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_erfc_Inplace(MTX* src);
/**
\brief Compute the inverse complementary error function (erfcinv) for all values in the matrix inplace.
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_erfcinv_Inplace(MTX* src);
/**
\brief Set the index vector so that it contains are the indices of values that are equal
to the value specified with the given tolerance from the column of the src matrix.
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_find_column_values_equalto(
const MTX* src, //!< The source matrix to search.
const unsigned col, //!< The zero-based index of the column which is searched.
MTX* indexVector, //!< This is the index vector corresponding to the equal values in the source matrix.
const double re, //!< The real part of the equal to value.
const double im, //!< The imaginary part of the equal to value.
const double tolerance //!< The search tolerance. e.g. 1.0e-12.
);
/**
\brief Set the index vector so that it contains are the indices of values that are not equal
to the value specified with the given tolerance from the column of the src matrix.
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_find_column_values_not_equalto(
const MTX* src, //!< The source matrix to search.
const unsigned col, //!< The zero-based index of the column which is searched.
MTX* indexVector, //!< This is the index vector corresponding to the values that are not equal in the source matrix.
const double re, //!< The real part of the value.
const double im, //!< The imaginary part of the value.
const double tolerance //!< The search tolerance. e.g. 1.0e-12.
);
/**
\brief Set the index vector so that it contains are the indices of values that are less then
to the value specified with the given tolerance from the column of the src matrix.
Complex matrix values are compared to the value by magnitude (i.e. sqrt(re*re+im*im)).
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_find_column_values_less_than(
const MTX* src, //!< The source matrix to search.
const unsigned col, //!< The zero-based index of the column which is searched.
MTX* indexVector, //!< This is the index vector of the values desired.
const double value //!< The comparison value.
);
/**
\brief Set the index vector so that it contains are the indices of values that are more then
to the value specified with the given tolerance from the column of the src matrix.
Complex matrix values are compared to the value by magnitude (i.e. sqrt(re*re+im*im)).
\return TRUE if successful, FALSE otherwise.
*/
BOOL MTX_find_column_values_more_than(
const MTX* src, //!< The source matrix to search.
const unsigned col, //!< The zero-based index of the column which is searched.
MTX* indexVector, //!< This is the index vector of the values desired.
const double value //!< The comparison value.
);
#ifdef __cplusplus
}
#endif
#endif // ZENUATICS_MTX_H
|
{
"redpajama_set_name": "RedPajamaGithub"
}
| 8,730
|
But who is hidden behind Ebulobo ?
Anne was born in Paris in 1967, lived all her childhood in Martinique and in swimsuit but followed her studies in Paris. After a year in History at La Sorbonne, she changed direction and continues her studies in Art School at ESAG first and then the ESDI (Industrial Design School).
Ferdinand was born in Paris in 1969 and did all his studies in the capital. After a while in architecture, he decided to enter l'Académie Charpentier and then the ENSCI (National School of Industrial Creation).
Anne is passionate about creation, toys' world in all its aspects et most of all the meeting of the industrial and the design.
Ferdinand is passionate about achievement, technical means and most of all the evolution of those means in the creation.
After a while working separately, we decided to become associates in order to create the Studio "Lelong Lecomte designers associés" in Paris.
Very quickly we are more and more interested by the children and our creation are made for them.
We even became parents in 1992 and then 1997 !
Thanks to the Studio, we have created several ranges of toys for DJECO, Fnac Eveil & Jeux, FAGOE, Sport France and some design objects for Decathlon, Issey Miyake and even Yves Saint Laurent !
In 2008, we decided to leave all what we were doing in order to create our own design company for children, EBULOBO and develop our own ideas in our way !
The name Ebulobo come from a volcano located in the Flores island in Indonesia. For us, the volcano Ebulobo symbolizes the explosion of ideas, sounds like a balloon and illustrates the small bubbles that can appear from a boiling liquid.
We are fans of children and so we decided to become specialized in toys. The early-learning and the psychomotor development are essential and the first preoccupation of babies when they play.
Ebulobo is conscious that babies don't only play to make fun but also to learn. With the play, babies take their visual, sound and touch-sensitive stimulation up. They also learn about their own coordination and recognition of the forms and colors.
All those learning processes are fondamental for the good development of children.
Ebulobo develop range of products where each toy match a function, a age bracket and is adapted to babies ability.
Each range of toys has a story which tells something special. The characters we create tell their own adventures.
The idea is to associate the adults around babies so they can help them discover the stories. For each range of toys, we create small book which tells the story of the range. By knowing the story, the parents will be able to play with their child. Through story, communication is better !
In addition, Ebulobo's collections are created following the trend and fashion. Anne isn't a real fashionista but loves to follow and use the trend books so Ebulobo can design trendy toys !
Each collection has a message. The Peace and Love collection is about about nature, harmony and organic products. Woodours collection is about the relationship of love between a bear cub and his father !
All Ebulobo's prints are drawn by Anne. We do not buy them, they are home-made !
There is time to create funny characters and collection and a time to make sure our toys are made in accordance with norms of safety.
At each launch of collection, we give products the green light so they meet norms and rules at the european level.
Ebulobo is about overjoyed and great mood creativity which give a great deal of room for imagination and humour !
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,101
|
Phnom Kulen National Park
River of a Thousand Lingas
Avoid the Reclining Buddha
The Waterfalls Scam
How to get there but avoid the scam
Nestling in the southern extension of the Dangrek Mountains in the Svay Leu District, 48 kilometres away from Siem Reap rests the Phnom Kulen National Park. One of the most scenic and historically significant locations in the area, the park falls along the journey to Prasat Banteay Srei, making a beautiful natural complement to the intricate manmade wonders of the ancient citadel.
Unfortunately, the waterfalls in the park are 'owned' by a businessman from Siem Reap with 'high' connections, who charges an outrageous $20 to see this natural resource.
But read on to discover how to avoid this scam.
Lingas in the river bed at Phnom Kulen National Park
Blanketed with lush green vegetation and adorned with waterfalls, the mountain slopes gently into a scenic valley at its foot. The grounds are peppered with spots of special note, both natural and manmade in significance. The Chup Preah is a plain in the valley surrounded by cool streams.
One of the most celebrated aspects combining the natural and the manmade is Kbal Spean, or the River of a Thousand Lingas. The sandstone rock bed of this shallow river is carvings of the Shiva phallus and its female counterpart Yoni symbols, interspersed with depictions of reclining Shiva, Vishnu and Brahma gods. This is said to have been done to assist the scared waters in better fertilizing the plains below.
In the Hindu tradition, water flowing over the lingas is sacred and holy, and many Cambodians bottle the water from the downriver waterfalls.
The terrace of Sdach Kamlung is notable for the small ruined temple Preah Thom at its centre, found upstream from one of the waterfalls. One of the most imposing sights is the statue of the reclining Buddha that has been carved out of a giant sandstone boulder and stands at a height of 8 meters. This is flanked by two towering and rare Cham Pa trees.
Although imposing, it is not the biggest Buddha in Cambodia. The reclining Buddha at Prasat Phnom Baset, north of Phnom Penh, is older and bigger. And there is something odd about this Buddha at Phnom Kulen: he is lying on his left side which is an offence against the strict rules of Buddhist iconography; this relief is a fake copy. Preah Thom is a profit-orientated, unfriendly place, with poor food stalls and no toilets. There are a lot of local visitors, mainly on the weekends.
Two magnificent waterfalls are the crowning beauties of the park. One is relatively short, but boasts a width while the other falls from a height of 15 meters. The multi-tiered descent of rock face makes the resulting cascades of white water ever more enchanting and musical. The area at the top of the taller falls is ideal for picnics and a tranquil rest after a day of climbing and sight-seeing.
Unfortunately, a businessman has been given exclusive rights to privately develop this national resource and the guy really wants to raise some revenue, setting an entrance fee charge of $20 (you read that correctly!) for a foreigner to ride up and see the waterfall, which is about 10 km from the ticket checkpoint area.
This site should not be visited, not even when you see the ticket 'promotion' at City Angkor Hotel in Siem Reap where the ticket 'only' costs $12. Guess who the owner of that hotel is? Right, the same 'businessman' that 'owns' the waterfalls! Going there will only support the scam.
So, how to get to Phnom Kulen, but avoid the scam? Drive to Banteay Srey and take the road north for about half an hour. At the junction before the checkpoint you turn right, towards Beng Mealea. After 6.5 km is Wat Prohm Bram Bey ('Eight Brahmas') on the left. Leave your vehicle at a shop on the foot of the concrete stairway. After some 20 minutes easy walk you are at Wat Preah Cup, a sacred spring, (bring a bottle with you) and a swimming pool. The relief shows the Buddha standing between a kneeling elephant and a coiled naga. It looks like a clumsy copy and may be from the 16th century. There is also a shrine for neak ta (local spirits).
Phnom Kulen was used as the final stronghold of the Khmer Rouge regime and before the construction of a private toll road, was relatively inaccessible or slow going, depending on weather conditions. Even now, tourists are warned not to wander off beaten tracks for fear of hidden mines. Some question that the locals are protecting the sanctity of this spot as thousands of Cambodians visit every year without incident.
Angkor Photo Festival
Angkor Half Marathon
Siem Reap Introduction
Landmine Museum & Relief Fund
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 135
|
Graphic design is an important skill everyone must master in this "gifting with art" business. With this skill, you can make higher profit margin in selling DIY gifts because customers are happy to pay for the unique design.
DIY is organizing 4-hrs but intensive Graphic Design Course to share all MUST-KNOW skills in popular graphic design software such as Photoshop & Illustrator.
Normal price for this Graphic Design Course is RM500. But DIY is offering at RM0 now. Yes, it is RM0 or F.R.E.E!
INTERESTED IN RESERVING YOUR SEAT IN GRAPHIC DESIGN COURSE? CALL US NOW!
p/s: ONLY FOR FIRST 12 DIY MEMBERS in first come first served basis.
– Visit our DIY showroom in Klang, Bandar Baru Klang.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 265
|
Suede upper block heel sandal, perfect for all day wear. Showcasing a two part design with a front strap and open back with an adjustable buckle fastening. The low block heel and buckle fastening completes this staple style.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 9,568
|
update: my boss sent a chat message I wasn't supposed to see — but it popped up on a shared screen
It's "where are you now?" month at Ask a Manager, and all December I'm running updates from people who had their letters here answered in the past.
Remember the letter-writer whose boss sent a chat message not intended for her — but it popped up on a shared screen? Here's the update.
Thank you so much for everyone's advice. Since the letter was posted a few months after it actually happened, I did some mini-updates in the comments. I am going to summarize those here and then post a further update.
The original comment about long-windedness was definitely about my retired coworker only. He was very well known for it and the boss had shown very public annoyance about it in the past (eye-rolling, complaining behind his back, snapping, etc.). After the message, I did some serious soul searching and asked for feedback from past/present colleagues and personal friends because I just didn't know what had happened to make him say that about me. I trust these people to tell me the truth. I was majorly beating myself up and feeling pretty terrible (anxiety/imposter syndrome anyone?). I do think I could occasionally over-explain something, but not often and certainly not to the level a boss should need to even say something. I think in the end the personality quirk that made my boss dislike me was probably the fact that he is not interested in hearing anybody's opinion unless it agreed with his and, while I was never disrespectful, I occasionally asked questions or voiced concerns such as "that's a good idea, but due to 'niche work factor' can we consider X, Y, or Z" using a collaborative, upbeat tone of voice. I think he disliked anyone not agreeing with him to a 'T' and this fact has since been corroborated with several other colleagues who work on his level.
Ever since that chat message, my boss kept giving Mark more projects despite me asking to be on projects too. Prior to this, I was the point person on most of the projects and I know I did a good job (from feedback from others in the department and several different grandbosses). Between the chat message and the inability to do anything but very basic rote work I was not hired to do, I decided to look at other opportunities. After much research, I decided to go back to school and got accepted into a short-term fellowship.
I was still waffling on attending as it would mean moving away. I decided to tell my boss I was probably leaving as I was about to be sent on expensive training and would have been turning in my notice the day after returning. I did not feel right about it and was worried about my reference if he thought I wasted company money.
In my conversation with him, he told me he would help me make the decision on whether to go to school or work training as he was planning on promoting Mark at the end of the month when we had returned from training. I was kind of stunned since he knew that I was working towards the small promotion and had been being groomed by upper management for a leadership position. I asked him why and he said that Mark was more "hands on." It appears it was in part a setup all along so he could justify giving the promotion to Mark, who is a yes-man.
I really, really did not want to believe sexism was at play, but I think it was to an extent. I had tenure; public, verbal approval for my work from upper management; a leadership fellowship sponsored by my company (which Mark was not invited to); and more relevant education than Mark. These things don't make me automatically deserve the small promotion, and I know this. I was shocked because Mark had never shown desire or drive to be the head of our tiny section (really just a point person) and I had and had asked what I needed to do to get there in performance reviews etc. In the reviews given by my boss, they were glowing and he never gave me anything to improve on despite me asking about areas I could learn and grow to help our company but rather just said it was all good and he didn't know what the future held. It turns out no women under him in any department has ever been promoted despite usually having better work and credentials than their promoted colleagues. So, in the end, he wanted someone who would never ever question him or suggest improvements who also happened to be a man.
On my way out, one of the C suite execs came to ask me why I was leaving as they thought I did fabulous work and they were really sorry to see me go and were going to miss me. I did not tell them the real reason why (though I wish I had in hindsight) as I didn't want to jeopardize my husband's job who also worked under my boss. (We were in completely different departments and he always did good work too so we are 99 % sure none of this had anything to do with that). If it got back to my boss that I had gotten him in trouble he could have made life ugly for my husband in retaliation.
I hate to disappoint all of you (trust me, this is a big life regret for me too), but I never confronted him on it. I sent in this letter too late to use Alison's script and I had already moved on. I ultimately decided not to say something because my boss is the type of person who would have flipped it around on me and gaslighted me. I honestly think he would have denied the message existed. He was not a healthy person.
I took the fellowship and have since completed it. I have a new job that I love with an extremely supportive boss. He wants us to work on professional development and he regularly appreciates our hard work and gives constructive feedback. Additionally, my new company is AWESOME. They truly care about employees as human beings and go above and beyond.
I kept in contact with several people at the company after I left. It turns out Boss got called in by the board for a review shortly after I left. He announced his retirement soon after and took a lower position to "transition out" a few months after that. To the rest of the company he is simply retiring, but I know from some colleagues who are part of the higher up board that he did not willingly retire. In a way I have to thank him because I got an amazing opportunity I never would have considered otherwise and now am working a job I actually love, that challenges and respects me.
You may also like:my boss sent a chat message I wasn't supposed to see — but it popped up on a shared screenI shared a complaint about a coworker with her manager — and then she shared my complaint with that personI saw my employee's X-rated chat
update: my boss sent a chat message I wasn't supposed to see — but it popped up on a shared screen was originally published by Alison Green on Ask a Manager.
Read more: askamanager.org
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 6,237
|
Selecting and building procedure codes is faster and easier with Carol J. Buck's 2018 ICD-10-PCS: Professional Edition. Designed by coders for coders, this full-color manual includes all the ICD-10-PCS codes that you need for today's inpatient procedure coding. As coders need extensive knowledge to code with ICD-10-PCS — and to choose from the thousands of possible codes — this edition provides colorful Netter's Anatomy illustrations and tables organized to simplify the process of choosing and building procedure codes. It comes with durable spiral binding, and also includes a companion website with the latest coding news and updates.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 3,154
|
Giving your team a voice is one of the main reasons why a regular all-hands meeting should be run. Still, for many employees, it is just another meeting to sit through.
So, how do you organize an all-hands meeting that your team members will actually look forward to?
We have put together for you this easily digestible, easy-to-read guide, that collects 25 actionable tips on how to organize more engaging all-hands meetings in your company.
They're all tried and tested, either by us or by leaders in the industry.
An all-hands meeting is a space where your employees have the chance to express themselves and have a direct, face-to-face conversation with their leaders. For this to happen, it has to provide them with enough opportunities for engagement and personal interaction.
The first chapter of this guidebook contains a handful of simple tricks on how to engage and energize your team at an all-hands by celebrating and acknowledging their professional and personal highlights.
If your team is spread across the world, an all-hands meeting is a perfect opportunity to engage your remote colleagues and make them feel part of the team. Sometimes, this can be a real challenge.
In the second part of this guide, we have collected some useful tips on tools and facilitation techniques that will help you actively engage your remote team members. Find out how to make it easier for them to participate and help them make the most out of every all-hands meeting.
A good Q&A is probably the most important part of an all-hands meeting. Whether on-site or online, your employees will surely want to ask questions and raise their concerns.
In the last chapter of the guide, you will find tricks to better handle the entire Q&A flow, improve the level of transparency in your company and make sure important issues get discussed.
So, here are our top 25 tips to engage your employees at your next all-hands meeting. View them in a slideshow below or download them as a practical guidebook. We hope you will find them inspiring and instructive.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 9,574
|
Tavern of the Taegeuk Warriors
News and Opinion on all things Korean football
K League Salaries & Club Payrolls: An Analysis (2017)
In the Numbers: Korea's 2018 World Cup Squad
Korean Football Reform
Community Engagement and Marketing
K League Attendance
Military Conscription
Toulon 2018
KNT Stock Watch
Call-ups & Results
Korean Players Abroad
KPA List
Lee Seung-woo
Ki Sung-yueng
Lee Kang-in
Suk Hyun-jun
Koo Ja-cheol
Ji Dong-won
Paik Seung-ho
Lee Chung-yong
Kwon Chang-hoon
Transfer Zone
Lee Jae-sung
Tavern Interview: KICKiT Football
Victory Tour: the Rebirth of the Korean Women's National Team
Victory Tour: The Dreams of the Korean Women's National Team
Tavern Interview: Caitlyn Schrepfer
On Anchor
Roy Ghim
Jae Chee
Jinseok
Nicole Chung
Michael Hyun Welch
Kevin Kim
Chi Soo Park
Roy's Story
Breaking News: Asan Mugunghwa to Disband
November 19, 2018 Michael Welch *Domestic*, K League Challenge 0
Photo Credit: Joongdo Ilbo
What seemed likely to happen a few weeks ago has finally been confirmed by the K League: Asan Mugunghwa FC, the 2018 K League 2 Champions, will not be promoted to K League 1 next season. Instead, Seongnam FC, the K League 2 runners-up, will take the automatic promotion spot in their place. For an understanding of how we got to this point, take a look at my previous article explaining the political causes of this decision here.
What does this mean for the K League?
For the K League, the uncertainty of how the K League 2 promotion system would work has finally been resolved. Seongnam FC, one of the most successful K League clubs, will move back to the top division after 3 seasons in K League 2. The promotion playoffs will feature three teams, starting with the 4th and 5th place playoff between Daejeon Citizen and Gwangju FC. The winner of that match will travel to Busan IPark FC. Finally, the ultimate winner of the playoffs contests a two-legged final with the 11th placed team in the K League 1, currently Incheon United FC (my favorite team). If the K League 1 side wins, they keep their place in the top division in a similar fashion to the Bundesliga's playoff final.
What happens to Asan?
This is really hard for the fans of Asan Mugunghwa FC and its previous iteration, Ansan Mugunghwa FC. 2 years ago, Ansan Mugunghwa FC won the K League 2 (then called the K League Challenge) but were also denied promotion because of their intention to relocate after the season. The relocation then was because the club wanted to be closer to the National Police Academy's main campus. After the relocation, Ansan formed a new citizens club called Ansan Greeners FC, which now competes in the K League 2. It seems like Asan is also planning to go this route. At the moment, Asan and South Chungcheong Province have held policy meetings to work on converting the police team into a citizens team. The Asan fans have organized a "Citizens Club Foundation" to support the move and it is hoped that the team could begin play in the K League 2 as early as next season. It seems that the Asan city government will officially run the team but will get some form of financial support from the South Chungcheong provincial government.
What about the players?
This still seems a bit unclear. There will be 14 players that will not have completed their military duty by the end of the season. This group includes Ju Sejong, currently on national team duty, and Lee Myungjoo, who has played for the national team in the past. What exactly do they do now? Will they have to try to transfer to Sangju Sangmu FC to finish their duty? Will the military grant them a special exemption? We'll have to wait and see on this.
What does this mean for the national team growth?
It's quite simple: it will now be as important as ever for young players to win military exemption. This will obviously heap pressure on the Asian Games and Olympics as never before. With Sangju Sangmu as a player's only remaining option to play professionally during their military duty, competition for spots on that roster will be fierce.
In terms of the KFA itself, it will be interesting to see how exactly they respond to this setback. Will they push the military to start a new team in the K League 2 to replace Asan? Will they lobby the military to reform the system so that there could be more ways to earn an exemption? For example, a possibility worth exploring is what the KFA does if Korea were to lift the Asian Cup this January. On that roster could be players like Ju Sejong, Jung Seunghyun, Park Jisoo, and Suk Hyunjun, none of whom have served their military duty. Would the KFA ask for the military to grant a special exemption to those players on the squad who hadn't previously earned an exemption?
The disbandment of Asan Mugunghwa FC is certainly not good news for the KFA. It will be interesting to see how they plan to respond in the coming months. If you have questions about this situation, get active in the comments!
Sharing = Fun
About Michael Welch 89 Articles
That Halfie Korean-American who loves football (I mean, soccer).
Australia vs South Korea: Player Ratings
Korea vs Uzbekistan Preview
Join in the Tavern's conversations -Leave a comment... Cancel reply
Follow the Tavern
Tavern RSS
Enter email address to subscribe to the Tavern + receive notifications of new posts by email
Fighting Stripes: a New Era
Bento vs. Hakbum Round 1: Winners and Losers
Team Bento vs. Team Hakbum: Who's Got the Edge?
Winners and Losers from All or Nothing Tottenham Hotspur Episodes 7-9
Why the Bundesliga will be more exciting this year
Tavern Archives
Tavern Archives Select Month November 2020 October 2020 September 2020 August 2020 June 2020 May 2020 April 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 August 2019 July 2019 June 2019 May 2019 April 2019 March 2019 February 2019 January 2019 December 2018 November 2018 October 2018 September 2018 August 2018 July 2018 June 2018 May 2018 April 2018 March 2018 February 2018 January 2018 December 2017 November 2017 October 2017 September 2017 August 2017 July 2017 June 2017 May 2017 April 2017 March 2017 February 2017 January 2017 December 2016 November 2016 October 2016 September 2016 August 2016 July 2016 June 2016 May 2016 April 2016 March 2016 February 2016 January 2016 December 2015 November 2015 October 2015 September 2015 August 2015 July 2015 June 2015 May 2015 April 2015 March 2015 February 2015 January 2015 December 2014 November 2014 October 2014 September 2014 August 2014 July 2014 June 2014 May 2014 April 2014 March 2014 February 2014 January 2014 December 2013 November 2013 October 2013 September 2013 August 2013 July 2013 June 2013 May 2013 April 2013 March 2013 February 2013 January 2013 December 2012 November 2012 October 2012 September 2012 August 2012
Korean Players Abroad (KPA) Forum
ROK football Korea forum
The K League Kilt
Korean Footballers Abroad
KFA English Site
Korean Football Association
KFA TV
foot coreen forum
K League Official English Page
Korean Women's Football Federation
Modern Seoul K-League page
K League Review
Women's K-League TV
Hwang Heechan
1 Red Bull Salzburg 25
1 Bayern Munich 39
2 RB Leipzig 35
3 Bayer 04 Leverkusen 32
4 Borussia Dortmund 29
5 Wolfsburg 29
6 Union Berlin 28
7 Borussia Mönchengladbach 28
8 Eintracht Frankfurt 27
9 SC Freiburg 24
10 Stuttgart 22
11 TSG 1899 Hoffenheim 19
12 Augsburg 1907 19
13 Werder Bremen 18
14 Hertha BSC 17
15 Arminia Bielefeld 17
16 1. FC Köln 15
17 1. FSV Mainz 05 7
18 Schalke 04 7
The Tavern of the Taegeuk Warriors is an online community of Korean football/soccer supporters. We bring you news, analysis and opinion in English about Korean players abroad, youth players and the K League.
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 8,336
|
Home #Entertainment 'Sri Thyagaraya Gana Sabha' – A 'Treasure Trove Of Telugu Culture' In...
'Sri Thyagaraya Gana Sabha' – A 'Treasure Trove Of Telugu Culture' In Hyderabad
Vishwanath Reddy
The oldest two-storied temple complex – a platform to promote Telugu language – Sri Tyagaraja Gana Sabha. Set in an area of approximately 2,000 sq yards, with one humongous statue of a 32-foot Lord Hanuman greeting you at the entrance, surrounded by trees and music vibrating through its hallways, Sri Thyagaraya Gana Sabha is a cultural treasure chest in itself.
At first glance, it resembles a two-storied temple building as the premises houses a temple of Sri Thyagaraja. But, it has much more to it than just that. "Established in 1966, the organisation's sole aim is to promote Telugu language art and culture throughout," says Bandi Srinivas, Administrative Manager of Sri Thyagaraya Gana Sabha. What started off with just one auditorium now grew to a set of 5. The premises houses two auditoriums with a seating capacity of 100, and two more that can seat 50 people at a time, while the main auditorium is equipped to accommodate a total of 700 people at a stretch.
ALSO READ: Health Is Wealth, But Where Is The Minimum Wealth To Create Health?
When asked about the reason behind naming the organisation after Saint Thyagaraya, he said, "Thyagaraya is one of the most highly-celebrated composers of Carnatic music. His devotion of Lord Rama and the dedication and love he had for music is much talked about. By naming the organisation after him, we hope to hold on to his essence of music and the level of dedication he had."
"Symbolically also, the name gives people a clear idea about the nature of the organisation and the kind of events that take place here," he added.
When asked about the nature of events that the Gana Sabha hosts, Srinivas said, "Mainly, it's music, dance and literature-related events that take place in the premises, like cultural dance shows, mainly Kuchipudi and Bharatanatyam, classical music recitals and performances, and book launches, skits depicting mythology."
ALSO READ: Delegates In The 'TRS Plenary' To Get 'Special Telangana Treat'
But, the organisation has now expanded its horizons and now stage plays of not just mythological origins but also on various other concepts, cultural and annual days of schools, meetings or gatherings of smaller organisations, etc.
An interesting fact about the place is that the entire premises, auditoriums and hallways alike, are filled with oil paintings. While some depict stories from Hindu mythology like Lord Narasimha slaying the demon Hiranyakashyapa, Lord Krishna, along with Radha and his gopikas, a recreation of the Ram-Sita wedding etc., a few others are portraits of musical stalwarts like Thyagaraya, Meera Bai, Annamayya, Muthuswami Dikshitar, Tulasi Das, Bhakta Tukaram, MS Subbulakshmi, and Ghantasala. Yet other portraits show the 23 Bharat Ratna awardees. Apart from these are the portraits of people who were responsible for the growth of Telugu as a language like Sri Krishna Devarayayulu, and Gidugu Ram Murthy.
ALSO READ: Mass Copying And Impersonation Rampant In Osmania University Colleges In Telangana
Explaining the reason behind housing so many oil paintings, Srinivas said, "The reason is a simple one. To inform and educate people, especially the younger generation, about the culture and heritage of the land. We also see it as an excellent opportunity to honour all these extraordinary people for their contributions."
"For programmes that are musical, dance or literary in nature, the mini auditoriums are available free of cost. This is all because of our chairman, Kala VS Janardhan Murthy. Within a short span of time, he has made some commendable changes that only increased the credibility and quality of the services we provided here," he added.
Having said that, the organisation has a lot of ideas in place that require monetary assistance from either the public or government or both and, therefore, is open for donations. #KhabarLive
Previous articleHailstorm And Heavy Rains Warning In Telangana For Next 48 Hours, IMD Advisory
Next article'Paigah Tombs' Of Hyderabad – Architectural Marvel And Spectacular Beauty Of A Serene Mausoleum
#KhanaKhazana
After 'Shawarma' Wave, Arabian 'Mandi' Craze Grips Hyderabad
Will KTR Be Next CM From Ugadi In Telangana?
#BigTopStory
Why Telangana Govt Issued 'Rythu Bandhu Scheme' Cheques In The Name Of 'Dead'?
A Mesmerising Performance By UoH Research Scholar In Vietnam Dance Competition
Valentine's Week Is here – Know the Right Dates for the...
Stay Dhinchak! Delving Into Dhinchak Pooja's Stardom And Craze
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 8,760
|
Embarking on the journey of building a home is not a decision made lightly, and often the most helpful thing to do is talk to people who have done it all before.
- An informative tutorial about best practices in modular building.
- Assistance with research and planning.
- A tour of our factory to discover how homes are built.
- Access to our display homes and design gallery to view the extensive assortment of standard inclusions and optional upgrades.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 2,515
|
Tennessee Valley Civil War Round Table
Education and Preservation
Little Round Tables
Past Round Tables
Stones River Field Trip, October of 2017
Conferences/Symposium
North Alabama Civil War Generals
The Civil War in Huntsville
Books published prior to 2014
That Furious Struggle: Chancellorsville and the High Tide of the Confederacy, May 1-4, 1863,
by Chris Mackowski and Kristopher D. White
El Dorado Hills: Savas Beatie, 2014
Review by Emil L. Posey
That Furious Struggle by by Chris Mackowski
Chancellorsville is a classic in the study not only of the Civil War and military history in general, but also of leadership, risk-taking, and military tactics.
The First Battle of Manassas (Bull Run) on July 21, 1861, had shown that indeed there would be large-scale, open war between north and south. The Battle of Shiloh (April 6-7, 1862) had shown that the war would be long, hard-fought, and bloody. And as the 1863 campaign season got underway, with major battles already having been fought in all theaters, the war appeared to stretch indefinitely into the future.
Thus the armies of Robert E. Lee the Army of Northern Virginia, and Joseph "Fighting Joe" Hooker the Army of the Potomac faced each other in April-May, 1863, across the Rappahannock River in a thickly-wooded region known as "the Wilderness" west of Fredericksburg. The Army of the Potomac was the Union's premier maneuver force in the Eastern Theater. Steeped in the theories of Antoine-Henri Jomini (as were all that had attended West Point before the war), Union leadership looked to the east (principally Virginia) as the critical theater of war. Several times the Army of the Potomac had sought decisive victory in major set-piece battles. And despite not yet having achieved victory, Major General Hooker intended to have another go at it. As with his predecessors, he was confident of victory (and admittedly, his, was a good plan of maneuver), yet he was just as unsuccessful as they had been. What makes this battle particularly interesting was that General Lee had absented a major portion of his force (First Corps, under Lieutenant General James B. Longstreet) south to Suffolk, Virginia and nearby parts of North Carolina to forage for food and supplies for the Army of Northern Virginia. Thus General Lee and a reduced Army of Northern Virginia faced a reinvigorated AoP and, making great use of Lieutenant General Thomas "Stonewall" Jackson, had to execute some truly brilliant tactics to once again defeat it.
Mackowski and White capture the battle with a concise, yet reasonably detailed description of the engagements, supporting movements, and the key personalities, including an excellent description of the wounding of Jackson. The writing is generally crisp and effective, and is supported by maps of sufficient detail to allow the reader to understand the action. There are a large number of photos and diagrams from the time, as well as more current photos of the terrain that will facilitate touring the battlefield, although some of these are dark with resultant loss of detail. The book includes five appendices on related topics, a detailed order of battle for both sides down to regimental and battery level, and a suggested reading list for further study.
All in all, this is a good primer on the campaign. But it is more than that. The book's strength is its battlefield tour guide. Interwoven into the text, it will facilitate the planning of personal and professional tours of all or parts of the battle area, particularly for families with elementary through high school children who want to walk and see the ground over the course of a two or three-day weekend, perhaps with evening readings as a review of the coming day's tour. The Chancellorsville battlefield is a beautiful piece of ground and would make for a great family outing. Mackowski's and White's book would provide an ideal supplement.
Your reviewer is Emil L. Posey, the Interim Vice President as well as the Communications Officer for the TVCWRT. His work history spans almost 45 years, of military and civilian service to our country. He retired from NASA/George C. Marshall Space Flight Center on December 27, 2014. He has a bachelor's degree in Political Science from Hood College, Frederick, Maryland; is a former president of the Huntsville chapter of the National Contract Management Association, and is a life member of the Special Forces Association. He is also a member of Elks Lodge 1648 (Huntsville, AL) and the Tennessee Valley Genealogical Society. He is a dedicated bibliophile, and is a (very) armchair political analyst and military enthusiast.
View Tennessee-Valley-Civil-War-Round-Table-188342877864862's profile on Facebook
View @TVCWRT's profile on Twitter
725 Franklin St. SE
Huntsville, AL 35801-4309
RT: 2nd Thursday at 6:30pm
LRT: 4th Thursday at 6:30pm
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 33
|
Ру́хань — деревня в Смоленской области России, в Ершичском районе. Расположена в южной части области в 18,5 км к юго-востоку от Ершичей, в 1,5 км к западу от границы с Брянской областью, на правом берегу реки Ипуть. Существовала на карте Рославльского уезда 1790-х годов.
Население — 219 жителей (2019 год). Административный центр Руханского сельского поселения.
Экономика
Средняя школа, 2 магазина.
Достопримечательности
Городище и курганная группа (27 насыпей) в 1,6 км к югу от деревни.
Сельский клуб, живописная природа речки Ипуть
Ссылки
Сведения на сайте областной администрации
Населённые пункты Ершичского района
|
{
"redpajama_set_name": "RedPajamaWikipedia"
}
| 335
|
MAKE PLANS TO VISIT CAMPUS OR MEET US ON THE ROAD!
We invite you to attend an Open House event or arrange to visit campus to take a tour, attend a class, and start getting to know our community. Check out our schedule of Open House events, or plan to see us when we are on the road at an event near you. It's always a good time to visit us on the river. If you cannot attend an Open House, please contact the Office of Admission to schedule a visit. Explore local lodging and dining options.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,872
|
Statutes of Limitations in New Jersey - Tomes & Hanratty, P.C.
If you have been injured in an accident that was caused by the negligence of another party, you may want to consider bringing a personal injury lawsuit against the liable party. Sometimes, people hesitate to bring a lawsuit for an extended period of time after the accident out of fear that they cannot afford the legal fees associated or they do not want to cause any trouble. This is especially true if they need to file a claim against a friend or relative. One thing that people don't realize is that personal injury attorneys are often paid on a contingency basis. This means that the attorney is only paid if they recover an award. The payment is often taken out of the award that is recovered.
It is crucial that if you are injured in a personal injury accident and are considering bringing a lawsuit against the negligent party, you do not hesitate for too long. Anyone who wishes to bring a lawsuit is subject to the statutes of limitations. This is simply a deadline by which individuals must file their lawsuit. In New Jersey, an injured party has to file a claim within two years of the date of the accident. If you fail to do so within that time frame, the state will not allow you to bring a lawsuit. If you simply don't file a claim, you may be subject to very significant financial burdens that could have been eased by compensation obtained during the case.
It is also important to be aware that if you were injured due to the negligence of a municipality, you may be required to file a Notice of Claim. This is a similar concept to the statutes of limitations but it is just to notify a municipality that you plan to bring a lawsuit. An experienced personal injury attorney can help you determine whether this is applicable to your case.
If you have been the victim of another party's negligence in New Jersey, contact our firm today for quality legal guidance when it matters most. Our firm is prepared to compassionately and effectively help you navigate the legal process and recover an award on your behalf.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 2,232
|
Cloud contact center solutions are no longer the wave of the future. They are the wave of today.
Widespread adoption is well underway, and cloud contact centers are revolutionizing the customer service capabilities of companies of all sizes. Smaller organization especially now have access to full contact center functionality just like large enterprises, and at a price point they can afford.
Regardless of the size of your contact center or whether you are using a premise or cloud contact center solution, compliance requirements remain the same, and so does the risk associated with violating these regulations. When your contact center agents, sales reps, collectors or support representatives speak with customers, prospects or payers on the telephone, they are subject to a variety of rules which must be followed, or your organization can face substantial fines and penalties. With Europe's GDPR and MiFID II privacy regulations, for example, one violation can cost your organization 4% and 10% of worldwide annual revenue, respectively. A single violation of PCI-DSS in the U.S. can result in lost credit card merchant capabilities, which can easily cripple an organization.
Take a short expedition through these key findings, intertwined with unique comics, to bring a smile to your face as you learn about the latest cloud adoption trends.
European governmental regulation which stipulates when an organization can and cannot record a call. For instance, you may record during the fulfillment of a contract; imposed by the European Commission.
United States industry regulation which mandates what can and cannot be stored in a telephone recording. For example, a customer's credit card or pin number cannot be captured in a call recording; imposed by leading U.S. credit card companies.
United States governmental regulation which mandates which private health information must be left out of a call recording and cannot be stored; imposed by the U.S. Department of Health & Human Services.
United States regulation which stipulates what information must be disclosed by the agent, such as the identity of the seller and that the call is a sales call; imposed by U.S. Federal Trade Commission.
Unites States regulation which regulates which pieces of information a mortgage broker or credit union must disclose to prospects and customers, such as the full terms of the proposed loan and all the specifics surrounding the interest rate; imposed by U.S. Federal Deposit Insurance Corporation.
Contact Centers which fall under one or more of these regulations can benefit greatly from deploying robust call recording functionality within their cloud contact center environment. Compliance call recording helps managers monitor what is and is not being said on the telephone and allows quality supervisors to review calls with agents to ensure proper compliance. Compliance call recording (aka Total Recording) captures every single call the contact center makes and stores these interactions securely for later recall and replay when necessary to resolve a dispute or prove compliance.
Kevin has been working in the contact center field for 15 years, helping companies like OrecX address the growing and diverse needs of customers across all industries.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,487
|
Sweet Potato Toast Bruschetta! This is one of the easiest and tastiest appetizer recipes I've made in a long time. The crazy part is that you cook the sweet potato slices in your toaster. Whaaaat?
Sweet potato toast is blowing up the internet. Okay, that's a bit of hyperbole, it's not really blowing up the WWW, but it is popping up all over Pinterest. I've been meaning to post this recipe for a few weeks, but other things, like this, and this, got in the way. Two sweet posts in a row is unusual for me, and now it's out of my system. Today it's back to healthy, colorful, and easy treats. Sound good?
If you haven't seen toast made out of sweet potato slices, you're probably wondering how do you make toast out of a potato, am I right? That was my first thought when I started seeing this idea on Pinterest. My second thought was that it would ruin my toaster because the sugar would drip all over the bottom of it. However, curiosity got the best of me, and I had to take that risk. I'm so happy that I did, because this is one of the easiest ways to make sweet potatoes, and, it didn't do any harm to my beloved appliance.
The thin slices of sweet potato take about three (3 minute) cycles to toast to a soft, yet firm texture. They turned out roasted, with a few blackened caramelized spots on them. They were solid enough to hold other ingredients on top, and soft enough to eat without a fight. I have to admit, I was skeptical when I first heard about them, but now I'm a convert.
This easy sweet potato bruschetta recipe took me about 15 minutes to whip up. All you'll need to do is peel and slice a large sweet potato. I sliced the pieces about a half an inch thick lengthwise. Once they're sliced, put as many as will fit into your toaster and toast them until they're easily pierced with a fork, yet firm enough to stay together when you put toppings on them. When they're almost done they'll most likely have started to brown in spots.
While the sweet potato slices are toasting, make the shallot, spinach, and garlic topping.
Top the toasts with the topping and sprinkle a bit of vegan ricotta cheese (I used Kite Hill), sea salt, and pepper on top, and enjoy a savory and healthy snack.
This is definitely the kind of appetizer that I will serve at my next get together, it's also great for a quick lunch or afternoon snack. If you want to make a big batch at once you can put the sweet potato slices on a cookie sheet and roast in a 400° oven for approximately 15 minutes. Make sure you flip them mid-way through roasting.
Give this easy, vibrant, and delicious savory sweet potato toast recipe a try, and let me know what you think. I'd love to hear from you.
An easy, gluten-free, healthy, and delicious appetizer.
Peel and slice the sweet potato lengthwise into 1/2 inch thick pieces.
Toast in your toaster until they're easy to pierce with a fork, yet firm enough to hold other ingredients.Approximately 8 to 10 minutes.
While the potatoes are toasting, heat the oil in a large skillet on medium heat. When the oil is hot add the shallots and cook until they're caramelized. Approximately 5 minutes. Add the spinach and garlic and cook until the spinach turns a dark green and begins to wilt. Approximately 2 minutes.
Top the sweet potato toast with the shallot and spinach mixture and grind sea salt and black pepper on top to taste. Sprinkle with vegan ricotta.
If you want to make a large batch you can roast the sweet potatoes in a 400° oven for approximately 15 minutes. Flip once while roasting. Double or triple the topping ingredients depending on how much you're making.
I love the versatility of this!
Little Miss Sunshine up there...do you always rain on people's parades!? I have never before heard of or seen this way of serving up sweet potatoes and I am sure to give it a try. Always looking for new and creative ways of preparing the foods I eat a lot of differently Thanks for this post, LINDA!
Thank you, Elizabeth! I'm happy to help. I used up three sweet potatoes in the last four days, each day I top them with something different. I'm loving this way of preparing them. I don't think Rebecca meant any disrespect, it's just not her cup of tea.
Such a cool idea to switch up the sweet potatoes instead of bread! Looks delicious!
I think so too. :) Thanks Mary Ellen.
This is so interesting and looks wonderful, thanks! I have not tried Kite Hill products yet and clearly I need to!
It's a great way to make sweet potatoes if you're in a hurry. No need to bake or boil. Kite Hill and Treeline are two of my favorite vegan cheese brands.
I am overall not a huge sweet potato fan but I love it in french fries and roasted! It's just too "wet" for me in other forms, so I could totally get on board with it as toast! I love the caramelized onion and spinach topping too. Some of my favorites!
I love them, but I can totally see what you mean about them being "wet." I think you'd like them prepared this way. Thanks, Sophia!
I think this is a great trend! I love the idea of packing more veggies in the day. These would be fun for breakfast, too.
I've never thought to put sweet potatoes in the toaster oven, but great idea. Love a good time saver!
Yum! We enjoy potato and sweet potato slices like this often. I call the planks, but your bruschetta name is WAY more elegant :) And that topping looks to die for!
Ooh these look so good! Any excuse to spring for Kite Hill ricotta!
Thank you, Becky! I spring for Kite Hill at least once a month, the best!
Love this idea! So many people these days are looking for bread alternatives and what could be better than replacing it with a superfood. I think this would be a big party hit!
Learned new way of eating sweet potatoes:) Thanks for the recipe.
I am a huge lover of all things sweet potato so really need to try this. I had no idea it would cook so quickly in the toaster. Perfect for a quick lunch. I might even try it tomorrow!
I still haven't tried sweet potato toast. That needs to change very soon!
I've never seen anyone actually toast their sweet potato slices but I just think thats a great idea. How creative and what a healthier option.
Oh yum, these sound delicious! I have heard about toasting sweet potato slices in the toaster, but have yet to try it - will have to now!!
Do it! :) I put peanut butter and cinnamon on them the other day for breakfast, SO good.
oh wow! I had no idea sweet potato toast was becoming a thing! I've been having it for the past 2 months when i was trying to avoid gluten...at least twice for breakfast every week and love it! So much that i have a simple recipe coming...but I've only ever had my simple combo...so looks like i'll have to try this recipe soon! Looks delicious with the greens!
What a terrific recipe! It's great to have a bruschetta option for us gluten free peeps. Plus it's a delicious way to get your beta carotene and fiber, not to mention the terrific pop of orange color. Sure beats the pale white bread! Thanks!!
This is such an easy recipe and looks so tasty, Linda! I need to get on the sweet potato toast train! YUM!
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 6,649
|
With almost all the major cellphone and PDA manufacturers offering state-of-the-art wireless networking services these days you're never really THAT away from the cyberspace. But there still are unfortunate times when your service provider's connectivity just gives way and if you have luck as sucky as mine, it probably happens when you need it the most. That's why I'm just so much in love with this wonderful new WIFI Desk from LIFEGOODS. The basic function of the desk is to provide users a petite semi-private space where they can take a break, take notes or even check their email and that too in the middle of a public space. It's much better than having to lug around a laptop and it also rids you of locating cyber cafes or worse still, trying to find a strong connection on your cellphone or PDA. The thing exists for the time being as a concept only, but I certainly see the potential of it becoming a reality soon.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 4,047
|
CaloriesCount.com Gives Sarah a New Lease on Life!
Despite gaining nearly 50 pounds in the three years following her college graduation, it was a late night health scare that served as Sarah's wake up call.
After waking up in pain and unable to breathe, Sarah immediately made an appointment with a doctor. Her diagnosis? Severe acid reflux. With her cholesterol hovering over the 250 mark – and a family history of chronic heartburn and early heart disease – Sarah decided it was time to change her unhealthy ways.
"I was tired of being overweight and this was the motivation I needed to kick my depression," said Sarah, now 27. "I signed up for CaloriesCount.com the day I had my doctor's appointment and never looked back."
A quick search for an online weight loss support site led her to CaloriesCount.com. And in the 17 months since she joined, she's shed nearly 60 pounds, has gone from a size 14-16 to a comfortable size 6 and now weighs a healthy 135 pounds.
Sarah religiously keeps a food diary, something she started early in her weight loss efforts. Her favorite part of the program, though, has been the message boards. The online support group, she says, has been instrumental in her success. "We sign in every day and check in with each other. And we have a weekly weigh-in. It's very helpful."
Since joining CaloriesCount.com, Sarah has also lowered her cholesterol and through portion control, has been able cut down on her heartburn and acid reflux episodes. She has also discovered an aptitude for cooking – whipping up appetizing meals and finding ways to modify recipes in order to reduce calories.
Although she no longer dreads trying on clothes, Sarah said her svelte shape is only one part of her success story. Actually, a sunnier, improved attitude has been the best outcome of her weight loss experience. Unlike many, Sarah never battled weight as a youth. Instead, it wasn't until her early 20s that the pounds started piling on. She attributes the weight gain to depression.
"The three years that I was overweight were probably the worst of my life," she said. "I didn't have as much energy. I was crankier and I was depressed. The depression made me gain weight, and gaining weight made me depressed, so I think it was a horrible, vicious cycle. I now have a body I didn't even know I could have. I have so much more energy and I'm happier."
What is her advice to others? Be patient, Sarah says. Use the tools available at CaloriesCount.com and don't blow off exercise.
Sarah's beginning exercise regimen consisted of hitting the gym every other day. She started with 25 minutes of cardio and 20 minutes of lifting. Today however, she hits the gym five or six times a week, combining 40 or more minutes of cardio with at least 30 minutes of weights. On the days she doesn't make it to the fitness center, she takes long walks or does Pilates at home.
Weight loss and physical fitness, Sarah warns, will not happen overnight. "Many people want results immediately and if they don't see them, they give up. Remember that it took you a long time to get where you are and it will take longer to undo it. Finally, you must find a way to fit exercise into your daily routine. It's important for your health and your success."
Throughout her CaloriesCount.com membership Sarah has experienced various weight loss and health-related milestones. However, Sarah said one of the biggest accomplishments was fitting into a size 8 wedding dress in time for her October 2006 nuptials. "I wanted to look good. And I did!"
The staff at CaloriesCount.com is glad we could help give Sarah a wonderful wedding gift – the best gift of all, the gift of health!
Read More Testimonials from CaloriesCount.com Members
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 9,969
|
Hey! It's throw back Thursday so I'm reaching back to a class we did in 2014 when a student wanted to do Marty from Madagascar. Our next fabulous cake sculpting class starts on November 4th here in our shop near Seattle. It's 2 weeks of sculpting fun!!!!! Email us at cakes@mikesamazingcakes.com for all the details.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 5,180
|
Who is responsible for the mystery apology seen by thousands of drivers a day at a busy Manchester roundabout?
The scrawled message on sheet has sparked a lot of speculation
Beth Abbit
This apology has been scrawled on a white sheet and attached to a roundabout in Wythenshawe
This mystery sign has appeared on a Manchester roundabout.
The large stained white sheet has been scrawled with the words 'I love you and I'm so sorry x'.
It has been attached to railings and placed on the Sharston roundabout, just off the M56 in Wythenshawe.
This apology has been scrawled on a white sheet and attached to a roundabout in Wythenshawe. Picture by Mark Andrew.
It is not known who created the banner, which appears to have been fashioned from a white bedsheet.
Even less is known about the reason for the apologetic declaration, which has drawn the attention of passing drivers.
The Sharston roundabout in Wythenshawe
One motorist snapped a picture of the makeshift sign on Wednesday after spotting it as he drove through the south Manchester suburb.
He said: "This sign has appeared on Sharston roundabout on Wythenshawe, just as you come off the motorway.
"It looks like someone is very sorry for maybe what they have done, or worse, what they are going to do. Who knows?"
Are you responsible for the mystery apology? Or was it aimed at you? Let us know by emailing newsdesk@men-news.co.uk, calling us on 0161 211 2323, tweeting us @MENnewsdesk or messaging us on our Facebook page . You can also send us a story tip using the form here .
Sharston
National newsBoy, 10, stabbed in random street attack as he walked with mum in LeicesterPolice are searching for the man who ran up and stabbed the boy, early on Saturday evening
Real Life'I was a single mum, severely overweight, bald, with one boob... I was scared for my children's future'Worsley mum was 'too overweight' for a breast rebuild...now she's four and a half stone lighter thanks to Slimming World
|
{
"redpajama_set_name": "RedPajamaCommonCrawl"
}
| 107
|
"Suggestion Schemes" are being operated in many progressive industrial undertakings in the country for the last several years. These " Schemes" operate on plant wide basis. Good suggestions leading to outstanding achievement or good performance on the part of workers in increasing productivity, quality, safety, working conditions, import substitution etc. are suitably rewarded by the Management at the enterprise level with financial & non-financial incentives including prizes & citation. The quantum of the prize money is generally related to the anticipated annual savings in the cost of production, resulting from the implementation of the suggestion at the plant level.
With the growing tempo of industrialization, it was considered desirable to provide for public recognition of outstanding achievement on the part of the workers, at the national level, so that, the workers could feel that they were accorded a place similar to that of other recipient of Rashtriya Puraskars for outstanding achievements in the other walks of life. The Government of India, Ministry of Labour & Employment has, therefore, instituted Vishwakarma Rashtriya Puraskar Scheme (previously known as Shram Vir National Awards) in the year 1965 for rewarding & recognizing the efforts of workers from the industrial undertakings at the national level. Since then this scheme has been in operation. This scheme is applicable for workers employed in the factories & docks.
The scheme is open to such Industrial Undertakings where Suggestion Schemes in the form of Quality Circles, General Suggestion Scheme, Safety Suggestion Scheme, Kaizen Schemes & Small Group Activities etc. are in operation. Suggestions accepted by the management and adopted during the previous calendar year in respect of any of the following qualify for the consideration of Vishwakarma Rashtriya Puraskar (VRP).
8. Making general working environment safe.
Each year applications are invited in the prescribed format for the grant of awards through advertisement in important national & local newspapers. Respective managements of the organization where these suggestion schemes are in operation are required to send the applications on behalf of the workers. The accepted applications are evaluated by both Internal and External Evaluation Committees consisting of Three Experts in each with specialization in Mech. Engg./Production Engg./ Indust.Engg./ Elect.Engg./Chemical Engg./Ergonomics/Envir. Engg/General Magt. The applications so evaluated by both the Committees are adjudged by a Tripartite Awards Committee appointed by the Ministry of Labour & Employment, Government of India, solely on the basis of their technical ability and expertise. The Tripartite Awards Committee consists of representatives from Government, Employers & Employees.
The VishwaKarma Rashtriya Puraskar (VRP) for each Performance Year will be granted to the awardees by the Hon'ble Union Labour & Employment Minister, Govt. of India at a special function to be held in New Delhi. Usually, the function is held each year on 17th September to coincide with the Vishwakarma Day.
To give recognition to good safety performance on the part of Industrial Establishments and to stimulate and maintain the interest of both the managements and the workers in accident prevention and safety promotion programmes, the Government of India instituted National Safety Awards(NSA) in the year 1965. Initially the NSA was instituted for factories registered under the Factories Act, 1948 which work One million man-hours or more during the contest year. From the year 1971, separate schemes were introduced for factories working less than One million manhours and also for Ports. From the year 1978 two more schemes were introduced for factories working more than one lakh and less than two and half lacs manhours during each year of the contest period. Further, the schemes which existed prior to 1978 were modified in 1978 as per the decision of the Awards Committee specially constituted for this purpose by the Ministry of Labour and Employment, Govt. of India. At present there are twelve schemes whose details are furnished as below. These schemes are operated by the Directorate General Factory Advice Service and Labour Institutes (DGFASLI), Mumbai, under the Ministry of Labour and Employment, Government of India.
The Schemes I to X are applicable to the Factories registered under the Factories Act, 1948, Construction Sites under the Building & Construction Workers (Regulation of Employment and Conditions of Service) Act, 1996 and Installations under Atomic Energy Regulatory Board (AERB). The Schemes XI to XII are applicable to establishments under Ports.
(iii) No. of total permanent disabled cases per million manhours worked multiplied by ten.
There is one winner and one runner-up in each of the 15 groups of industries as given in the Schedule which has worked the largest number of manhours, without any fatal/non-fatal accident/total permanent disability during the performance year. Each awardee will be presented with a shield and a certificate of merit.
There is one Winner and one Runner-up in each of the 11 Groups of industries as given in the Schedule which achieve the lowest average weighted accident frequency rate over a period of three preceding consecutive years ending with the performance year. Each awardee will be presented with a shield and a certificate of merit.
There is one winner and one runner-up in each of the 11 groups of industries as given in the Schedule which has worked the largest number of manhours, without any fatal/non-fatal accident/total permanent disability during the performance year. Each awardee will be presented with a shield and a certificate of merit.
FOR FACTORIES/CONSTRUCTION SITES/INSTALLATIONS UNDER AERB, WORKING LESS THAN ONE QUARTER MILLION MANHOURS SUBJECT TO MINIMUM OF ONE LAKH MANHOURS.
FOR FACTORIES/CONSTRUCTION SITES/INSTALLATIONS UNDER AERB, WORKING LESS THAN ONE LAKH MANHOURS SUBJECT TO MINIMUM OF FIFTY THOUSAND MANHOURS.
Provides for the grant of three awards to employer handling any cargo, except bulk oil on board the ship who achieves the lowest average weighted frequency rate of accidents over a period of three consecutive years ending in the performance year. One award is for employers who work a minimum of 1,00,000 man-hours(Group A) during each of the three consecutive years ending in the performance year. The second award is for employers who work a minimum of 50,000 manhours but less than 1,00,000 manhours(Group B) and the third award is for employers who work a minimum of 25,000 manhours but less than 50,000(Group C) manhours during each of the three consecutive years. Under each group a shield is given to the winner and the runner-up. A certificate of merit is also given to the awards winners.
Provides for the grant of three awards for shore employers, including port authorities, who achieve the lowest average weighted frequency rate over a period of three consecutive years ending in the performance year. One award is for employers who work a minimum of 2,50,000 manhours(Group A) during each of the three consecutive years ending in the performance year. The second award is for employers who work a minimum of 1,00,000 manhours but less than 2,50,000 manhours (Group B) and the third award is for employers who work less than 1,00,000 manhours but subject to minimum of 25,000 manhours (Group C) during each of the three consecutive years. Under each group a shield is given to the winner and runner-up. A certificate of merit is also given to the awards winners.
Every year applications are invited in the prescribed form for the grant of the awards through advertisement in important national and regional newspapers. Organisations are required to apply for awards under each scheme as applicable to them. The applications are adjudged by Tripartite Awards Committee constituted for three years by the Ministry of Labour and consisting of not less than five members selected solely on the basis of their experience and technical ability. The decision of the Awards Committee is final with regard to the final result.
The National Safety Awards(NSA) for each Performance Year will be granted to the winners and Runners up by the Hon'ble Labour & Employment Minister, Govt. of India, in a special function to be held in New Delhi. Usually the function is held each year on 17th September to coincide with the Vishwakarma Day.
2. Manufacture of Paper & Paper Products, Publishing, Printing and Reproduction of Recorded Media.
6. Manufacture of Machinery & Equipment other than Electrical Machinery & apparatus.
7. Manufacture of Electrical Machinery and apparatus.
and optical instruments and watches and clocks.
10. Manufacture of Motor Vehicles, Trailers and Semi Trailers.
11. Manufacture of Basic Metals & Fabricated Metal Products Except Machinery & Equipment.
12. Manufacture of Non-Metallic Mineral Products.
13. Manufacture of Food Products and Beverages.
5. Manufacture of Non-Metallic Mineral Products.
6. Manufacture of Food Products & Beverages.
and optical Instruments, Watches and Clocks.
8. Manufacture of Machinery and Equipment except Electrical machinery.
|
{
"redpajama_set_name": "RedPajamaC4"
}
| 3,502
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 17