text:
State Tectonics
The Centenal Cycle (Volume 3)
Malka Older
10:28:0
Campbell Award finalist Malka Older's State Tectonics concludes The Centenal Cycle, the cyberpunk poltical thriller series that began with Infomocracy.
The future of democracy must evolve or die.
The last time Information held an election, a global network outage, two counts of sabotage by major world governments, and a devastating earthquake almost shook micro-democracy apart. Five years later, it's time to vote again, and the system that has ensured global peace for 25 years is more vulnerable than ever.
Unknown enemies are attacking Information's network infrastructure. Spies, former superpowers, and revolutionaries sharpen their knives in the shadows. And Information's best agents question whether the data monopoly they've served all their lives is worth saving, or whether it's time to burn the world down and start anew.
The Centenal Cycle
#1 Infomocracy
#2 Null States
#3 State Tectonics
Kirkus Reviews Best Books of the Year
The Dhaka street swarms with people, objects, and all of the existing data about all of these people and objects. Maryam, who of all people should be accustomed to words and numbers floating in front of her eyes, finds herself...
Praise for State Tectonics
PRAISE FOR NULL STATES
"Subtly radical (except where it's openly radical), this book and series continues to offer a kinetically involving narrative that can also make you think about our actual world today." —RT Book Reviews on Null States, Top Pick (4.5 Stars)
"Carefully researched, prescient, thoughtful, and disturbing." —Kirkus Reviews on Null States
"Seriously inspirational for people who are genuinely involved in inventing the future." — Craig Newmark, founder of CraigsList
"A riveting science fiction thriller that brings the future of democracy to vivid, divisive life... a hell of a good story." —The Chicago Review of Books
"Subtly radical (except where it's openly radical), this book and series continues to offer a kinetically involving narrative that can also make you think about our actual world today." —RT Book Reviews, Top Pick (4.5 Stars)
PRAISE FOR INFOMOCRACY
"Kinetic and gripping, the plot hurtles toward an electoral climax that leaps off the page." —NPR
"Futurists and politics geeks will love this unreservedly." —The New York Times Book Review
"This brilliant book is unquestionably one of the greatest literary debuts in recent history." —The Huffington Post
"A futuristic world with eerie parallels to current events... [an] uncanny political thriller." —The Washington Post
"Smart, ambitious, bursting with provocative extrapolations, Infomocracy is the big-data-big-ideas-techno-analytical-microdemoglobal-post-everything political thriller w… More…
"Smart, ambitious, bursting with provocative extrapolations, Infomocracy is the big-data-big-ideas-techno-analytical-microdemoglobal-post-everything political thriller we've been waiting for." —Ken Liu, author of The Grace of Kings
"A fast-paced, post-cyberpunk political thriller... If you always wanted to put The West Wing in a particle accelerator with Snow Crash to see what would happen, read this book." —Max Gladstone, author of the Craft Sequence
"A frighteningly relevant exploration of how the flow of information can manipulate public opinion...timely and perhaps timeless." —Kirkus Reviews starred review
"Older's sparkling debut, the first full-length novel from the novella-focused Tor.com imprint, serves as both a callback to classic futurist adventure tales by the likes of Brunner and Bester and a current examination of the power of information." —Publishers Weekly
"In the mid-21st century, your biggest threat isn't Artificial Intelligence—it's other people. Yet the passionate, partisan, political and ultimately fallible men and women fighting for their beliefs are also Infomocracy's greatest hope. An inspiring book about what we frail humans could still achieve, if we learn to work together." —Karl Schroeder, author of Lockstep and the Virga saga
MALKA OLDER is a Campbell Award finalist, humanitarian worker, and PhD candidate studying governance and disasters. She has more than eight years of experience in humanitarian aid and development, and has responded to complex emergencies and natural disasters in Uganda, Darfur, Indonesia, Japan, and Mali. Her debut novel was 2016's Infomocracy.
MORE BLOG POSTS →
Tweetsby @tordotcom
Tweetsby @MacmillanAudio


For a very brief period of time I worked at Barnes and Noble. And while I loved the store, generally liked the people I worked with (even my bosses), and really enjoyed the discount, I had a hard time with the job.
No, it's not a start of a joke, there is no punch line.
I went to a Reiki healer the other day to clear some of the blockages and negativity that had manifested within me over the course of the summer, as mentioned in the previous post. I wanted to enter this next era of my life as being a committed writer with clarity, openness to creativity, and positive energy.
Before I go on, I should probably address what a Reiki healer is and what a reiki treatment does exactly.


Steven Zimmerman ; Husband, Father, Friend, Volunteer Football Coach & Actively Licensed Realtor ABR GRI e.Certified with Belloise Tropical Realty Lives-in, Markets & Sells Florida's [all-year] Waterfront Lifestyle from within his unique Coastal Family & Boaters Friendly Community; GULF HARBORS on the Gulf of Mexico.
Steven, born and raised in Tenafly, New Jersey, until moving to Florida in 1983, is Married [with his lovely Mary for over 29 years, who he met on the Sand of Florida's Hollywood Beach], together they have one Teen Son, Tyler, a 6x All American Scholar-Athlete.
Steven's work ethics are a culmination of growing up in a Family-owned North Jersey Retail environment [Marcia's] and working in conjunction with two of South Florida's Premier Waterfront Developers for over a decade.
Relocating to the Gulf Coast in 2000, Steven has been a driving force within his Coastal Community, Developer's Representative from 2000 to 2010 and Multi-Million Dollar & Top Sales Associate.
Steven is active in and a proud supporter of his Son's Education as well as his many Sports interests, including being a 4th year Volunteer Coach for their local Pop Warner West Pasco Prowlers Tackle Football Team.
You can speak directly with Steven anytime between 10am and midnight [Eastern-Standard] or contact him on-line or by text or e-mail from 8am to 1am at (727) 534-3226 / Steve@SteveZimmerman.com / BB Pin # 332B0BAF.


text:
Antwerp Symphony Orchestra & Olari Elts – Kalevi Aho: Double & Triple Concertos (2021) [Official Digital Download 24bit/96kHz]
Antwerp Symphony Orchestra & Olari Elts – Kalevi Aho: Double & Triple Concertos (2021)
FLAC (tracks) 24bit/96kHz | Time – 00:59:06 minutes | 1010 MB | Genre: Classical
Studio Masters, Official Digital Download | Digital Booklet, Front Cover | © BIS
Concertos for cor anglais are few and far between, and harp concertos aren't very common either. In combining the two, Kalevi Aho has come up with a true rarity – possibly the only double concerto in existence for these two instruments. Composed in 2014, the work was commissioned by the Antwerp Symphony Orchestra for two of its solo players: Anneleen Lenaerts and Dimitri Mestdag, who also perform it here. The work is characteristically eclectic, making the most of the sonic possibilities of the solo instruments, but also of the orchestral palette.
The Antwerp Symphony Orchestra is no newcomer to Aho's music, having previously recorded his concertos for trombone and trumpet. Here, it also provides support for the Storioni Trio, in the Triple Concerto for Violin, Cello, Piano and Chamber Orchestra, a joint commission by the trio and the orchestra. In 2017, as Aho started work on the concerto, his granddaughter was born. Having written a lullaby for her, he decided to use that as the core melodic material of the piece. The lullaby is heard several times in the first movement, which is quite tonal and very dreamlike. It also features in the movements that follow, while the harmonic language becomes more complex. Aho himself describes the work as having "a general atmosphere full of joy and positive (sometimes quite virtuosic) energy".
1. Dimitri Mestdag, Anneleen Lenaerts, Antwerp Symphony Orchestra & Olari Elts – Double Concerto for Cor anglais, Harp & Orchestra: I.  — (13:45)
2. Dimitri Mestdag, Anneleen Lenaerts, Antwerp Symphony Orchestra & Olari Elts – Double Concerto for Cor anglais, Harp & Orchestra: II. Cadenza (02:11)
3. Dimitri Mestdag, Anneleen Lenaerts, Antwerp Symphony Orchestra & Olari Elts – Double Concerto for Cor anglais, Harp & Orchestra: III. Allegro (06:35)
4. Dimitri Mestdag, Anneleen Lenaerts, Antwerp Symphony Orchestra & Olari Elts – Double Concerto for Cor anglais, Harp & Orchestra: IV. Adagio (05:42)
5. Storioni Trio, Antwerp Symphony Orchestra & Olari Elts – Triple Concerto for Violin, Cello, Piano & Chamber Orchestra: I. Lullaby (05:07)
6. Storioni Trio, Antwerp Symphony Orchestra & Olari Elts – Triple Concerto for Violin, Cello, Piano & Chamber Orchestra: II. Presto (06:28)
7. Storioni Trio, Antwerp Symphony Orchestra & Olari Elts – Triple Concerto for Violin, Cello, Piano & Chamber Orchestra: III. Tranquillo, misterioso (09:48)
8. Storioni Trio, Antwerp Symphony Orchestra & Olari Elts – Triple Concerto for Violin, Cello, Piano & Chamber Orchestra: IV. Andante – Allegro molto (09:30)
https://subyshare.com/8f5g389ta64i/AntwerpSymph0ny0rchestra0lariEltsKaleviAh0D0ubleTripleC0ncert0s20212496.part1.rar.html
https://subyshare.com/yt7yn3qt5ssf/AntwerpSymph0ny0rchestra0lariEltsKaleviAh0D0ubleTripleC0ncert0s20212496.part2.rar.html
Dimitri Mestdag
Previous Post Anna Pasetti – De Marin 3 Sonatas, Op. 15 (2018) [Official Digital Download 24bit/88,2kHz]
Next Post Apollo5 – A Deep but Dazzling Darkness (2021) [Official Digital Download 24bit/96kHz]

redpajama_set_name: RedPajamaCommonCrawl


text:
De TAZARA (afkorting voor Tanzania-Zambia Railway) is een spoorlijn tussen Kapiri Mposhi in Zambia en Dar es Salaam in Tanzania. In Kapiri Mposhi sluit de spoorlijn aan op de spoorlijn Lusaka–Kitwe.

De overeenkomsten over de bouw van deze spoorweg werden eind 1967 getekend in de Chinese Volksrepublieke hoofdstad Beijing. De TAZARA werd geopend in 1976 als exportroute voor Zambiaans kopererts. De aanleg werd om politieke redenen gefinancierd door de Volksrepubliek China; de spoorlijn werd aangelegd omdat de exportroutes tot dan toe via Rhodesië en Zuid-Afrika liepen. Zowel Rhodesië als Zuid-Afrika hadden destijds een blank minderheidsbewind, waar Zambia een tegenstander van was. De financiering door communistisch China paste in het wereldbeeld van dictator Mao Zedong om alle arme landen te vrijwaren van imperialisme en elkaar als onderontwikkelde landen te helpen. De bouw van de spoorlijn zorgde ook voor dat steeds meer Afrikaanse landen de Volksrepubliek China zagen als een goede vriend. Hierdoor werd begin jaren 70 een resolutie in de Verenigde Naties aangenomen waardoor Republiek China haar zetel in de Veiligheidsraad moest opgeven ten bate van de Volksrepubliek. Bij de stemming was een meerderheid doordat hierbij veel meer Afrikaanse landen voor de resolutie stemden.

De TAZARA is 1860 km lang en is uitgevoerd met een spoorbreedte van 1067 mm (het zogenaamde Kaapspoor). Deze spoorbreedte wordt gebruikt in Zambia, Zimbabwe, Botswana, Namibië en Zuid-Afrika, maar niet in Tanzania. Tanzania gebruikt meterspoor. Op twee plaatsen in Tanzania kunnen goederen overgeladen worden van het Kaapspoor naar het meterspoor: in Dar-Es-Salaam en in Kidatu. De TAZARA is voor Afrikaanse begrippen betrouwbaar, hoewel het traject in de regentijd regelmatig door aardverschuivingen geblokkeerd raakt.

De TAZARA wordt niet intensief gebruikt: de Zuid-Afrikaanse havens zijn efficiënter dan Dar-es-Salaam. Naast het goederenvervoer rijdt er tweemaal per week een reizigerstrein.

Spoorweg
Verkeer en vervoer in Tanzania
Verkeer en vervoer in Zambia

redpajama_set_name: RedPajamaWikipedia


