text:
Couple gives $1 million for endowed professorship in accounting
April 24, 2017 | News, UToday, Advancement, Alumni, Business and Innovation
By Laurie B. Davis
Alan H. Barry and his wife, Karen A. Barry, have given their alma mater a $1 million gift to establish an endowment that supports the Alan H. and Karen A. Barry Endowed Professorship in Accounting at The University of Toledo.
The Barrys announced the gift at their home in Scottsdale, Ariz., April 21 at an alumni event for the Phoenix Chapter of the UT Alumni Association. University President Sharon L. Gaber attended the event in Scottsdale as the alumni chapter's invited speaker.
Karen A. Barry, left, and her husband, Alan H. Barry, signed an agreement April 21 with UT President Sharon L. Gaber to establish an endowed professorship in accounting at the University.
"UT's College of Business and Innovation has benefited greatly from the generosity of Alan and Karen Barry through their many gifts, which have supported both the Management and Accounting departments," Gaber said. "Their donations have helped our business faculty prepare UT students to enter the accounting and management professions with all of the necessary critical-thinking skills and core business principles to succeed as leaders in today's competitive marketplace.
"This newest gift from Alan and Karen Barry to endow a professorship adds another level of support, ensuring that our students are receiving the best possible education in accounting, and that our faculty have the resources they need to deliver an education of excellence," she said. "The University is deeply grateful for Alan and Karen Barry's generous gift and all that they do to support UT students."
The Alan H. and Karen A. Barry Endowed Professorship in Accounting will be used to recruit or retain a professor in the Department of Accounting; any costs related to the recruitment of a faculty member; bridge or pilot research projects; faculty and staff development costs; curriculum development; the development of a fellowship program; and specialized equipment needed for teaching.
"We are ecstatic that Alan and Karen have made such a tremendously generous gift to establish the endowed professorship in accounting in the College of Business," said Dr. Gary Insch, dean of the College of Business and Innovation. "Their action will benefit countless students for years to come and further elevate the College of Business and Innovation's reputation. Alan shows how much he truly cares about our students by frequently coming to campus when he is in town, and taking the time to meet and talk with business students, answering their real-life questions, and being a true mentor to them. We cannot thank Alan and Karen enough for their kindness, generosity and support."
Alan Barry, who is a certified public accountant and the retired president and chief operating officer of the Fortune 200 company Masco Corp., said giving back to UT students is a pleasure: "The accounting background I got at the University was beneficial to me throughout my career. I've always been a supporter of the University, and once I was in a position to do so financially, I felt pretty good about giving back to the University that gave me the opportunity to succeed."
He joined Brass Craft Manufacturing Co. in 1972 as controller and became president of that Masco division in 1988. In 1996, he became a group president of Masco, a manufacturer of home improvement and building products. He has broad business experience that includes finance, manufacturing, customer development, acquisitions and general operating management.
He serves on the board of directors of the H.W. Kaufman Financial Group. He is a retired director of Arch Aluminum & Glass Co. Inc., Scotts Miracle Gro Co., Flint Inc., and IPS Corp. He also served as an executive board member of the Plumbing Manufacturing Institute from 1985 through 2000, and as chairman of the institute in 1994. In addition, Barry served on the executive board of the associate member division of the American Supply Association during 1995 and 1996.
The Barrys have a history of philanthropy at The University of Toledo. In 2014, the University named a new accounting lab in the College of Business and Innovation for Alan Barry. At the time the lab was established, it was the first one nationwide to have a certified management accountant license, in which students could access for free the review material from Wiley, a leading provider of educational programs for professionals and students who are preparing for the certified management accountant exam.
The lab also serves as the location of the free income tax preparation assistance the College of Business and Innovation provides annually to qualified, low- to moderate-income individuals and families in the Toledo area during the spring income tax filing season.
"I am truly grateful for Karen and Alan Barry for their continuous support to the accounting students," Dr. Hassan HassabElnaby, professor and chair of the UT Department of Accounting, said. "It's only through people like Karen and Alan that we are able to provide the high-quality education we offer at the UT College of Business and Innovation. It has been my privilege to see Alan as a guest speaker in the classrooms, meeting and advising accounting students, supporting their development through the state-of-the-art Alan Barry Accounting Lab and the $1 million gift."
The Barrys also endowed the Alan and Karen Barry Scholarship Fund, which provides support for full-time UT business accounting students, based on both merit and needs. Alan Barry, a native of Toledo, is an active UT Alumni Association Phoenix Chapter member, as well as an active member in UT's Blue Key organization. He also serves on the UT Foundation Board of Trustees.
The couple's interest in supporting accounting students through financing scholarships, the accounting lab and the endowed professorship grew out of a nostalgic return to campus. "I was invited back to the University about 15 or so years ago. I hadn't been on the campus for a long time, and I guess I kind of fell in love with the place for the second time." The Barrys have been supportive donors ever since.
Alan received a business degree in 1966, and Karen graduated in 1964 with an associate degree.
The Department of Accounting is accredited by the Association to Advance Collegiate Schools of Business, International. This prestigious accreditation places the department among the top 2 percent of accounting departments worldwide.


The Shakespeare Club is looking for Michael Richards.
Ten-year-old Luis watches "Seinfeld" religiously and is a fan of Michael Richards in particular.
I suggested that perhaps he could write a letter to Mr. Richards.
"Oooo, that's tight, Ms. Ryane," Luis beamed.
I like the way you act on "Seinfeld." I like the way you come in the door.
I am a fifth grader and this is my last year in elemntary school. I came out on a play "Twelfth Night" and I played the prat of Sir Andrew Aguecheek. Watching Seinfeld helped me on my physical comedy. When the people would laugh it felt like a big wave of warm water falling on me.
I would love it if you could send my a signed picture of your self. Thank you for all the laughs you gave me.
Couldn't he use some good PR?
Answer the letter, Michael. It's the tight thing to do.
Today's blog was the tight thing to do, as well!


text:
Clippers' Blake Griffin: 'I am…
SportsNBAClippers
Clippers' Blake Griffin: 'I am very truly, truly sorry'
Clippers forward Blake Griffin, second from right, tries to fire up fans at Staples Center during a 2014 playoff series against Golden State.
By Robert Morales | rmorales@scng.com | Press Telegram
PUBLISHED: February 16, 2016 at 11:13 p.m. | UPDATED: September 1, 2017 at 12:52 p.m.
Clippers star Blake Griffin approached the large group of reporters Tuesday, walking with his head slightly down. He appeared deep in thought, then answered questions for a few minutes about his beatdown of team assistant equipment manager Matias Testi on Jan. 23 at a restaurant in Toronto.
The number of reporters was larger than usual because of all the trade rumors surrounding Griffin. They had no idea Griffin would be addressing them on this day.
Griffin seemed down. He spoke in contrite tones.
"Before we start, I just want to say that I have had a lot of time to reflect, and that I am very truly, truly sorry for what happened," he said before any questions were posed. "It was a situation between two friends that kind of got out of hand and I exercised poor judgment. I have spoken to Matias about it. I have spoken to my teammates about it … coaches.
"The last people to apologize to are the fans and to show them how sorry I am for this situation. It is something that I feel awful about. It is something that I have not had to deal with ever before in life. And it has been tough."
Griffin said that now that his punishment has been doled out by the Clippers and the league — a total of five games without pay — he looks forward to getting back on the court.
That won't be for some time. He had not played since Christmas because of a partially torn quad tendon. The fractured right hand sustained when he punched Testi, who was also at practice Tuesday, means Griffin won't be available until sometime in March — more than likely no sooner than mid-month. The Clippers (35-18), who host San Antonio on Thursday, are 18-5 without Griffin.
How could he do something so foolish? That was one inquiry.
"It was a situation, like I said, between two friends that escalated and again, I exercised poor judgment," he said. "It is something that I think about every day and wish I could take it back, and I have told Matias that. It is one of those things that you cannot take back, so now I am focused on moving forward and doing the best I can from here on out."
Griffin in early November 2014 was charged with misdemeanor battery for an incident in a Las Vegas nightclub. He was not prosecuted because of a lack of evidence. Now this. He was asked if he needs anger management.
"I have never really struggled with that kind of problem. Those incidents were completely separate and, no, I don't believe I need that," Griffin said.
He suggested this has been a trying time.
"It has been tough to know that I let my teammates down, let our organization down and let the fans down, let my family down, all of that," he said. "That has probably been the hardest part."
Griffin said he has spoken to Testi often since the incident, which apparently started with some trash-talk between friends.
"I have talked to Matias tons of times since the incident," he said. "He actually said it best, 'Stuff happens. We are like brothers and we just have to move on.'"
Rivers a bit irked
Coach Doc Rivers has been saying he has no intention of trading Griffin, even though there have been rumors to the contrary; the trade deadline is Thursday. One had it that the Clippers offered Griffin and Lance Stephenson to Denver for four players — Danilo Gallinari, Kenneth Faried, Nikola Jokic and Will Barton. One story said the Clippers initiated the deal, another said the opposite.
Rivers was asked if this Griffin drama is what sparked the trade talk.
"Not for us, no," Rivers said. "I've told you we're not trading Blake, but I guess everyone else wants to keep doing that, so we'll let them do it."
Rivers said it's frustrating to hear the gossip when "nothing is going on." When he was asked if he has received a lot of calls regarding Griffin's services, he said, "That's none of your business. It really isn't."
And the fans?
"It's none of their business, either," Rivers said. "Having said that, I think we receive phone calls about every single player, honestly, but it does frustrate me when you hear all the speculation and all that stuff. It's completely untrue."
Robert Morales | reporter
Robert Morales covers and coordinates local sports for the Press-Telegram
rmorales@scng.com
Follow Robert Morales	@RMoralesPT

redpajama_set_name: RedPajamaCommonCrawl


