A big trope in fanfiction is the idea of people having soul mates. I'm not going to lie, it's the perfect plot piece because it allows you to have your One True Pairing without actually having to explain how the hell they could possibly end up together. Plus, it can be done in so many different ways that it will probably never go out of style. Almost like the Marriage Law that seems extremely prevalent in the Harry Potter fandom.
What has peaked my interest about the soulmate trope, is the "Your soulmate's name appears somewhere on your body" idea that's been popping up lately. The few times that I have seen it, the name will usually appear on a character's wrist, although it can show up elsewhere like your heart. There's also the variations on it: some will just have a letter, some allow the letter to grow into a name, some only have the first name, and some allow for the names of two different people at the same time. A lot of times, if it's a May/December romance, one of the characters will go years without having a name on their wrist and, depending on the stigma in their community, may or may not feel incomplete because of it.
It's a solid idea, and I will even admit that I have played with the soulmate trope myself (involving personal visits to Cupid), but I am curious as to where this idea came from and how it got so popular. I'm not saying it's something that is just sweeping all of the fandoms, but I've seen it popping up in my Harry Potter and Avengers fanfiction, and even Glee, according to A3O. There has to be something to it.
Fanlore.org cites a Live Journal thread for a BBC Sherlock prompt session as an example for this subtrope, but it's dated for the 30th of December 2011, which would probably be a bit too recent. Unfortunately, Archive of Our Own's oldest fanfic using that trope is dated for New Years Day 2012 (it's a Teen Wolf fanfic, in case you were wondering).
Wattpad has an entry dating back as far as August 25, 2011, for a story about soulmate's names showing up on people's wrists (I want to make a side note that Wattpad seems to be like a Facebook for writers). Judging from the prologue it seems like that story will get icky somewhere down the line though.
Still, from what I've gathered, the idea behind the soulmate's subtrope is the 2009 indie movie, TiMER. Basically there's a company the sells these clocks that they put into your wrist that will countdown to the moment that you're supposed to meet your soulmate. And like every "knowing something specific about your soulmate before you meet them" story, the main character's clock is blank. Go figure.
So in the first two years since this movie was shown at Tribeca (it won an award), people were writing reviews about it and a couple of writers begin to formulate the "names on wrist" idea. By 2011 you start to see it pop up in a few fanfics, but it's not until the end of that year that it shows up in a fandom big enough to make waves (like Sherlock). And then in 2012, we see an explosion of fanfics using this idea.
Admittedly, this subtrope will never be as big as the Marriage Law – which is somehow managing to pop up outside of the Harry Potter fandom (Gundam Wing and X-Men, for some reason) – but it has the same kind of staying power. It's something that can easily be explained and is usually set up to seem too complicated to be entirely shot down. It's actually harder to work a loophole into soulmate story than it is for one in a Marriage Law story; you will never find a fanfic that manages to completely circumvent a soulmate bond without lasting repercussions. It's a foolproof plot.
Unfortunately, in most cases, the soulmate trope, as well as the Marriage Law, only works in Alternative Universes. If your fandom does not allow for it in canon, how can you use it in canonical fanfiction? Soulmates are of the fantasy genre, and Marriage Law is, at best, an emergency reaction to a population ravaged by war. Both work in the Harry Potter canon because it is fantasy/adventure and partially stuck in a particualar historical period. Any other fandom needs fair warning.
In any case, I like this new subtrope and I think it should be expanded on. I expect to write a fanfic review for a story that uses it soon. I don't know if I will be writing anymore posts like these in the future, but keep your fingers crossed for me. Writing about fanfiction and its trends is something that I've always wanted to persue.


text:
Q: How to remove only last new line with regular expression in javascript I have a file like so:
const stringToTest = ' test1\n test2\n test3\n \n \n'

The output I want to get is:
stringTransformed = 'test1\n test2\n test3\n \n'

so in other words I want to get rid of only LAST white space and new line:
' \n'

I have tried following:
stringToTest.replace(/\s+\n$/, '')

but it removes all white spaces and new lines at the end of the file.
I know I can do it with split and join but I would prefer to do it with regular expression as it's much faster and sometimes my strings are really big so I don't want to split them into arrays.

A: Your \s pattern matches any whitespace. If you subtract CR and LF symbols from it, you will only match horizontal whitespaces.
So, you may use
replace(/[^\S\n\r]*\n$/, '')

Or, to also handle CRLF endings:
replace(/[^\S\n\r]*\r?\n$/, '')

Note I changed + to * quantifier to also remove the last line break if there are no horizontal whitespace chars on the line before the last newline.
JS demo:

const stringToTest = ' test1\n test2\n test3\n \n \n';
console.log(stringToTest.replace(/[^\S\n\r]*\n$/, ''));

redpajama_set_name: RedPajamaStackExchange


text:
Home » Business » You are reading »
Top 10 Online B2b Portals in World In 2021
By admin | Business | | Add Comment
Online businesses have taken over the markets and have opened doors for enormous opportunities to people; the people include both traders and buyers. Nonetheless, B2B businesses have made the most of the opportunities and have created a sustainable trade system for the world.
B2B portals and marketplaces have led a way for businesses of each scale either small, medium, or large to come up and do desirable trade with the most suitable clients. The B2B portals have overcome all the boundaries and limitations to trade in specific areas, today you can connect to a business without any limitation of regions or boundaries.
Even though the world has been hit hard with the pandemic and post-pandemic effects, the B2B portals still managed to do convenient trade as much as they could and kept in mind all the policies to follow in the pandemic. To have an understanding of the marketplaces and to trade easily, here are the top 10 online B2B portals in world in 2021.
com: Global Trade Starts Here
com for All the Business Needs
EWorldTrade as the Ultimate Products Provider
com to Trade Internationally
Made-in-China.com Connecting Chinese Suppliers to the World
com the Best Affordable B2B Portal
com for Global Outreach
EC21 for Global Marketing and Consulting
com the Best Indian B2B Portal
com Reasonable B2B E-commerce Platform
1. Alibaba.com: Global Trade Starts Here
2. Amazon.com for All the Business Needs
3. EWorldTrade as the Ultimate Products Provider
4. Globalsources.com to Trade Internationally
5. Made-in-China.com Connecting Chinese Suppliers to the World
6. DHgate.com the Best Affordable B2B Portal
7. ETradeasia.com for Global Outreach
8. EC21.com for Global Marketing and Consulting
9. IndiaMart.com the Best Indian B2B Portal
10. TradeKorea.com Reasonable B2B E-commerce Platform
Alibaba.com is the largest B2B platform in the world. They promote global trade and supply products around the globe. The portal has a huge customer base; the user-base is of 755 million customers to date. This B2B marketplace was initiated with the sole aim of trade and global business in 1999.
The portal operates in more than 200 countries of the world covering almost all the regions and markets around the globe. The portal has earned revenues of 509,711 billion yuan or 509.7 billion USD, this is the highest of all the B2B marketplaces of the world and therefore, the business is supposed to reach number one in 2021.
Amazon.com is a well-known source for B2B and B2C trade around the globe. This platform has a huge user-base and is a reliable source of products for millions. Its name claims that this B2B portal has everything covered from A to Z.
You will find all the products at reasonable pricing. The business initially started as a bookselling company in 1995 and further expanded into this new market.
EWorldTrade is an emerging B2B platform that has come a long way in the time of 10 years only. The business caters to more than 500,000 active users and has a database of buyers, suppliers, manufacturers, and intermediaries from around the world.
The platform is designed to provide feasible trade options with safety, timeliness, and authenticity. This is a US-based business but its main operations function from Pakistan.
Globalsources.com is yet another huge name in the list of top B2B portals of the world. The portal isspread over 240 countries of the world and does equally fine in each region. It has a whopping 1.5 million user-base.
You can connect to thousands of manufacturers, buyers, exporters, importers, etc. This marketplace holds the top 94 retailers from the list of top 100 retailers of the world under its umbrella.
Made-in-China.com is a Chinese initiated B2B portal that provides the buyers from all over the world with products from Chinese suppliers only. The Trade is open to the world and the platform has millions of users on it.
The marketplace offers a variety of products in thousands of categories; this portal is on the way to become the largest Chinese business like Alibaba. To facilitate the users, they offer services in multiple languages.
DHgate.com is yet another huge B2B portal that caters to four million users worldwide. The business is spread in over 230 countries in the world. It mainly deals in wholesale and bulk products supplies to the buyers.
You will find thousands of relatable buyers, sellers, and manufacturers selling the best authentic products. The business was initiated in 2004 and is leading the way towards successful trade.
Etradeasia.com is also an emerging B2B portal where trade is done comfortably and with the utmost ease. The portal holds a strong user-base of almost 700,000 active members. The business has millions of products in thousands of categories.
The portal has thousands of suppliers, manufacturers, and dealers who provide ultimate quality and authentic products. The pricing they offer is also affordable for businesses to do feasible trade with the world.
EC21.com is one of the top B2B portals that facilitates small and medium scale manufacturing businesses. It has all the solutions for you to collaborate with the required sellers or buyers for your business. It offers authenticity, quality, and reliability of the products traded from all sources. They have the best customer care system where you can connect to an experienced professional 24/7.
IndiaMart.com is also one of the leading B2B portals that have more than a million active users from around the world. Along with Alibaba, this is the largest source of B2B operations for the locals. It is the largest online Indian B2B portal. They have a strong clientele including the corporate sector as well.
TradeKorea.com being one of the finest B2B portals in the world holds a clientele of millions of users. It has a reach to global buyers and it abides by all the product needs of the buyers timely. You can easily get the best products at reasonable pricing.
Can these platforms help me in my home-based business?
Yes, all of these platforms deal with Business-to-Business activities, it does not matter what type or what scale of business you have, and you can get the best deals from these portals.
https://www.migramatters.com/top-10-online-b2b-portals-in-world/ adminBusiness
Online businesses have taken over the markets and have opened doors for enormous opportunities to people; the people include both traders and buyers. Nonetheless, B2B businesses have made the most of the opportunities and have created a sustainable trade system for the world. B2B portals and marketplaces have led a...
admin [email protected]AdministratorMigraMatters
«Next Post A Comprehensive SEO Guide for eCommerce Sites
Top 7 WordPress Plugins for Website Development Previous Post»

redpajama_set_name: RedPajamaCommonCrawl


text:
Сарайки  — деревня в Воротынском районе Нижегородской области, в составе Красногорского сельсовета. .

Географическое положение
Деревня Сарайки расположена в 1 км к югу от федеральной трассы «Волга» и в 19 км к западу от районного центра Воротынец.

История
В сторону реки Имзы от деревни находится Татарское озеро, которое, по местному преданию выкопали татары - собиратели дани, и в котором они купали своих лошадей. Около озера находили ржавые сабли и мечи, что указывает на место поселения, а возможно, и древнего сражения.

Литература
Едранов Е.А. На священной речке. - Н. Новгород: 2013. с. 252.

Ссылки

 История деревни фото и видео. Проект Старинные деревни и села Нижегородской области.

Примечания

Населённые пункты Воротынского района

redpajama_set_name: RedPajamaWikipedia


text:
HomePrivacy Statement
Towson University is committed to protecting your privacy and personal information.
This privacy statement primarily addresses ways Towson University ("TU") collects and manages both personally identifiable and non-personally identifiable information for users of its various websites and online portals.
TU complies with both federal and state law regarding privacy rights. For example, as a state agency, TU does not create personal records unless the need for information is clearly established. Such records must be relevant to the purposes for which they are collected, be accurate and current, and not be obtained by fraudulent means.
TU collects and retains relevant information, including "education records" as defined under the Family Educational Rights and Privacy Act (20 U.S.C. § 1232g; 34 C.F.R. Part 99) ("FERPA"), for both prospective and enrolled students. Its purpose is to further its mission, including providing successful academic opportunities throughout a student's academic journey. Students' education records are protected and not disclosed to third parties unless the student consents to the disclosure or a FERPA exception applies. Learn more about TU's compliance with FERPA.
Data Collection Forms
TU's websites allow users to do things like request information, opt-in to receive messages/updates, register for events, purchase goods, and complete various tasks. To do so, TU uses electronic forms which collect necessary information, such as first and last name, address, phone number, and email address. This information is provided voluntarily and can be inspected and updated at a user's request.
TU uses various user-tracking technologies, including cookies, which allow it to collect and analyze user data. Information collected in this way includes how often a user visits a site, where users enter the site (e.g., by clicking on an advertisement or link on another web page), and what actions users take while on TU's websites. TU utilizes this aggregate- and user-level site data to benchmark performance of websites and inform marketing strategies.
Individual web browsers provide instructions on rejecting or deleting cookies. Please note some website pages and applications may not function properly if cookies are rejected or deleted.
TU uses display advertising on other websites and search engines which measure performance and user behavior as it relates to those ads. Third parties, such as Google, Facebook, and YouTube, show TU ads to various audiences. These third parties then provide data to TU which helps it evaluate performance and assess user interactions before, during, and after visiting a TU website. To do so, TU places tags or pixels on its websites to capture information and inform interest-based advertising.
Protecting personal information is our priority. TU takes appropriate and necessary actions to safeguard user information and personal records. It employs reasonable practices to help prevent the loss or misuse of data. Learn more about the university's data privacy practices.
Beginning May 25, 2018, the European Union ("EU") will enforce data protection legislation known as GDPR, which requires TU to protect the personal data of EU residents. Protected personal data includes IP address, email address, and other device identifiers. TU is committed to processing personal data in compliance with GDPR.
This statement has been updated as of May 25, 2018. Additional updates will be added to this page. TU reserves the right to revise this statement at any time.
If you have any comments or questions about this Privacy Statement or would like to contact a TU representative regarding privacy or your personal information, please contact infosec AT_TOWSON.


We greatly appreciate the support of our community. Click "Donate Now" to make a contribution to our school.
Wasatch Charter School is a K-8 tuition-free, charter school in the Salt Lake Valley guided by the principles of public Waldorf education.
We integrate academics, arts, movement, nature, and social responsibility into everyday learning.


text:
Crunch is Proof that Video Game Executives Don't Understand Video Games
by Shamus Young 2 months 0 comments
A couple of weeks ago, MovieBob talked about the problems the video game industry has with crunch and why it's a bad thing. I was in the tech sector during the dot-com boom and I worked on several projects that required crunch conditions, so I thought I'd add my perspective.
The popular narrative is that executives are amoral meanies who work their employees long hours to save money. While there are lots of examples of that sort of behavior, this narrative misses the nuance in how tech culture works. I agree that crunch is hard on workers, hard on families, and generally bad for the quality of the game and the bottom line, but I think it's a little more complex than the cliche sweatshop metaphor. Not all crunch time is created equal. Crunch isn't always the result of malice, and sometimes it's not even the fault of management. Before I condemn the perma-crunch that plagues the industry, let me defend temporary limited crunch as a way of meeting firm deadlines.
Scheduling is Hard
Scheduling for software development is notoriously difficult. It's tough to predict how long a given task will take because you often can't anticipate the problems you'll face. This is particularly true if you're dealing with tight hardware constraints and high performance requirements, which is the norm in gaming. Accurately scheduling a game means knowing how long it will take to come up with solutions you haven't thought of to problems you don't know you'll have.
If testing reveals that the game is suffering from occasional but serious frame drops because the levels are just a little too big for the console you're targeting, it's not always obvious what the correct solution is. Maybe you need to take the really big levels back to the design phase and chop them up until they fit comfortably in memory. Or maybe the programming team needs to put in some time and see if they can make the engine more efficient. The first option will make the game less fun by giving you more joy-killing loading screens, while the second option is a bit of a gamble because there's no guarantee that the coders will be able to save enough memory to make the existing levels work. Maybe they'll spend weeks tuning the engine and then you'll have to chop up the levels anyway. By that time, chopping up the levels will be even more difficult because they'll be closer to completion.
These kinds of problems happen less often if your team is really familiar with the hardware. As everyone gains experience, they get better at estimating what challenges they're going to run into and what sorts of solutions work best. Then the industry moves to a new console generation and everyone goes back to guessing. This is why the janky games tend to happen early in the lifespan of a console and things get smoother and prettier as the tools mature.
Scheduling is also hard because game development is inherently a creative and collaborative process. Many people have to work together for years to create a game, and that's not a recipe for predictability. I've watched and read a lot of postmortems, and I've never heard of a team making exactly the game they had planned out in the original design document. At some point, the specs will change. A designer will come up with a better idea. Analysis will reveal the original design contains degenerate strategies or major imbalances. Gameplay fads will shift, making some of the original design seem stale. Playtesting will discover some emergent gameplay that's really fun and should be embraced as part of the design.
On top of that is the normal tendency to engage in feature creep. There will always be someone on the team advocating "just one more little feature". It's hard to say no to ideas that sound fun, but the cumulative effect is that the spec grows and all those little features combine to create a lot of extra work.
Consider the case of the 11th hour change of the art style for Borderlands. Originally Borderlands was supposed to have a much more gritty and photorealistic art style. Very late in development the team realized the realism wasn't working and decided to embrace the comic book design the series is now famous for. That move created a ton of additional work for the team, but it was also an immense improvement to the quality of the experience. It's possible this move saved the franchise. A grim and gritty Borderlands may have faded into the background like so many other forgettable shooters of the time period. The developers had to make a personal sacrifice to make this change to the game, and while I don't know any of the developers personally, I'm willing to bet they would say the sacrifice was worth it.
Borderlands looked a whole lot different at the beginning.
The problem is that games often have a fixed release schedule. If the new version of Microsoft Office is taking longer than anticipated, Microsoft can shove it to the next fiscal quarter without crippling the company. It's much harder for a game to miss its release window, because the marketing campaign (which often costs as much as the budget for the entire game) is usually paid for and planned a year in advance. More importantly, the release schedule is usually set to avoid conflicts with competing games. If you're releasing an open-world third-person game set in a big city, you really don't want to release too close to the next Grand Theft Auto. A delay might push your project into a release slot against a stronger title, which can kill a game. For contrast, Microsoft Office is a well-established product and it isn't going to live or die based on its release date.
More People, More Problems
When a project is late, it's easy to blame management for not hiring enough people. But even if budget wasn't a concern, there's only so much work you can get done by throwing more bodies at a problem. If a project is late, adding people will usually make it even later, because now everyone needs to stop and train all the newbies to bring them up to speed. As the team size expands, collaborative friction increases. The bigger the team, the more time needs to be spent in meetings to keep everyone coordinated. It's like the human resources equivalent of the tyranny of the rocket equation: The more people you have, the more everyone's productivity will be consumed by office politics, interpersonal conflicts, and efforts to organize, measure, and coordinate work.
To sum up: Assuming your game isn't a cookie-cutter title, it's hard to predict how long it'll take to develop the mechanics and write the software. Even if you predict correctly, ambitions will grow and features may creep into the design because your game is being made by gamers and overcoming challenges is in their blood. The end of the project is where the irresistible force of creative ambition meets the immovable object of the ship date. Sometimes it's necessary for the team to work extra hours to close this gap.
In these cases, there's no villain. The publisher isn't being a cruel taskmaster and the developer isn't irresponsible. It's just that we live in a complex world where we find ourselves up against difficult problems and we have finite time and manpower to deal with those problems.
Farmers work long days around harvest time, retail workers are busy around Christmas, and video game journalists basically stop sleeping when E3 rolls around. There's nothing insidious or exploitative about having a few weeks of long hours at the end of a project. I've worked on projects where we had to crunch a little to meet our deadline. It was sometimes fun, sometimes frustrating, but I always understood it as a natural byproduct of living in an imperfect world where ambitions are at odds with available resources.
However, none of that excuses perma-crunch.
People like to cite the various articles or studies showing that worker productivity drops off sharply above a certain number of hours worked. Those studies all meet with my personal experience and observations, with one small qualifier: I think people can effectively crunch for short bursts of time without suffering from the predicted falloff in productivity. The exact threshold varies from person to person. Some hit their limit after a couple of weeks, and some can go as long as six before the high workload begins to take its toll. Young people can crunch for longer than old, but sooner or later everyone runs out of momentum. Enthusiasm fades, fatigue sets in, workers become estranged from their families, and output plummets. After that point, additional crunch mode makes them angry, disloyal, and uncreative, without getting the job done any faster.
While I defend brief short-term "sprinting" at the end of a project to make sure you hit a ship date, I insist that prolonged crunch is the work of fools and idiots. It's all cost and no benefit. If your team spends six months in crunch mode and is still falling short of the ship date, what's your plan? If everyone is already working at maximum capacity, then you can't speed things up.
Morale matters. Video games is a creative industry. Developers aren't digging ditches. The product is the result of their collective creative output and their ability to collaborate. If everyone is tired and irritable, then the quality of their work will fall. Even if you're an amoral manager who doesn't care anything about your staff, you still need to avoid prolonged crunch because it lowers the overall quality of your game. You're creating a situation where your top talent will leave, the game will take even longer to develop, and the product will drop in quality. You're inflicting both short-term and long-term damage to your company and your products. There's no way that makes financial sense. It would be better to miss your ship date.
Perma-crunch is more proof for the thesis that I keep revisiting in this space: Executives at the big publishers do not understand the industry they're trying to run. If an executive understood game development, they would be able to intuitively understand the reality of crunch. If an executive understood the business well enough that they could understand the schedule and project milestones, then they would be able to observe how dangerous long-term crunch mode is. Even if that boss cares nothing for their staff and has purely selfish motives, they ought to be throwing people out of the office at 6PM rather than let the team burn itself out early.
I said that scheduling is hard, but it's not impossible. You can get projects done on time. It takes knowledge and experience, but companies do pull it off. You just need a leadership that understands the business they're trying to run.
As one final warning to executives: There will be consequences for all of this. Maybe folks will unionize. Maybe there will be congressional hearings and legislation. Maybe there will be large protests. Regardless of what form the backlash takes, it will be a bad time for you. The loot box thing came back to bite you, and that's not going to go away. If you have any sense at all — any shred of self-preservation — you'll stop the death march crunch mode now. When the outrage boils over to the wider culture, it will create new headaches that you haven't even dreamed of. At that point, a missed ship date will be the least of your problems.
Shamus Young
Shamus Young is a game developer, critic, and novelist. He's just published a new cyberpunk novel. Check it out!
Related to: ActivisionAnthemBiowareBorderlandsBorderlands 3Electronic ArtsExperienced PointsgearboxGrand Theft AutoMortal Kombatwarner bros


text:
Gov't Achievements
Finance Minister's approval of ADB loan to Mc Dan illegal – Minority
The Minority in Parliament has described the process through which a loan facility was given to Mc Dan Shipping Company Limited as illegal.
The Minority argued that the Finance Minister Ken Ofori Atta usurped the authority of the board of ADB by approving GH¢10million loan facility for Mc Dan.
At a press conference held on Tuesday, September 5, 2017, the Minority leader Haruna Iddrisu alleged that Ofori Atta single-handedly, approved the loan facility, in breach of the country's financial laws.
The Minority said that Ofori-Atta issued a letter to the Managing Director of ADB to grant the loan to the shipping company to finance a contract with COCOBOD.
"The contract for which authorization of the ADB loan was approved by the Minister of Finance, we are told, originated from the Ghana Cocoa Board."
"Serious question arise that seem to be whether they have demonstrated respect to our procurement processes. The breach is an affront to corporate governance processes and procedures in our country," he added.
He called on President Nana Addo Dankwa Akufo-Addo to ensure the loan is reversed for the due diligence to be done.
"We, therefore, call on President Nana Addo Danquah to direct the reversal of this illegal decisions and acts of malfeasance as well as taking steps to restore good corporate governance," he pleaded.
Okyehene Palace to be upgraded to modern standards
ONE CONSTITUENCY, $1MILLION IS A HOAX!
Albert B. Sackey writes: Common sense versus POPULISM
Govt threaten to arrest picketing nurses at Health Ministry
Akufo-Addo to reshuffle ministers soon
GARGANTUAN CORRUPTION HITS USAG JUDICIAL BOARD
We need to improve on our communication strategy–Okudzeto Ablakwa


NCALM is based at the University of Houston and is operated in partnership with the University of California, Berkeley. The center is supported by the National Science Foundation and is associated with the multi-disciplinary Geosensing Systems Engineering & Sciences graduate program at the University of Houston.
OpenTopography has released a new publically-available NCALM lidar dataset covering 28 km2 of the San Andreas Fault near Parkfield, California. The data were part of the Seed Proposal program and collected for a student PI. Read more at opentopography.org, where the data is also available. You can find out more about the Student Seed Proposal program here.
The National Center for Airborne Laser Mapping surveys multiple projects each year for graduate student PIs whose research would be enhanced by airborne lidar data and visible imagery. Students write and submit a two- to three-page proposal to be considered for an award (details at: ncalm.cive.uh.edu/seed/about). The applications are reviewed by the NCALM Steering Committee, who then select winners based on intellectual merit and broader impact.
Planning for the 2019 Mexico and Central America Lidar Collection Campaign for Small- and Medium-Sized Projects is ongoing. Currently there are 14 committed projects in Mexico, Belize, Guatemala, El Salvador, and Honduras. NCALM has applied for a temporary export license of the mapping equipment and is working with project PIs to acquire the necessary permits for each location.
NCALM is enthusiastic about this first international small-project campaign and is eager to begin the data collection portion. Principal Investigators can expect regular updates through email as we coordinate and arrange assistance for each project. We anticipate beginning to map in April/May.
Dr. Craig Glennie was awarded the Osman Ghazzaly Faculty Achievement Award from the Department of Civil & Environmental Engineering (CEE). The award is presented each year to an outstanding faculty member in recognition of their innovation and excellence in teaching, research, or service. He received the award at the 2019 Civil & Environmental Engineering Gala, where other awardees and scholarship recipients were also honored. Dr. Glennie is an NCALM PI and Associate Professor in CEE. Congratulations, Craig!
Read about this year's recent Civil & Environmental Enginnering Gala & Induction Ceremony here. Pictures of the event can be viewed here.


text:
A controversial $160 million investment fund created by the Pedro Rossello administration to promote economic development.  The PRIIF was funded by U.S. companies operating under Section 936 of the federal tax code in exchange for not paying approximately $960 million in tollgate tax obligations to Puerto Rico.

Xavier Romeu was the President of the PRIIF from April 1999 to December 2000 and held two of three seats on the Fund's Board of Directors.

Sources
 Comisión Independiente de Ciudadanos para Evaluar Transacciones Gubernamentales
 PUERTO RICO HERALD: Blue Ribbon Finds Pridco Misused Public Funds…
 PUERTO RICO HERALD: Calderon Urged To Approve Plan For Vieques
 PUERTO RICO HERALD: Blue Ribbon Finds Pridco Misused Public Funds…

Government agencies of Puerto Rico


text:
BRIONNE JANAE
Please tell us about the making of "Newly Wed."
"Newly Wed" comes from the section of my book set in 1910 in the Black town of Slocum, Texas. I had just read a book on African American history and there was a section where they talked about the majority black towns where there were middle/professional class black folks, doctors, teachers, etc., as well the working and impoverished class people that we see so frequently in photographs in grade school history books. I was taken by the idea of an insular independent Black town, and I wanted to write poems from the voices of folks in the town. "Newly Wed" came me asking what it would be like when people in the town married between classes. Particularly, I was imagining what the experience of a woman raised with middle class privilege, whose parents had expected her to become a teacher or wife to a professional, would be once she married a man living near poverty. I also was interested in what it must have been like to be a young bride back in 1910 when women, especially Black women, had so little space in the world. I imagined it must've been nerve racking to think you're supposed to spend the rest of your life trying to keep some man happy. Essentially, "Newly Wed" comes from me trying to travel back through generations and figure out what it means to be and do and exist in a time that's so different from our own.
What does a typical writing session look like for you?
My writing practice is pretty fluid in that I almost never write a poem from start to finish in the same location. I typically start a poem in a public place, usually a cafe, and I normally will flip through the notes on my phone where I keep any half-baked ideas I want to write about. Once I've decided on an idea, I normally pull out a notebook and write by hand as I look for a way into the poem. This part of the process is typically pretty frustrating for me because starting things (especially poems) is hard for me, and until I've found my first line, the poem can often feel shapeless and impossible. That said, the beginning of a poem and my entrance into the poem are not necessarily the same thing. There are plenty of times where I've found my entrance into the poem and I'll get half way through the revision process and realize that the first line I have is actually not the beginning to the poem, and then I will start obsessively re-ordering everything. Finding my entrance into the poem is a big part of the process, though, because it lets me know what the line lengths, tone, and cadence of the poem will be.
Once I've found a way into the poem and have a few lines and some momentum going, I usually switch to working on my computer and will try to bang out a full draft or at least get to the turn in the poem before coming home.
Most of the real work of crafting and reorganizing and shaping the poem usually happens at home in my bed, usually between 8:00 p.m.-12:00 a.m. While at the coffee shop, I'm usually complaining to myself and on social media about how hard it is to start a poem. At this stage, I often become a little obsessive, like I can't go to sleep or do anything else until the poem feels right.
Do you practice another form of art? If so, do you find that it competes with or complements your writing?
Sometimes I draw in my spare time, and I used to be in band when I was in high school, though I rarely play these days. When I do, though, I find that drawing and playing music can put me into a meditative/open head space that allows for poem ideas to happen.
Do you have any poems in mind that you would like to write, but you know they are not ready to be written yet?
Yes, I definitely do. I frequently have ideas for poems that I know I want to write, but also know I'm not the person/poet I need to be to write it yet. For instance, once in grad school when I was working on my first book, After Jubilee, I discovered this image of Laura Nelson, an African American woman who was lynched in the early 1900s. I knew as soon as I saw the picture that I wanted to write something about it, but I also knew that I couldn't yet. I needed distance from the rawness of having just seen that image for the first time, and I needed the will to access that emotional space of memorializing a woman who was lynched alongside her son for trying to defend him. I didn't write that poem until at least six months after having first seen the image. And then one day I sat down to write and reached for a poem, and that one came.
How do you approach revision?
Obsessively. I'm pretty bad at revising poems after they've sat for more than a month. But in the first three to seven days after writing the initial draft, I can easily come up with seven or eight different drafts/revisions of a poem. When I'm revising, I'm normally in my room, reading the poem aloud over and over again and changing things that don't sound right and figuring out where I need to cut or add more. It's strange, but sometimes I can literally feel in my body when some part isn't working or needs to be cut, but I'll occasionally be resistant to cutting a line or phrase because I like it so much. Inevitably, though, after reading the poem several times aloud and stumbling or grimacing over the awkward line, once I cut it, there's this feeling of relief, like OMG, this feels so much better now.
I'm also a very big fan of writing in community. When I lived in Boston, I used to meet up with a group of poet friends to workshop poems once a month, and now that I've moved, I still send them my work. Whether I take their advice or not (and I usually do eventually), it's good to have another set of eyes on a poem to confirm for me whether something is or is not working.


We're often told that men are impossible to buy for, but if the man in your life likes cars (or tinkering with any kind of motor) and food, we think we've found the perfect present!
The Spanner Cheese Knives Gift Set by Culinary Concepts is very crafty cutlery - two cheese knives (one for hard cheeses, one for soft) with handles that are exact replicas of traditional drop forged spanners. They are sure to raise a smile when taken out of their charmingly retro gift box and give the user a warm glow every time they use them (as they are reminded of happy times tinkering under the bonnet).
These Spanner Cheese Knives are the perfect gift, stocking filler or personal treat for the car or mechanics enthusiast who loves their cheese and they also make a great talking point on the cheese board when entertaining.
Both cheese knives have strong stainless steel blades. The first is ideal for a variety of harder cheese, and its two pronged end makes spearing your slice easy and mess-free. The second knife has an aerated blade making it perfect for softer cheeses such as Brie or Camembert.


You are named on the web site (logo + link to your web site).
You are named on the documents distributed during the summer school.
You receive 1 free registration.
You are named on documents distributed during the summer school.
You receive 2 free registrations.
You have a dedicated table to showcase your products and technology during the summer school.
Excellent young talents will draft proof-of-concept solutions to problems. These problems have been defined by industry experts and researchers in a preceding workshop.
Your sponsoring helps us to attract the brightest young talents to the summer school, regardless of their financial situation and traveling distance.
A subsequent expert review in September checks the further viability of the initial solutions developed during the summer school.
Workshops provide network to partners for subsequent experimentation and implementation in projects. In particular, we are aligned closely with cutting-edge activities such as the Boost4.0 EU project on Big Data for Factories.


text:
news, world
Two experts from the international team commissioned by the World Health Organisation (WHO) to research the origins of the coronavirus have not been allowed to enter China, the Wall Street Journal reports. Sources told the newspaper that Chinese officials prevented two people on the 15-member team from boarding the plane to Wuhan during a layover in Singapore. In a screening before their departure, both had tested positive for the presence of coronavirus antibodies, indicating a prior infection at some point. But swab tests conducted on the two found them currently negative for Covid-19. The rest of the team arrived in the central Chinese city of Wuhan, officials confirmed on Thursday, after a protracted tug-of-war about the trip. The WHO team includes an Australian. Australian Associated Press
/images/transform/v1/crop/frm/silverstone-feed-data/ce47eb34-be31-4441-a3dd-03c9f751d938.jpg/r0_74_800_526_w1200_h678_fmax.jpg
China denies entry to two WHO team members
A team of WHO scientists probing coronavirus origins has arrived in Wuhan, minus two members.
Two experts from the international team commissioned by the World Health Organisation (WHO) to research the origins of the coronavirus have not been allowed to enter China, the Wall Street Journal reports.
Sources told the newspaper that Chinese officials prevented two people on the 15-member team from boarding the plane to Wuhan during a layover in Singapore.
In a screening before their departure, both had tested positive for the presence of coronavirus antibodies, indicating a prior infection at some point.
But swab tests conducted on the two found them currently negative for Covid-19.
The rest of the team arrived in the central Chinese city of Wuhan, officials confirmed on Thursday, after a protracted tug-of-war about the trip.
The WHO team includes an Australian.
Ambulance Tasmania boss set to resign
Gay rights activists call for blood donation rule change
Helicopters sent to fight bushfire in state's East
New child safety data labelled 'horrifying', 'appalling'
'Absurd': Tourism boss lashes Incat Bass Strait crossing plan


So what is the role of demand forecasting software in your business, as you are aware demand planning and demand forecasting deals with determining the future demand of your inventory and with planning what your company should do to influence inventory demand concerning sales, selling, prices and marketing?
While this might sound simple enough, it is, however, also a process of uncovering uncertainties connected with the inventory forecast and inventory demand, i.e. a risk analysis when it comes to the inventory demand. Are you starting to see the role of demand forecasting software when it comes to demand forecasting and inventory planning?
As we all know the goal of demand planning and to a certain degree demand forecasting software is to plan and develop an inventory forecast, which is feasible and exploits market opportunities and available resources. Remember all goals needs to SMART and the "A" means attainable while the "R" stands for realistic. That is the key to demand forecasting software and something that at Intuendi focuses on is that what is produced by our demand forecasting software is realistic and usable by all of our clients.
To be successful companies must take an overall view, not just a simple observation but aggregating complicated bits of information, comparing different factors and modelling different scenarios to identify the risk and highlight the best model for that inventory item. This is all made possible with the use of demand forecasting software which develops a complex digital model of how demand emerges, and how the inventory forecast is to be calculated.
How does demand forecasting software work and go about creating your demand forecast? Well to develop your inventory demand model, which includes prior sales data and causal factors, the demand forecasting software should identify the demand drivers and/or demand indicators, which are significant to your inventory demand.
This can be achieved through a realistic assessment, test and simplification and a data identification process, ending with a mathematical model or as you would know it as a demand forecast. This should go some way to explain what your demand forecasting software is actually doing. However, a better way might be to see it work on your data, click on the button below for a free trial of Intuendi demand forecasting software.


text:
from temboo.core.choreography import Choreography
from temboo.core.choreography import InputSet
from temboo.core.choreography import ResultSet
from temboo.core.choreography import ChoreographyExecution

import json

class CSVToXML(Choreography):

    def __init__(self, temboo_session):
        """
        Create a new instance of the CSVToXML Choreo. A TembooSession object, containing a valid
        set of Temboo credentials, must be supplied.
        """
        super(CSVToXML, self).__init__(temboo_session, '/Library/Utilities/DataConversions/CSVToXML')

    def new_input_set(self):
        return CSVToXMLInputSet()

    def _make_result_set(self, result, path):
        return CSVToXMLResultSet(result, path)

    def _make_execution(self, session, exec_id, path):
        return CSVToXMLChoreographyExecution(session, exec_id, path)

class CSVToXMLInputSet(InputSet):
    """
    An InputSet with methods appropriate for specifying the inputs to the CSVToXML
    Choreo. The InputSet object is used to specify input parameters when executing this Choreo.
    """
    def set_CSV(self, value):
        """
        Set the value of the CSV input for this Choreo. ((required, multiline) The CSV file to convert to XML. Your CSV data must contain column names.)
        """
        super(CSVToXMLInputSet, self)._set_input('CSV', value)

class CSVToXMLResultSet(ResultSet):
    """
    A ResultSet with methods tailored to the values returned by the CSVToXML Choreo.
    The ResultSet object is used to retrieve the results of a Choreo execution.
    """

    def getJSONFromString(self, str):
        return json.loads(str)

    def get_XML(self):
        """
        Retrieve the value for the "XML" output from this Choreo execution. ((xml) The XML formatted data.)
        """
        return self._output.get('XML', None)

class CSVToXMLChoreographyExecution(ChoreographyExecution):

    def _make_result_set(self, response, path):
        return CSVToXMLResultSet(response, path)

redpajama_set_name: RedPajamaGithub


"available": "No hay datos disponibles."
Please take this into consideration, as other providers from my country will find it very useful.
WHMCS can check the availability of over 800 domain extensions as standard. Any additional whois servers can be added at your end by creating a /resources/domains/whois.json file and entering the whois server details for the desired TLD.
Yes. I know I can add it manually. I did it, actually. But I wanted to look for a way to make this source always available so you don't have to readd the code after every WHMCS upgrade. Possible?
The whois.json file is not overwritten when updating WHMCS, so custom whois servers remain defined after applying an update.
Seriously? Wow, I had paused updates to avoid having to use time to readd code.
@marceloP: The dist.whois.json will get overwritten. However, you can make your own whois.json which will not get overwritten. I can confirm the whois.json does not exist in the latest download of WHMCS.


Currently a third year at IAUPR School of Optometry, I am also the Co-President of NOSA and AOSA InfantSEE Liaison. I chose optometry for its versatility and dynamic nature. I believe that a well-rounded experience that is based in service and community involvement is essential to students because it not only balances academics, but allows them to contribute to practice clinical skills and make a difference while still in school.


text:
\section*{Acknowledgements}
\noindent We express our gratitude to our colleagues in the CERN
accelerator departments for the excellent performance of the LHC. We
thank the technical and administrative staff at the LHCb
institutes. We acknowledge support from CERN and from the national
agencies: CAPES, CNPq, FAPERJ and FINEP (Brazil); MOST and NSFC
(China); CNRS/IN2P3 (France); BMBF, DFG and MPG (Germany); INFN
(Italy); NWO (The Netherlands); MNiSW and NCN (Poland); MEN/IFA
(Romania); MinES and FASO (Russia); MinECo (Spain); SNSF and SER
(Switzerland); NASU (Ukraine); STFC (United Kingdom); NSF (USA).  We
acknowledge the computing resources that are provided by CERN, IN2P3
(France), KIT and DESY (Germany), INFN (Italy), SURF (The
Netherlands), PIC (Spain), GridPP (United Kingdom), RRCKI and Yandex
LLC (Russia), CSCS (Switzerland), IFIN-HH (Romania), CBPF (Brazil),
PL-GRID (Poland) and OSC (USA). We are indebted to the communities
behind the multiple open-source software packages on which we depend.
Individual groups or members have received support from AvH Foundation
(Germany), EPLANET, Marie Sk\l{}odowska-Curie Actions and ERC
(European Union), ANR, Labex P2IO, ENIGMASS and OCEVU, and R\'{e}gion
Auvergne-Rh\^{o}ne-Alpes (France), RFBR and Yandex LLC (Russia), GVA,
XuntaGal and GENCAT (Spain), Herchel Smith Fund, the Royal Society,
the English-Speaking Union and the Leverhulme Trust (United Kingdom).

\section{Backgrounds}
\label{sec:backgrounds}

In addition to the combinatorial background,
the signal region is also potentially polluted by backgrounds from exclusive decays
where one or more of the final-state particles are misidentified or not reconstructed.
The potentially most dangerous of these backgrounds are hadronic \decay{\B}{\Ph^+ \Ph'^-} decays where both hadrons
are misidentified as an electron-muon pair, resulting in peaking structures near the \decay{\Bs}{e^\pm\mu^\mp} signal mass.
Other decays which could contribute, especially at low invariant masses, are
\mbox{$B^+_c \ensuremath{\rightarrow}\xspace {\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace \ell'^+ \nu_{\ell'}$} with ${\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace \rightarrow \ell^+ \ell^-$, ${\ensuremath{\B^0}}\xspace \ensuremath{\rightarrow}\xspace \pi^- \ell^+ \nu_{\ell}$,
${\ensuremath{\Lz^0_\bquark}}\xspace \ensuremath{\rightarrow}\xspace p \ell^- \overline{\nu}_{\ell}$ and ${\ensuremath{\Bu}}\xspace \ensuremath{\rightarrow}\xspace \pi^{+} {\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace$ with ${\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace\ensuremath{\rightarrow}\xspace\ell^+ \ell^-$,
where $\ell/\ell'^{\pm} = e^{\pm}$ or $\mu^{\pm}$. These decays do not peak under the signal
but are potentially abundant.
The expected number of candidates from each possible background decay that pass the signal selection is evaluated using simulation.
The candidates are normalised to the number of \BuToJpsiK decays found in data as
\begin{equation}
   N_{X} = N_{\BuToJpsiK} \frac{f_q}{f_u} \frac{\BF(X)}{\BF(\BuToJpsiK)\cdot\BF(\decay{\jpsi}{\mu^+\mu^-})} \frac{\varepsilon(X)}{\varepsilon(\BuToJpsiK)},
\end{equation}
where $N_{X}$ is the expected number of candidates from the $X$ decay that fall into the \decay{\Bs}{e^\pm\mu^\mp} signal mass window;
$f_{q}$ is the fragmentation fraction;
$\BF(X)$, $\BF(\BuToJpsiK)$ and $\BF(\decay{\jpsi}{\mu^+\mu^-})$ are respectively the branching fractions of the decay under
study, \BuToJpsiK and \decay{\jpsi}{\mu^+\mu^-}~\cite{PDG2017};
$\varepsilon(X)$ is the efficiency for each considered decay to pass the \decay{\Bs}{e^\pm\mu^\mp} selection; and
$\varepsilon(\BuToJpsiK)$ is the efficiency for \BuToJpsiK candidates to pass the respective selection.

The mass and BDT distributions of these background modes are evaluated using simulated
samples, while the probabilities of misidentifying kaons, pions and protons as muons or electrons
are determined from $D^{*+} \ensuremath{\rightarrow}\xspace D^0 \pi^+$ with $D^0 \ensuremath{\rightarrow}\xspace K^{-} \pi^{+}$ and ${\ensuremath{\PLambda}}\xspace \ensuremath{\rightarrow}\xspace p \pi^-$
decays selected from data.
The expected total number of \decay{\B}{\Ph^+ \Ph'^-} candidates is $0.11\pm0.02$ in the full BDT range,
which is negligible. This yield estimation is cross-checked using data. A sample of \decay{\B}{\Ph^+ \Ph'^-} decays is
selected by applying only a partial \decay{\Bds}{e^\pm\mu^\mp} selection: only the signal electron PID requirements
are applied while the second particle is required to be identified as a pion.
The application of these criteria still leaves a sizeable peak to be fit in data.
The yield of decays identified as ${\ensuremath{\B^0_{(\squark)}}}\xspace \ensuremath{\rightarrow}\xspace e^\pm\pi^\mp$ is then modified
to take into account the probability of a pion to be misidentified as a muon.
After this correction the expected yield is compatible with the yield obtained using the simulation.

The expected yields of most of the other backgrounds are also found to be negligible.
The only backgrounds which are relevant are ${\ensuremath{\B^0}}\xspace \ensuremath{\rightarrow}\xspace \pi^- \mu^+ \nu_{\ell}$
and ${\ensuremath{\Lz^0_\bquark}}\xspace \ensuremath{\rightarrow}\xspace p \ell^- \overline{\nu}_{\ell}$ for which $55 \pm 3$ and $82 \pm 39$ candidates, respectively,
are expected in the full BDT range. The contributions from these two decays are included in the fit model.

\section{Detector and simulation}
\label{sec:Detector}

The \mbox{LHCb}\xspace detector~\cite{Alves:2008zz,LHCb-DP-2014-002} is a single-arm forward
spectrometer covering the \mbox{pseudorapidity} range $2<\eta <5$,
designed for the study of particles containing {\ensuremath{\Pb}}\xspace or {\ensuremath{\Pc}}\xspace quarks.
The detector includes a high-precision tracking system
consisting of a silicon-strip vertex detector surrounding the $pp$
interaction region, a large-area silicon-strip detector located
upstream of a dipole magnet with a bending power of about
$4{\mathrm{\,Tm}}$, and three stations of silicon-strip detectors and straw
drift tubes placed downstream of the magnet.
The tracking system provides a measurement of momentum, \mbox{$p$}\xspace, of charged particles with
a relative uncertainty that varies from 0.5\% at low momentum to 1.0\% at 200\ensuremath{{\mathrm{\,Ge\kern -0.1em V\!/}c}}\xspace.
The minimum distance of a track to a primary vertex (PV), the impact parameter (IP),
is measured with a resolution of $(15+29/\mbox{$p_{\mathrm{ T}}$}\xspace)\ensuremath{{\,\upmu\mathrm{m}}}\xspace$,
where \mbox{$p_{\mathrm{ T}}$}\xspace is the component of the momentum transverse to the beam, in\,\ensuremath{{\mathrm{\,Ge\kern -0.1em V\!/}c}}\xspace.
Different types of charged hadrons are distinguished using information
from two ring-imaging Cherenkov detectors.
Photons, electrons and hadrons are identified by a calorimeter system consisting of
scintillating-pad and preshower detectors, an electromagnetic
calorimeter and a hadronic calorimeter. Muons are identified by a
system composed of alternating layers of iron and multiwire
proportional chambers.

The online event selection is performed by a trigger,
which consists of a hardware stage, based on information from the muon and calorimeter
systems, followed by a software stage that applies a full reconstruction of the event.
The \decay{\Bds}{e^\pm\mu^\mp} candidates must fulfill the requirements of the electron or muon triggers.
At the hardware stage, the electron trigger requires the presence of a cluster in the electromagnetic calorimeter with a transverse energy deposit, \mbox{$E_{\mathrm{ T}}$}\xspace,
of at least 2.5 (3.0)\ensuremath{\mathrm{\,Ge\kern -0.1em V}}\xspace for 2011 (2012) data. The muon trigger selects muon candidates
with \mbox{$p_{\mathrm{ T}}$}\xspace higher than $1.5$ ($1.8$)\ensuremath{{\mathrm{\,Ge\kern -0.1em V\!/}c}}\xspace for 2011 (2012) data.
The software stage requires a two-track secondary vertex identified by a multivariate algorithm~\cite{Gligorov:2012qt} to be consistent
with the decay of a {\ensuremath{\Pb}}\xspace hadron with at least two charged tracks, and at least one track with high \mbox{$p_{\mathrm{ T}}$}\xspace and large IP with respect to any PV.

Simulated samples are used to evaluate geometrical, reconstruction and selection efficiencies for both signal and backgrounds,
to train multivariate classifiers and to determine the shapes of invariant mass distributions of both signal and backgrounds.
In the simulation, $pp$ collisions are generated using
\mbox{\textsc{Pythia}}\xspace~\cite{Sjostrand:2007gs}
with a specific \mbox{LHCb}\xspace
configuration~\cite{LHCb-PROC-2010-056}.  Decays of hadronic particles
are described by \mbox{\textsc{EvtGen}}\xspace~\cite{Lange:2001uf}, in which final-state
radiation is generated using \mbox{\textsc{Photos}}\xspace~\cite{Golonka:2005pn}. The
interaction of the generated particles with the detector, and its response,
are simulated using the \mbox{\textsc{Geant4}}\xspace
toolkit~\cite{Allison:2006ve, *Agostinelli:2002hh} as described in
Ref.~\cite{LHCb-PROC-2011-006}.

\section{Introduction}
\label{sec:Introduction}

Processes that are suppressed or forbidden in the Standard Model (SM) are sensitive to potential
contributions from new mediators, even if their masses are inaccessible to direct searches.
Despite the fact that lepton-flavour violating (LFV) decays are forbidden within the SM,
neutrino oscillation phenomena are proof that lepton flavour is not conserved in the neutral sector.
However,
LFV decays have not yet been observed, and their observation would be clear evidence of physics beyond the SM.

The study of LFV decays is particularly interesting in light
of hints of lepton non-universality (LNU) effects in semileptonic
decays~\cite{LHCb-PAPER-2015-025} and $b\ensuremath{\rightarrow}\xspace s\ell\ell$
transitions~\cite{LHCb-PAPER-2017-013,LHCb-PAPER-2014-024},
which could be associated with LFV processes~\cite{Guadagnoli}.
Possible explanations of these hints can be found in various scenarios beyond the SM,
\mbox{\itshape e.g.}\xspace models with a new gauge ${\ensuremath{\PZ}}\xspace^\prime$ boson~\cite{Crivellin} or leptoquarks~\cite{Becirevic,Varzielas}.
In these models, the branching fractions of the \mbox{\decay{\Bs}{e^\pm\mu^\mp}} and \mbox{\decay{\Bd}{e^\pm\mu^\mp}} decays\footnote{Inclusion of charge conjugate processes is implied throughout the text.} can be enhanced up to $10^{-11}$.
Other models also predict possible enhancement for \mbox{\decay{\Bs}{e^\pm\mu^\mp}} and \mbox{\decay{\Bd}{e^\pm\mu^\mp}} decays, \mbox{\itshape e.g.}\xspace
heavy singlet Dirac neutrinos~\cite{ilakovac}, supersymmetric models~\cite{susy} and the Pati-Salam model\cite{patisalam}.
The most stringent published limits on the branching fractions of these decays are currently
${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp})< 1.4 \times 10^{-8}$ and ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bd}{e^\pm\mu^\mp}) < 3.7 \times 10^{-9}$ at 95\% confidence level (CL)
from the LHCb collaboration using data corresponding to 1\ensuremath{\mbox{\,fb}^{-1}}\xspace of integrated luminosity~\cite{LHCB-PAPER-2013-030}.

This article presents an analysis performed on a larger data sample, corresponding to an integrated luminosity
of \mbox{3\ensuremath{\mbox{\,fb}^{-1}}\xspace} of $pp$ collisions collected at centre-of-mass energies of 7 and 8~\ifthenelse{\boolean{inbibliography}}{\ensuremath{~T\kern -0.05em eV}}{\ensuremath{\mathrm{\,Te\kern -0.1em V}}}\xspace by the
LHCb experiment in 2011 and 2012.
In addition to a larger data sample, this analysis benefits from an improved selection
and in particular a better performing multivariate classifier for signal and background separation. It supersedes
the previous LHCb search for \decay{\Bs}{e^\pm\mu^\mp} and \decay{\Bd}{e^\pm\mu^\mp} decays~\cite{LHCB-PAPER-2013-030}.

Two normalisation channels are used: the \BdToKpi decay which has a similar topology to that of the signal, and the \BuToJpsiK decay, with \decay{\jpsi}{\mu^+\mu^-}, which has an abundant yield and a similar purity and trigger selection.
To avoid potential biases, \decay{\Bds}{e^\pm\mu^\mp} candidates in the signal region,
$\ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace \in [5100, 5500]\ensuremath{{\mathrm{\,Me\kern -0.1em V\!/}c^2}}\xspace$, where \ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace is the invariant mass of the $e^{\pm}\mu^{\mp}$ pair, were not examined until the selection and fitting procedure were finalised.

\section{Mass calibration}
\label{sec:masscalibration}

The invariant-mass distribution of \decay{\Bds}{e^\pm\mu^\mp} candidates is modelled
by a modified Crystal Ball function~\cite{Skwarnicki:1986xj} with two tails on opposite sides
defined by two parameters each.
The signal shape parameters are obtained from simulation, with data-driven scale factors applied
to the core resolution to correct for possible data-simulation discrepancies.
For this purpose, since there is no appropriate control channel with an electron and a muon in the
final state, \mbox{\decay{\jpsi}{e^+e^-}} and \mbox{\decay{\jpsi}{\mu^+\mu^-}} decays are analysed comparing the
mass resolution in data and simulation.
The results are then combined to reproduce the effect on an $e^{\pm}\mu^{\mp}$ final state.
Corrections to the widths of the mass are of the order of 10\%.
Since bremsstrahlung can significantly alter the mass shape by enhancing the tails,
the fit model for \decay{\Bds}{e^\pm\mu^\mp} candidates is obtained separately for the two bremsstrahlung categories (see Fig.~\ref{fig:masscal}).
The mass shape parameters are found to be independent of the particular BDT bin chosen and
a single model for each bremsstrahlung category is therefore used.

\begin{figure}
\label{fig:bdt_calib_plots}
\centering
\includegraphics[width=.48\textwidth]{Fig3left.pdf}
\includegraphics[width=.48\textwidth]{Fig3right.pdf}
\caption{Distribution of the \ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace invariant mass of simulated {\ensuremath{\B^0_\squark}}\xspace candidates with no (left) and one or more (right)
recovered bremsstrahlung photons. The overlaid fit function is a modified Crystal Ball function with two tails on opposite sides.
}
\label{fig:masscal}
\end{figure}

\section{Normalisation}
\label{sec:normalisation}

The \decay{\Bds}{e^\pm\mu^\mp} yields are obtained from a fit to the lepton-pair invariant mass distribution and translated into branching fractions according to
\begin{eqnarray}
{\ensuremath{\mathcal{B}}}\xspace(\decay{\Bds}{e^\pm\mu^\mp}) &=& \sum_i
    w^i \frac{{\cal B}^i_{\rm norm}}{N^i_{\rm norm}} \frac{\varepsilon^i_{\rm norm}}{\varepsilon_{\rm sig}} \frac{f_q}{f_{d(s)} } \frac{\mathcal{L}_{\rm norm}^{i}}{\mathcal{L}_{\rm sig}}
 \times N_{\decay{\Bds}{e^\pm\mu^\mp}}  \nonumber \\
& = & \alpha_{{\ensuremath{\B^0_{(\squark)}}}\xspace}  \times N_{\decay{\Bds}{e^\pm\mu^\mp}},
\label{eq:normalisation}
\end{eqnarray}
where the index $i$ identifies the normalisation channel and $N^i_{\rm norm}$ and ${\cal B}^i_{\rm norm}$ are its number of candidates and its branching fraction.
The signal yields are denoted by $N_{\decay{\Bds}{e^\pm\mu^\mp}}$ and the factors
$f_{q}$ indicate the probabilities that a {\ensuremath{\Pb}}\xspace quark fragments into a {\ensuremath{\B^0}}\xspace or {\ensuremath{\B^0_\squark}}\xspace meson.
Assuming $f_d=f_u$, the fragmentation probability for the $B^0$ and $B^+$ channels is set to $f_d$.
The value of $f_s/f_d$ used is measured in $pp$ collision data at $\sqrt{s}=7$~\ifthenelse{\boolean{inbibliography}}{\ensuremath{~T\kern -0.05em eV}}{\ensuremath{\mathrm{\,Te\kern -0.1em V}}}\xspace by the LHCb collaboration and is evaluated to be $0.259 \pm 0.015$~\cite{fsfd}.
The two normalisation channels are averaged with weights $w^i$ proportional to the square of the inverse of the uncertainty related to their branching fractions and yields. A correction has also been applied for the marginal difference in luminosity, $\mathcal{L}$, between the channels.
The branching fractions of the signal decays include both charge configurations of the final-state particles, $e^+\mu^-$ and $e^-\mu^+$,
so that {${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bds}{e^\pm\mu^\mp}) \equiv {\ensuremath{\mathcal{B}}}\xspace(\decay{{\ensuremath{\B^0_{(\squark)}}}\xspace}{e^+\mu^-}) + {\ensuremath{\mathcal{B}}}\xspace(\decay{{\ensuremath{\B^0_{(\squark)}}}\xspace}{e^-\mu^+})$}.
The results of the two fits are shown in Fig.~\ref{fig:normalisations} and the measured yields are reported in Table~\ref{tab:normyields}.

\begin{table}[t!]
\caption{Yields of normalisation channels obtained from fits to data.}
\label{tab:normyields}
\begin{minipage}[t]{0.96\textwidth}
\begin{center}
\begin{tabular}{l|r@{}l}
\hline
& Yield\\
\hline
\BdToKpi & \phantom{lll}$49\,907$&\phantom{,}$\pm$\phantom{,}$277$   \\
\BuToJpsiK & $913\,074$&\phantom{,}$\pm$\phantom{,}$1106$ \\
\hline
\end{tabular}
\end{center}
\end{minipage}
\end{table}

\begin{figure}[!t]
\centering
\includegraphics[width=.48\textwidth]{figs/Fig2left.pdf}
\includegraphics[width=.48\textwidth]{figs/Fig2right.pdf}
\caption{Invariant mass distributions of the two normalisation channels with fit functions superimposed: (left) \BdToKpi and (right) \BuToJpsiK.
Pull distributions are shown below each plot.}
\label{fig:normalisations}
\end{figure}

The efficiency ${\rm \varepsilon_{sig(norm)}}$ for the signal (normalisation) channels depends on several factors:
the geometric acceptance of the detector, the probability for particles to produce hits in the detector which can be
reconstructed as tracks, and the efficiency of the selection requirements that are applied both in the trigger and selection stages, which includes
the particle identification requirements. The ratios of acceptance, reconstruction and selection efficiencies are
evaluated using simulation with the exception of the trigger and particle identification efficiencies,
which are not well reproduced by simulation, and are calibrated using data~\cite{Tolk:1701134,Anderlini:2202412}.
Calibration samples where the trigger decision was independent of the candidate decay products are used to study the trigger efficiency.
From these samples, \BuToJpsiK candidates, with \decay{\jpsi}{e^+e^-} and \decay{\jpsi}{\mu^+\mu^-}, are used to study the requirements for the electrons and muons, respectively.
The efficiencies are determined as a function of the \mbox{$p_{\mathrm{ T}}$}\xspace and IP for the muon and \mbox{$E_{\mathrm{ T}}$}\xspace and IP for the electron.
The single-track efficiencies are then combined with a weighted average over the properties of
the electron and muon tracks of a \decay{\Bs}{e^\pm\mu^\mp} simulated sample.

Particle identification efficiencies are evaluated using calibration samples where
the identity of one of the particles can be inferred by means uncorrelated to particle identification requirements.
A tag-and-probe method is applied on {\decay{\jpsi}{\mu^+\mu^-}} and {\decay{\jpsi}{e^+e^-}} decay samples, where only one lepton, the tag, is required to be well identified
and the identity of the other lepton is deduced.
The single-track efficiencies, calculated  as a function of kinematic variables, are then combined and averaged
using the momentum distributions of the leptons in a \decay{\Bs}{e^\pm\mu^\mp} simulated sample.

The two normalisation factors $\alpha_{{\ensuremath{\B^0_\squark}}\xspace}$ and $\alpha_{{\ensuremath{\B^0}}\xspace}$ are determined to be
$(2.48\pm0.17)\times 10^{-10}$ and $(6.16\pm0.23)\times 10^{-11}$.
The total efficiencies for the \decay{\Bd}{e^\pm\mu^\mp}, \decay{\Bs}{e^\pm\mu^\mp}, \BuToJpsiK and \BdToKpi decays are respectively $(2.22\pm0.05)\%$, $(2.29\pm0.05)\%$, $(2.215\pm0.035)\%$ and $(0.360\pm0.021)\%$,
where the efficiencies for \decay{\Bds}{e^\pm\mu^\mp} are for the full BDT and bremsstrahlung category range.

To validate the normalisation procedure,
the ratio between the measured branching fractions of \BdToKpi and \BuToJpsiK is determined as
\begin{equation}

  R_{\rm norm} = \frac{N_{\BdToKpi} \times \varepsilon_{\BuToJpsiK}}{ N_{\BuToJpsiK} \times \varepsilon_{\BdToKpi}} = 0.332 \pm 0.002\ensuremath{\mathrm{\,(stat)}}\xspace \pm 0.020 \ensuremath{\mathrm{\,(syst)}}\xspace,
\end{equation}
where $\varepsilon_{\BuToJpsiK}$ and $\varepsilon_{\BdToKpi}$ are the selection efficiencies for the {\BdToKpi} and {\BuToJpsiK} decays respectively. A correction of about 1\% is applied in order to take into account the difference in luminosity between the two channels.
The value obtained for $R_{\rm norm}$ is in excellent agreement with the measured value of $0.321 \pm 0.013$~\cite{PDG2017}.

\section{Results}
\label{sec:results}

The data sample is split into two bremsstrahlung categories, which are further divided into seven subsets each depending on
the BDT response covering the range from 0.25 to 1.0, with boundaries 0.25, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9 and 1.0.
The region with BDT response lower than 0.25, which is mostly populated by combinatorial background, is excluded from the fit.
The \decay{\Bd}{e^\pm\mu^\mp} and \decay{\Bs}{e^\pm\mu^\mp} yields are obtained from a single unbinned extended maximum likelihood fit performed simultaneously to
the \ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace distributions in each subset. The \decay{\Bds}{e^\pm\mu^\mp} fractional yields and
the mass shape parameters in each category are Gaussian-constrained according to their expected values and uncertainties.
The combinatorial background is modelled with an exponential function with independent yield and shape parameters in each subset.
The exclusive backgrounds are included as separate components in the fit.
Their mass shapes are modelled using nonparametric functions determined from simulation for each bremsstrahlung category.
The overall yields and fractions of these backgrounds are Gaussian-constrained to their expected values.
The result of this fit is shown in Fig.~\ref{fig:fit}.

\begin{figure}[!ht]
\centering
\includegraphics[width=\textwidth]{figs/Fig4.pdf}
\caption{Distributions of the invariant mass of the \decay{\Bds}{e^\pm\mu^\mp} candidates, \ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace, divided into bins of BDT response and two bremsstrahlung categories (left) without and (right)
with bremsstrahlung photons recovered. The result of the fit is overlaid and the different components are detailed.
The edges of the range that was examined only after finalising the selection and fit procedure are delimited by gray dashed vertical lines. This region includes 90\% of the potential signal candidates. Given the result obtained from the fit,
the \decay{\Bd}{e^\pm\mu^\mp} component is not visible in the plots.
}
\label{fig:fit}
\end{figure}

No significant excess of \decay{\Bd}{e^\pm\mu^\mp} or \decay{\Bs}{e^\pm\mu^\mp} decays is observed and upper limits on the
branching fractions are set using the \ensuremath{\mathrm{CL_s}}\xspace method~\cite{Read:2002hq}.
The ratio between the likelihoods in two hypotheses, signal plus background and background only, is used as the test statistic.
The likelihoods are computed with nuisance parameters fixed to their nominal values. Pseudoexperiments, in which the nuisance
parameters are varied according to their statistical and systematic uncertainties, are used for the evaluation of the test statistic.
The resulting \ensuremath{\mathrm{CL_s}}\xspace scans are shown in Fig.~\ref{fig:cls} and upper limits at $95\%$ and $90\%$ confidence level are reported in Table~\ref{tab:upperlimits}.

\begin{figure}[!ht]
\centering
\includegraphics[width=.48\textwidth]{figs/Fig5left.pdf}
\includegraphics[width=.48\textwidth]{figs/Fig5right.pdf}
\caption{Results of the \ensuremath{\mathrm{CL_s}}\xspace scan used to obtain the limit on (left) ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bd}{e^\pm\mu^\mp})$ and (right) ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp})$.
The background-only expectation is shown by the dashed line and the $1\sigma$ and $2\sigma$ bands are shown as dark (green) and light (yellow) bands respectively.
The observed limit is shown as the solid black line.}
\label{fig:cls}
\end{figure}