It was only around five years ago that Jasmeet Singh, then a bored summer school student living in Guelph (Ontario, Canada), posted his first YouTube video.
Since then, his on-point commentary on race, his parodies of pop culture and his comedic deadpan have earned him a significant following: 425,000 subscribers on YouTube and another 780,000 on Vine, where his six-second videos have been looped almost half a billion times.
Jasmeet Singh, better known on the internet as JusReign, uses nearly every social media platform in existence to rant, criticize, and crack jokes -- often at the expense of white people who can't tell a turban from a niqab.
We talked with him about racism, turbans and making a living on the internet.
Q: How did Jasmeet Singh become Jus Reign?
A [Jasmeet Singh]: I was in university, and I was doing summer school and I was really bored. I used to make a lot of short films and sketches in high school, so I decided to make a YouTube account. I was 19 when I made my first video, "25 Random Things in my Room." I started doing more and more content, and it just started spreading.
Q: What was the first one to go viral?
Q: What does that name even mean?
A: I got this name when I was like 14. I used to DJ, mixing hip hop with Punjabi music. My name was DJ Double Edge. But there was another DJ Double Edge in Toronto, a Jamaican DJ. He hit me up on MSN and was like, "Hey boy, you can't have that name." My cousin suggested Jus Reign, like I was going to reign over everybody. I never called myself Jus Reign -- it was the name of my channel. But then people started calling me that, and it just stuck.
Q: Isn't it weird to still have an alias that you used when you were 14?
A: Yeah, it's kind of a silly name. But now it's just there. I don't even think about it.
Q: You grew up in Guelph. What was that like?
A: That was an interesting experience, because I was the only brown kid.
Q: And did your humour help you deal with standing out like that?
A: Yeah. I think after 9/11, there was a sense of mistaken identity. My parents are from Punjab; we're Sikh. We have nothing to do with the Middle East -- not to bash the Middle East. So everybody thought I was Osama's nephew or something, and I just had to deal with that. My way of brushing it off and fitting in, of deflecting negativity that was thrown my way, was to be funny. I remember being cornered and joking my way out of fights. Even to this day, I've joked my way out of fights by making the other person look silly.
Q: You do some pretty harsh impersonations of Indian parents. What do your Sikh parents make of that?
A: When they first saw it, they hated it. I was pursuing being a doctor, because that was what my parents wanted me to be. I started doing these sketches, and they didn't know about them. I just didn't tell them. Within South Asian culture, it's still frowned upon to be in the arts. It's either a doctor, an engineer or a lawyer -- that's all they want you to be. I actually wanted to go to film school, but my parents didn't approve of that. The turnaround came when other parents came up to my parents with their approval, and then the money started coming in, so right now they're supportive.
Q: So is YouTube a full-time job for you now?
A: Yeah. But a lot of YouTubers, like myself, have different streams of revenue. There's merchandise, there are shows. I did a couple movies this year, including one in India. I'm one of the leads, and it was all because of YouTube. I love doing standup, and I eventually want to transition to that.
Q: What's your YouTube process like?
A: I like to incorporate skits within my rants. Some people just do rants so they can upload quickly. Usually I'll come up with an idea, and I'll write a script, and I have a group of friends and I put them in my skits. It's kind of turned into a mini TV show online. For a skit, I'll write a loose script, and when we're shooting it, we'll improv a lot. It takes about a week. A few days of filming and a few days of editing.
Q: And then there's Vine, which seems like a pretty ideal vehicle for your type of humour.
A: Vines I try to do every day. Vine is a totally different world. People think making a Vine is easy, but you have to capture someone's attention in six seconds. Vine was something that got my content to another level.
Q: The Bindi-Zit one is pretty good.
A: I had to shoot a video that day, and the zit was huge, massive. But it's like when I deal with racism: I like to take something bad and turn it into comedy. Never take yourself too seriously. So I had this huge zit on my forehead, and I could either sulk about it or just turn it into something totally hilarious. So I turned it into my dad being mad about this zit.
Q: You spend a lot of time talking about racism. What did you make of the recent mayoral election?
A: I remember that Olivia Chow cartoon. I'm not surprised because as much as I'd like to say that racism doesn't exist, it does. I see it when I'm in public. There are certain places where I go and I'll get stared at. It's something I'm accustomed to. People will come up to me and say, "Oh man, I never knew an Arab guy could be so funny. You guys are all Al-Qaeda and stuff, but it's so great." It's like going up to an Irish guy and saying, "Man, I love Italians." I think it's going to be there always, and I think that the best way to counter that is through entertainment.
Q: In an ideal world how would people get along?
A: I think we should embrace our differences. It's all about your intentions. People who are racist want to bring others down -- that's different than joking around with your friends. I have friends from all different backgrounds, and we joke about our cultures and our differences and how we act. And there are different levels of racism. I always bring this back to 9/11, because after that the only depiction of brown people was with Al-Qaeda and the Taliban, and the only depiction of a turban was like Osama and his crew sitting in a cave.
Ninety-nine per cent of people who wear turbans are Sikhs, and we're from Punjab. I don't think any news organizations did a good job of differentiating who's who. And I don't think it's getting any better with Charlie Hebdo in France. Don't be scared of a turban. We're normal people.
Then there's a contingent of people who think that if you ignore racism it'll go away.
Yeah, and there's also oversensitivity about racism. I don't want people to be scared to ask me questions. If you ask me if you can touch my turban, yeah, go ahead and touch my turban. It's better than having restrictions and feeling uncomfortable. I want people to feel comfortable.
Q: So you don't actually mind when someone asks you if you take your turban off when you go to the bathroom?
A: Well, that's hilarious. If you're going to ask me how I wash my hair with my turban on -- these are common sense questions. It's 2015. Everything you need to know about life is on the Internet. Sometimes I think people choose to be ignorant or racist. If you see someone wearing a hat, or a dress, or a turban, it's all the same.
Q: In your "Bounce" video, there are some pretty complicated dance moves. How did the choreography work?
A: It's just weird, lightly Punjabi dancing. As soon as I heard the song in that's used in the video, I saw myself dancing in my head. In the comments, people have written like university-level essays about what they think the video means.
Q: I have to ask: what do you keep in your turban?
A: Ten grenades, plastic explosives and a plane. The Malaysia Airlines plane that went missing is actually in here.
1: Harinder Singh (Punjab), January 30, 2015, 6:12 PM.
Tussi great ho, Bha ji.
2: Baldev Singh (Bradford, United Kingdom), January 30, 2015, 9:29 PM.
3: Sunny Grewal (Abbotsford, British Columbia, Canada), January 30, 2015, 10:33 PM.
This is the man who coined the term 'Drunkle'. A drunk uncle. Ha-Ha-Ha!
The Phenomenon of Jasmeet Singh"


text:
by Ryan Schreiber
listen on Pitchfork
Gauntlet Hair
"I Was Thinking..."
And the Worst Bandname of the Week award goes to... these guys! I don't know what Gauntlet Hair is, but it sounds like something people used to get diagnosed with in the 1820s when the docs were more creative. Not a big deal-- hey, you'll remember it. What matters is that "I Was Thinking..." is a delirious, fire-spewing stomper from this Denver-based avant-pop duo affiliated with Rhinoceropolis, the Denver DIY space which local heroes Pictureplane and Hollagramz call home.
The song's central figure is a hyper-rhythmic guitar that repeatedly slides up, then snaps like a rubberband into starbursts of perfect chordness. You might also enjoy the firecracker-loud handclaps, trunk-rattling bass hits, and battle-cry shoutsinging. Whoever mixed this thing is-- to steal a phrase from my Pitchfork penpal Joe Tangari-- definitely a soldier in the loudness war. But at the song's center is an unstoppable melodic heart that beats like it just ran an Alaskan winter mile in short-shorts, and all you want to do is douse that fucker in Gatorade when it breaks through the finish line.


Our client, a key player in its chosen field with a fantastic reputation, is looking to source an immediately available Italian Speaking Credit Controller to join its talented team on an initial 12 months contract basis with great potential for the role to go perm.
The successful candidate will be immediately available and have an outgoing and confident approach as interaction between the credit control team and sales teams is necessary. You will be an experienced Credit Controller and have the ability to work for fast paced organisation. You must speak Italian fluently.
You will have the ability to establish and maintain good client relationships, both internally and externally at all levels.


Shortwave Radiation: solar radiation. Solar radiation comes either directly from the sun, or indirectly via scattering in the earth atmosphere. The spectral range of solar radiation extends from 0,1 to 30 μm, with 0,3 to 3,5 μm containing the most of the energy.
Electromagnetic waves of solar radiation are much shorter and thus have a higher energy than thermal radiation. That is why they are called short- (solar) and long wave (thermal) radiation.


text:
Arnold Langemann, auch Arnoldus Langemann, später Arnoldus Macrander, (* um 1566 in Mengeringhausen; † 15. März 1620 in Peckelsheim) war Sekretär, Kammermeister und Ratsherr des Grafen von Waldeck.

Leben

Arnold Langemann studierte in Wittenberg, genannt als "Waldeccus Westvalus" (1586), war 1589 Sekretär des (Fürst)bischofs von Osnabrück Bernhard von Waldeck, Sekretär der Waldeck-Eisenbergischen Linie (1591), Rektor der Schule zu Mengeringhausen (1593), Sekretär und Kammermeister des Grafen von Waldeck-Wildungen, Ratsherr der Gräfin-Witwe Margarethe von Waldeck-Wildungen (1594), Procurator zu Nieder-Wildungen (1608) und Fiscalis (Vertreter des Fiskus) des Amts Dringenberg (1610–1612). Langemann änderte (gräzisierte) seinen Namen in Arnold(us) Macrander und ist Stammvater der Familie Macrander. Sein Vetter war Anton Holmann (* um 1535 in Mengeringhausen; † 7. März 1606 in Mengeringhausen), Kanzler zu Arolsen.

Langemann heiratete in erster Ehe 1589 in Osnabrück Margaretha Nicolai, Tochter von Theodor Dietrich Rafflenboel (Nicolai) und Katharina Meyhan, Schwester des Theologen, Priesters und Komponisten Philipp Nicolai. Margaretha wurde in Mengeringhausen geboren und starb in Alt-Wildungen am 14. Februar 1597 an der Pest. In zweiter Ehe, ab 1599, war er verheiratet mit Regina Nübel, Tochter von Johann Nübel. Regina wurde 1575 in Peckelsheim geboren, wo sie auch starb. Sie war "Camermagd bey der Gräffin zu Wildungen, dabevor gewesene Kindermagd".

In zweiter Ehe, ab 1599, war er verheiratet mit Regina Nübel, Tochter von Johann Nübel. Regina wurde geboren in Peckelsheim 1575, wo sie auch starb. Sie war "Camermagd bey der Gräffin zu Wildungen, dabevor gewesene Kindermagd".

Weblinks
 Macrander (familie) Niederländisch
 Website zur Geschichte der Familie Macrander Niederländisch/Englisch
 Haus und Handbuch Macrander (PDF-Datei; 7,89 MB)
 Geschichtsblätter Waldeck: Beamte Waldecks (PDF-Datei; 1,67 MB)

Person (Bad Arolsen)
Person (Kreis Höxter)
Willebadessen
Geboren im 16. Jahrhundert
Gestorben 1620
Mann


Today's freebie is Print Ready Simplicity Style – Free Business Cards Template at 300DPI, CMYK , and 2" x 3,5" with bleed lines and guides included and enabled. Text layers in Free PSD Template are full type and can be edited with the click of a button. Enjoy!