lifeasydelhincr (#536) 37 days ago News plumber in gurgaon All https://www.lifeasy.in Discuss Published New Discard Success!
lifeasydelhincr (#536) 45 days ago News carpenter in delhi All https://www.lifeasy.in Discuss Published New Discard Success!
JassieIrwik (#1680) 52 days ago News shepard fairey prints All https://ello.co Discuss Published New Discard Success!
Shepard Fairey prints come with namely Shepard Fairey in the year of 1970. He is the artists with a creative mind and started his career as a freestyle graffiti artist in the year of 1989. He designed some stickers like Obey Giant, poster, t-shirts and many kinds of variety of items which he mostly uses to sell to their customers. If you want to purchase top Shepard Fairey prints than visit Urbanart24 website.
AudreyLee (#1680) 57 days ago News china display stand All http://www.yimuexhibits.com Discuss Published New Discard Success!
Organize an exhibition is a platform to promote your product or service. So Yimuexhibits is the USA company which provides you china display stand at competitive prices because if the designing of your product stand is unique and modern it can make numbers of eye attraction for your products.
ScotieLari (#1680) 66 days ago News ghana news online All https://readymag.com Discuss Published New Discard Success!
Now you can get Ghana news online just visit the Celebritesbuzz website. This provides online news services anywhere just by using smartphones, tablets etc. They have all updated information like sports, music lyrics, business, celebrity news etc. It is the user-friendly website where you can simply get all the latest information. It is the best source to connect with the world.
CadenSmith (#1680) 69 days ago News entertainment news ghana today All https://www.celebritiesbuzz.com.gh Discuss Published New Discard Success!
At Celebritiesbuzz you can enjoy not only news regarding sports, business but also here is a platform for entertainment news in Ghana today just by keep online. They updated all the latest gossips about your favorite celebrities. You can get news information with the video clips.
ElijahKaila (#1680) 71 days ago News ghana online news All https://www.celebritiesbuzz.com.gh Discuss Published New Discard Success!
Nowadays online newspapers or website are more convenient than the printed newspaper. Because it can easily access the news just via downloaded phone applications and go through websites. So Celebritiesbuzz is the same for this kind of services. This provides Ghana news online that are more up-to-date and current topics are updated related to sports, your favorite celebrity, business news and many more.
sadik24 (#852) 78 days ago News drivers education texas All https://driversedtx.blogspot.com Discuss Published New Discard Success!


text:
Baseball: Former Yomiuri Giants pitcher arrested on gambling charges
Former Yomiuri Giants pitcher Shoki Kasahara was arrested on charges that he helped to organise baseball gambling. PHOTO: AFP
https://str.sg/UczF
TOKYO (AFP) - Former Yomiuri Giants pitcher Shoki Kasahara was arrested on Friday on charges that he helped organise baseball gambling, Tokyo police said, in a scandal which has rocked Japan's leading sport.
The 25-year-old, who has already been banned indefinitely by the sport's governing body, was arrested along with the alleged organiser of a baseball betting scheme, according to a Tokyo police spokesman.
It is the first arrest among the four suspended Giants players accused of being involved in illegal gambling by Nippon Professional Baseball (NPB).
Two of the others - Satoshi Fukuda and Ryuya Matsumoto - also received indefinite bans from the NPB, while Kyosuke Takagi was suspended for one year.
The Tokyo-based Giants, Japan's answer to the New York Yankees, have been fined a total of 15 million yen (S$188,100) over the scandal.
Kasahara is charged with helping alleged gambling organiser Satoshi Saito, 38, by explaining how to bet on professional baseball games and by collecting money from Saito's clients in 2014 and 2015, the police spokesman said.
Before his arrest, Kasahara told NHK television that he had visited underground casinos, but denied betting on Giants games and said he was never involved in match-fixing.
Gambling is generally illegal in Japan and the betting scandal has sent shockwaves through the country's most popular sport at a time when it is bidding for inclusion in the 2020 Tokyo Olympics.
The arrests came after Japanese badminton players, including Olympic medal hope Kento Momota, were booted off the national team for visiting an illegal casino.


text:
Заха́ри Сира́ков (род. 8 октября 1977, Смолян, Болгария) — болгарский футболист, защитник. В составе пермского «Амкара» провёл 11 сезонов. Рекордсмен среди всех болгарских футболистов по количеству матчей в чемпионатах России (276).

Карьера

Болгария
Воспитанник футбольной школы софийского «Левски» (тренер — Э. Спасов). Широкую известность получил после того, как 24 сентября 1999 года сравнял на 92 минуте счёт в матче с «Литексом» (1:1) ударом внешней стороной правой ступни. В сезоне 2000/01 получил тяжёлую травму, из-за чего покинул «Левски», а вскоре перешёл в лучший клуб Кипра — АПОЭЛ, с которым выиграл чемпионат.

Ушёл из АПОЭЛа посреди сезона 2002/03 из-за несоблюдения контрактных обязательств. Вернулся в Болгарию фактически во вторую команду «Левски» — «Родопу».

«Амкар»
С 2004 года выступал за пермский «Амкар». Хорошо отыграв за «Амкар», ожидал, что может оказаться в сильной московской команде. Однако, в дальнейшем, несколько раз имея предложения от других команд Премьер-лиги («Москва», «Динамо»), каждый раз отвечал отказом, мотивируя это тем, что его все устраивает в Перми.

В 2010 году в матче 15 тура против нальчикского «Спартака» забил гол практически от углового флажка. Видео собрало на портале YouTube более 1 миллиона просмотров. Вскоре Сираков был вызван в сборную Болгарии на товарищеский матч со сборной России.

31 января 2011 года Сираков продлил контракт с «Амкаром» на 2 года, согласившись на понижение заработной платы ради сохранения клуба в Премьер-лиге.

Статистика выступлений

Клубная

За сборную

Достижения
 Чемпион Болгарии 1999/2000, 2000/01
 Обладатель Кубка Болгарии 1997/98, 1999/2000
 Чемпион Кипра 2002/03
 Финалист Кубка России 2007/08
 Двукратный обладатель приза лучшего легионера «Амкара»

Примечания

Ссылки

Футболисты Болгарии
Игроки сборной Болгарии по футболу
Игроки ФК «Велбажд»
Игроки ФК «Левски»
Игроки ФК «Спартак» Плевен
Игроки ФК «Локомотив» София
Игроки ФК АПОЭЛ
Игроки ФК «Амкар»

redpajama_set_name: RedPajamaWikipedia


text:
Issue # 110 / 7 November 2008 //
Cover | Page One | Page Two | Page Three | Contents | Links | Contact
On My Street
Roll Tide! Alabama Is Number One!
by Stargirl
MY STARS! ALABAMA IS NUMBER ONE in the nation in college football! I am so very happy! Because I was born in Alabama and I love my University of Alabama football. Roll Tide! The AP Poll and the Coaches Poll. Isn't that great? And we need some good news about Alabama.
Because people say bad things about Alabama, my home state, and it really makes me mad.
People say that Alabama ranks forty-eighth in child health care. And that's from an Alabama newspaper! My stars!
And people say that Jefferson County, which is where Birmingham is, leads the nation in syphilis rates. Do you believe that?
And people also say that Jefferson County, which is where Birmingham is, like I said, is about to declare bankruptcy because they got all involved with that hedge fund stuff when they tried to raise money to repair the sewer system. My stars! The sewer system! Bankruptcy! That's what people say.
And something else. People say that Alabama rates forty-eighth again in education for kindergarten through twelfth grade. Isn't that something? My stars!
Well, this is what I think. I think that if that's true or—and this is important—if people just believe that about my home state, it's important that we are number one in football. That's right. I mean that. I mean, think about how bad people in Alabama must feel if they think that the rest of the country thinks that Alabama doesn't take care of its children. Poor health care for children and bad education. And syphilis, bankruptcy. To have that kind of reputation as a state is just terrible and it's so depressing for the people of the state.
And that's why it's important that Alabama is number one in football. Because it will make people feel better about their home state and forget about all that negative stuff that's so depressing. See?
Well here's somebody who makes me feel good. John Parker Wilson. He's the Crimson Tide quarterback. He is so handsome and so very talented.
And here's somebody else. Nick Saban. He's the coach and he's a Scorpio, that's his sign. And I just love Scorpios. My two husbands were both Scorpios. Determined and forceful. Emotional and intuitive. Powerful and passionate. Exciting and magnetic. That's a Scorpio. And that's a great coach, Nick Saban.
And you know that Nick Saban makes more than five million dollars a year? Well, he deserves it. If he can make those boys play great football and win all their games and become number one in the country, he deserves that kind of salary. You know why? So that the people of the state can get involved in following the great University of Alabama football team. And forget all that bad stuff that people are saying about the state about bad education and health care, not taking care of the children, that depressing stuff.
My stars! Number one in football! Roll Tide!
—edited by Britt Leach


text:
What India need to do against Afghanistan's key players
25dAakash Chopra
Gaikwad, Gill and Saini make it 2-0 for India A
46mGeorge Dobell
R Ashwin claims six wickets but Nottinghamshire still have it all to do with the bat against Surrey
2dJon Culley in Nottingham
Rashid Khan might have come in for some stick in the World Cup, but he is a top-class bowler. Mohammad Nabi is an old-school offspinner who relies on flight to deceive Randy Brooks / © AFP
Aakash ChopraFormer India opener
Aakash Chopra is the 245th Indian to represent India in Test cricket. A batsman in the traditional mould, he played 10 Tests for India in 2003-04, and has played over 120 first-class matches. He currently plays for Delhi in the Ranji Trophy; his book Beyond the Blues was an account of the 2007-08 season. Chopra made a formidable opening combination with Virender Sehwag, which was believed to be one of the reasons for India's success in Australia and Pakistan in 2003-04. He is considered one of the best close-in fielders India has produced after Eknath Solkar.
Why they need to beware of the three spinners, and how they can tackle them
Mohammad Nabi
Nabi is a throwback to days gone by. He has one of the cleanest actions, the ability to slow the ball down, and a lot of control. In terms of the pure hang-time for the ball, he must be among the slowest fingerspinners in the world - in contrast to the majority of his breed, who have started bowling a lot faster to stay relevant. In fact, many of these spinners have lost out on the race for places in white-ball teams despite bowling quicker and even after adding the carrom ball to their repertoire.
Nabi relies on using that airtime for deception. He makes subtle changes to his pace and the angle of delivery to counter aggressive batsmen. Mostly, while bowling to right-hand batsmen, he gets close to the stumps and pushes the ball outside off with drift; from there, the ball grips and turns off the surface. Since he is slow in the air, it challenges the batsman to use his feet to get to the pitch of the delivery. But along with his drift, Nabi is able to make the ball dip on the batsman, which results in a number of wickets caught in the deep. He is also capable of going round the stumps, bowling a little roundarm to create a new, wider angle.
The best way to play Nabi is to use the feet to get to the pitch of the ball, or to use the width of the crease to play off the back foot. Ideally, when you step out against him, the attempt should be to play along and down the ground. That way the body weight is not going backwards while playing the attacking shot. Once you have used the feet to step out a few times, it is advisable to hang back and play off the back foot.
Mujeeb Ur Rahman
He is among the few spinners who are not only adept at bowling with the new ball but also quite effective with it. He has three key variations - the slider, the carrom ball, and the googly - and the knowhow to use them wisely. The first two are bowled at an identical pace and trajectory, with the intent of pushing the batsman onto the back foot. The one with the seam angled towards fine leg moves in the air like an inswinger, and the cross-seam one moves outwards after pitching.
The googly, as is usually the case, is bowled from out of the back of the hand and is the slowest ball he bowls. If the ball isn't gripping the surface, the first two variations aren't too dissimilar in nature and should be dealt with similarly. But once the ball starts gripping the surface, the carrom ball is a threat.
The ideal way to play him is to watch the hand/release closely and choose shots accordingly. If you are unable to read it out of the hand, follow the trajectory of the ball closely. The faster and flatter balls will be the flipper and carrom ball, and the slower ones with the more loopy trajectory will be googlies.
He has not had a good World Cup so far but you count Rashid out at your own peril. He is a champion bowler who will ask tough questions and knows how to bounce back after a mauling.
He is quick and flat in the air and represents the new breed of legspinners - the ones who bowl with a high-arm action and try to finish within the stumps all the time. Neither his googly nor his legspinner turns a mile but they will turn enough to keep pressure on the batsman. Unlike more orthodox legspinners, the back of his hand faces the batsman even when he is bowling regular legspin. The giveaway is the position of the fingers when he is loading up: for legspin, he keeps the fingers split apart; for the googly, they are closer together.
Rashid has been guilty of dragging it a little too short too often this World Cup and that has been an area of concern for him. The England batsmen, especially Eoin Morgan, took full toll against the short balls and he struggled to come back in the innings.


text:
Q: How to find out which js code changes selected index I have a dropdown and my selected index is set by php (which works as long as javascript is disabled).
When i enable javascript, then my selected index is changed to the first option as soon as the page is loaded. Now i need to find out which piece of js changes my selected index.
Can anyone tell me please how to find this out, for example by using firebug?

redpajama_set_name: RedPajamaStackExchange


text:
Q: serial port event not firing after opening the form using showDialog() method in c# windows form application Actually i am receiving data from com serial port to get phone/mobile number while people/customers call to restaurant for order.
First Time serial port  listening perfectly and then windows form displying the phone number  correctly. To open windows form I have to use this.showdialog() instead of this.show(). Because there few more forms already open behind of the current form.
The problem is happening after fist time showing the dialog, serial port not listening phone call or serial port function on triggering and the the form is not being updated with new caller phone number.
I understand this is happening because of use of showdialog() but i have to use this. I am put down the code i used ..

private void FindCom()
        {

            try
            {
                //Messagebox.show("Called Find Com");
                LogFile.WriteLogFile("File:Caller", "Method:FindCom", "--FindCom Called--");
                string COM = RunProcess("FindCOMET.exe"); // Using the autofind to find the unit's
                string[] COMPorts = COM.Split(';'); // Split the AutoFind string into individual ports
                COM = COMPorts[0]; // Select the first COM port
                // Initialise COM port with all settings.
                serialPort = new SerialPort();
                serialPort.PortName = COM;
                serialPort.BaudRate = 1200;
                serialPort.DataBits = 8;
                serialPort.StopBits = StopBits.One;
                serialPort.Parity = Parity.None;
                serialPort.DataReceived += new SerialDataReceivedEventHandler(this.serialPort_DataReceived);
                serialPort.ReadTimeout = 100; // Required for end of packet Timeout notification
                serialPort.Open();
            }
            catch (Exception ex)
            {
                //MessageBox.Show("Exception1"+ ex.Message.ToString());
                LogFile.WriteLogFile("File:Caller", "Method:FindCom", "EM: " + ex.Message.ToString());
            }
            // Loop until user presses a key then exit
            //System.Console.WriteLine("Press any key to exit");
            //Console.ReadKey();
        }

        // Variables for the data read
        int[] buffer = new int[255];
        int pointer;
        private void serialPort_DataReceived(object sender, System.IO.Ports.SerialDataReceivedEventArgs e)
        {
            try
            {
                // Read all the current buffer into the array
                for (int c = 0; c != serialPort.BytesToRead; c++)
                {
                    buffer[pointer] = serialPort.ReadByte();
                    pointer++;
                }
            }
            catch (TimeoutException x)
            {
                try
                {

                    COMET_Data cid = new COMET_Data(buffer);
                    // Output the data or call something within your program here
                    string mobileNo = cid.getCIDNumber();
                    string telePhone =string.Empty;
                    var getName = string.Empty;
                    if (mobileNo != null)
                    {
                        mobileNo = Regex.Replace(mobileNo, "[^0-9]+", string.Empty);
                       // MessageBox.Show("FullNumber" + mobileNo);
                        if (mobileNo[0] == '9')
                        {
                            mobileNo = mobileNo.Substring(1);
                        }
                        //MessageBox.Show(mobileNo.Substring(0, 2)+" OF =>"+ mobileNo);
                        if (mobileNo.Substring(0,2) == "07")
                        {
                            //mobileNo = mobileNo;
                            txtbxMobileNo.Text = mobileNo;
                            lblMobileNo.Text = mobileNo;
                        }
                        else
                        {

                            telePhone = mobileNo;
                            //MessageBox.Show("telephone:" + telePhone);
                            txtbxTelephone.Text = telePhone;
                            lblMobileNo.Text = telePhone;
                        }
                        getName = cid.getCIDName();

                    }
                    else
                    {
                        lblCustomerName.Text = "Not Available";
                        txtbxMobileNo.Text = "Withheld";
                        lblMobileNo.Text = "Withheld";
                    }

                    //MessageBox.Show(mobileNo);
                    SaveCommetCaller(mobileNo);
                    // Reset the buffer pointer and buffer
                    buffer = new int[255];
                    pointer = 0;
                    //for (int i = 1; i >= 0; i--)

                    isFormOpen = true;
                    this.ShowDialog();
                    serialPort.DiscardInBuffer();
                    //is_open = false;
                }
                catch (Exception ex)
                {
                    LogFile.WriteLogFile("File:Caller", "Method:DataReceived", "EM: " + ex.Message.ToString());
                }
                //serialPort.DataReceived += new SerialDataReceivedEventHandler(this.serialPort_DataReceived);
            }
            finally
            {
               // serialPort.DataReceived += serialPort_DataReceived;
            }
        }

I want to get data from serial port while the form is still open using showdialog() method without user activity to close or hide the form.

A: The ShowDialog() will block your application no matter what.
Best result I could achive can be watched here: Dialogs video
First, put your event emitter in separate thread/task and inject the event emitter to the first form:
static class Program
{
    [STAThread]
    static void Main()
    {
        Application.EnableVisualStyles();
        Application.SetCompatibleTextRenderingDefault(false);

        var callReceiver = new CallReceiver();

        var thread = new Thread(callReceiver.WaitForCall);
        thread.Start();

        Application.Run(new Form1(callReceiver));
    }
}

public class CallReceiver
{
    public event EventHandler<int> CallReceived;

    public void WaitForCall()
    {
        var i = 0;
        while (true)
        {
            Thread.Sleep(1000);
            OnCallReceived(i++);//Dummy event emitter
        }
    }
    protected virtual void OnCallReceived(int e)
    {
        CallReceived?.Invoke(this, e);
    }
}

The first form listens to the event of an incoming call and creates a dialog when a call enters. The event emitter is injected to the second dialog as well.
Form1.cs:
public partial class Form1 : Form
{
    private readonly CallReceiver _callReceiver;
    private DisplayCallForm _displayCallForm;
    public Form1(CallReceiver callReceiver)
    {
        _callReceiver = callReceiver;
        InitializeComponent();

        _callReceiver.CallReceived += CallReceiverOnCallReceived;

    }

    private void CallReceiverOnCallReceived(object sender, int i)
    {

        this.InvokeIfRequired(() =>
        {
            if (_displayCallForm == null)
            {
                _displayCallForm = new DisplayCallForm(_callReceiver);

                _displayCallForm.Show(this); //give "this" to show() to make sure the
                                             //new dialog is in foreground.
            }
        });
    }
}

the this.InvokeIfRequired() is to avoid cross-thread problems and looks like this:
static class Invoker
{
    public static void InvokeIfRequired(this Control control, MethodInvoker action)
    {
        if (control.InvokeRequired)
        {
            control.Invoke(action);
        }
        else
        {
            action();
        }
    }
}

DisplayCallForm.cs:
public partial class DisplayCallForm : Form
{
    private readonly CallReceiver _callReceiver;

    public DisplayCallForm(CallReceiver callReceiver)
    {

        InitializeComponent();
        _callReceiver = callReceiver;

        _callReceiver.CallReceived += CallReceiverOnCallReceived;
    }

    private void CallReceiverOnCallReceived(object sender, int i)
    {
        this.InvokeIfRequired(() =>
        {
            label1.Text = i.ToString();
        });
    }
}

Hope this helps.

A: I had the same issue and solved it surprisingly simple, iam not calling                 "serialPort1.Close();" after i recieved data but instead in the button for going back to mainpage in my case:
private void button1_Click(object sender, EventArgs e)
{
    serialPort1.Close();  //  <---
    Form1 nextForm = new Form1();
    Hide();
    nextForm.ShowDialog();
    Close();
}

this allows me to switch between winforms and keep functional serialport1.


Did you know that Dolly the Sheep would have been 21 years old today?
Of course, some of you might not even know (or remember) who Dolly was.
Dolly, of course, was the first mammal cloned from an adult somatic cell – the donor cell having come from a mammary gland. Back in 1996, her birth/cloning/creation caused quite the controversy around the ethics of cloning.
All the same, it was a significant scientific breakthrough that led to others: mice, cats, cows, and more. The processs has garnered a lot of interest as a potential means of saving endangered species as well as possibly reviving extinct ones. Hopefully nothing of the Jurassic Park variety because, well, you know, not a pretty picture.
That said, perhaps the bigger legacy of Dolly may not be the reality that cloning is possible but that her creation helped lead to great progression in stem cell research. Of course, stem cell research is not without its own controversies, but the truth is that advances in this area have helped pave the way for medical breakthroughs that help sustain human life and battle illness.
Personally, I think that so long as there is ethical responsibility in how such research is conducted, then it is for the good of humanity.
Dolly passed away in 2003, just a few months before she would have turned seven.
Still, the significance of this fascinating creature survives to this very day.


It will work on computer only on flash player enabled browsers.
Decor my cupcakes is another cooking game that includes many activities of making cupcakes. You will be given many things and activities to decor the cupcakes in a perfect way. So choose the right color combination and follow screens prompt.


text:
// Copyright (c) Miha Zupan. All rights reserved.
// This file is licensed under the BSD-Clause 2 license.
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.CodeAnalysis;
using System.Runtime.CompilerServices;

/*
 * Ported to Markdig from https://github.com/MihaZupan/SharpCollections
 *
 * If you encounter any problems related to this data structure, please cc @MihaZupan
 *
 * This data structure aims to use less memory than reference-based implementations.
 * Please note the lack of a Remove method on this data structure
 */

// Relies on NETCORE being set for selective use of Spans

//namespace SharpCollections.Generic
namespace Markdig.Helpers
{
    /// <summary>
    /// A compact insert-only key/value collection for fast prefix lookups
    /// <para>Something between a Trie and a full Radix tree, but stored linearly in memory</para>
    /// </summary>
    /// <typeparam name="TValue">The value associated with the key</typeparam>
    [ExcludeFromCodeCoverage]
    internal sealed class CompactPrefixTree<TValue> : IReadOnlyDictionary<string, TValue>, IReadOnlyList<KeyValuePair<string, TValue>>
    {
        /// <summary>
        /// Used internally to control behavior of insertion
        /// <para>Copied from <see cref="Dictionary{TKey, TValue}"/> internals</para>
        /// </summary>
        internal enum InsertionBehavior : byte
        {
            /// <summary>
            /// The default insertion behavior. Does not overwrite or throw.
            /// </summary>
            None = 0,

            /// <summary>
            /// Specifies that an existing entry with the same key should be overwritten if encountered.
            /// </summary>
            OverwriteExisting = 1,

            /// <summary>
            /// Specifies that if an existing entry with the same key is encountered, an exception should be thrown.
            /// </summary>
            ThrowOnExisting = 2
        }

        [DebuggerDisplay("{Char}, Child: {ChildChar} at {ChildIndex}, Match: {MatchIndex}, Children: {Children?.Count ?? 0}")]
        private struct Node
        {
            /// <summary>
            /// The character this node represents, should never be 0
            /// </summary>
            public char Char;
            /// <summary>
            /// Will be 0 if this is a leaf node
            /// </summary>
            public char ChildChar;
            public int ChildIndex;
            /// <summary>
            /// Set to -1 if it does not point to a match
            /// </summary>
            public int MatchIndex;
            /// <summary>
            /// -1 if not present
            /// </summary>
            public int Children;
        }

        private Node[] _tree;
        private static readonly Node[] _emptyTree = new Node[0];

        private KeyValuePair<string, TValue>[] _matches;
        private static readonly KeyValuePair<string, TValue>[] _emptyMatches = new KeyValuePair<string, TValue>[0];

        private int _childrenIndex = 0;
        private int[] _children = _emptyChildren;
        private static readonly int[] _emptyChildren = new int[0];

        #region Size and Capacity

        /// <summary>
        /// Gets the number of nodes in the internal tree structure
        /// <para>You might be looking for <see cref="Count"/></para>
        /// <para>Exposing this might help in deducing more efficient initial parameters</para>
        /// </summary>
        public int TreeSize { get; private set; }
        /// <summary>
        /// Gets or sets the capacity of the internal tree structure buffer
        /// <para>You might be looking for <see cref="Capacity"/></para>
        /// </summary>
        public int TreeCapacity
        {
            get
            {
                return _tree.Length;
            }
            set
            {
                if (value < TreeSize)
                    ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.value, ExceptionReason.SmallCapacity);

                if (value != TreeSize)
                {
                    Node[] newTree = new Node[value];
                    if (TreeSize > 0)
                    {
                        Array.Copy(_tree, 0, newTree, 0, TreeSize);
                    }
                    _tree = newTree;
                }
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        private void EnsureTreeCapacity(int min)
        {
            if (_tree.Length < min)
            {
                EnsureTreeCapacityRare(min);
            }
            Debug.Assert(_tree.Length >= min);
        }
        [MethodImpl(MethodImplOptions.NoInlining)]
        private void EnsureTreeCapacityRare(int min)
        {
            // Expansion logic as in System.Collections.Generic.List<T>
            Debug.Assert(min > _tree.Length);
            int newCapacity = _tree.Length * 2;
            if ((uint)min > int.MaxValue) newCapacity = int.MaxValue;
            if (newCapacity < min) newCapacity = min;
            TreeCapacity = newCapacity;
        }

        /// <summary>
        /// Gets the number of key/value pairs contained in the <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        public int Count { get; private set; }
        /// <summary>
        /// Gets or sets the capacity of the internal key/value pair buffer
        /// </summary>
        public int Capacity
        {
            get
            {
                return _matches.Length;
            }
            set
            {
                if (value < Count)
                    ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.value, ExceptionReason.SmallCapacity);

                if (value != Count)
                {
                    KeyValuePair<string, TValue>[] newMatches = new KeyValuePair<string, TValue>[value];
                    if (Count > 0)
                    {
                        Array.Copy(_matches, 0, newMatches, 0, Count);
                    }
                    _matches = newMatches;
                }
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        private void EnsureCapacity(int min)
        {
            // Expansion logic as in System.Collections.Generic.List<T>
            if (_matches.Length < min)
            {
                EnsureCapacityRare(min);
            }
            Debug.Assert(_matches.Length >= min);
        }
        [MethodImpl(MethodImplOptions.NoInlining)]
        private void EnsureCapacityRare(int min)
        {
            // Expansion logic as in System.Collections.Generic.List<T>
            Debug.Assert(min > _matches.Length);
            int newCapacity = _matches.Length * 2;
            if ((uint)min > int.MaxValue) newCapacity = int.MaxValue;
            if (newCapacity < min) newCapacity = min;
            Capacity = newCapacity;
        }

        /// <summary>
        /// Gets the size of the children buffer in the internal tree structure
        /// <para>You might be looking for <see cref="Count"/></para>
        /// <para>Exposing this might help in deducing more efficient initial parameters</para>
        /// </summary>
        public int ChildrenCount => _childrenIndex;
        /// <summary>
        /// Gets or sets the capacity of the internal children buffer
        /// <para>You might be looking for <see cref="Capacity"/></para>
        /// </summary>
        public int ChildrenCapacity
        {
            get
            {
                return _children.Length;
            }
            set
            {
                if (value < _childrenIndex)
                    ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.value, ExceptionReason.SmallCapacity);

                if (value != _childrenIndex)
                {
                    int[] newChildren = new int[value];
                    if (_childrenIndex > 0)
                    {
                        Array.Copy(_children, 0, newChildren, 0, _childrenIndex);
                    }

                    // Set new odd indexes to -1
                    for (int i = _childrenIndex + 1; i < newChildren.Length; i += 2)
                        newChildren[i] = -1;

                    _children = newChildren;
                }
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        private void EnsureChildrenCapacity(int min)
        {
            if (_children.Length < min)
            {
                EnsureChildrenCapacityRare(min);
            }
            Debug.Assert(_children.Length >= min);
        }
        [MethodImpl(MethodImplOptions.NoInlining)]
        private void EnsureChildrenCapacityRare(int min)
        {
            // Expansion logic as in System.Collections.Generic.List<T>
            Debug.Assert(min > _children.Length);
            Debug.Assert(_childrenIndex % 2 == 0);
            int newCapacity = _children.Length * 2;
            if ((uint)min > int.MaxValue) newCapacity = int.MaxValue;
            if (newCapacity < min) newCapacity = min;
            ChildrenCapacity = newCapacity;
        }

        #endregion Size and Capacity

        #region RootChar

        // Inspired by Markdig's CharacterMap

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        private bool TryGetRoot(char rootChar, out int rootNodeIndex)
        {
            if (rootChar < 128)
            {
                rootNodeIndex = _asciiRootMap[rootChar];
                return rootNodeIndex != -1;
            }

            if (_unicodeRootMap != null)
            {
                return _unicodeRootMap.TryGetValue(rootChar, out rootNodeIndex);
            }

            rootNodeIndex = -1;
            return false;
        }
        private void SetRootChar(char rootChar)
        {
            if (rootChar < 128)
            {
                Debug.Assert(_asciiRootMap[rootChar] == -1);
                _asciiRootMap[rootChar] = TreeSize;
            }
            else
            {
                if (_unicodeRootMap == null)
                {
                    _unicodeRootMap = new Dictionary<char, int>();
                }
                _unicodeRootMap.Add(rootChar, TreeSize);
            }
        }
        private readonly int[] _asciiRootMap = new int[128];
        private Dictionary<char, int> _unicodeRootMap;

        #endregion RootChar

        private void Init(int matchCapacity, int treeCapacity, int childrenCapacity)
        {
            for (int i = 0; i < _asciiRootMap.Length; i++)
                _asciiRootMap[i] = -1;

            _matches = matchCapacity == 0 ? _emptyMatches : new KeyValuePair<string, TValue>[matchCapacity];
            _tree = treeCapacity == 0 ? _emptyTree : new Node[treeCapacity];
            EnsureChildrenCapacity(childrenCapacity);
        }

        /// <summary>
        /// Constructs a new <see cref="CompactPrefixTree{TValue}"/> with no initial prefixes
        /// </summary>
        public CompactPrefixTree(int matchCapacity = 0, int treeCapacity = 0, int childrenCapacity = 0)
        {
            Init(matchCapacity, treeCapacity, childrenCapacity);
        }
        /// <summary>
        /// Constructs a new <see cref="CompactPrefixTree{TValue}"/> with the supplied matches
        /// </summary>
        /// <param name="input">Matches to initialize the <see cref="CompactPrefixTree{TValue}"/> with. For best lookup performance, this collection should be sorted.</param>
        public CompactPrefixTree(ICollection<KeyValuePair<string, TValue>> input)
        {
            if (input == null) ThrowHelper.ThrowArgumentNullException(ExceptionArgument.input);

            Init(input.Count, input.Count * 2, input.Count * 2);

            using (var e = input.GetEnumerator())
            {
                for (int i = 0; i < input.Count; i++)
                {
                    e.MoveNext();
                    TryInsert(e.Current, InsertionBehavior.ThrowOnExisting);
                }
            }
        }

        #region this[] accessors

        /// <summary>
        /// Retrieves the key/value pair at the specified index (must be lower than <see cref="Count"/>)
        /// </summary>
        /// <param name="index">Index of pair to get, must be lower than <see cref="Count"/> (the order is the same as the order in which the elements were added)</param>
        /// <returns>The key/value pair of the element at the specified index</returns>
        public KeyValuePair<string, TValue> this[int index]
        {
            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            get
            {
                if ((uint)index >= (uint)Count) ThrowHelper.ThrowIndexOutOfRangeException();
                return _matches[index];
            }
        }

        /// <summary>
        /// Gets or sets the value associated with the specified key
        /// </summary>
        /// <param name="key">The key of the value to get or set</param>
        /// <returns>The value of the element with the specified key</returns>
        public TValue this[string key]
        {
            get
            {
                if (TryMatchExact(key.AsSpan(), out KeyValuePair<string, TValue> match))
                    return match.Value;
                throw new KeyNotFoundException(key);
            }
            set
            {
                var pair = new KeyValuePair<string, TValue>(key, value);
                bool modified = TryInsert(in pair, InsertionBehavior.OverwriteExisting);
                Debug.Assert(modified);
            }
        } // Get, Set

        /// <summary>
        /// Gets the value associated with the specified key
        /// </summary>
        /// <param name="key">The key of the value to get</param>
        /// <returns>The key/value pair of the element with the specified key</returns>
        public KeyValuePair<string, TValue> this[ReadOnlySpan<char> key]
        {
            get
            {
                if (TryMatchExact(key, out KeyValuePair<string, TValue> match))
                    return match;
                throw new KeyNotFoundException(key.ToString());
            }
        } // Get only

        #endregion this[] accessors

        #region Add, TryAdd

        /// <summary>
        /// Adds the specified key/value pair to the <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        /// <param name="key">The key of the element to add</param>
        /// <param name="value">The value of the element to add</param>
        public void Add(string key, TValue value)
        {
            var pair = new KeyValuePair<string, TValue>(key, value);
            TryInsert(in pair, InsertionBehavior.ThrowOnExisting);
        }
        /// <summary>
        /// Adds the specified key/value pair to the <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        /// <param name="pair">The key/value pair to add</param>
        public void Add(KeyValuePair<string, TValue> pair)
            => TryInsert(in pair, InsertionBehavior.ThrowOnExisting);

        /// <summary>
        /// Tries to add the key/value pair to the <see cref="CompactPrefixTree{TValue}"/> if the key is not yet present
        /// </summary>
        /// <param name="key">The key of the element to add</param>
        /// <param name="value">The value of the element to add</param>
        /// <returns>True if the element was added, false otherwise</returns>
        public bool TryAdd(string key, TValue value)
        {
            var pair = new KeyValuePair<string, TValue>(key, value);
            return TryInsert(in pair, InsertionBehavior.None);
        }
        /// <summary>
        /// Tries to add the key/value pair to the <see cref="CompactPrefixTree{TValue}"/> if the key is not yet present
        /// </summary>
        /// <param name="pair">The pair to add</param>
        /// <returns>True if the element was added, false otherwise</returns>
        public bool TryAdd(KeyValuePair<string, TValue> pair)
            => TryInsert(in pair, InsertionBehavior.None);

        #endregion Add, TryAdd

        #region Insert internal

        private bool TryInsert(in KeyValuePair<string, TValue> pair, InsertionBehavior behavior)
        {
            string key = pair.Key;
            if (key == null) ThrowHelper.ThrowArgumentNullException(ExceptionArgument.key);
            if (key.Length == 0) ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.key, ExceptionReason.String_Empty);
            Debug.Assert(!string.IsNullOrEmpty(key));

            char rootChar = key[0];
            if (TryGetRoot(rootChar, out int rootNodeIndex))
            {
                var tree = _tree;
                ref Node node = ref tree[rootNodeIndex];
                for (int i = 1; i < key.Length; i++)
                {
                    char c = key[i];

                    if (node.ChildChar == c)
                    {
                        node = ref tree[node.ChildIndex];
                        continue;
                    }

                    if (node.Children == -1)
                    {
                        // This could be a leaf node
                        if (node.ChildChar == 0)
                        {
                            // This is a leaf node
                            int previousMatchIndex = node.MatchIndex;
                            ref KeyValuePair<string, TValue> previousMatch = ref _matches[previousMatchIndex];
                            string previousKey = previousMatch.Key;

                            // Find out for how long the two keys continue to share a prefix
                            int previousIndex = i;
                            int minLength = Math.Min(key.Length, previousKey.Length);
                            for (; i < minLength; i++)
                            {
                                // We haven't checked the i-th character of key so far
                                if (key[i] != previousKey[i]) break;
                            }

                            if (i == minLength && key.Length == previousKey.Length)
                            {
                                // The two keys are of the same length and i has reached the length of the key => duplicate
                                Debug.Assert(i == key.Length && i == previousKey.Length);
                                Debug.Assert(key == previousKey);
                                goto HandleDuplicateKey;
                            }

                            // Clear the match index on the current node as it's no longer a leaf node
                            node.MatchIndex = -1;

                            // insert (i - previousIndex) intermediary nodes (could be 0)
                            int intermediaryNodesToInsert = i - previousIndex;
                            if (intermediaryNodesToInsert > 0)
                            {
                                node.ChildIndex = TreeSize;
                                node.ChildChar = key[previousIndex];
                                EnsureTreeCapacity(TreeSize + intermediaryNodesToInsert);
                                tree = _tree;
                                for (int j = 0; j < intermediaryNodesToInsert - 1; j++)
                                {
                                    tree[TreeSize + j] = new Node()
                                    {
                                        Char = previousKey[previousIndex + j],
                                        ChildChar = previousKey[previousIndex + j + 1],
                                        ChildIndex = TreeSize + j + 1,
                                        MatchIndex = -1,
                                        Children = -1
                                    };
                                }
                                TreeSize += intermediaryNodesToInsert;
                                tree[TreeSize - 1] = new Node()
                                {
                                    Char = previousKey[previousIndex + intermediaryNodesToInsert - 1],
                                    MatchIndex = -1,
                                    Children = -1
                                };
                                node = ref tree[TreeSize - 1];
                            }

                            node.ChildIndex = TreeSize;

                            // Insert the pair
                            EnsureCapacity(Count + 1);
                            _matches[Count] = pair;

                            // One of the strings could be a prefix of the other, in that case we're only inserting one leaf node
                            if (i == minLength)
                            {
                                Debug.Assert(key.Length != previousKey.Length);
                                if (previousKey.Length < key.Length) // If the input was sorted, this should be hit
                                {
                                    Debug.Assert(key.StartsWith(previousKey));
                                    node.ChildChar = key[i];
                                    node.MatchIndex = previousMatchIndex;
                                    EnsureTreeCapacity(TreeSize + 1);
                                    _tree[TreeSize] = new Node()
                                    {
                                        Char = key[i],
                                        MatchIndex = Count,
                                        Children = -1
                                    };
                                }
                                else // if key.Length < previousKey.Length
                                {
                                    Debug.Assert(key.Length < previousKey.Length);
                                    Debug.Assert(previousKey.StartsWith(key));
                                    node.ChildChar = previousKey[i];
                                    node.MatchIndex = Count;
                                    EnsureTreeCapacity(TreeSize + 1);
                                    _tree[TreeSize] = new Node()
                                    {
                                        Char = previousKey[i],
                                        MatchIndex = previousMatchIndex,
                                        Children = -1
                                    };
                                }
                                Count++;
                                TreeSize++;
                                return true;
                            }

                            // Insert two leaf nodes
                            Debug.Assert(node.Char != 0 && node.Char == previousKey[i - 1]);
                            Debug.Assert(node.MatchIndex == -1);
                            Debug.Assert(node.Children == -1);

                            node.ChildChar = previousKey[i];
                            node.Children = _childrenIndex;

                            EnsureChildrenCapacity(_childrenIndex + 2);
                            _children[_childrenIndex] = TreeSize + 1;
                            _childrenIndex += 2;

                            // Insert the two leaf nodes
                            EnsureTreeCapacity(TreeSize + 2);
                            _tree[TreeSize] = new Node()
                            {
                                Char = previousKey[i],
                                MatchIndex = previousMatchIndex,
                                Children = -1
                            };
                            _tree[TreeSize + 1] = new Node()
                            {
                                Char = key[i],
                                MatchIndex = Count,
                                Children = -1
                            };

                            Count++;
                            TreeSize += 2;
                            return true;
                        }
                        else
                        {
                            // This node has a child char, therefore we either don't have a match attached or that match is simply a prefix of the current key
                            Debug.Assert(node.MatchIndex == -1 || key.StartsWith(_matches[node.MatchIndex].Key));

                            // Set this pair as the current node's first element in the Children list
                            node.Children = _childrenIndex;
                            EnsureChildrenCapacity(_childrenIndex + 2);
                            _children[_childrenIndex] = TreeSize;
                            _childrenIndex += 2;

                            InsertLeafNode(in pair, c);
                            return true;
                        }
                    }
                    else
                    {
                        // Look for a child node with a matching Char in all of children
                        var children = _children;
                        int childrenIndex = node.Children;
                        int lastChildrenIndex = childrenIndex;
                        do
                        {
                            if ((uint)childrenIndex >= (uint)children.Length)
                                break;
                            node = ref _tree[children[childrenIndex]];
                            if (node.Char == c) goto NextChar;
                            lastChildrenIndex = childrenIndex;
                            childrenIndex = children[childrenIndex + 1];
                        }
                        while (true);

                        // A child node was not found, add a new one to children
                        EnsureChildrenCapacity(_childrenIndex + 2);
                        _children[lastChildrenIndex + 1] = _childrenIndex;
                        _children[_childrenIndex] = TreeSize;
                        _childrenIndex += 2;

                        InsertLeafNode(in pair, c);
                        return true;
                    }

                NextChar:;
                }

                // We have found our final node, check if a match already claimed this node
                if (node.MatchIndex != -1)
                {
                    ref KeyValuePair<string, TValue> previousMatch = ref _matches[node.MatchIndex];

                    // Either some other key is the leaf here, or the key is duplicated
                    if (previousMatch.Key.Length == key.Length)
                    {
                        Debug.Assert(previousMatch.Key == key);
                        goto HandleDuplicateKey;
                    }
                    else
                    {
                        // It's not a duplicate but shares key.Length characters, therefore it's longer
                        // This will never occur if the input was sorted
                        Debug.Assert(previousMatch.Key.Length > key.Length);
                        Debug.Assert(previousMatch.Key.StartsWith(key));
                        Debug.Assert(node.ChildChar == 0 && node.Children == -1);

                        // It is a leaf node
                        // Move the prevMatch one node inward
                        int previousMatchIndex = node.MatchIndex;
                        node.MatchIndex = Count;
                        node.ChildChar = previousMatch.Key[key.Length];
                        node.ChildIndex = TreeSize;
                        EnsureTreeCapacity(TreeSize + 1);
                        _tree[TreeSize] = new Node()
                        {
                            Char = previousMatch.Key[key.Length],
                            MatchIndex = previousMatchIndex,
                            Children = -1
                        };
                        TreeSize++;

                        // Set the pair as a match on this node
                    }
                }

                // Set the pair as a match on this node
                node.MatchIndex = Count; // This might be modifying a forgotten node reference, but in that case it was already set
                EnsureCapacity(Count + 1);
                _matches[Count] = pair;
                Count++;
                return true;

            HandleDuplicateKey:;
                Debug.Assert(key == _matches[node.MatchIndex].Key);
                if (behavior == InsertionBehavior.None) return false;
                if (behavior == InsertionBehavior.OverwriteExisting)
                {
                    _matches[node.MatchIndex] = pair;
                    return true;
                }
                Debug.Assert(behavior == InsertionBehavior.ThrowOnExisting);
                ThrowHelper.ThrowArgumentException(ExceptionArgument.key, ExceptionReason.DuplicateKey);
                Debug.Assert(false, "Should throw by now");
                return false;
            }
            else // if the root character is not yet in the collection
            {
                SetRootChar(rootChar);
                InsertLeafNode(in pair, rootChar);
                return true;
            }
        }
        private void InsertLeafNode(in KeyValuePair<string, TValue> pair, char nodeChar)
        {
            EnsureCapacity(Count + 1);
            _matches[Count] = pair;

            EnsureTreeCapacity(TreeSize + 1);
            _tree[TreeSize] = new Node()
            {
                Char = nodeChar,
                MatchIndex = Count,
                Children = -1
            };

            Count++;
            TreeSize++;
        }

        #endregion Insert internal

        #region TryMatch longest

        /// <summary>
        /// Tries to find the longest prefix of text, that is contained in this <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        /// <param name="text">The text in which to search for the prefix</param>
        /// <param name="match">The found prefix and the corresponding value</param>
        /// <returns>True if a match was found, false otherwise</returns>
        public bool TryMatchLongest(ReadOnlySpan<char> text, out KeyValuePair<string, TValue> match)
        {
            match = default;
            if (text.Length == 0 || !TryGetRoot(text[0], out int nodeIndex))
                return false;

            int matchIndex = -1;
            int depth = 1;

            ref Node node = ref _tree[nodeIndex];
            if (node.ChildChar == 0) goto LeafNodeFound;
            if (node.MatchIndex != -1) matchIndex = node.MatchIndex;

            for (int i = 1; i < text.Length; i++)
            {
                char c = text[i];

                if (node.ChildChar == c)
                {
                    node = ref _tree[node.ChildIndex];
                    goto NextChar;
                }

                var children = _children;
                int childrenIndex = node.Children;
                do
                {
                    if ((uint)childrenIndex >= (uint)children.Length)
                        goto Return;
                    node = ref _tree[children[childrenIndex]];
                    if (node.Char == c) goto NextChar;
                    childrenIndex = children[childrenIndex + 1];
                }
                while (true);

            NextChar:;
                depth++;
                if (node.ChildChar == 0) goto LeafNodeFound;
                if (node.MatchIndex != -1) matchIndex = node.MatchIndex;
            }
            // We have ran out of our string, return the longest match we've found
            goto Return;

        LeafNodeFound:;
            ref KeyValuePair<string, TValue> possibleMatch = ref _matches[node.MatchIndex];
            if (possibleMatch.Key.Length <= text.Length)
            {
                // Check that the rest of the strings match
                if (text.Slice(depth).StartsWith(possibleMatch.Key.AsSpan(depth), StringComparison.Ordinal))
                {
                    matchIndex = node.MatchIndex;
                }
            }

        Return:;
            if (matchIndex != -1)
            {
                match = _matches[matchIndex];
                return true;
            }
            return false;
        }

        #endregion TryMatch longest

        #region TryMatch exact

        /// <summary>
        /// Tries to find a prefix of text, that is contained in this <see cref="CompactPrefixTree{TValue}"/> and is exactly text.Length characters long
        /// </summary>
        /// <param name="text">The text in which to search for the prefix</param>
        /// <param name="match">The found prefix and the corresponding value</param>
        /// <returns>True if a match was found, false otherwise</returns>
        public bool TryMatchExact(ReadOnlySpan<char> text, out KeyValuePair<string, TValue> match)
        {
            match = default;
            if (text.Length == 0 || !TryGetRoot(text[0], out int nodeIndex))
                return false;

            int depth = 1;

            ref Node node = ref _tree[nodeIndex];
            if (node.ChildChar == 0) goto LeafNodeFound;
            if (node.MatchIndex != -1 && text.Length == 1)
            {
                match = _matches[node.MatchIndex];
                return true;
            }

            for (int i = 1; i < text.Length; i++)
            {
                char c = text[i];

                if (node.ChildChar == c)
                {
                    node = ref _tree[node.ChildIndex];
                    goto NextChar;
                }

                var children = _children;
                int childrenIndex = node.Children;
                do
                {
                    if ((uint)childrenIndex >= (uint)children.Length)
                        return false;
                    node = ref _tree[children[childrenIndex]];
                    if (node.Char == c) goto NextChar;
                    childrenIndex = children[childrenIndex + 1];
                }
                while (true);

            NextChar:;
                depth++;
                if (node.ChildChar == 0) goto LeafNodeFound;
            }

            if (node.MatchIndex == -1) return false;
            match = _matches[node.MatchIndex];
            Debug.Assert(match.Key.Length == text.Length);
            return true;

        LeafNodeFound:;
            match = _matches[node.MatchIndex];

            return match.Key.Length == text.Length &&
                text.Slice(depth).Equals(match.Key.AsSpan(depth), StringComparison.Ordinal);
        }

        #endregion TryMatch exact

        #region TryMatch shortest

        /// <summary>
        /// Tries to find the shortest prefix of text, that is contained in this <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        /// <param name="text">The text in which to search for the prefix</param>
        /// <param name="match">The found prefix and the corresponding value</param>
        /// <returns>True if a match was found, false otherwise</returns>
        public bool TryMatchShortest(ReadOnlySpan<char> text, out KeyValuePair<string, TValue> match)
        {
            match = default;
            if (text.Length == 0 || !TryGetRoot(text[0], out int nodeIndex))
                return false;

            ref Node node = ref _tree[nodeIndex];
            if (node.MatchIndex != -1)
            {
                match = _matches[node.MatchIndex];
                return true;
            }

            for (int i = 1; i < text.Length; i++)
            {
                char c = text[i];

                if (node.ChildChar == c)
                {
                    node = ref _tree[node.ChildIndex];
                    goto NextChar;
                }

                var children = _children;
                int childrenIndex = node.Children;
                do
                {
                    if ((uint)childrenIndex >= (uint)children.Length)
                        return false;
                    node = ref _tree[children[childrenIndex]];
                    if (node.Char == c) goto NextChar;
                    childrenIndex = children[childrenIndex + 1];
                }
                while (true);

            NextChar:;
                if (node.MatchIndex != -1)
                {
                    match = _matches[node.MatchIndex];
                    return true;
                }
            }
            Debug.Assert(node.MatchIndex == -1);
            return false;
        }

        #endregion TryMatch shortest

        #region Interface implementations

        /// <summary>
        /// Determines whether the <see cref="CompactPrefixTree{TValue}"/> contains the specified key
        /// </summary>
        /// <param name="key">The key to locate in this <see cref="CompactPrefixTree{TValue}"/></param>
        /// <returns>True if the key is contained in this PrefixTree, false otherwise.</returns>
        public bool ContainsKey(string key)
            => TryMatchExact(key.AsSpan(), out _);

        /// <summary>
        /// Gets the value associated with the specified key
        /// </summary>
        /// <param name="key">The key of the value to get</param>
        /// <param name="value">The value associated with the specified key</param>
        /// <returns>True if the key is contained in this PrefixTree, false otherwise.</returns>
        public bool TryGetValue(string key, out TValue value)
        {
            bool ret = TryMatchExact(key.AsSpan(), out KeyValuePair<string, TValue> match);
            value = match.Value;
            return ret;
        }

        /// <summary>
        /// Gets a collection containing the keys in this <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        public IEnumerable<string> Keys
        {
            get
            {
                for (int i = 0; i < Count; i++)
                    yield return _matches[i].Key;
            }
        }
        /// <summary>
        /// Gets a collection containing the values in this <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        public IEnumerable<TValue> Values
        {
            get
            {
                for (int i = 0; i < Count; i++)
                    yield return _matches[i].Value;
            }
        }

        /// <summary>
        /// Returns an Enumerator that iterates through the <see cref="CompactPrefixTree{TValue}"/>.
        /// <para>Use the index accessor instead (<see cref="this[int]"/>)</para>
        /// </summary>
        /// <returns></returns>
        public IEnumerator<KeyValuePair<string, TValue>> GetEnumerator() => new Enumerator(_matches);

        IEnumerator IEnumerable.GetEnumerator() => new Enumerator(_matches);

        /// <summary>
        /// Enumerates the elements of a <see cref="CompactPrefixTree{TValue}"/>
        /// </summary>
        public struct Enumerator : IEnumerator<KeyValuePair<string, TValue>>, IEnumerator
        {
            private readonly KeyValuePair<string, TValue>[] _matches;
            private int _index;

            internal Enumerator(KeyValuePair<string, TValue>[] matches)
            {
                _matches = matches;
                _index = -1;
            }

            /// <summary>
            /// Increments the internal index
            /// </summary>
            /// <returns>True if the index is less than the length of the internal array</returns>
            public bool MoveNext() => ++_index < _matches.Length;
            /// <summary>
            /// Gets the <see cref="KeyValuePair{TKey, TValue}"/> at the current position
            /// </summary>
            public KeyValuePair<string, TValue> Current => _matches[_index];
            object IEnumerator.Current => _matches[_index];

            /// <summary>
            /// Does nothing
            /// </summary>
            public void Dispose() { }

            /// <summary>
            /// Resets the internal index to the beginning of the array
            /// </summary>
            public void Reset()
            {
                _index = -1;
            }
        }

        #endregion Interface implementations
    }
}

redpajama_set_name: RedPajamaGithub


text:
6 Thought Leaders Share What's NOT on Their LinkedIn Profile [VIDEO]
Can you tell me something that's not on your LinkedIn profile?
It's a question that is posed to all new LinkedIn employees by our fearless leader & CEO Jeff Weiner: "Can you tell me something that's not on your LinkedIn profile?" It is a LinkedIn tradition of sorts, serving as a way to get to know new hires a bit better. The answers never fail to entertain - they range from special talents, rare allergies, to embarrassing first jobs and beyond. Two years ago, we asked 9 Content Marketing Thought Leaders Share What's NOT on Their LinkedIn Profile when we had the chance to catch them all in one place during Content Marketing World.
This year, I caught up with a new set of industry leaders at Social Media Marketing World 2015. We posed the same question, but received a new slew of interesting and fun answers. Check out the responses from:
Brian Clark, CEO Copyblogger Media
Tim Washer, Public Relations and Communications, Cisco Systems
Lynette Young, Director of Marketing, Mingl Marketing Group
Cathy McPhillips, Marketing Director, Content Marketing Institute
Andrea Vahl, Social Media Consultant, AndreaVahl.com
Brian Carter, Social Media Speaker, The Carter Group.
Then ask your co-workers the same. What's one thing that's not on your profile on the world's largest professional social network?
6 Thought Leaders Share What's NOT on Their LinkedIn Profile [VIDEO] from LinkedIn Marketing Solutions
Looking for more entertaining, insightful and inspiring content delivered to your inbox daily? Subscribe to our blog.
B2B Marketing Influencers
17x ROI? What Content Marketers Can Learn From NewsCred's Success on LinkedIn
Ask the Expert: Stephanie Sammons on Growing Influence on LinkedIn


text:
Q: Inherited ServletRquestAttributes is marked completed before child thread finishes in Spring Boot I am using SpringBoot 1.5.2 release. I have an asynchronous REST call that spawns separate java thread to finish a long running job. The long running job need to update DB tables, where I configured Spring auditing bean to update table with current login username. The issue i got is: After enabling inheritable flag by calling setThreadContextInheritable(true), the ServletRequestAttributes object passed down to the child thread which does the long running DB update was marked "inactive" before the child thread finishes its job, that ends up the error when auditing bean try to access the username from ServletRequestAttributes cached in RequestContextHolder.
To turn on inheritable flag, please refer to Scope 'session' is not active for the current thread; IllegalStateException: No thread-bound request found
Here is major code to get what i have so far:

*

*In Application.java
@Override
public Executor getAsyncExecutor() {
    SimpleAsyncTaskExecutor executor = new
        SimpleAsyncTaskExecutor(appProperties.threadNamePrefix);
    return executor;
}
@Bean
public ServletRegistrationBean registerAirportDispatchServlet() {
    DispatcherServlet dispatcherServlet = new DispatcherServlet();
    AnnotationConfigWebApplicationContext applicationContext =
        new AnnotationConfigWebApplicationContext();
    dispatcherServlet.setApplicationContext(applicationContext);
    dispatcherServlet.setThreadContextInheritable(true);
    ServletRegistrationBean servletRegistrationBean =
        new ServletRegistrationBean(dispatcherServlet, "/*");
    servletRegistrationBean.setName("AirportSCSDispacherServlet");
    return servletRegistrationBean;
}
@Bean
@Scope(scopeName = WebApplicationContext.SCOPE_REQUEST, proxyMode = ScopedProxyMode.TARGET_CLASS)
public AccessToken getAccessToken() {
    RequestAttributes attribs =
        RequestContextHolder.getRequestAttributes();
    //do something with the attribs here...
    return token;
}

Yes, i have to register my DispatcherServlet and set flag there instead of using RequestContextFilter and RequestContextListener because down the path of request filtering, DispatcherServlet set inheritable flag to false which will overwrite true flag set from RequestContextFilter and RequestContextListener earlier of chain.
From debugging, i can tell inside the method processRequest() of FrameworkServlet which is super class of DispatcherServlet, it calls requestAttributes.requestCompleted(); at line 989, and this requestAttributes object is saved in RequestContextHolder as inherited attributes for newly spawned thread, when the new thread try to get this attributes for AccessToken, Spring framework throws error because it is marked as inactive. I have tried SESSION scope, it did not work since my REST call is not in session, i am using Keycloak for authentication, so the request attributes contains string access token in it.
I am asking here: is there better anyway that i can keep this inherited request attributes object still active?

A: I got struck with the exact same problem. My application is starting an asynchronous thread and after that sending http response back to client immediately. As i have already sent response by the time i try to get attributes in async thread, the requestActive field is false. That is the reason for this error. We can't set the requestActive field externally. Spring will handle this field according to the http request status.


in one hand a net or two in the other and coming back with a feed of delicious blue claw yabbies.
be you snacking on these delicious morsels.
Starting with one male and female in a 1000m2 dam is pointless as they are never likely to ever meet up again.
The common method for growing yabbies in farm dams is referred to as extensive farming.
Extensive farming is where the only food source is what washes in or occurs naturally in your dam.
The recommended minimum stocking density on an extensive method basis is 1 yabby per 10 square metres, or 100 yabbies which ever is greater.
often you want to feast on this delicacy.
Another method of farming is known as semi intensive.
stocking density to 1 yabby per 5 square metres.
As an example commercial farmers of yabbies feeding 3 or 4 times a week would tend to stock at a density of 2-3 yabbies per square metre.
develop an angry streak from having to fight for available for food.


text:
Richard Hamilton Biography
By Kentucky Kindred Genealogical Research on November 25, 2012 • ( Leave a comment )
Alexander Hamilton and wives: Harriett Edelen, Theresa Jarboe, Elizabeth S. Smith and Lucinda Hayden. Alexander and Harriett are the parents of Richard Hamilton.
from Kentucky Genealogy and Biography, Volume V
Richard Hamilton, son of Alexander and Harriett (Edelen) Hamilton, was born in Washington County, Kentucky, December 29, 1811. His grandfather, Thomas Hamilton, was a native of Maryland, and one of the earliest pioneers of Washington County. He settled about five and one-half miles northwest of Springfield and was resident of his adopted county until his death, which occurred many years ago. Alexander Hamilton was born in Maryland, but was brought to Kentucky when a small boy, and passed the remainder of his life in Washington County. He was a successful farmer, accumulated a large estate, and died in 1878 at the advanced age of ninety-one years. His wife, Harriett Hamilton, was born in Kentucky and died a number of years ago. She was the mother of six children, only one of whom is now living, Thomas G. Hamilton. Richard Hamilton was reared a farmer, and received a good education in the country schools and St. Mary's College. He began life as a teacher, which profession he followed a short time near Fredericktown, and later was elected magistrate, which position he held for several years. He was deputy sheriff under his father for some time, and later was elected sheriff. He acquired the reputation of being one of the most skillful businessmen in the county, and his services were constantly in demand, settling estates, etc. He engaged in farming in 1869 near Fredericktown village, which vocation he followed until his death, February 20, 1883. He was married August 1, 1876, to Mrs. Sallie J. Thompson, widow of John C. Thompson, and daughter of Stith and Catherine (McIlvoy) Thompson, by whom he had three children: A. Richard, Mary S. and S. Thomas. Mrs. Sallie J. Hamilton was born August 14, 1841, and is the fourth of a family of seven children. Her father, Stith Thompson, was the son of John Thompson. He was born November 5, 1805, and is still living in Washington, his native county. Catherine (McIlvoy) Thompson, daughter of Alexander and Magdalene McIlvoy, was born in Ireland on the 15th of August, 1811. Her parents came to America in 1818, and settled near the village of Mackville, Washington County, where the father died in 1863, at the age of ninety-three years. The mother died in 1846. The children of Stith and Catherine Thompson were the following: Alexander, William R., John M., Sallie J., Maggie, Rosa and Daniel M. Thompson. Sallie J. Thompson was married February 10, 1867, to John C. Thompson, by whom she had three children, namely: Peter J., Simeon A. and John C., all living. John C. Thompson, Sr., son of Thomas and Susan (Blandford) Thompson, was born in Washington County on the 25th of March, 1825. He was a farmer by occupation, a successful trader, and resided nearly all his life near the village of Fredericktown. He was twice married, the first time on the 22nd of October, 1861, to Miss Maggie Thompson, by whom he had two children: Alexander and Thomas. Mrs. Maggie Thompson died April 19, 1866, aged twenty-two years. His second marriage to Sallie J. Thompson, sister of former wife, has already been alluded to.
Tagged as: Alexander Hamilton, Alexander McIlvoy, biographies, Catherine McIlvoy, family, genealogy research, Hamilton Surname, Harriett Edelen, Kentucky Kindred Genealogy, Maryland, Richard Hamilton, Sallie J. Thompson, St. Mary's College, Stith Thompson, Susan Blandford, Thomas Hamilton, Thompson Surname, Washington County Kentucky
Today In Genealogy History – November 25, 2012


text:
Q: Building a connection string from a user's input in a WPF application If we want in our WPF application to let a user make a SQL Server db connection settings through dialog window, what approach we should use in implementing this.
Should we programmatically make changes to the app.config file? Or, some another approach exists? Or, maybe, in WPF there is  some prebuilt tools for doing this?

A: You could always use one of the built-in dialogs. There is an ADODB connection dialog that requires COM interop. There's also one that has a dependency on a Visual Studio DLL.
But Microsoft has also released the source code to the standard connection dialog available on Code Gallery.
As far as storing the connection string, I would avoid assuming you can write to the App.config unless your application is being installed on a per-user basis. Instead I would store it as a user-scoped setting. If you will allow the user to store the password in the connection string, you should first encrypt the string using the ProtectedData class. Note that you should probably use the per-user scope when encrypting.

A: Regardless of how you build the connection string, it needs to get into your config file which is supported by ConfigurationManager as long as the user has rights to save the config file in the location where it's being installed.


text:
The Terror Review.
Sep 02, 2018 by Joseph Blode and Julian Romero	in Entertainment
Aw shit we're going old school boys. This movie actually has a rather interesting history, after filming the 1963 movie "The Raven," a few days earlier than scheduled, Roger Corman decided to try and make a new film in the short amount of time he could, with all the same actors props and sets. Every single scene with Boris Karloff was filmed in just four days, and he stars in a rather large chunk of the movie. Almost all of the movie was improvised, and the whole process only took 9 months from beginning to end, most of it being post production. The end result is, "The Terror." Does the 9 month production time show? You bet your ass it does
The film starts with Boris Karloff sneaking around through his castle, when suddenly he opens a door and BOOM skeleton! Anyways moving past that scene that is never referenced again, the film starts with Jack Nicholson, in one of his earliest film acting roles, riding down a beach as a soldier. He looks at a compass that is very clearly not working, throws it to the ground, then falls off his horse due to, I assume heat stroke.
After waking up he sees a very beautiful lady just kinda, standing there. He goes over and tries to flirt with her before asking for some water, explaining he's a soldier who got lost from his regiment on the way to poland from france. She gives him some water in a weird cave, before walking right off into the ocean to drown. Jack tries to save her, but gets distracted with punching a bird, before almost drowning.
He wakes up again, this time in the shack of an old woman, who nurses him back to health before pointing him in the direction of a baron's castle he could go to for shelter for the night. I guess she's just a bitch and doesn't want him staying there. He goes off to the castle, gets acquainted with the baron, played by Boris Karloff, and he allows him and his horse to rest there. However, he notices a painting of the lady he met at the beach that doesn't look anything like the lady at the beach, and he starts to be suspicious.
His suspicion rises the next day, however, when he finds out that his horse has mysteriously gone missing! The butler, the only man in the castle aside from the baron, tells him he'll have to wait while he gets him a new horse from the nearest town. Jack does some more sleuthing around, he finds that the painting of the lady is gone, and has been moved to some secret remote area of the castle. Jack decides to start questioning what Boris knows about the lady. Boris explains that when he was younger he was engaged to a woman, but found her in bed with another man, so he killed them both. But, what about the lady at the beach? Well for answers stay tuned, because we're gonna talk about something else now for a bit.
As terrible as the movie is, it at least has characters that actually do progress, at least a little bit, but honestly I think that just has to do with the acting, again most of it was improvised. Boris Karloff is great in his role as an old man who is slowly going insane, Jack is also great, slowly getting angrier and angrier as the film goes on, trying to find out what the hell is going on.
However, everyone else is clearly just phoning it in. No one seems to be giving it their all in any part of this film. The acting is, alright I guess, at least for the time, but as for characters themselves, none of the other actors really have one, they more have, roles that they fit into, if I had to put a word to it. They're just going through the motions, not changing or progressing, but hey at least we got Boris and Jack.
After getting a new horse, Jack decides to just get the hell outta there before anything else weird happens. But before he can something else weird happens. He notices the butler getting attacked by the same bird he tried to punch, and he falls off a fucking cliff onto rocky ocean land below!
Some fucking how he's not only alive, but not really that beaten up, as him and Jack decide to go to the old woman, who apparently owns the bird. She finally spills the beans that she's actually conjured up the spirit of the barons fiance in order to drive him to suicide for revenge of killing her son, Eric, who was the one cucking the baron. However, plot twist in 3, 2, 1, the Boris isn't the baron! Apparently Eric killed the baron and the lady he was sleeping with, then somehow got it in his head that he was the baron. This is told to us by the butler, who was apparently around also, jeeze how many people were cucking the baron?
Anyways, they all realize that Eric is about to kill himself in the crypt below the castle by flooding it with water, so everyone runs off to try and stop him. However in the scuffle, the old woman gets struck by a bolt of lightning and catches on fucking fire! This, by the way, is the worst struck by lightning then caught on fire effect I have ever seen, it tops troll 2! Anyways Jack and the butler try to save the baron, fail, and instead Jack carries out the, spirit of the lady, who he then sits down next to a rock, kisses, then she decays into a skeleton. The end! WHAT THE FUCK WAS THAT.
Man this film was bad, like even on a technical side! I don't know if its just the version we watched, but for some reason the audio just kept cutting out, for up to 3 minutes sometimes! That being said though it is rather funny sometimes, with how clearly shotty the production was, but it was also really fucking boring for most of the film. So, I guess if you wanna find those few really funny moments through the mostly boring swamp that is this film, I guess give it a try, but to everyone else, stay faaar away.
Tagged with: Review, The terror


Forensic anthropologist Tempe Brennan investigates the death of a man who appears to have died while engaged in a bizarre sexual act and who was originally declared dead four decades earlier.
John Lowery was declared dead in 1968--the victim of a Huey crash in Vietnam. Four decades later, Temperance Brennan is called to the scene of a drowning in Quebec. The victim appears to have died while in the midst of a bizarre sexual practice. The corpse is later identified as John Lowery. But how could Lowery have died twice? Taking the remains to JPAC in Hawaii for reanalysis, Tempe is joined by her colleague and ex-lover Detective Andrew Ryan (how "ex" is he?) and by her daughter, recovering from her own tragic loss. Soon another set of remains is located, with Lowery's dog tags tangled among them. Three bodies--all identified as Lowery.--From publisher description.
Really could not get into this one. It went into too much nebulous historical and anatomical detail. As another reader said, I just didn't care. Too many dead characters and various body parts to keep track of. Her books are usually better than this. Won't try again for a while.
The living characters I had no trouble keeping track of, but when it came to the dead ones I was a bit confused. The twists and turns seemed a little more predictable in this book, but I still love the lady.
For anyone who just can't get into the Kathy Reichs series I have to say that I didn't like her Temperance Brennan books when I picked up the first one a few years ago. Now I'm hooked. So maybe try again later.
My first go at a Kathy Reichs book. Not impressed - the writing is flat and kind of obvious. I was getting bored and put the book down for a few days, then tried picking it up again, but by then I couldn't keep track of all the details, and simply didn't care about it enough to finish reading it. But, I really love the "Bones" TV series - which she doesn't write!
In this book Kathy Reichs deals with servicemen and women who are MIA and details how their remains are processed to find out who they are and give their families closure. That said she weaves a good tale involving a new notion of a Chimera who can hold DNA which differs from the norm.
I really enjoyed this entry in Reichs' series. Her previous novel I found very "preachy" and obvious. This one was nothing like that. I found the information about the ongoing search for soldiers who are M.I.A. very interesting, and the storyline absorbing. Of course it didn't hurt that the story takes place in Hawaii, one of my favourite places! It did make for a nice change from the usual locations of Quebec or the Carolinas. Would definitely recommend this one both to loyal readers and to new ones.
A word of warning: for those to this series, the Tempe Brennan in the books is NOT the same as the Tempe Brennan in the Fox TV show "Bones".
Really enjoyed this book. Adventure, suspense, mystery & romance. If you've ever been to the Hawaiian Island of Oahu, you'll love this book even more.
An interesting read; but at times it is hard to follow all the intricacies and all the names introduced. One needs to read Kathy Reich's books in perhaps five days or less not over a three week period where you may lose track of all the directions her books take you. Senior Doctor-at Bass! D. A.