\begin{table}[t!]
\caption{Expected (assuming no signal) and observed upper limits for $\BF(\decay{\Bs}{e^\pm\mu^\mp})$ and $\BF(\decay{\Bd}{e^\pm\mu^\mp})$ at 95\%\,(90\%) CL. The upper limit on the $\BF(\decay{\Bs}{e^\pm\mu^\mp})$
is evaluated under the assumption of pure heavy eigenstate contribution on the decay amplitude.}
\label{tab:upperlimits}
\begin{minipage}[t]{0.96\textwidth}
\begin{center}
\begin{tabular}{l|c|c}
\hline
channel & expected & observed \\
\hline
${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp})$ & $5.0\,(3.9) \times 10^{-9}$ &  $6.3\,(5.4) \times 10^{-9}$ \\
${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bd}{e^\pm\mu^\mp})$ &  $1.2\,(0.9) \times 10^{-9}$ &  $1.3\,(1.0) \times 10^{-9}$ \\
\hline\end{tabular}
\end{center}
\end{minipage}
\end{table}

Several systematic uncertainties can affect the evaluation of the limit on the \decay{\Bs}{e^\pm\mu^\mp} and \decay{\Bd}{e^\pm\mu^\mp} branching fractions
through the normalisation formula in Eq.~\ref{eq:normalisation} and the fit model used to evaluate the signal yields.
The systematic uncertainties are taken into account for the limit computation by constraining the respective nuisance parameters in the likelihood fit
with a Gaussian distribution having the central value of the parameter as the mean and its uncertainty as the width.
The nuisance parameters for the \decay{\Bds}{e^\pm\mu^\mp} yields are related
to the calibration of the BDT response, the parameters of the signal shape, the estimated yields of the ${\ensuremath{\B^0}}\xspace \ensuremath{\rightarrow}\xspace \pi^- \mu^+ \nu_{\ell}$ and
${\ensuremath{\Lz^0_\bquark}}\xspace \ensuremath{\rightarrow}\xspace p \ell^- \overline{\nu}_{\ell}$ backgrounds and the fractional yield per bremsstrahlung category.
For the limit on the \decay{\Bds}{e^\pm\mu^\mp} branching fractions,
the nuisance parameters are in addition related to the signal efficiency, whose uncertainty is dominated by the systematic uncertainty on the trigger
efficiencies, and the uncertainties on the efficiencies, branching fractions and yields of the normalisation channels.
For the \decay{\Bs}{e^\pm\mu^\mp} branching fraction estimation, Eq.~\ref{eq:normalisation} also includes the hadronisation fraction $f_s/f_d$,
which dominates the systematic uncertainty for the normalisation.
The overall impact on the limits is evaluated to be below 5\%.