Miami's commercial vacancy rates have been steadily ranking among the lowest in Florida for the past few years. According to the Miami Association of Realtors' Realtor Commercial Alliance, this means that there has been an increase in local investment from various global investors and companies.
An article published by Miami Edition regarding commercial news in real estate notes Miami's vacancy rates for commercial sectors, stating that they are performing better than average for the United States as a whole, apart from the multifamily sector, which is .1 percent lower. The article details, "Miami's vacancy rates for office (14.9 percent), industrial (5.3 percent), retail (6.3 percent), and multifamily (4.4 perfect) are the lowest among major cities in Florida," (Gerrity, Miami Commercial Investment Activity Upticks, Aided by Low Vacancies). These numbers compare to the national vacancy rates as of May 2015, which were recorded by NAR and Reis, calculated in at 15.6 percent for office, 8.4 percent for industrial, 9.6 percent for retail and 4.3 percent for multifamily.
"'Technology companies and other businesses are moving to Miami largely because of the region's top-tier cultural offerings, outdoor lifestyle, and affordability compared to other major cities around the globe,'" (Gerrity, Miami Commercial Investment Activity Upticks, Aided by Low Vacancies).
For more information regarding Miami's commercial investment market, read this article published by Miami Edition, which details each sector of commercial development within the city.
First, there is limited space. Remember, New York only has so many square miles of land, especially in Manhattan where buildings are dense. Combine this with the amount of people who want to live in Manhattan from all around the world, and competition increases. When there is more competition, prices rise.
Second, there are an abundance of zoning rules that inhibit real estate supply. Barro explains, "Of course, you can get more apartments on a given amount of land by building taller buildings closer together. And compared to most cities, New York is very dense. But it could be even denser," (Barro, Dear New Yorkers: Here's Why Your Rent is So Ridiculously High).
Lastly, rent control raises rent prices if you are not rent controlled. This may sound confusing at first, but it's really quite simple. Tenants that live in rent controlled apartments have incredible deals on their rent and most likely will not be moving out anytime soon, especially since the average rent for available apartments in NYC is more than $3,000. Barro notes, "In Manhattan below 96th Street, 35% of rent regulated apartments are occupied by a tenant who has lived there for more than 20 years. Less than 3% of market-rate tenants have been around that long," (Barro, Dear New Yorkers: Here's Why Your Rent is So Ridiculously High). To keep it simple: cheap apartment exist – you just can't get one.
For more information on the real estate market in New York City and why rent prices are soaring, check out Josh Barro's article on the Business Insider here.


text:
Indian group celebrates birthday of 'savior of humanity' Trump
June 14, 2016 | By Reuters
Members of Hindu Sena, a right wing Hindu group, celebrate U.S. Republican presidential candidate Trump's birthday in New Delhi
NEW DELHI (Reuters) – A Hindu fringe group celebrated the 70th birthday of Donald Trump in the Indian capital on Tuesday, calling the U.S. presidential contender the "savior of humanity" who could end the global threat posed by Islamist militants.
About 20 members of the far-right Hindu Sena, or Hindu Army, held the festivities as Americans grieved over the deaths of 49 people in the country's worst-ever mass shooting, perpetrated by a gunman claiming allegiance to Islamic State.
"Trump has said Muslims should be banned from entering America. Everyone should support that," said Hindu Sena leader Vishnu Gupta, whose group is known more for its publicity stunts than for having any meaningful support.
Donning red and blue paper hats, activists gathered at a stall on a Delhi road to pledge their allegiance to the presumptive Republican nominee, saying they counted on Trump to contain India's neighbor Pakistan.
They observed a minute's silence for the victims of last weekend's shooting at a gay nightclub in Orlando, Florida, before a large birthday cake was cut to shouts of "Long Live Donald Trump".
"Trump is about to become the king of the world," Gupta said. "How will we attack Pakistan without his support?"
India accuses Muslim Pakistan of responsibility for a commando-style militant raid on the financial capital Mumbai in 2008 that killed 166 people, and an attack on an air base this year.
The nuclear-armed neighbors have fought three wars since independence and partition in 1947.
(Reporting by Sankalp Phartiyal; Editing by Douglas Busvine)
Twelve Days of Slayings: Murders Committed During Christmas and New Year's
Britain's Prince Harry condemns 'incessant' media focus on his private life
Volkswagen believes it can fix 85,000 polluting U.S. vehicles
New Jersey judge orders naming of Bridgegate scandal co-conspirators
Funeral for slain Baton Rouge police officer draws thousands
Three UC Berkeley students wounded, one missing in Nice attack
Debbie's Dream Foundation: Curing Stomach Cancer Encourages Stomach Cancer Researchers to Apply for Peer Reviewed Cancer Research Program Grants
Homeless Dog Gets A Makeover And Learns To Love
WeCanResist.It Turns Trump's Tweets Into Donations for Charities


text:
Home » May 20, 2011: Scientific Conservation Partners With Intel to Improve Building Energy Use and Data Center Cooling
May 20, 2011: Scientific Conservation Partners With Intel to Improve Building Energy Use and Data Center Cooling
SAN FRANCISCO - Scientific Conservation Inc. (SCI), a leading provider of energy efficiency solutions via predictive diagnostics and analytics for the commercial building market, has announced a strategic alliance with Intel to improve energy use in large campuses, optimize data center cooling, and collaborate on technologies to improve the energy efficiency of IT-intensive workspaces. As part of the alliance between the two companies, Intel Capital, the global investment organization of Intel Corp., has acquired an investment instrument in Scientific Conservation.
SCI said its technology, SCIwatch™, is an adaptive solution that can analyze multivariable inputs to predict an optimal result specific to a given environment. SCIwatch interfaces remotely with building energy management systems for automatic data collection, data warehousing, diagnostics, work order issuance and tracking, automated fault detection, and predictive maintenance, enabling ongoing commissioning of a building and optimizing its HVAC systems. This expertise, together with Intel's expertise in data center energy efficiency, will be applied to the cooling challenges of data centers.
"We are delighted to collaborate with Intel to enable smarter energy grids and more sophisticated demand-side management. Intel is a global leader in the technologies that enable greater energy efficiency not only in IT equipment, but also in the facilities in which IT equipment resides," said Russ McMeekin, CEO, SCI.
"Intel is excited to collaborate with Scientific Conservation to help commercial building owners and occupants reduce their energy use," said Lorie Wigle, general manager of Intel's Eco-Technology Program Office. "The combination of SCI's cloud-based artificial intelligence algorithms, and Intel's expertise in energy measurement and efficiency technologies, is a great example of smart energy solutions that are being brought to market through the Intel Open Energy Initiative."
For more information about Scientific Conservation, visit www.scientificconservation.com.


Dr. Philipp Schaefer is a counsel in the Frankfurt office of Mayer Brown's Real Estate practice. He advises, inter alia, domestic and foreign institutional investors and banks on all aspects of real estate law. He primarily focuses on advising real estate transactions (asset deal and share deal), in particular relating to the product classes "Shopping Centre", "Specialist Stores" and "Office".
Before joining Mayer Brown in 2017, Philipp worked for two other international law firms in Frankfurt.
Advised Concarus Real Estate Invest, a company of the May & Porth Group, on the acquisition of the "BahnhofsCenter" in Gelsenkirchen from the Cerberus Group. The property located right near the main station has about 13,000 sqm retail and service space and about 310 parking spaces in a parking garage.
Advised the open real estate fund BERENBERG Real Estate Berlin, which was set-up by Berenberg Bank as real estate manager and Universal-Investment, on the acquisition of the shopping and district center "Neumann Forum" in Berlin-Pankow from the Hamburg real estate company RI Partners. The "Neumann Forum" has a lettable area of around 26,500 sqm with more than 270 parking. Tenants of the almost fully let property are large retail chains, a privately-owned school, a kindergarden as well as a retirement home.
Advised Art-Invest Real Estate Funds on sale of the office building "Am Mozartplatz" in Frankfurt to Park Lane Investors Group for further project development.
Advised LaSalle Investment on the acquisition of a 16,000 sqm commercial building "Am Friedensplatz" in Bonn by way of sale-and-leaseback for a club of investors from Sparkasse Koeln/Bonn. The property serves as local headquarter of Sparkasse Koeln/Bonn.
Advising a joint venture in acquiring a portfolio of 28 specialist stores located throughout Germany.
Advising in acquiring an eleven-story office building in Hamburg.
Advising a family office in acquiring a portfolio of 15 high-street-estates, located in e.g. Frankfurt, Düsseldorf and Göttingen.
Advising in acquiring a portfolio of six industrial estates.
Advising in selling a portfolio of one shopping centre in Hamburg and two specialist stores in Berlin.


text:
EU Withdrawal Bill passes first major hurdle with support of North Lincolnshire Tory MPs
MPs voted through the Brexit legislation by 326 to 290 - a majority of 36
The EU Withdrawal Bill passed its Second Reading in the House of Commons
MPs have voted to continue with Britain's process of leaving the European Union this evening.
The Government successfully squeezed the EU Withdrawal Bill through its Second Reading – its first major test in the House of Commons – with MPs passing it by 326 to 290.
The Bill is designed to end the "supremacy" of EU law over British law and also effectively copy-and-paste every EU law onto UK statute books before the Brexit deadline.
Labour, the Liberal Democrats and the Scottish National Party had combined to oppose the legislation, calling the proposed increase of " Henry VIII powers " undemocratic, given it would allow ministers to change laws without Parliament's approval.
The revolt failed, however, with the Bill passing its Second Reading with a majority of 36.
An accepted "reasonable amendment", submitted by Labour, was defeated by 318 votes against, to 296 votes for.
Sir Edward Leigh, Conservative MP for Gainsborough, spoke in favour of the EU Withdrawal Bill
North Lincolnshire's Tory MPs played their part in getting the Bill over the line.
All four of the region's Government representatives voted in support, with Sir Edward Leigh (Gainsborough) and Victoria Atkins (Louth) both speaking in favour on Monday evening.
Sir Edward, a life-long Eurosceptic, urged ministers to be "generous" both in the Brexit negotiations and with allowing MPs to debate the process.
North Lincolnshire MP slams Labour's 'appalling' decision to vote against first major Brexit law
He added: "Listen to the House, accept some amendments and ensure that this process is time limited.
"The key thing for our constituents is this: that we leave the EU at the end of March 2019; that any implementation period lasts only two years; and that we then become an open, free-trading nation with the whole world, with a free trade agreement with the EU.
"Stick to the essentials, be confident, be generous with the House and we will win this battle," the veteran politician told the Government."
Grimsby MP Melanie Onn objected to the Withdrawal Bill at its Second Reading
Great Grimsby MP, Melanie Onn, joined her party in opposing the Bill, saying she feared workers' rights and environmental protections could be "cut or watered down" by the Henry VIII powers.
In one of the final speeches of the night, Ms Onn said the Bill would "allow any government to water down basic privileges that people enjoy today".
The Shadow Housing Minister said it "was not good enough" that the "only guarantees" Parliament had been given over the extra powers was a call from the Brexit Secretary to "trust him and the Government".
She previously told the Telegraph that she would be looking to back suitable amendments, to protect workers' rights, at the next stage of the process.
Another councillor defects from Ukip to the Tories in the Brexit aftermath
The Second Reading's passing vote, held after two days of debate, signifies that the principle of the law has been agreed.
Were MPs right to vote through the EU Withdrawal Bill?
Yes - this law is needed to make Brexit work
No - the legislation gives the Government too much power
Maybe - opposition MPs need to show what the alternative is
You lost me at Henry VIII...
The Withdrawal Bill will go to an 8-day Committee Stage where MPs will be able to suggest changes next month, when they return after the upcoming 3-week break for the party conference season.
Ministers will have to offer guarantees to unhappy Tory MPs, such as influential backbencher and ex-attorney general Dominic Grieve, that the law's noted deficiencies will be patched up in time for the next Committee Stage – or face a possible rebellion.
Powerhouse Minister backs call for Virgin Cleethorpes to London line
HOW DID YOUR MP VOTE?
Eurosceptic Martin Vickers, MP for Cleethorpes, voted in favour (Image: Jon Corken)
Martin Vickers, MP for Cleethorpes
Sir Edward Leigh, MP for Gainsborough (including Market Rasen)
Victoria Atkins, MP for Louth and Horncastle
Andrew Percy, MP for Brigg and Goole
Melanie Onn, MP for Great Grimsby
Andrew Percy
Edward Leigh


text:
France to continue helping Ukraine in hostages release, - Isabelle Dumont
The ambassador also assured that her country supports the sovereignty and territorial integrity of Ukraine
Ambassador of the French Republic in Ukraine Isabelle Dumont stated that her country intends to continue to help Ukraine in the release of hostages. She said this during a brief speech at the Boryspil airport, where two planes with the hostages released from captivity arrived.
"I want to wish you all the best on behalf of France and on behalf of President Macron, to return to your homes and I want to assure that we will continue to work so that all the hostages return home. I also want to assure that we support the sovereignty and territorial integrity of Ukraine, "the ambassador said.
Also, Mrs. Dumont assured that the day of the return of prisoners was as "special" for her, as for many Ukrainians.
Related: Next prisoners' exchange in Donbas can take place under 74 for 29 formula
As it was reported earlier for more than a year Ukraine has been expecting for this exchange. Negotiations have been often disrupted, militants agreed to conduct the exchange and then refused.
And on the eve of the New Year, the agreement on the exchange of hostages between Ukraine and representatives of the "LPR" and "DPR" has finally succeeded.
The exchange of prisoners took place on December 27. The exchange started on Wednesday noon at Mayorske checkpoint.
Related: Prisoners exchange ongoing in Donbas: 16 Ukrainians released so far
Ukraine France Isabelle Dumont prisoners exchange Macron