The two {\ensuremath{\B^0_\squark}}\xspace mass eigenstates are characterised by a large lifetime difference.
Depending on their contribution to the decay amplitude, the selection efficiency and the BDT shape can be affected.
Given the negligible difference in lifetime for the {\ensuremath{\B^0}}\xspace system, this effect is not taken into account for the \decay{\Bd}{e^\pm\mu^\mp} limit evaluation.
Two extreme cases can be distinguished: when only the heavy or the light eigenstate contributes to the total decay amplitude.
For example, if the only contribution to the LFV \decay{\Bs}{e^\pm\mu^\mp} decay is due to neutrino oscillations, it is expected that the
amplitude is dominated by the heavy eigenstate as for the \decay{\Bs}{\mu^+\mu^-} decay~\cite{LHCb-PAPER-2017-001}.
As the contribution to the total amplitude from the heavy and light eigenstate can have an effect on the acceptance,
the limit on ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp})$ is evaluated in the two extreme cases. The one reported in Table~\ref{tab:upperlimits} and obtained from the CLs scan in Fig.~\ref{fig:cls}, is evaluated assuming only a contribution from the heavy eigenstate. For the light eigenstate case the limit is found to be ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp}) < 7.2\,(6.0) \times 10^{-9}$ at 95\%\,(90\%) CL.

\section{Selection}
\label{sec:selection}

The \decay{\Bds}{e^\pm\mu^\mp} candidates in the events passing the trigger selection are constructed by combining pairs of tracks producing good quality secondary vertices that are separated from any PV in the downstream direction by a flight distance greater than 15 times its uncertainty.
Only {\ensuremath{\B^0_{(\squark)}}}\xspace candidates with $\mbox{$p_{\mathrm{ T}}$}\xspace > 0.5$\ensuremath{{\mathrm{\,Ge\kern -0.1em V\!/}c}}\xspace and
a small impact parameter \ensuremath{\chi^2}\xspace, \ensuremath{\chi^2_{\text{IP}}}\xspace, are considered, where the \ensuremath{\chi^2_{\text{IP}}}\xspace of a {\ensuremath{\B^0_{(\squark)}}}\xspace candidate
is defined as the difference between the \ensuremath{\chi^2}\xspace of the PV reconstructed with and without
the considered candidate. The PV with the smallest \ensuremath{\chi^2_{\text{IP}}}\xspace is associated to the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate.
The measured momentum of electron candidates is corrected for the loss of momentum due to bremsstrahlung.
This correction is made by adding to the electron the momentum of photons consistent with being
emitted from the electron before the magnet~\cite{Kstee}.
Since bremsstrahlung can affect the kinematic distribution of \decay{\Bds}{e^\pm\mu^\mp} candidates,
the sample is split into two categories: candidates in which no photon is associated with
the electron and candidates for which one or more photons are recovered. The fraction of electrons with recovered bremsstrahlung photons is about 60\% for \decay{\Bds}{e^\pm\mu^\mp} decays.
Only \decay{\Bds}{e^\pm\mu^\mp} candidates with $\ensuremath{m_{e^{\pm}\mu^{\mp}}}\xspace \in [4900,5850] \ensuremath{{\mathrm{\,Me\kern -0.1em V\!/}c^2}}\xspace$ are retained to be further analysed.