The VON ESCH LAW GROUP handles all phases of spousal support claims. If you are in need of support during or after your divorce, or in need of a defense against unreasonable support demands, the VON ESCH LAW GROUP can help.
Spousal support matters are handled under the supervision of Amy M. von Esch. Ms. von Esch is a principal of the VON ESCH LAW GROUP and the chairman of its family law department. She has devoted herself exclusively to the practice of family law.


Soft Computing, 21 (8), pp. 2069–2089, 2017.
Journal of Machine Learning Research, 16 , pp. 491-494, 2015.
Proceedings of the 17th Portuguese Conference on Artificial Intelligence, pp. 305–310, 2015.
Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO'14, pp. 887-893, 2014.
7831 LNCS , pp. 217-228, 2013.
Soft Computing, 16 (2), pp. 187-202, 2012.
1st, InTech, 2012, ISBN: 978-953-51-0809-2.
Proceedings of the 6th International Conference on Hybrid Artificial Intelligent Systems, HAIS'11, pp. 172-181, 2011.
Proceedings of the 5th International Conference on Hybrid Artificial Intelligent Systems, HAIS'10, pp. 17-26, 2010.
IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, 40 (2), pp. 121-144, 2010.


In just 28 hours thanks to the help of all philanthropists, activists and volunteers, we raised funds for our daily Kollel Torah! We hope that in September we will be able to expand the program from 2 to 4 groups!
4 – a Group for young mothers.


text:
Bumblebee Movie In Cinemas now - Review
We have been to the cinema a few times this year and each time, Tilly has watched the previews of upcoming movies and then she decides what she wants to watch. One of these films was Bumblebee. Now Tilly has never been a fan of transformers, she has never seen them on the Tv like the older kids did, but I think this real-life version of a transformers movie is an attempt to bring Transformers back to the forefront of kids toys.
The preview of the film looked lovely, A young lady meets a yellow car, who turns into a friendly robot. But the real film was quite a contrast to what we were led to believe. We took our seat in the cinema and the film opens with a full on battle happening on the planet of Cybertron, their fictional planet. The battle between the Peace loving Autobots and rebellious Decepticons. This upset Tilly as she didn't expect the film to open like this and to be honest, I should have prepared her but I don't know the transformers stories either. I thought we would have to leave the cinema, but she said she wanted to stay. She later got upset when the Decepticons attacked Bumblebee and slit his voice box so he couldn't talk.
The film follows the story of Charlie, a young lady, grieving the loss of her dad and struggling every day to get by. A feeling that I am so familiar with! She comes across a Yellow Beetle car that turns out to be Bumblebee in disguise and hiding from the Decepticons. They have an adventure and have to keep running and hiding from Agent Burns. The Decepticons are very deceptive and convince the humans that Bumblebee is guilty of being a criminal and there is a real cat and mouse game going on.
The film is based in 1987 which was brilliant because it keeps the Transformers in the era that they were created and it was fab seeing the 80's fashion and hearing the music from the time. The film was very well cast with Hailee Steinfeld from Pitch Perfect 2 and 3 as Charlie and John Cena as Agent Burns. The fight scenes are really well made and look realistic enough to upset Tilly. The film is rated a PG and if your child is as empathic and sympathetic as Tilly, then it isn't a film for them. The film had comedy moments that even she understood, Bumblebee spits out a tape of Rick Astley singing 'Never Gonna Give You Up' and Tilly actually met Rick Astley in the summer.
I enjoyed the film, It was really good, realistic with the benefits of the CGI, and as a person who has never shown any interest in Transformers in the past, either as I was growing up or as the older kids were growing up. I actually enjoyed this film. The story is very familiar to E.T, but it was just as enjoyable as when I watched that for the first time too. The film was cast well and it goes to show that you shouldn't believe everything that people tell you in the film.
If you're taking kids, warn them about the fighting though.


text:
\section{Introduction}

Nanopore sequencing \cite{ONT} has emerged as a promising technology for the sequencing of {\em deoxyribonucleic acid (DNA)}, however it is limited by many distortions imposed by the physics of the sequencer. Thus far, a complete model of the nanopore sequencer has not been established in the research community, hence the purpose of this paper is to introduce a model that is suitable for the future development of codes that enable reliable data storage in synthetic DNA when using nanopore sequencing for the reading operation \cite{Lopez2019}.

The four molecules adenine ($A$), cytosine ($C$), guanine ($G$) and thymine ($T$), connected to a sugar-phosphate backbone molecule, form the {\em nucleotides} (or {\em bases}), which are the primary elements of {\em single-stranded DNA (ssDNA)}. Abstractly, we can assume $\{A,T,C,G\}$ is the alphabet forming arbitrary length sequences.

The nanopore is a microscopic pore that holds $\tau$ nucleotides (see Fig. \ref{fig:nnc}) for a random duration determined by a motor protein that shifts nucleotides one by one through the nanopore. Meanwhile, an ionic electrical current flowing through the nanopore is uniquely disturbed by the $\tau$ nucleotides inside it at any given time, and is sampled by the sequencer at a frequency $f_s$. Measuring the current level through an output function $f$, the nanopore sequencer estimates the {\em state} of the system defined by the $\tau$ bases in the nanopore. Unfortunately, the following distortions reduce the reliability of detection \cite{Laszlo2014}:

\begin{itemize}
  \item {\bf Random dwell times (sample duplications)}: Fluctuations in the motor protein operation results in a random number of samples per nucleotide, since the nucleotide is not being shifted in lockstep with the sampler.

  \item  {\bf Fading}: For each nucleotide, the motor is designed to halt for a duration that facilitates the sampling of a constant current level. However, minor variability in the physical dimensions of the nanopores slightly changes this level. This is similar to a variable fading coefficient depending on the nanopore in use.

  \item  {\bf Inter-symbol interference (ISI)}: Given that the electrical current is disturbed by $\tau$ bases, the detection of a single base is distorted by inter-symbol interference with its neighbours.

  \item  {\bf Noisy measurements}: Finally, each sample is distorted by measurement noise.
\end{itemize}

From experimental data, the authors of \cite{Laszlo2014} additionally observed {\em backsteps (tandem duplications)} and, less frequently, {\em skippings (deletions)}.

\begin{figure}
\includegraphics[width=\linewidth]{nnc.pdf}
\caption{A diagram of the noisy nanopore channel of Definition \ref{def:nnc}. The $\ell$-th base in the ssDNA is fed through the nanopore after $K_\ell/f_s$ seconds, according to the variable ``DNA Clock''. Simultaneously, the sampler samples every $1/f_s$ seconds, according to the ``Sample Clock'' with frequency $f_s$.}
\label{fig:nnc}
\end{figure}

Before information-theoretic methods for the nanopore sequencer can be employed, a tractable channel model that best represents the aforementioned distortions must be chosen. In this regard, the channel proposed in \cite{Mao2017} is the closest to ours that we have found in the literature, given that it modelled ISI, fading, and deletions. This channel excluded duplications by assuming a perfect segmentation algorithm, since any segmentation errors could be combined with backsteps (tandem-duplications) or deletions, but unfortunately their channel did not include backsteps to justify this decision.

Simpler channel models have been considered to study distortions in isolation, including a {\em noiseless nanopore channel} \cite{Hulett2021}, a {\em noisy (tandem-)duplication channel} \cite{Tang2019}, and a {\em memoryless nanopore channel} \cite{Conde2018}. While these channels highlight interesting properties of the nanopore, they are incomplete.

In contrast, our approach is based on a {\em finite-state Markov channel (FSMC)}  \cite[Chapter~4.6]{Gallager1968} to model ISI and noisy measurements, which we extend to include duplications. The duplications can be modelled by an i.i.d. duplication channel,
but since sample duplications of a Markov chain result in a semi-Markov chain (or renewal process), we concatenate it with a {\em finite-state semi-Markov channel (FSSMC)} to form the proposed {\em noisy nanopore channel (NNC)}. We do not include fading, since its effect can be modelled as additional measurement noise, neither do we include deletions, since they can be eliminated by tuning  the sampling rate relative to the speed of the motor protein.

The primary contribution of this work is establishing a tractable channel that models the dominant distortions in nanopore sequencing. Secondary contributions include generalising MAP detection algorithms that have been important tools for coding schemes of finite-state channels. In particular, we generalise the forward-backward algorithm for MAP symbol detection, and the Viterbi algorithm for MAP sequence detection. Aside from detection, the generalised forward-backward algorithm is used to estimate achievable rates using analogous methods to \cite{Kavcic2001, Arnold2001}, which leads us to conjecture that the {\em generalised Blahut-Arimoto algorithm} (GBAA) \cite{Kavcic2001} optimises the Markov source (and, if the conjecture in \cite{Kavcic2001,Vontobel2008} is true, is capacity-achieving).

This paper is organised as follows. Section II presents preliminaries on (hidden) Markov chains and (hidden) semi-Markov chains. Section III introduces the noisy nanopore channel. Section IV derives the forward-backward algorithm for MAP symbol detection, and a Viterbi algorithm for MAP sequence detection. Section V shows how to compute achievable information rates, and highlights its connection with the generalised Blahut-Arimoto algorithm. Finally, Section VI presents numerical results of computed achievable rates over different channel parameters, using a channel mapping derived from the Scrappie simulator \cite{Oxford2013}.