Particles forming the \decay{\Bds}{e^\pm\mu^\mp} candidates are required to be well identified as an electron and a muon~\cite{muonid},
using information from the Cherenkov detectors, the calorimeters and the muon stations.
These identification criteria are optimised to keep high signal efficiency while
maximising the rejection power for the two-body hadronic $B$ decays, \decay{\B}{\Ph^+ \Ph'^-}, which are
the major peaking backgrounds.

In order to reduce combinatorial background --- combinations of two random tracks that can be associated to a common vertex --- a loose requirement
on the response of a multivariate classifier trained on simulated events is applied to the signal candidates.
This classifier takes the following geometrical variables as input: the direction of the {\ensuremath{\B^0_{(\squark)}}}\xspace meson candidate;
its impact parameter with respect to the assigned PV, defined as the PV with which it forms the
smallest \ensuremath{\chi^2_{\text{IP}}}\xspace; the separation between the two outgoing leptonic tracks at their point of closest approach; and the minimum IP of each lepton particle with respect to any PV.
In total 22~020 \decay{\Bds}{e^\pm\mu^\mp} candidates are selected, which are mainly comprised of combinatorial background that is made up of true electrons and muons.

The normalisation channels are selected with requirements as similar as possible
to those used for the signal. The selection for \BdToKpi candidates is the same as for the \decay{\Bds}{e^\pm\mu^\mp}
channel, except for the particle identification criteria which are changed into hadronic particle identification requirements.
Similarly, the \BuToJpsiK candidate selection is also kept as similar as possible, applying the same selection used
for the signal to the dimuon pair from the {\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace, except for the particle identification requirements.
Additionally, loose quality requirements are applied on the {\ensuremath{\B^+}}\xspace vertex
and particle identification is required on both muons.
Finally, a $60\ensuremath{{\mathrm{\,Me\kern -0.1em V\!/}c^2}}\xspace$ mass window around the nominal {\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace mass and the requirement $1.4 < 1 + p_{{\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace}/p_K < 20.0$ is used.
The latter removes backgrounds that have a least one track that is misidentified and another that is not reconstructed, mainly ${\ensuremath{\PB}}\xspace\ensuremath{\rightarrow}\xspace{\ensuremath{{\PJ\mskip -3mu/\mskip -2mu\Ppsi\mskip 2mu}}}\xspace{\ensuremath{\pion^+}}\xspace X$,
where X can be one or more particles.

\section{BDT training and calibration}
\label{sec:bdtcalibration}

A Boosted Decision Tree (BDT) classifier is used to separate the \decay{\Bds}{e^\pm\mu^\mp} signal from the combinatorial background.
The BDT is trained using a simulated sample of \decay{\Bs}{e^\pm\mu^\mp} events to describe the signal and a data sample of same-sign $e^{\pm}\mu^{\pm}$ candidates
to describe the combinatorial background.
The following input variables are used:
the proper decay time of the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate; the minimum \ensuremath{\chi^2_{\text{IP}}}\xspace of the two leptons with respect to the assigned PV;
the IP of the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate with respect to its PV; the distance of closest approach between the two lepton tracks;
the degree of isolation of the two tracks with respect to the other tracks in the same event~\cite{LHCb-PAPER-2017-001};
the transverse momentum of the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate; the cosine of the angle between the muon momentum in the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate rest
frame and the vector perpendicular to the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate momentum and the beam axis;
the flight distance of the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate with respect to its PV; the \ensuremath{\chi^2}\xspace of the {\ensuremath{\B^0_{(\squark)}}}\xspace candidate decay vertex; the maximum
transverse momentum of the two decay products and their difference in pseudorapidity.

The BDT response is transformed such that it is uniformly distributed in the range [0,1] for the signal, while
peaking at zero for the background.
The linear correlation between the BDT response and the dilepton invariant mass is found to be around 4\%.

Since the BDT is trained using only kinematic information of a two-body {\ensuremath{\B^0_{(\squark)}}}\xspace decay,
its response is calibrated using \BdToKpi decays as a proxy.
To avoid biases, \BdToKpi candidates are selected from candidates where the trigger decision did not depend
on the presence of the {\ensuremath{\B^0}}\xspace decay products.
Furthermore, the candidates are weighted to emulate the effect of the lepton triggers and the particle identification requirements.
The number of \BdToKpi candidates in bins of BDT response is determined by
fitting the ${\ensuremath{\kaon^+}}\xspace{\ensuremath{\pion^-}}\xspace$ invariant mass distribution. As expected, the BDT response is found to be
consistent with a uniform distribution across the range [0,1].
The distribution of the BDT response is also checked
on a \BdToKpi simulated sample and a uniform distribution is obtained. Candidates with a value smaller than $0.25$ are then excluded, as this region is highly
contaminated by background, leaving a total of 476 signal candidates.
The signal candidates are classified in a binned two-dimensional space formed by the BDT response and the two bremsstrahlung categories.
The expected probability density function (PDF) of the BDT response for \decay{\Bds}{e^\pm\mu^\mp} decays with recovered bremsstrahlung photons is shown in Fig.~\ref{fig:bdtresponse}.

Unrecovered bremsstrahlung photons emitted by signal electrons can affect the BDT response and are not accounted
for in the calibration procedure since hadrons do not emit significant bremsstrahlung.
The impact of bremsstrahlung on the BDT response distribution is evaluated using simulation and a correction
is applied where no bremsstrahlung is recovered.

\begin{figure}[!t]
\centering
\includegraphics[width=0.8\textwidth]{figs/Fig1.pdf}
\caption{Expected distribution of the BDT response for \decay{\Bds}{e^\pm\mu^\mp} decays with recovered bremsstrahlung photons obtained from the \BdToKpi control channel.
  The total uncertainty is shown as a light grey band. Each bin is normalised to its width.}
\label{fig:bdtresponse}
\end{figure}

\section{Summary}
\label{sec:summary}

In summary, a search for the LFV decays \decay{\Bs}{e^\pm\mu^\mp} and \decay{\Bd}{e^\pm\mu^\mp} is performed using $pp$ collision data collected at
centre-of-mass energies of 7 and 8\ifthenelse{\boolean{inbibliography}}{\ensuremath{~T\kern -0.05em eV}}{\ensuremath{\mathrm{\,Te\kern -0.1em V}}}\xspace, corresponding to a total integrated luminosity of 3\ensuremath{\mbox{\,fb}^{-1}}\xspace.
No excesses are observed for these two modes and upper limits on the branching fractions are set to ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp}) < 6.3\,(5.4) \times 10^{-9}$
and ${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bd}{e^\pm\mu^\mp}) < 1.3\,(1.0) \times 10^{-9}$ at $95\%\,(90\%)$ CL, where only a contribution from the heavy eigenstate is assumed for the ${\ensuremath{\B^0_\squark}}\xspace$ meson.
If the {\ensuremath{\B^0_\squark}}\xspace amplitude is completely dominated by the light eighenstate, the upper limit on the branching fraction becomes
${\ensuremath{\mathcal{B}}}\xspace(\decay{\Bs}{e^\pm\mu^\mp}) < 7.2\,(6.0) \times 10^{-9}$ at $95\%\,(90\%)$ CL.
These results represent the best upper limits to date and are a factor 2 to 3 better than the previous results from LHCb~\cite{LHCB-PAPER-2013-030}.

redpajama_set_name: RedPajamaArXiv


text:
educational media on the critical issues of our times
A 501(c)(3) Nonprofit Public Benefit Corporation
Home > the arts > Glasnost Film Festival: Black Square & Dialogues
Glasnost Film Festival: Black Square & Dialogues
Films by Joseph Pasternak and Nikolai Obukhovich
Scene Selection • Closed Captioned
Grades 11 - Adult
Item #:GFF-1187
Select DVD License (limited PPR included)
All Groups and Institutions - $79
Volume 7 of the Glasnost Film Festival.
The Glasnost Film Festival is a 12 DVD collection featuring 22 documentary films produced or released in the beginning of the "Glasnost Era" in the Soviet Union, 1986-1988. These independent films definitively document the historic cultural and political shifts that led to greater openness and the eventual demise of the Soviet Union in 1991.
All were produced originally on 35mm film and are subtitled in English.
Black Square, 56 min.
A Film by Joseph Pasternak
Tells the story of Russia's artistic avant-garde from the 1950s to the 1970s, when artists were confronted by semi-official, ideological art. Works could be destroyed by being smashed by a bulldozer, flooded with acid, or covered with concrete.
The film is a cinematic appreciation of works only recently allowed to be exhibited and a story about artists, so many of whom were forced to leave their own country.
Dialogues, 28 min.
A Film by Nikolai Obukhovich
A bacchanal of rock-jazz and a carnival of punk music erupt in an abandoned Leningrad palace. Collective singing, dancing, and playing makes this group of people a community rather than just a crowd.
Preview link available upon request. Contact [email protected] for more information
Reviews and Festivals
"Mesmerizing programs for anyone interested in art, music, or the Soviet Union."
— ABC-CLIO Video Rating Guide for Libraries
"Black Square, a thoughtful provocative survey of Soviet avant-garde artists, who have endured decades of oppression and obscurity for daring to defy the official calendar art style glorifying communist progress. This comprehensive and painful study makes clear that although these artists can now sell their work abroad they have yet to achieve real recognition at home."
— Los Angeles Times
"This is a sample of artistic documentary filmmaking."
— Unnamed Soviet Film Critic
"The best of the lot by far is the witty Dialogues"
— Denise J. Youngblood, The Russian Review
"Controversial saxophonist Sergei Kyryokhin leads a joyously eclectic jam session/concert incorporating everything from jazz, rock, punk and experimental music. (The unlikely site is a formal rococo ballroom in a Leningrad palace.)"
"More recent Soviet music is the subject of...Nikolai Obukhovich's Dialogi (Dialogues) about the improvised musical style of Sergei Kurekhin's band, Popular Mechanics."
— Evgenii Tsymbal, Dammin the tide of glasnost, Index on Censorship
"A dialogue between the PM musicians (including jass musicians) and Vladimir Chekasin's jazz quartet. Obukhovich combined theses scenes with traditional jazz tunes from the Tbilissi Jazz Festival, but leaves the viewer unaware about this fact."
— Hannelore Fobo, E-E The Leningrad 1980s in Evgenij Kozlov's work
"Dialogues is expertly edited to convey the emotional variation from one musician's style to another. Dialogues begins slowly and builds to a crescendo...Black Square and Dialogues are mesmerizing programs for anyone interested in art, music, or the Soviet Union."
Finding Babel
Price: Starting at $99
Glasnost Film Festival - 12 DVD Series
the arts > Music
the arts > Art
global studies > European / Slavic Studies
1-800-4-PLANET (1-800-475-2638) © Copyright . Video Project. All Rights Reserved.


text:
Q: Django: How can I identify the calling view from a template? Short version:
Is there a simple, built-in way to identify the calling view in a Django template, without passing extra context variables?
Long (original) version:
One of my Django apps has several different views, each with its own named URL pattern, that all render the same template. There's a very small amount of template code that needs to change depending on the called view, too small to be worth the overhead of setting up separate templates for each view, so ideally I need to find a way to identify the calling view in the template.
I've tried setting up the views to pass in extra context variables (e.g. "view_name") to identify the calling view, and I've also tried using {% ifequal request.path "/some/path/" %} comparisons, but neither of these solutions seems particularly elegant. Is there a better way to identify the calling view from the template? Is there a way to access to the view's name, or the name of the URL pattern?

Update 1: Regarding the comment that this is simply a case of me misunderstanding MVC, I understand MVC, but Django's not really an MVC framework. I believe the way my app is set up is consistent with Django's take on MVC: the views describe which data is presented, and the templates describe how the data is presented. It just happens that I have a number of views that prepare different data, but that all use the same template because the data is presented the same way for all the views. I'm just looking for a simple way to identify the calling view from the template, if this exists.
Update 2: Thanks for all the answers. I think the question is being overthought -- as mentioned in my original question, I've already considered and tried all of the suggested solutions -- so I've distilled it down to a "short version" now at the top of the question. And right now it seems that if someone were to simply post "No", it'd be the most correct answer :)
Update 3: Carl Meyer posted "No" :) Thanks again, everyone.

A: If your naming is consistent in your urls.py and views.py, which it should be, then this will return the view name:
{{ request.resolver_match.url_name }}

Be sure to apply some context to it when you call it in the template. For example, I use it here to remove the delete button from my detail view, but in my update view the delete button will still appear!
{% if request.resolver_match.url_name != 'employee_detail' %}

A: Since Django 1.5, the url_name is accessible using:
request.resolver_match.url_name

Before that, you can use a Middleware for that :
from django.core.urlresolvers import resolve

class ViewNameMiddleware(object):
    def process_view(self, request, view_func, view_args, view_kwargs):
        url_name = resolve(request.path).url_name
        request.url_name = url_name

Then adding this in MIDDLEWARE_CLASSES, and in templates I have this:
{% if request.url_name == "url_name" %} ... {% endif %}

considering a RequestContext(request) is always passed to the render function. I prefer using url_name for urls, but one can use resolve().app_name and resolve().func.name, but this doesn't work with decorators - the decorator function name is returned instead.

A: Since Django 1.5 you can access an instance of ResolverMatch through request.resolver_match.
The ResolverMatch gives you the resolved url name, namespace, etc.

A: No, and it would be a bad idea.  To directly refer to a view function name from the template introduces overly tight coupling between the view layer and the template layer.
A much better solution here is Django's template inheritance system.  Define a common parent template, with a block for the (small) area that needs to change in each view's version.  Then define each view's template to extend from the parent and define that block appropriately.