\section{Preliminaries
\subsection{Hidden Markov chains}
A discrete-time stochastic process $(S_\ell)$ with initial probabilities $\mu_0(i) := \mathbb{P}(S_0 = i)$ is said to be a {\em Markov chain} if its {\em  Markov kernel} $P$ satisfies
\begin{align}
P(i,j) &:= \mathbb{P}(S_{\ell+1}=j|S_0,\ldots,S_\ell=i)\notag\\
&= \mathbb{P}(S_{\ell+1}=j|S_\ell=i)
\end{align}
for all $i,j\in \mathsf{supp}(S)$ and for all $\ell \in \mathbb{N}$.
The chain $(S_\ell,Y_\ell)$ is said to be a {\em hidden Markov chain} if $(S_\ell)$ is a Markov chain and, for all $\ell \in\mathbb{N}$, it satisfies
\begin{align}
\mathbb{P}(Y_{\ell}|S_0,\ldots, S_\ell) &= \mathbb{P}(Y_{\ell}|S_\ell)
\end{align}

\subsection{Hidden semi-Markov chains}
The discrete-time stochastic process $(S_\ell,T_\ell)$ is said to be a {\em Markov renewal process} with jump times $(T_\ell)$ if, using the parameterisation $K_{\ell+1}=T_{\ell+1}-T_\ell$, its {\em semi-Markov kernel} satisfies \cite[Definition~3.2]{Barbu2008}
\begin{multline}
    Q(i,j,k) :=\\ \mathbb{P}\bigl(S_{\ell+1}=j,K_{\ell+1}=k|S_0,\ldots,S_{\ell}=i; K_1,\ldots,K_{\ell}\bigr)\\
    = \mathbb{P}\bigl(S_{\ell+1}=j,K_{\ell+1}=k|S_{\ell}=i\bigr)
\end{multline}
for all $\ell\in\mathbb{N}$, for all $i,j\in\mathsf{supp}(S)$, and for all $k\in\mathsf{supp}(K)$. The {\em semi-Markov chain} $(Z_t)$ represents this Markov renewal chain as $Z_t = S_\ell \quad \text{if} \quad T_{\ell-1} < t \leq T_{\ell}$. We note that the main difference between chains $(S_\ell,K_\ell)$ and $(Z_t)$ is that the former is a tuple of states and durations, whereas the latter is the actual process that has a defined state at any given time, but they are equivalent. We will switch between them whenever it is convenient to do so throughout this work.

A stochastic process $(Z_t,Y_t)$ is said to be a {\em hidden semi-Markov chain} if it satisfies \cite[Definition~6.1]{Barbu2008}
\begin{align}
    \gamma_{t'+1}^{t}(i,j) &:= \mathbb{P}\left(Y_{t'+1}^{t}, Z_{t'+1}^{t}=j |Y_{1}^{t'}; Z_1,\ldots,Z_{t'}=i\right) \notag\\
    &=Q(i,j,t-t') \prod_{r=t'+1}^{t} \mathbb{P}(Y_r|Z_r = j)
\end{align}
for all $i,j \in \mathsf{supp}(Z)$ and for all $t',t \in \mathsf{supp}(T)$ such that $i \neq j$ and $t' < t$. Assume the processes $(Y_t)$ and $(K_{\ell})$ are i.i.d. throughout this work.

Our choice of notation is heavily inspired by \cite{Girardin2018, Barbu2008}, which gives a more detailed treatment of (hidden) semi-Markov processes. Refer to the concrete example in Fig. \ref{fig:smm}.

\begin{figure}[!h]
\centering

\begin{tikzpicture}
\tikzset{odd/.style={draw,rectangle,fill=gray!20}}
\tikzset{even/.style={draw,rectangle}}

\node[odd] (a1) {A};
\node[even, right=1cm of a1] (a2) {B};
\node[odd, right=1cm of a2] (a3) {A};
\node[even, right=1cm of a3] (a4) {B};

\node (af1)  [draw, inner sep=0pt,
             label=below:{$S_1$},
             fit=(a1)] {};
\node (af2)  [draw, inner sep=0pt,
             label=below:{$S_2$},
             fit=(a2)] {};
\node (af3)  [draw, inner sep=0pt,
             label=below:{$S_3$},
             fit=(a3)] {};
\node (af4)  [draw, inner sep=0pt,
             label=below:{$S_4$},
             fit=(a4)] {};

\path[->,-latex](a1) edge[bend left=30] node[pos=0.5,above] {$P(A,B)$} (a2);
\path[->,-latex](a2) edge[bend left=30] node[pos=0.5,above] {$P(B,A)$} (a3);
\path[->,-latex](a3) edge[bend left=30] node[pos=0.5,above] {$P(A,B)$} (a4);

\end{tikzpicture}

\vspace{.2cm}

\begin{tikzpicture}
\tikzset{odd/.style={draw,rectangle,fill=gray!20}}
\tikzset{even/.style={draw,rectangle}}

\node[odd] (b1) {A};
\node[even, right=1cm of b1] (b2) {B};
\node[even, right=0mm of b2] (b3) {B};
\node[odd, right=1cm of b3] (b4) {A};
\node[odd, right=0mm of b4] (b5) {A};
\node[even, right=1cm of b5] (b6) {B};

\node (bf1)  [draw, inner sep=0pt,
             label=below:{$Z_1$},
             fit=(b1)] {};
\node (bf2)  [draw, inner sep=0pt,
             label=below:{$Z_2,Z_3$},
             fit=(b2) (b3)] {};
\node (bf3)  [draw, inner sep=0pt,
             label=below:{$Z_4,Z_5$},
             fit=(b4) (b5)] {};

\node (bf4)  [draw, inner sep=0pt,
             label=below:{$Z_6$},
             fit=(b6)] {};

\path[->,-latex](b1) edge[bend left=30] node[pos=0.5,above] {$Q(A,B,2)$} (b2);
\path[->,-latex](b3) edge[bend left=30] node[pos=0.5,above] {$Q(B,A,2)$} (b4);
\path[->,-latex](b5) edge[bend left=30] node[pos=0.5,above] {$Q(A,B,1)$} (b6);

\end{tikzpicture}

\vspace{0.2cm}

\begin{tikzpicture}
\tikzset{odd/.style={draw,rectangle,fill=gray!20}}
\tikzset{even/.style={draw,rectangle}}

\node[odd] (c1) {1.0};
\node[even, right=1cm of c1] (c2) {-0.9};
\node[even, right=0mm of c2] (c3) {-1.1};
\node[odd, right=1cm of c3] (c4) {0.95};
\node[odd, right=0mm of c4] (c5) {1.2};
\node[even, right=1cm of c5] (c6) {-0.8};

\node (cf1)  [draw, inner sep=0pt,
             label=below:{$Y_1$},
             fit=(c1)] {};
\node (cf2)  [draw, inner sep=0pt,
             label=below:{$Y_2,Y_3$},
             fit=(c2) (c3)] {};
\node (cf3)  [draw, inner sep=0pt,
             label=below:{$Y_4,Y_5$},
             fit=(c4) (c5)] {};

\node (cf4)  [draw, inner sep=0pt,
             label=below:{$Y_6$},
             fit=(c6)] {};

\path[->,-latex](c1) edge[bend left=30] node[pos=0.5,above] {$\gamma_2^3(A,B)$} (c2);
\path[->,-latex](c3) edge[bend left=30] node[pos=0.5,above] {$\gamma_4^5(B,A)$} (c4);
\path[->,-latex](c5) edge[bend left=30] node[pos=0.5,above] {$\gamma_6^6(A,B)$} (c6);
\end{tikzpicture}

\caption{Example realisations of Markov chain $S_1^4$, semi-Markov chain $Z_1^6$, and hidden semi-Markov chain $Y_1^6$. Each block holds a realised value of the random variable below it, and the transitions define the probability of each realisation.}
\label{fig:smm}

\end{figure}

\section{Channel Model}
We now propose a channel model for the nanopore sequencer based on the concatenation of an i.i.d. duplication channel with a FSSMC. The channel will model random dwell times with i.i.d. duplications, ISI with a finite state-space, and noisy measurements with additive noise. The following makes the components of the illustration in Fig. \ref{fig:nnc} precise.

\vspace{1mm}
\textbf{Noiseless nanopore channel}.\quad Let $\Omega=\{A,T,C,G\}^\tau$ be the state-space of the nanopore sequencer with memory constraint $\tau\geq 1$. Given a sequence of bases $b_1^n$ in $\{A,T,C,G\}^n$, let us model the nanopore as a shift register that stores the subsequence $b_{\ell-\tau-1}^{\ell} = (b_{\ell-\tau-1},b_{\ell-\tau},\ldots, b_\ell)$ after $\ell$ bases have been shifted through, where the initial state is some $(b_{-\tau-1}, b_{-\tau},\ldots,b_0)\in\Omega$. In addition, let these subsequences induce a mean measurement level by injective mapping $f: \Omega \rightarrow \mathcal{Y}\subseteq \mathbb{R}$, as defined for the {\em noiseless nanopore channel} in  \cite{Hulett2021}.

\vspace{1mm}
\textbf{Noisy nanopore channel}.\quad
Let $S_\ell = b_{\ell-\tau-1}^{\ell}$ be one of $4^\tau$ possible states in $\Omega$, then the subsequent state $S_{\ell+1}=b_{\ell-\tau}^{\ell+1}$ is only conditionally dependent on $S_{\ell}$. Hence, the sequence of states that are stored in the shift register form a Markov chain $(S_\ell)$ on $\Omega$. Now, let us say that we can observe the state of the shift register at {\em deterministic} time intervals to yield a sequence of {\em sample states} $(Z_1,Z_2,\ldots)$, however suppose that the bases are shifted in at {\em random} time intervals such that each state $S_\ell$ is observed for a {\em duration} of $K_\ell$ samples. In this scenario, we have that $Z_t = S_\ell$ for all $t$ such that $T_{\ell-1} = K_1 + \ldots + K_{\ell-1} < t \leq T_{\ell} = K_1 + \ldots + K_{\ell-1} + K_{\ell}$, where $T_\ell$ denotes the time when state $S_\ell$ is observed for the last time. Hence, the sequence of observed sample states in the shift register at different time instances form a semi-Markov chain $(Z_t)$ on $\Omega$. Finally, let us take {\em noisy measurements} $(Y_1,Y_2,\ldots)$ of the hidden sample states $(Z_1,Z_2,\ldots)$, where $Y_t = f(Z_t) + N_t$ for zero-mean additive noise $N_t$. This sequence of measurements form a hidden semi-Markov chain $(Y_t)$ on $\mathcal{Y}\subseteq \mathbb{R}$.

We have now defined all components of the channel model, which are summarised in the following definition.

\begin{definition}[Noisy nanopore channel]
Let us define $m$ channel-uses of the noisy nanopore channel as $W^{(m)} : (S_0,S_1,\ldots, S_m) \rightarrow (Y_1,\ldots,Y_{T_1}, Y_{T_1 + 1},\ldots,Y_{T_m})$, where the input $(S_0,S_1,\ldots, S_m)$ is a Markov chain on $\Omega$, and the output is derived by mapping the semi-Markov chain $(Z_1,\ldots,Z_{T_1},Z_{T_1+1},\ldots,Z_{T_m})$ on $\Omega$ to the hidden semi-Markov chain $(Y_1,Y_2,\ldots,Y_{T_m})$ on $\mathcal{Y}\subseteq \mathbb{R}$, where the dwell times $K_\ell = T_{\ell}-T_{\ell-1}$ are defined on $\Lambda \subseteq \mathbb{N} \backslash \{0\}$. The mapping of the output is the mean measurement level given by $f$ with zero-mean additive noise.\label{def:nnc}
\end{definition}

This natural definition of the noisy nanopore channel has hinted at a new class of channels, namely finite-state semi-Markov channels. If we set $\Lambda = \{1\}$, then the FSSMC collapses into the classical FSMC, and hence we say that the former generalises the latter. In addition, a FSSMC with geometrically distributed durations is also a FSMC (since the semi-Markov source collapses into a Markov source).

We briefly note that the zero element is removed from the durations $\mathsf{supp}(K) = \Lambda$ since that would imply concatenation of a deletion channel with deletion probability $d=\mathbb{P}(K=0)$, but we do not allow this here. Future work may study a generalisation of this channel, where deletion is allowed.

\section{Detection Algorithms}
We now generalise two important detection algorithms, namely the forward-backward algorithm and the Viterbi algorithm. In \cite{Yu2010, Girardin2018}, similar algorithms were derived for inference of the sample states $(Z_t)$ given the observations $(Y_t)$, but with an unknown number of states. In our case, we know $m$ channel-uses segments $(Z_t)$ into $m$ states of $S_1^m$, hence the detection problem is to find which non-overlapping segments of samples in $(Y_t)$ correspond to which sequence of states.

\subsection{MAP symbol detection}
The goal of this section is to derive message passing algorithms to compute $\mathbb{P}(S_\ell| Y_1^{T_m})$ for all $\ell \in [m]$. The existing message passing algorithms \cite{Yu2010} for hidden semi-Markov chains compute $\mathbb{P}(Z_t| Y_1^{T_m})$ and $\mathbb{P}(Z_{t'}^t| Y_1^{T_m})$, however we are interested in the probability of the $\ell$-th segment being in a particular state given that there are exactly $m$ segments in total, which includes all sample paths $Z_1^{T_m}$ with $Z_{t'}^t = S_\ell$ for all $t',t \in [T_m]$ such that $t'<t$. Note that the constraint of $m$ segments effectively adds memory the size of the entire block.

\vspace{1mm}
\textbf{Generalised forward algorithm.}\quad Let us now generalise the classical forward algorithm. The initial forward probabilities are defined as
\begin{align}
    \alpha_{1, t}(s) &:=\mathbb{P}(Y_1^t, S_1 = s) \notag\\

    &= \sum_{s' \in \Omega} \gamma_1^t(s',s)\mu_0(s')
\end{align}
for all $t \in [T_m]$, and for all $s \in \Omega$. The inductive forward probabilities are defined as
\begin{align}
    \alpha_{\ell, t}(s) &:= \mathbb{P}(Y_1^t, S_\ell = s) \notag\\

    &= \sum_{s' \in \Omega}\sum_{t' \in [t-1]} \gamma_{t'+1}^t(s',s) \alpha_{\ell-1, t'}(s')
\end{align}
for all $t \in [T_m]$, for all $\ell \in [m]\backslash\{1\}$, and for all $s \in \Omega$. Observe that setting $\Lambda = \{1\}$ yields the classical forward algorithm.

\vspace{1mm}
\textbf{Generalised backward algorithm.}\quad Let us now generalise the classical backward algorithm. The initial backward probabilities are defined to be $\beta_{m, T_m}(s) := 1$ for all $s \in \Omega$. The inductive backward probabilities are defined as
\begin{align}
    \begin{split}\beta_{\ell, t}(s) &:= \mathbb{P}(Y_{t+1}^{T_m}| S_\ell = s)\\

    &= \sum_{s' \in \Omega}\sum_{t' \in [t+1:T_m]} \gamma_{t+1}^{t'}(s,s') \beta_{\ell+1, t'}(s')
    \end{split}
\end{align}
for all $t \in [T_m]$, for all $\ell \in [m-1]$, and for all $s \in \Omega$. Once again, setting $\Lambda = \{1\}$ yields the classical backward algorithm.

\vspace{1mm}
\textbf{Generalised forward-backward algorithm.}\quad
We now use the generalised forward algorithm and the generalised backward algorithm to compute the posterior probabilities
\begin{align}
    \psi_{\ell}(s) &:= \mathbb{P}(S_\ell = s| Y_1^{T_m}) \notag\\

    &=  \frac{\sum_{t \in [T_m]} \mathbb{P}(Y_1^t, S_\ell = s) \mathbb{P}(Y_{t+1}^{T_m}| S_\ell = s) }{\mathbb{P}(Y_1^{T_m})}\notag\\
    &= \frac{\sum_{t \in [T_m]} \alpha_{ \ell, t}(s) \beta_{\ell, t}(s)  }{\sum_{s' \in \Omega} \alpha_{m, T_m}(s')}.
    \label{eq:fb1}
\end{align}
Similarly, we can also compute the joint posterior probabilities
\begin{align}
    \psi_{\ell}(s', s) &:= \mathbb{P}(S_{\ell-1} = s', S_\ell = s| Y_1^{T_m}) \notag\\

    &= \frac{\sum_{t',t \in [T_m] : t' < t} \alpha_{\ell-1, t'}(s') \gamma_{t'+1}^{t}(s',s) \beta_{\ell, t}(s) }{\sum_{s'' \in \Omega} \alpha_{m, T_m}(s'')}.
    \label{eq:fb2}
\end{align}
Aside from detection, we will use both of these probabilities to estimate achievable rates of the NNC in Section V.

\subsection{MAP sequence detection}
The goal of this section is to derive a Viterbi algorithm to compute the sequence of states that maximise the posterior $\mathbb{P}(Z_1^{T_m}|Y_1^{T_m}) \propto \mathbb{P}(Z_1^{T_m}, Y_1^{T_m})$. Compared to the classical Viterbi algorithm, we not only sequentially maximise the path of states $S_1^m$, but also the sequence of jump times $T_1^{m}$. Importantly, we require that the first state begins at index $T_0+1$ ($T_0=0$) and the $m$-th state ends at index $T_m$ known at the decoder, hence we must segment an observation $Y_1^{T_m}$ into a sequence of $m$ segments that maximises the posterior.

\vspace{1mm}
\textbf{Generalised Viterbi algorithm.}\quad Let us now derive the dynamic program of the generalised Viterbi algorithm as
\begin{align}
    V(m,t_m) &:= \max_{\substack{s_1,\ldots,s_m \\ 1<t_1<\ldots < t_m}} \prod_{\ell=1}^{m} \gamma_{t_{\ell-1}+1}^{t_\ell}(s_{\ell-1},s_\ell) \label{eq:viterbi_dp}\\
    \begin{split}&= \max_{\substack{s_m \\ t_{m-1} < t_m}} \gamma_{t_{m-1}+1}^{t_m}(s_{m-1},s_m) \\ &\quad\quad\quad\cdot \left[\max_{\substack{s_1,\ldots,s_{m-1} \\ 1<t_1<\ldots<t_{m-1}}} \prod_{\ell=1}^{m-1} \gamma_{t_{\ell-1}+1}^{t_\ell}(s_{\ell-1},s_\ell)\right]\end{split}\notag\\
    &= \max_{\substack{s_m \\ t_{m-1} < t_m}} \gamma_{t_{m-1}+1}^{t_m}(s_{m-1},s_m) V(m-1,t_{m-1})\notag
\end{align}
where $V(0,0):=1$, noting that each $t_\ell$ is a constant in $V(\ell, t_\ell)$. The dynamic program of subproblem $V(\ell, t_\ell)$ jointly maximises the posterior of the sequence of states $s_1^\ell$ and the sequence of segment jump times $t_1^{\ell-1}$ such that the $\ell$-th segment jumps after time $t$. Since $V(\ell, t)$ depends on other subproblems $V(\ell', t')$ for all $\ell' < \ell$ and for all $t'<t$, it can be shown with some work that standard dynamic programming techniques solve (\ref{eq:viterbi_dp}) in a worst-case $O(m T_m 4 |\Omega| |\Lambda|)$ time (note that for the nanopore any state is connected to a maximum of four other states).

\section{Achievable Rates}
We now turn our attention to computing achievable rates.
The ultimate goal is to compute the capacity of Definition \ref{def:nnc}, constrained to Markov sources, which is given by

\begin{align}
\begin{split}
  C(W) &= \sup_{P} I(\mathscr{S}; \mathscr{Y})\\
  &= \lim_{m\rightarrow\infty}\frac{1}{m}\sup_{P} I(S_1^m; Y_1^{T_m})
  \label{eq:cap_def}
  \end{split}
\end{align}

in bits per base (or bits per state), where $P$ is a Markov kernel of Markov source $(S_\ell)$ and the resulting achievable rate is $I(\mathscr{S}; \mathscr{Y})$. As in the previous section, let us take methods for the FSMC and show analogous methods for the NNC.

In \cite{Kavcic2001}, the classical Blahut-Arimoto algorithm for discrete memoryless channels was generalised to compute achievable rates of finite-state channels. It was not rigorously proven to converge to the capacity, however it was strongly suggested based on their numerical results, and later proven to at least converge to a critical point \cite{Vontobel2008}. In this spirit, we show the (almost) direct application of GBAA to the NNC.

 GBAA iteratively searches for the Markov kernel that achieves the maximisation of (\ref{eq:cap_def}), computing achievable rates at each iteration using the method we now describe. Let $\mu$ be the stationary distribution of some Markov kernel $P$, then we can write the achievable information rate as
 %
\begin{multline}
    \frac{1}{m}I(S_1^m; Y_1^{T_m}) =\\ \underbrace{\frac{1}{m}\sum_{\ell=1}^{m} H(S_\ell|S_{\ell-1})}_{\sum_{i,j \in \Omega} \mu(i) P(i,j) \log \frac{1}{P(i,j)}}-\frac{1}{m}\sum_{\ell=1}^{m} H(S_\ell|S_{\ell-1},Y_1^{T_m}).
    \label{eq:mi_rate}
\end{multline}
The first term has a closed-form, however the second term is significantly more challenging to compute. We decompose the second term identically to \cite{Kavcic2001}, which defines the so-called {\em $T$-values} as

\begin{align}
    T(i,j) &= \lim_{m\rightarrow\infty} \frac{1}{m}\sum_{\ell=1}^{m}  \mathbb{E}\left[\log \frac{\psi_{\ell}(i,j)^{\frac{\psi_{\ell}(i,j)}{\mu(i) P(i,j)}}}{ \psi_{\ell-1}(i)^{\frac{\psi_{\ell-1}(i)}{\mu(i)}} }\right]
    \label{eq:t_values},
\end{align}

 then, assuming we can compute these $T$-values, the achievable information rate of the NNC is computed as

\begin{align}
    I(\mathscr{S}; \mathscr{Y}) = \sum_{i,j \in \Omega} \mu(i) P(i,j) \log \left[\frac{1}{P(i,j)} + T(i,j)\right]
\end{align}

and may be optimised using GBAA \cite{Kavcic2001}. Similarly to \cite{Kavcic2001, Vontobel2008}, we conjecture that this algorithm converges to the capacity since (ergodic) finite-state semi-Markov processes are a subclass of (ergodic) finite-state processes (i.e., processes with memory). Strictly speaking, the capacity of a FSSMC must optimise semi-Markov kernel $Q$, but since $\mathbb{P}(K)$ is fixed by the duplication channel we need only consider Markov kernel $P$, where the information contribution of $K$ is subtracted to give (\ref{eq:mi_rate}) for the NNC and is identical in form to the FSMC.
\newpage
The $T$-values can be estimated using a variation of the Arnold-Loeliger method \cite{Arnold2001}, which assumes ergodicity to compute estimates of (\ref{eq:t_values}) by applying the classical forward-backward algorithm on a long realisation $y_1^{t_m}$. For the NNC, we require the probabilities $\psi_{\ell}(i,j)$ and $\psi_{\ell-1}(i)$, which  are (\ref{eq:fb2}) and (\ref{eq:fb1}), respectively, from Section IV.

\section{Numerical Results}
{\bf Model parameters.} Let us now consider which parameters of the NNC accurately model the actual nanopore channel. Scrappie \cite{Oxford2013} is a simulator by Oxford Nanopore Technologies that takes input bases $b_1^n$ and outputs tuples $\{(x_\ell,\sigma^2_\ell)\}_{\ell=1}^{n-\tau+1}$ for the mean and variance of measurements for the $\ell$-th base shifted into the nanopore. The model in Scrappie assumes the memory constraint $\tau$ is large, but we choose $\tau=5$ since it gives roughly stationary parameters. We generate the channel mapping $f$ by inputting multiple {\em de Bruijn sequences} (short sequences that enumerate all $4^\tau$ nucleotides) into Scrappie and averaging $x_\ell$ over identical states in each sequence. For simplicity, we use a constant $\sigma^2$ for all states, but all methods described earlier are easily extended. Noisy measurements are distributed as i.i.d.  $\mathsf{Normal}\bigl(f(s), \sigma^2\bigr)$ while in state $s\in\Omega$, and durations are distributed as i.i.d. $\mathsf{Uniform}(\Lambda)$.

Although $P$ is sparse for $\tau=5$, it yields a state-space of $4^5 = 1024$ states that is prohibitive for the algorithms of Section IV. Hence, we reduce the state-space by removing edges in the graph of the Markov source that are not desirable for synchronisation (segmentation), namely the edges that have a {\em jumping distance}, $\abs{f(i)-f(j)}$, below a minimum threshold $J_{min}$, for all $i,j\in \Omega$ with $P(i,j)>0$. Ensuring the new graph is {\em irreducible}, and thus ergodic, we use standard algorithms to compute the list of {\em strongly connected components} and take the one with largest entropy. Set $J_{min} = 1.38$ to get our example state-space graph in Fig. \ref{fig:ssplot}.
\vspace{1mm}

{\bf Achievable rates.} We now discuss the achievable information rates in Fig. \ref{fig:info_rates}, which are plotted over different values of $\sigma$ and $\Lambda$ to highlight the effect of the minimum duration and the range of durations with respect to measurement noise. The achievable rates are estimated using a limited $m=10,000$ channel-uses. We choose $\sigma$ to be in the range $0.10-0.40$, which covers those given by the Scrappie simulator.

We observe the rates with durations $\Lambda=\{1\}$, i.e., the NNC without duplications, which achieve the maximum source entropy $H_{\max}=0.3063$ over this range of $\sigma$. We further observe that  single duplications with $\Lambda = \{1,2\}$ significantly degrade the rates, but fortunately this degradation halts as the range is widened to $\Lambda=\{1,2,\ldots,5\}$, giving identical rates to $\Lambda=\{1,2,\ldots,10\}$ and beyond. Additionally, we observe that shifting the durations by one significantly improves the rate, which is demonstrated from $\Lambda = \{1,2\}$ to $\Lambda=\{2,3\}$, and from $\Lambda=\{1,2,\ldots,5\}$ to $\Lambda=\{2,3,\ldots,6\}$. Note the range effects remain. This observation confirms our intuition that the shortest duration is the most difficult to synchronise in a noisy channel, especially in the high-noise regime.

\begin{figure}[h!]
    \centering

    \begin{tikzpicture}[
      thick,
      acteur/.style={
        circle,
        fill=black,
        thick,
        inner sep=2pt,
        minimum size=0.2cm
      }
    ]
      \node (a1) at (0,0) [acteur,label={[align=center]below:{\footnotesize $f(\mathsf{CTCGT})$\\\footnotesize$=0.19$}}]{};
      \node (a2) at (0,1.5)[acteur,label={[align=center]left:{\footnotesize $f(\mathsf{TCGTC})$\\\footnotesize$=-1.3$}}]{};
      \node (a3) at (0,3)
      [acteur,label={[align=center]:{\footnotesize $f(\mathsf{CGTCT})$\\\footnotesize$=1.6$}}]{};

      \node (a4) at (2.5,0) [acteur,label={[align=center]below:{\footnotesize $f(\mathsf{TCTCG})$\\\footnotesize$=1.6$}}]{};
      \node (a5) at (2.5,3) [acteur,label={[align=center]:{\footnotesize $f(\mathsf{GTCTC})$\\\footnotesize$=-0.031$}}]{};

      \node (a6) at (5,0) [acteur,label={[align=center]below:{\footnotesize $f(\mathsf{CTCTC})$\\\footnotesize$=0.094$}}]{};
      \node (a7) at (5,3) [acteur,label={[align=center]:{\footnotesize $f(\mathsf{TCTCT})$\\\footnotesize$=1.5$}}]{};

      \draw[->,-latex] (a1) -- (a2);
      \draw (a1) -- (a2) node [midway, fill=white] {\footnotesize $\mathsf{C}$};

      \draw[->,-latex] (a2) -- (a3);
      \draw (a2) -- (a3) node [midway, fill=white] {\footnotesize $\mathsf{T}$};

      \draw[->,-latex] (a3) -- (a5);
      \draw (a3) -- (a5) node [midway, fill=white] {\footnotesize $\mathsf{C}$};

      \draw[->,-latex,label={$c$}] (a5) -- (a7);
      \draw (a5) -- (a7) node [midway, fill=white] {\footnotesize $\mathsf{T}$};

      \path[->,-latex](a7) edge[bend left=30] node[pos=0.5,right] {} (a6);
      \path[->,-latex](a7) edge[bend left=30] node[pos=0.5,midway,fill=white] {\footnotesize $\mathsf{C}$} (a6);

      \path[->,-latex](a6) edge[bend left=30] node[pos=0.5,right] {} (a7);
      \path[->,-latex](a6) edge[bend left=30] node[pos=0.5,midway,fill=white] {\footnotesize $\mathsf{T}$} (a7);

      \draw[->,-latex] (a6) -- (a4);
      \draw (a6) -- (a4) node [midway, fill=white] {\footnotesize $\mathsf{G}$};

      \draw[->,-latex] (a4) -- (a1);
      \draw (a4) -- (a1) node [midway, fill=white] {\footnotesize $\mathsf{T}$};

      \draw[->,-latex] (a5) -- (a4);
      \draw (a4) -- (a5) node [midway, fill=white] {\footnotesize $\mathsf{G}$};

    \end{tikzpicture}

    \caption{A jump-constrained graph derived from measurement levels in Scrappie \cite{Oxford2013}. The edges are channel inputs and the nodes are a state $s\in\Omega$ with channel mapping $f(s)$.}
    \label{fig:ssplot}
\end{figure}

\begin{figure}[h]
\vspace{-2mm}
\centering
\begin{tikzpicture}[scale=0.8]

\begin{axis}[%
at={(0.758in,0.481in)},
scale only axis,
xmin=0.1,
xmax=0.4,
xlabel style={font=\color{white!15!black}},
xlabel={$\sigma$},
ymin=0.05,
ymax=0.34,
ylabel style={font=\color{white!15!black}},
ylabel={Rate (bits/base)},
axis background/.style={fill=white},
title style={font=\bfseries},
title={i.u.d. jump-constrained achievable information rates},
xmajorgrids,
ymajorgrids,
legend style={at={(0.03,0.03)}, anchor=south west, legend cell align=left, align=left, draw=white!15!black}
]
\addplot [color=white!75!gray, line width=1.0pt, mark size=4.0pt, mark=o, mark options={solid, white!75!gray}]
  table[row sep=crcr]{%
0.1	0.3064\\
0.15	0.3064\\
0.2	0.3064\\
0.25	0.3065\\
0.3	0.3064\\
0.35	0.3066\\
0.4	0.3066\\
};
\addlegendentry{$\Lambda=\{1\}$}

\addplot [color=lightgray, line width=1.0pt, mark size=2.7pt, mark=triangle, mark options={solid, lightgray}]
  table[row sep=crcr]{%
0.15	0.3062\\
0.2	0.3063\\
0.25	0.3062\\
0.3	0.3063\\
0.35	0.3062\\
0.4	0.3059\\
};
\addlegendentry{$\Lambda=\{2,3\}$}

\addplot [color=white!50!darkgray, line width=1.0pt, mark size=2.7pt, mark=triangle, mark options={solid, rotate=270, white!50!darkgray}]
  table[row sep=crcr]{%
0.15	0.3062\\
0.2	0.3062\\
0.25	0.3063\\
0.3	0.3059\\
0.35	0.2428\\
0.4	0.2478\\
0.45	0.192\\
0.5	0.1238\\
};
\addlegendentry{$\Lambda=\{2,3,\ldots,6\}$}

\addplot [color=gray, line width=1.0pt, mark size=5pt, mark=diamond, mark options={solid, gray}]
  table[row sep=crcr]{%
0.1	0.3062\\
0.15	0.3063\\
0.2	0.3063\\
0.25	0.3005\\
0.3	0.2419\\
0.35	0.1694\\
0.4	0.1349\\
};
\addlegendentry{$\Lambda=\{1,2\}$}

\addplot [color=black!25!gray, line width=1.0pt, mark size=2.8pt, mark=square, mark options={solid, black!25!gray}]
  table[row sep=crcr]{%
0.1	0.3062\\
0.15	0.3063\\
0.2	0.3044\\
0.25	0.2531\\
0.3	0.1634\\
0.35	0.1081\\
0.4	0.086\\
};
\addlegendentry{$\Lambda=\{1,2, 3\}$}

\addplot [color=darkgray, line width=1.0pt, mark size=2.7pt, mark=triangle, mark options={solid, rotate=180, darkgray}]
  table[row sep=crcr]{%
0.1	0.3062\\
0.15	0.3054\\
0.2	0.3061\\
0.25	0.2047\\
0.3	0.1307\\
0.35	0.0985\\
0.4	0.0744\\
};
\addlegendentry{$\Lambda=\{1,2,\ldots,5\}$}

\addplot [color=black!50!darkgray, line width=1.0pt, mark size=4.0pt, mark=x, mark options={solid, black!50!darkgray}]
  table[row sep=crcr]{%
0.1	0.3062\\
0.15	0.3063\\
0.2	0.3036\\
0.25	0.2051\\
0.3	0.1393\\
0.35	0.0977\\
0.4	0.0591\\
};
\addlegendentry{$\Lambda=\{1,2,\ldots,10\}$}

\node[above] at (50,260) {$H_{max}=0.3063$};

\end{axis}
\end{tikzpicture}%
\caption{Achievable rates using the independent and uniformly distributed (i.u.d.) input distribution for the example in Fig. \ref{fig:ssplot}.}
\label{fig:info_rates}
\vspace{-4mm}
\end{figure}
\vspace{3.5mm}
\section{Conclusion}
In summary, we proposed the NNC for modelling the dominant distortions of the nanopore sequencer. We filled the gap in previous works by including duplications in the model, while maintaining tractability. The tractability of the model was demonstrated by the detection algorithms that generalised their classical counterparts. We estimated achievable rates for an example NNC using methods closely tied to GBAA.

This paper established a model with basic tools before coding schemes are considered in our future work. Such coding schemes will have to satisfy the source constraints required for synthesis and sequencing of DNA, all while being efficiently decodable. Our detection algorithms open the possibility of iterative decoding of LDPC codes with the generalised forward-backward algorithm, or sequential decoding of convolutional codes with the generalised Viterbi algorithm. We are hopeful that this avenue of research will lead to reliable nanopore sequencing.

\clearpage
\newpage
\IEEEtriggeratref{8}

redpajama_set_name: RedPajamaArXiv


text:
Real estate crowdfunding startup CrowdStreet turns to its customers to raise $12M round
by Nat Levy on November 6, 2019 at 7:00 am November 6, 2019 at 9:46 am
The CrowdStreet team. (CrowdStreet Photo)
CrowdStreet, a Portland-based commercial real estate crowdfunding startup, has raised a big new funding round, with a twist. Instead of relying solely on venture capital investors, the startup turned to its own community of real estate investors and developers to raise the bulk of the money for its Series C round.
The result: CrowdStreet this morning announced it has raised $12 million, primarily from the users of its platform, bringing lifetime funding to $25 million.
CrowdStreet CEO Tore Steen. (CrowdStreet Photo)
"We pride ourselves in democratizing access to commercial real estate investing, so we wanted to take it one step further and provide individual investors the opportunity to invest in a round that traditionally would have gone entirely to VCs," Tore Steen, CrowdStreet's CEO said in a statement.
The round comes just days after the company announced several major executive hires, including a new CFO and CTO.
Real estate continues to be a hotbed for technology investment and innovation. CrowdStreet is part of a growing ecosystem of real estate startups and heavyweights in the Pacific Northwest trying to transform how people buy and sell homes and how commercial developers build major projects. CrowdStreet's focus is on connecting real estate developers seeking capital to finance projects with investors.
CrowdStreet expects investment volume on its platform to reach $500 million this year alone. That's more investment activity than the platform saw in its first five years combined. The six-year-old company employs 92 people today, and it expects headcount to reach 100 by the end of the year.
Nat Levy is a staff reporter at Geekwire covering a variety of technology topics, including Microsoft, Amazon, tech startups, and the intersection of technology with real estate, courts and government. Contact him at nat@geekwire.com and follow him on Twitter at @natjlevy.
Planting the seeds of digital agriculture: Startup bets the farm on Microsoft's new ag tech platform
Tech Moves: OneLogin snags ex-DocuSign security leader; Hootsuite's longtime CEO steps down
Filed Under: Real Estate • Startups Tagged With: Crowdfunding • crowdstreet • Real Estate • Startup funding • Venture capital
Real estate investment platform CrowdStreet raises $8M to develop new products and services
Real estate tech startups surge on the GeekWire 200 as investors bet on sector's long-term growth
A big year for Pacific Northwest startups: Unicorn births, key exits, and others waiting in the wings
Real estate tech startup Savvy Lane raises $2M with plans to keep moving into West Coast markets
ControllerCraftAg


text:
フィアー3
Day 1 Studios
PC, PS3
06/21/11 Warner Bros. Interactive
F.E.A.R. 3 (X360)
Eight months ago, Point Man and his F.E.A.R. squad were tapped to stop an unknown man who had commandeered a secret battalion of telepathically-controlled supersoldiers at the Armacham research facility in the Northwestern US city of Fairport. During the mission Point Man learned that the man wasn't working alone. In fact, the very people Point Man was working to destroy were his telepathic, cannibalistic brother, Paxton Fettel, and his tortured and psychically powerful mother, Alma Wade—products of Armacham's perverse paranormal experiments. Despite this revelation, Point Man moved forward with the standing F.E.A.R. team orders to stop the targets at any cost. In a last-ditch attempt to end the pair's homicidal rampage, the F.E.A.R. team set in motion an explosive series of events that seemingly accomplished their goal but at the cost of ravaging the city, its inhabitants and almost all of Point Man's squad mates.
For months following the blast, events in Fairport have made it clear that Alma's psychic influence survived—and worse, her paranormal power is growing and spilling into reality. Now her supernatural agony repeatedly rocks the city as she attempts to secure the survival of her bloodline and reunite her family. Armacham's security force remains violently focused on eliminating all evidence of the events in the city, and the remaining F.E.A.R squad carries on the mission to stop Alma.
With the chain of command broken and Point Man calling his own shots, where will his allegiance lie? With his brother Paxton Fettel, back from the dead, arriving with an unclear agenda and refusing to leave Point Man's side? With his pregnant mother Alma and her horrifically twisted, yet immensely powerful paranormal existence? Or with his remaining F.E.A.R. squad brethren who are hell bent on saving the world, but at the cost of destroying the only blood ties Point Man has ever had?
(Official site)
Release Date Added to Database oliist 11th May 2011
Game Information Updated oliist 11th May 2011
Release Date Added to Database oliist 27th Apr 2011
Game Information Updated oliist 28th Mar 2011
Release Date Added to Database oliist 23rd Mar 2011
Release Date Added to Database oliist 12th Jan 2011
Release Date Added to Database oliist 28th Oct 2010
Boxart Added oliist 23rd Apr 2010
1 n/a 60,711 14,403 11,224 86,338
2 n/a 11,504 10,401 3,273 25,178
3 n/a 7,308 5,423 1,902 14,633
5 1,379 4,046 1,774 870 8,069
6 534 2,271 1,711 595 5,111
8 254 777 1,100 280 2,411
9 254 1,172 988 323 2,737
10 213 1,281 861 320 2,675
thewastedyouth posted 18/06/2012, 04:23
I think FEAR 3 sold around 500,000 and a little bit more in all platforms
epic fail!!!
Mr Puggsly posted 27/02/2012, 08:20
I love the gun play, but the punishing difficulty and endless enemies thrown at you makes this game feel cheap and boring.
yahoocom1984 posted 28/09/2011, 10:24
FEAR 1 was PC title in a long time and that game is so much better than this crap
yo_john117 posted 24/09/2011, 09:22
Wow this should have sold so much better than the abomination of a game called FEAR
pokymon90 posted 24/07/2011, 01:03
great sales!!!!!!!!!!!!!!!!!!! i think cars 2 has more sales on all its systems than fears xbox and pc
-ku- posted 04/07/2011, 12:10


Moving your home or planning to build a new house or thinking about a house renovation! Whatever it is, you will surely want to make use of a self storage unit for making a temporary arrangement to store your belongings.
Are you residing, working or passing through the Western Suburbs in Sydney? Hills Self Storage can be of assistance as they have self storage facilities across Sydney in three locations namely, Castle Hill, Galston, and Kings Park/ Blacktown.
6 square meters with 17.4 cubic meters: This is ideal for storing contents of one bedroom. It can cover white goods, bedroom furniture; small relax room furniture and boxes etc.
9 square meters with 26.1 cubic meters: Perfect for storing contents of up to two bedrooms. This one is often recommended when you have to put your house on sale as it facilities for storing everything in your home.
Storage Tip: It's recommended to leave your fridge doors half open so as to avoid mould formation.
About Renting Period: You can rent them for the period comprising 1 to 6 months, 6 months to 12 months or over 12 months as per your requirement.
Flexibility to Alter Size of the Storage Units: You only pay for the space you have rented, and don't have to rent beyond your need. Also, you will get the flexibility to alter the size of the storage units as and when required by you. That means you can increase or reduce the size of the storage units per your changing requirement, if any.
Car Storage Facility: You will also get separate space wherein you can store your car.
Wine Storage Facility: You will get separate storage area for storing your precious wine. Wine cellars are temperature controlled spaces so that your wine tastes perfect when you get hold of them.
Are you interested? Know in detail about features and services of these self storage units.


All fields are required with *.
We are excited to welcome you to our community!
Once you've submitted your application we will contact you within two weeks regarding your acceptance.
Click here if your professional information is the same as your personal information.
2. Tell us about your current practice, including the average number of clients you see each week.
3. Please describe the components of your professional support system, e.g. relationships with mentors or colleagues, clinical supervision, networking groups, professional organizations?
I understand the Zero Balancing Certification Program and courses are not designed nor intended to grant a legal privilege to do hands-on therapy and do not provide a legal basis from which to do so. It is my responsibility to satisfy any state or local requirements to practice hands-on professional work.
I agree to complete all requirements of the program including attending 100 hours of approved classes, passing a written exam, passing a practical exam, submitting an evaluation, and payment of fees.
I understand this program is to be completed within three (3) years from the date of acceptance. One additional year may be granted by sending in a written request and paying a non-refundable fee of $150. Candidates who do not complete the program by their completion date will be considered withdrawn.
I understand that following receipt of an acceptance letter from the ZBHA, I may refer to myself in writing as a ZB Certification Candidate or a Candidate in the Zero Balancing Certification Program.
Upon successful completion of the ZBHA Certification Program, candidates will become Certified Zero Balancers and members of the ZBHA. Membership benefits and status are maintained by paying yearly dues.
I understand the terms Zero Balancing® and Certified Zero Balancer® and the Zero Balancing logo are registered trademarks and may not be used without the sanction of the Zero Balancing Health Association. I understand I may use these terms after I am certified as long as I maintain active membership in the ZBHA.
I have read and agree to the Ethics Guidelines of the ZBHA.
I acknowledge and agree with the preceding statements.


Joseph Hinson was booked on 2/8/2019 10:07:58 AM. Hinson was arrested by BOONE COUNTY in Boone, Indiana. Hinson was 35 years old at the time of the arrest.
Joseph Hinson may not have been convicted of the charges or crimes listed and are presumed innocent until proven guilty. Please contact the BOONE COUNTY for more information regarding arrest records.


text:
SHOWCASE PRESENTS: ROBIN, THE BOY WONDER VOL. 1
U.S. Price: $16.99
Don't miss this massive volume collecting stories from Batman #184, 192, 227, 229-231, 234-236, 239-242, 244-246, 248-250, 252, 254, Detective Comics #386, 390, 394-395, 398-403, 445, 447, 450-451, Jimmy Olsen #91 and 111, Justice League of America #50 and 91-92, Teen Titans #14, Brave and the Bold #83 and #100 and World's Finest #195 and #200!
The DC Book Club: Batman Noel
Join the DC Book Club -- This month we're reading Batman: Noel!
Cover Color by: Drew R Moore
Inker Jim Aparo, Mike Grell, Dick Giordano, Nick Cardy, Neal Adams, Frank McLaughlin, Frank Giacoia, Vince Colletta, Joe Giella, Mike Esposito, Terry Austin, Murphy Anderson, Irv Novick, Richard J Buckler Sr.
Penciller Curt Swan, Chic Stone, Al Milgrom, Mike Grell, Dick Giordano, Nick Cardy, Bob Brown, Neal Adams, Dick Dillin, Irv Novick, Mike Sekowsky, Sheldon Moldoff, Gil Kane, Richard J Buckler Sr., Ross Andru, Jim Aparo
Written by: Bob Haney, Bob Rozakis, Frank Robbins, Elliot Maggin, Mike Friedrich, Dennis O'Neil, Gardner Fox, Cary Bates
Commissioner James Gordon
Jay Garrick
Jimmy Olsen
Perry White
Solomon Grundy
Kid Flash
Justice Society of America


It is all so retrograde, so Reform Party.
Stupid-on-crime legislation: arbitrary minimum sentences, the (in)effectiveness of which mere politicians, especiallly coat-tail draggers from the so-called Conservative Party, cannot assess; prisons to the right of us, prisons before and behind, both a school for crime and a school for scandal; "anti-drug laws" which will treat teenage foolishness like drug trafficking.
Where will the funds come from – all the while calling for deficit and debt reduction.
Will they come from the same social services which reduce crime rates, the rates we know have been reducing crime incidence over the past 30 years along with a simply aging population?
Stupid-on-crime legislation, an omnibus bill; this is not what we voted for. We did not vote to bring an end to civil society, to decency, to justice, or holding the government to account even in majority from its own benches by real MPs.


As a Worship Leader, do you struggle with uniting the tech team and the musicians into one cohesive team?
LEARN how to strategically unite those serving on your tech team with those who serve as musicians into one team that worships and serves together in this webinar by Grant Norsworthy.
Grant Norsworthy: More Than Music Mentor is dedicated to providing high quality onsite and online training for the heart and the art of worshiping musicians everywhere. Grant Norsworthy – the founder and content developer of More Than Music Mentor – has the passion, expertise, experience and the teacher's gift to equip Church instrumentalists, singers and technician towards artistic excellence and authentic worship.
Since 2007, he has instructed countless musicians of all skill levels, across a wide spectrum of musical styles and many different denominations, throughout the USA and around the world.
As a member of top Contemporary Christian Music bands PC3 (Paul Colman Trio) and Sonicflood, as a session/touring bassist and as a solo artist, Grant has achieved significant success as a musician; including a Grammy® nomination and a Dove Award.
But it's by serving The Church with More Than Music Mentor that he has truly found his voice and calling.
Originally from Melbourne Australia, Grant now lives in Nashville, Tennessee, USA with his wife Brooke and three sons Max, Marcus and Casper.
Grant Norsworthy is a wholehearted advocate for Compassion International and has seen over 7,000 needy children find sponsors through his efforts. He has encountered the work of Compassion first hand "on the field" in Thailand, Rwanda and The Dominican Republic. Experiences there have profoundly and irrevocably altered Grant's faith and perspectives.
Are you a WTTU Member? Did you know you could get this free?


Dr. Kevin Broyles leads the HOPE worldwide Bolivia team and serves as the country's medical director., and is also the lead medical professional at the Centro Medico Internacional Hope Clinic. The clinic serves one of La Paz' most affluent communities and is the first step in creating a social enterprise where profits will fund and support the work in Bolivia's vulnerable populations, including its children.
Additionally, Dr. Broyles coordinates the medical related activities of the health Social Services Division of Hope worldwide Ltd within South America, providing relief services for the impoverished, and coordinating learning and volunteer opportunities.
Dr. Broyles moved to Bolivia in 2011 after spending four years as the associate chief medical officer for Duke Primary Care in the Duke University Health System. From 1998 – 2007, he was the senior medical director of Duke Urgent Care Services.
Dr. Broyles received his bachelor's degree from Florida State University in biology in 1982, and his medical degree from the University of Florida College of Medicine in 1986. He served his residency at the Duke University School of Medicine between 1986 and 1989, and completed a fellowship in faculty development at Duke in 1990.
Dr. Broyles began his medical career as a clinical staff physician in Chapel Hill, NC in 1990 and beginning in 1992, served as the medical director of the Lakewood on Broad Family Practice, PA in Durham, NC for the next seven years before becoming a staff physician at Duke.
Dr. Broyles leads the Hope worldwide Bolivia team with his wife, Noelle. He is a member of the board of directors of the La Paz Christian Church where they worship.
Dr. Broyles received a master's degree in health science in clinical leadership in 2002.
While the deacon of missions at the Triangle Churches in Chapel Hill and Raleigh, NC between 2004 and 2001, Dr. Broyles served as a site-coordinator for the KenyaKids Child Sponsorship Program in which teams of students and families served the poor in the slums of Nairobi, Kenya.
Dr. Broyles serves as a consultant to Hospital Arco Iris in La Paz. He assists the 100- bed full-service hospital in leadership development, financial sustainability and in development of Bolivia's first educational nursing program.


text:
Le rio di (ou de ) San Giovanni Laterano (canal de Saint-Jean-de-Latran) est un canal de Venise dans le sestiere de Castello.

Description
Le rio di San Giovanni Laterano a une longueur de .
Il prolonge le rio di Santa Marina en direction est, depuis l'endroit (le ponte Consafelzi) où il se fourche en deux bras formant outre le présent rio, le rio della Tetta. Lorsqu'il croise les rii de San Antonin et de Santa Giustina, il se mue en rio di San Franceso.

Toponymie
Le nom provient de l'ancienne église San Giovanni di Laterano.

Situation
 Ce rio croise aussi le rio di San Lorenzo sur son flanc sud.

Ponts

Il est traversé par trois ponts :
le Ponte Muazzo entre le sotoportego du même nom et le Campiello Cappello à l'est ;
le pont privé San Giovanni au 6396 ;
le Ponte de l'Ospedaletto entre la calle du même nom et la calle Tetta. Ce pont est nommé d'après un petit hospital au bout de la calle fondé en 1527 sur le site Bersaglio (galerie de tir) et devenu en 1807 asile pour hommes vieillards et impotents pauvres ;

Voir aussi

Articles connexes
 Liste des canaux de Venise

Liens externes

Giovanni Laterano


Hydraulic fracturing, more commonly referred to as fracking, is a type of drilling in which tight-rock formations, such as shale, are accessed from the surface with a drill that descends at least a mile. Once the optimal depth is reached, the drill is slowly turned to a horizontal position from which it can continue for several thousand feet. Once these offshoots of the main well have been drilled, they will be cased and cemented and a mixture of water, sand, and additional elements will be pumped through perforations in the well pipe.
The process of fracking allows a single surface site to accommodate multiple wells in order to maximize output without disturbing excess land on the surface.
In 2012, shale gas constituted 40 percent of the total U.S. production. The EIA predicts that number will increase to as much as 53 percent by 2040 due to the unprecedented level of access into tight-rock formations that fracking allows.
If you are considering whether or not to sell the mineral rights to your property, our team of representatives can answer any and all of your questions. Learn more about selling your mineral rights today by calling The Mineral Auction at (512) 698-2802.