A: one simple solution is :
def view1(req):
   viewname = "view1"
   and pass this viewname to the template context

def view2(req):
   viewname = "view2"
   and pass this viewname to the template context

in template access the viewname as
{{viewname}}

and also you can use this in comparisons.

A: This sounds like the perfect example of a generic view that you can set up.
See the following resources:

*

*Django Book - Chapter 11: Generic Views

*Django Docs  -Tutorial: Chapter 4

*Django Docs - Generic Views
These links should help you simplify your views and your templates accordingly.

A: I'm working on this for a help-page system where I wanted each view to correspond to a help-page in my cms with a default page shown if no help page was defined for that view. I stumbled upon this blog where they use a template context processor and some python inspect magic to deduce the view name and populate the context with it.

A: If you're using Class Based Views, you most likely have a view variable you can access.
You can use several methods from that to determine which view has been called or which template is being rendered.
e.g.
{% if view.template_name == 'foo.html' %}
# do something
{% else %}
# other thing
{% endif %}

Another option is to take out the piece of the template where you need something to change and make it into a snippet and then use {% include 'my_snippet.html' with button_type = 'bold' %} in your templates, sending arbitrary values to the snippet so it can determine what to show / how to style itself.

A: Most generic views — if not all — inherits the ContextMixin which adds a view context variable that points to the View instance.

A: In your template, you can access the current view instance like this:
{{ view }}

Define class_name method in your view
class ExampleView(FormView):
    ...
    def class_name(self):
        return self.__class__.__name__

You can get the class name of the current view in a template like this:
{{ view.class_name }}

{% if view.class_name == "ExampleView" %} ... {% endif %}

A: Why not trying setting up a session cookie, then read the cookie from your template.
on your views set cookies
def view1(request):
 ...
#set cookie
 request.session["param"]="view1"

def view2(request):
  request.session["param"]="view2"

then in your ONE template check something like..

{% ifequal request.session.param "view1" %}
   ... do stuff related to view1
{% endifequal %}

{% ifequal request.session.param "view2" %}
  ... do stuff related to "view2"
{% endifequal %}

Gath