Videoscope, (2) Rechargeable Smart Li-ion batteries, Battery charger cradle with power supply, 8GB SD memory card, USB to PC Streaming software, USB 2.0 Cable – 6', User Manual, Storm Case.
The FreedomView Advanced Borescope is a great "grab and go" device ideal for a wide range of applications in aviation, power generators, military and law enforcement inspections. This user-friendly, cost-effective borescope is designed for quick, intuitive inspections on the go that will provide you with informative solutions at a fraction of the price of devices with similar sets of characteristics.
One of such unique characteristics is a patented no-light loss technology that is much more efficient than other conventional illumination methods and provides even, super-bright LED light illumination exactly where you need it.
Its ergonomic, compact design with easy side access to SD card and USB ports and easy-to-use control buttons allow for intuitive, one-handed operation. The whole inspection process can be seen with outstanding clarity on the integral 3.7" transflective touchscreen display.
Due to a long (2m/79") insertion probe, operators can remotely inspect dangerous structures and objects without jeopardizing their health or lives. The 6mm tangsten-braided probe is durable, immersible in water and features a short, 11mm distal tip that articulates 110⁰ in each direction, offering users unparalleled flexibility and maneuverability even in the most confined spaces.
Recently the FreedomView Advanced Borescope has been approved for use in Class 1 Division 2 Hazardous Locations (UL Certificate) and can be used for various high-risk situations, such as aircraft engine and tank inspections, or military, customs and law enforcement applications.
Li-ion battery-powered operation ensures safe, free of wires operation up to 2 hours.
The FreedomView Advanced Borescope is one of the very few devices in the market that offers such a valuable package of high level equipment characteristics and a product safety certification at such a competitive price.
Note: FreedomView Borescope is a specially ordered product. Conditions apply. Call for details.


text:
« ZACKTAYLOR Releases New Visuals for "Randy Savage" – Watch
Tri-City Music Group Rapper Mvp Mhad Drops New heat "Winnin" »
Omo Phola – New Visual for Hit Single "African Beauty" is Out Now – WATCH
He was born in Nigeria, South Africa, but his popularity earned him the name Omo Phola P/K/A Boiphill De Super Star, a songwriter, performer, artist and singer, and now recently dubbed an Award-winning musician.
Hailing from a family of musicians like his late father "Charles Orgihator" and his mother and Uncle, were also musicians in their own ranks. Omo Phola's calling from the start was music, and so he took that baton, owned and ran with it, with pride and stride, never ignore his calling and never looking back. Since a young child in primary school, Omo Phola spend precious times with his mother learning the art and ways to be a great performer, she was his inspiration, and so he was inspired by the way she would express her feelings, her passion, through music.
So, where did his stage name come from? How did he earned that titled? "Omo Phola" came from a fusion of various names, but it was mainly from his father's name, which in their local language of Yoroba means "Fly and Go."
Omo Phola describe his musical sound as more Afro Pop, sprinkled with a smidge of fusion and a small dash of Hip Hop. Every song that Omo Phola has written is created to give the listener a ray of hope, and that has always been his dream, to create the kind of music that will touch the very heart and souls, something that folks will share through generations to come, since they are stories, created through his music. Ever since Omo Phola has teamed up with his manager Andrew "Drew" Knibbs and his team of music professionals, he signed a distribution deal with G.I. Records LLC out of the USA his fan based has grown, and it has kept growing with the current buzz he has been receiving not just from fans in South Africa, but fans across the world. His second and current hit single "African Beauty" is getting much buzz on Youtube and other music video streaming platforms, with 7.2K views as of this writing, "African Beauty" is a song that was written and perform by Omo Phola to show appreciation to the beauty of women all over the world, no matter what part of the world you are from, Omo Phola would like for you to embrace who you are.
Omo Phola dream is to one day own his own record label and to be able to do a collaboration with artists like Burna Boy, Kevin Riss, and many more. Omo Phola has just recently completed a new music project, his first E.P. "One Step (The EP)" which will be distributed worldwide by independent label G.I. Records LLC.
Omo Phola is known for such hit songs like "Mummy I Love" "My Zulu Baby" "E Money" "Show Me Love" "I'm a Rider feat. IAM Versatile" "African Beauty."
In South Africa Omo Phola mentors musically are DJ Tira, and Timaya from Nigeria along with 2face.
https://twitter.com/Omophola_
https://www.instagram.com/omophola_
https://www.facebook.com/Omophola/
https://www.janiegallegos.com/post/african-beauty-with-omo-phola-1
https://www.youtube.com/channel/UC1TkF7eBw0cp9ZXTR33RuSQ

redpajama_set_name: RedPajamaCommonCrawl


text:
Rupert Goodwins' Diary
Telling the time in binary on the Cote d'Azur, where Dell's secrets are not revealed
By Rupert Goodwins | June 4, 2004 -- 15:30 GMT (08:30 PDT) | Topic: Tech Industry
Monday 31/6/2004
Bank Holiday. Nothing happens. Well, something happens: as a result of a recent birthday and a very perceptive woman I am now the very proud owner of a binary wristwatch. Press a button and it lights up the time as a couple of rows of tiny red LEDs -- each lit up for a one, or extinguished for a zero. Thus 12:45 is rendered 1010 101101: entirely mysterious to anyone who didn't spend a lot of their youth building digital circuits for fun, and thus entirely compelling to anyone who did.
That would be me, then.
Tuesday 1/6/2004
A classic news day. We pick up a rumour in the morning that Sony is going to pull out of the PDA market in the US -- but our French cousins are ahead of us and have already found someone who not only confirms this but says that the tactical withdrawal is going to be in Europe as well. Only Japan will continue to get new Clies: the French newsdesk phones PalmSource to get their reaction, but -- helas! -- find out that PalmSource had no idea that Sony was about to do any such thing. As Sony is (well, was) PalmSource's best hope of keeping PalmOS alive as an independent operating system away from the Palm platform itself, the reaction that was forthcoming was more forceful and less considered than one normally expects. When was the last time you heard a company go on the record and say "this is very bad news for us"? The way things normally work, you call up a company with a product that's just been shown to hunt down and decapitate grandmothers and get "we are very excited by the new marketing opportunities that this presents".
Later on, the company recovers its poise. Sony was never that important, it says. Small slice of revenues. Big challenge is smartphones, where elegance and single-minded task-based approach counts for loads more than shoehorning in a shrunken PC. PalmOS excellently positioned to take advantage of that space.
Who are we to say that this will not be so? But that first, unguarded and somewhat emotional reaction was so rare and precious in this world of carefully worded, dutifully guarded and perfectly spun press blather that we will cherish it for some time. And no, PalmOS really doesn't need Sony that much -- but it does need some good breaks, and soon, if it's going to withstand the Redmond whirlwind. Wednesday 2/6/2004
Dell are taking me to Cannes! To be precise, they're taking me out to the annual Dell EMEA Product Showcase (EMEA is an unlovely and rather soppy marketing term you see on business cards meaning Europe, Middle East and Africa -- or Eventually Might Escape to America). Dell is normally the beat of reviews supremo Charles McLellan, but he's on his hols so I get to wave the flag. What I don't realise until too late is that attending is dependent on signing a truly enormous non-disclosure agreement: the vast majority of Products Showcased are not to be launched until various dates in the future, and thus I cannot write about them now.
Which is a bit frustrating, but we're all going to have to be patient. Each product sits on a big list of secret things with its own date, after which beans can be spilled and cats debagged. My favourite member of that list was one which, despite much deep thought, I couldn't remember being mentioned even a little bit. "Ah, no," said the PR. "That was going to be here, but isn't now" -- and she gave a reason which I'm sure I can't disclose. "But what was it going to be?" I asked. There then followed a period of intense thought: normally, we're told about things that exist and the NDA makes us pretend they don't. This time, it didn't exist. Can an NDA cover something that isn't there?
I would tell you the conclusion of that philosophical conundrum but... ah, you're there already. Watch this space. But don't tell anyone I told you. Thursday 03/06/2004
It's day two of the Dell EMEA product showcase, and outside the hotel the sun is filtering through the palm trees onto the dusty, dog-walked concrete of La Croisette. At least, I assume so: nothing filters through the partitions of the conference rooms. There are those among us who haven't left the hotel since they arrived early yesterday -- the circuit of bedroom, breakfast room, briefings and bar is an hermetic circle that shields us from temptation while inculcating the maximum Dellyvision. However, after the day's round of Powerpoint, one-on-ones and demonstrations, the PRs silently melt away, the last scraps of copy are filed and we are free to breath in the salty air of the Cote d'Azur. After all, what's the point of coming all the way to the playground of the rich, famous and wrinkly and not stepping out to admire the yachts and the rollerbladers?
But even as I wander towards the Palais des Festivals, I feel curiously alone. It's not so curious: I am alone. Where are my fellow hacks? Investigations reveal they are incarcerated in the darkest, deepest part of the Dell dungeon, a room dedicated to demonstrating certain computers. "We're free!" I tell them. "Time off! For bad behaviour!" There is no response. I look closer through the gloom: they have a glazed expression and are wearing headphones. With boom mikes. Has some fiendish magic turned them into call-centre operatives? Is this how Dell plans to increase its profits from services?
No. This is a voluntary incarceration. They are locked in combat, eviscerating each other with machine guns, machetes, rifles and other attitude amplifiers in some sort of multiplayer arcade game called Far Cry, Far Call, Far Canal or some such. "Look at those graphics!" said one hip young gunslinger, pointing at a lens-flared sun atop some fractally generated plant life. "Have you seen outside?" I suggested. "It's even nicer, and that bloke from PC Format isn't hiding in the bushes with a sniper rifle."
Hopeless. I leave them to it, and wander onto the foreshore where the PRs are checking out the weather for the beach party later.
It's a very good party, diverting enough to help me forget that the 8 a.m. flight back home means I have to leave the hotel at 6 a.m.
The party continues into the small hours, with all manner of Dellians, PRs, event organisers, Friends of Dell and assorted European hacks enjoying a late burst of freedom. There is some talk among the British contingent of breaking into the hotel and reassembling the gaming network, but I try and look stern and it soon fizzles out.
I remember the 6 a.m. start with, as it were, a start. My watch says it's one dot for the hour and three dots, one space and three dots for the minutes. That's, um, one twenty seven a.m. That or it's only one oh one and too many cocktails have fried my binocular vision. Nope, vision is fine.
Buses were caught, check-in times made, a plane to Heathrow boarded -- ham and cheese toastie for breakfast -- and once at Heathrow, another plane caught. To Edinburgh this time -- apple tart and coffee -- where I sit and write this diary. Next week, y'see, I'm at the Citrix iForum, where the aforementioned company will roll out doubtless marvellous musings on the exciting world of remote access. And iForum is at Edinburgh, therefore so am I. It does mean that nothing happened on Friday that could be of any possible interest to anyone, so I'm going to skip this day in the diary. If that's all right with you.
CXO Government Security
More from Rupert Goodwins
Home Computers: 100 Icons that Defined a Digital Generation, book review
RISC-V opens up processor design
5G New Radio: The technical background
New 5G business models
Facebook and Google are still fighting Australia's Media Bargaining Code
Respectively calling it 'one-sided' and 'unworkable', while Twitter has raised its own concerns with the Bill as the companies prepare to face future implications of any agreement. ...
Naver acquires storytelling platform Wattpad for $600 million
Naver will secure 160 million monthly users for its content business through the acquisition.
Fujitsu to redesign Singapore office to support flexible working
The company's 500 Singapore-based employees will also have the option to work remotely 90% of the time.
Web inventor concerned new Australian code breaches internet's fundamental principle
Tim Berners-Lee says requiring a charge for a link on the web blocks an important aspect of the value of web content.
Still talking to Cortana? Microsoft gives you more control over how your voice recordings are used
Microsoft still wants to re-use your voice clips, but will now ask for permission first.
GitHub admits 'significant error of judgment' in firing employee over Capitol 'Nazi' comments
GitHub's head of HR has resigned over the matter.
Report commissioned by Google shows it's helping Australia to the tune of AU$53b
Also 'sets the record straight' regarding claims made by 10 US state attorneys-general in a lawsuit filed last month against the search giant.
Google cuts off other Chromium-based browsers from its Sync service
Google Sync to stop working in other browsers except Chrome starting March 15 2021.


Welcome to the OSP Proposal Resource Library!
This page contains templates for proposal documents, boilerplate information from our interdisciplinary research Institutes (IRIs), and other helpful documentation. It will be updated frequently, so check back often! Please contact training@osp.gatech.edu with suggestions for new content.


To put it simply, if you want a good wielding machine from a reputable and trustworthy brand with excellent value for the money, then the Everlast PowerARC 160STH should be your choice.
Welders come in many grades and price points that range from cheap to big bucks.
However, not all welders can be used for every welding job.
Some welders, though, have more than one ability like the Hobart Ironman 230 MIG welder.
What's The Ironman 230v MIG Welder Best For?
The welder is used primarily for MIG welding, although you can use it for flux cored welding as well.
That being said, this welder is much better suited for welding thicker and tougher materials.
The Ironman can weld thick-to-thin steel, stainless steel, and aluminum.
For starters, this is a full-size welder.
However, it can be moved around with ease as it is on rollers, which is quite beneficial to the user. Also, this allows for easier storage.
Another great pro for this machine is that it is very easy to set up and weld with.
It will lay down perfect welds evenly and has great arc quality. It will weld up to ½ in steel in a single cut. It comes complete and ready to weld with once you have a gas tank and wire.
This is one powerful welder with a 30 to 250-output amperage and a 60% duty cycle. It offers 12 voltage settings to allow for a smooth, controllable arc.
The Hobart 230 MIG welder has a uniquely designed spool hub, which allows for easily changing the wire spools and an automatic wire alignment.
It has reversible driver rolls, which all but eliminates the need for spare parts and reduces the time it takes to change wire spools. The wire feed speed control allows for precise adjustment of the weld bead shape.
It comes with a 15ft H200L4-15 MIG gun with liner or you can purchase the Hobart direct connect spool gun DP 3545-20 for better aluminum welds.
Occasionally, the automatic wire feed conduit can get clogged and not allow the wire to go through.
Once you turn it off, even out the wire and turn it back on, the problem should go away.
The Hobart 230 cannot be operated on a normal household power supply outlet because it requires a special set up.
It is much better suited to an industrial site or a large workshop or garage, or you're going to have to install a 230V line at home.
The Hobart 230 MIG carries a hefty price tag of $1599, which is more expensive than many other MIG welders.
Hobart offers a Hobart Handlers 5/3/1 warranty.
The warranty for the most part is 5 years.
There is also a 3-year warranty on the parts that are not the transformer, and there is a 1-year for all components and parts outside the battery charger and welder cover.
This welder is an excellent choice for those looking for a full-sized, more specialized light duty welder.
The welder is pretty powerful and it can weld easily everything up to ½'' thick steel in a single phase.
While it can be moved around the shop on rollers, it is not that portable due to its size and weight.
However, the Hobart Ironman 230 is the perfect welder if you want a MIG welder with dual abilities to use as gas-shielding MIG or self-shielding Flux-core welder.


text:
Website: www.campaspe.vic.gov.au
Rochester is a small town in rural Victoria, Australia.
Population:3,113
Local Government Area:Shire of Campaspe
Rochester is a small town in rural Victoria, Australia. It is located 180 km (110 mi) north of Melbourne with a mixture of rural and semi-rural communities on the northern Campaspe River,between Bendigo and the Murray River port of Echuca. At the 2016 census, Rochester had a population of 3,113. # History The area around the Campaspe River was known as Yalooka, which for thousands of years was home to the Pinpandoor, the local tribe of Aboriginal Australians. Rochester (via Rowechester) was named after Dr John Pearson Rowe, who had a hotel here before the township was gazetted in 1855. The Post Office opened on 11 May 1863 and the town was reached by the railway line from Bendigo (connecting it to Melbourne) in 1864.The Rochester Magistrates' Court closed on 1 January 1990.The town the birthplace in 1904 of Australian racing and endurance cyclist, Sir Hubert Opperman, affectionately known as Oppy. There is a museum dedicated to Oppy in Moore street, and a statue of him winning the 24-hour Bol D'Or race in Paris in 1928. On his 90th birthday Oppy donated one of his trusty Malvern Star bicycles to the museum. # Weather # Things to do
Address: Shire of Campaspe VIC, PO Box 35,Rochester,VIC,3561
Website:www.campaspe.vic.gov.au


text:
Book Review: Suzanne Lacy, Leaving Art
@font-face { font-family: "Cambria"; }p.MsoNormal, li.MsoNormal, div.MsoNormal { margin: 0cm 0cm 10pt; font-size: 12pt; font-family: "Times New Roman"; }div.Section1 { page: Section1; }
Fig. 61, (p. 285). Inside the prison the collaborative team poses during an opening for their three car sculptures, which explored gripping personal stories of domestic violence and rape: Doing Time, Suzanne Lacy, Charlotte Watson, Virginia Cotts, Sharon Smolick, and Thea Dubow, Bedford Hills Maximum Security Facility, Bedford Hills, new York, 1993.
Photo by Lacy. Courtesy, Suzanne Lacy.
Book Review: Suzanne Lacy, Leaving Art: Writings on Performance, Politics and Publics
Leaving Art: Writings on Performance, Politics and Publics
Suzanne Lacy
2010, Duke University Press
ISBN: 978-0-8223-4569-5, 424pp
One vivid memory stands out from my few months as an international exchange student at the Cooper Union art school in New York. The venerable art critic and political activist Dore Ashton taught the History of Art course at Cooper and she presented us, at the beginning of the first class, with Xeroxed readings complete with scratchy, almost-illegible black and white illustrations. The reason for the hopeless visuals, she announced, was to provoke us to seek out as many works of art as we could in the flesh. The course was on early twentieth-century modernist sculpture and painting with all of the resources of New York at hand. Therefore, though this task was not without its practical and ideological challenges, it was concretely possible.
The image situation would have been quite different had we been discussing Tristan Tzara's theatre, for example, or post-minimalist performance art. For live art is transient, often without traceable physical residue. It relies upon lens-based, audio and textual records that are subject to manipulation, interpretation and other historical filtering processes in a rather different way than are robustly physical works of art installed in a museum.
Fig. 48, (p. 211). For seven days Lacy held intimate conversations with patients and hospital staff and displayed resulting drawings in an empty hospital room:
Cancer Notes: 7 Day Genesis, Suzanne Lacy, Art Park at Roswell Park Memorial Cancer Center, Buffalo, New York, 1991.
Photo by David Katsive. Courtesy, the artist and the photographer.
Public artist Suzanne Lacy's collection of writings, documents and images published over the last thirty years is provocatively titled Leaving Art. Amongst other purposes, it houses an articulate and careful attempt to address the problem of live and participatory art's ephemerality. In the book's preface, Lacy assigns a tripartite meaning to her phrase "leaving art", the first aspect relating directly to the ephemeral: "what is left behind with transient and public practices" (p. xiii). For Lacy, the term "leaving art" also relates to the uses of "sources outside of art history" to add critical nuance, or to assist in explaining, public practice; thirdly, like many post-minimalist practitioners with a political bent, Lacy positions herself within "the art/life continuum", rather than merely in the specialised world of contemporary art (p. xiii).
Crucially, Lacy's mix of conventional writings, documentary photographs, text-based experiments and photo essays operate on the knife-edge of this "art/life continuum". Indeed, more often than not, Lacy chooses to interrogate the most painful of personal and social scenarios in her collisions of art and life. Sexual violence, terminal illness and prostitution are three early subjects; as Lacy comments, "the threat of physical violence" inspires both large-scale activist works and intimate "performances as vulnerability" (p. 3). Two of Lacy's "meditations" (p. 211) on these subjects, "Prostitution Notes", 1974, and "Cancer Notes", 1995, are worth exploring in a little more detail for the ways in which they sensitively (and successfully) confront both their difficult subject matter and the problem of communicating about live art after the event.
"Prostitution Notes" is constructed as a diaristic, chronological narrative of Lacy's attempts to research, through performance and interviews in seedy cafes with sex workers, pimps and hangers on, the subjective and social implications of the business. Cutting into the main text, in bold, centred type, are questions that might be self-directed or addressed towards the feminist reader. The questions begin innocently enough in parallel with Lacy's somewhat naïve position at the project's start: "Do you know on which corners you can always find a hooker?" (p. 6). However, they rapidly grow more searching as she begins to identify with the men and woman that she meets: "Have you ever bought a gift, hoping for sex in return" (p. 8); before long, fear is registered: "Has your boyfriend picked up a hooker when you weren't in town?" (p. 12). Photographic documentation of outdoor performances and scrawled text/image pieces are also interspersed throughout. The essay draws together these fragments, or leftovers, so that each act of reading and looking produces a new performance – a period of heightened personal and political reflection. In this way, Lacy demonstrates her awareness of the time-based limitations of ephemeral practice, but also manages, to some extent, to bypass them.
Fig 13, (p. 17). In a performance that extended over several months, Lacy recorded the internal and external geography of her research on prostitution in Los Angeles:
Prostitution Notes, Suzanne Lacy, Los Angeles, 1974.
Photo Courtesy of the Museum of Contemporary Art, Los Angeles.
"Cancer Notes" has a similar function, though it shows a more visual, less journalistic, approach to text (designed by Leslie Barker). In the original public artwork, Lacy conducted a series of one-hour interviews with medical professionals and patients at the Roswell Park Cancer Center. She recorded their accounts in subjective, drawn diagrams on large sheets of paper, which were displayed in a grid format within the hospital. In Leaving Art, a documentary photo of the original installation heads the essay, but its main body transforms the hand-sketched diagrams into printed, composed pages. Again, rather than attempting to reproduce the original display or experience, the book format is utilised to produce a new work of art to be navigated differently by each viewer. The document becomes participatory too, negating the idea that the live work is the definitive piece.
Several of Lacy's works and texts infuse their hardcore subject matter and conceptual sophistication with a strange sense of ethical mystery, even spirituality. For example, in "Cancer Notes", Lacy quotes artist and critic Suzi Gablik on enchanted alternatives to modernism, explaining the motivations behind the project, alongside the words of doctors and patients: "Seeing with the heart, rather than with the disembodied eye, leads inevitably to a different kind of art – one that is more empathic and interactive and comes from a more gentle, diffused mode of listening" (p. 214). In "Having it Good: Reflections on Engaged Art and Engaged Buddhism", 2006, Lacy's discusses her Buddhist practice in order to make sense of this spiritual or philosophical tendency in the context of contemporary art, that most materialist of domains. As promised in the book's preface, by drawing upon Buddhist thought, as well as from experiences of low-paid manual labour, popular television and anthropology, she convincingly challenges and enriches the often closed art world with sources from "outside" (p. xiii).
To conclude, the book includes a short memorial essay on the performance artist and activist Allan Kaprow, Lacy's teacher during her early years as an art practitioner and teacher. One of the more traditional documents in Leaving Art it was first published in Artforum, 2006, alongside other reminiscences on Kaprow. Lacy uses the text to make a case for Kaprow's formative influence on feminist art, and hence to reinforce feminism's importance to post-minimalist performance. Because this essay is placed last in the collection, it also functions as a kind of summation of the book's thesis. Significantly, she notes that "art making was the function of a reflective life, not a skill set" (p. 321) for Kaprow. Reflection in and on the present moment – rather than a concern for prestige or posterity – defines and sets apart Lacy's experimental documents as in some way "live" themselves, making Leaving Art a strong resource for public and live artists working now.
Fig. 69, (p. 323). Allan Kaprow discusses his contribution to this complex collaborative performance in Finland as Lacy listens;
other artists invited by Lacy included Judy Baca, Guillermo Gómez-Peña, Susan Leibovitz Steinman, and writer Moira Roth:
Road of Poems and Borders, Suzanne Lacy, Arthur Strimling, et al., Performers and Artists for Nuclear Disarmament International Festival, Joensuu, Finland, 1990.
Photo by Tuula Tavi. Courtesy, the artists and the photographer.
Becky Hunter
Becky Hunter is a writer based in London and Durham, UK. She is Assistant Editor for Whitehot Magazine.
rebeccalouisehunter(at)yahoo.co.uk
www.beckyhunter.co.uk


XW Li and AY Wang and KR Lee, COMPUTATIONAL MATERIALS SCIENCE, 151, 246-254 (2018).
Amorphous carbon (a-C) films were deposited by molecular dynamics simulation using Tersoff, REBO and AIREBO potentials, respectively. The hybridization and the distributions of both bond angles and lengths as a function of the three potentials were analyzed, and the density and residual stress were calculated. Results revealed that comparing with the Tersoff and REBO potentials, the AIREBO potential gave the more reasonable values of density, hybridization ratio and residual stress. This attributed to that in AIREBO potential, the conjugation effect between the different coordinated atoms was corrected by revising the bond order term, which was responsible for the sp(3) content; while the introduction of long-range Lennard-Jones (LJ) interaction described the compressed graphite structure correctly following the rational density; in particular, both the LJ and torsion interactions were indispensable for the accurate evaluation of residual stress of a-C films. In addition, the simulation result using AIREBO potential suggested no dependence on the processing methods of atom-by-atom deposition and liquid-quenching method.


While spring break took many of my peers to the Great Wall and Taj Mahal, the beginning of my vacation took me down to Deep Ellum.
Center: A bicycle and stick figure doing yoga, representing the interest in health, wellness, and personal care at the heart of all I do.
In the Corners: The MIT Dome, representing my sense of identity and respect for the nerdy, world-changing spirit of the Institute; a cupcake, symbolizing my entrepreneurial exploits in the food space; a television, illustrating my love of entertainment and marketing; stylized X's, which I called intersections, demonstrating my desire to stand crossroads of art and science, of the creative and the calculated (Being perfectly honest, I initially drew the X's to be multiplication signs to show off my quantitative side, but, figuring the rest of the interview did enough to support my math abilities, I called them intersections instead).
While part of me wishes I was off sandboarding in the Sahara or pounding back Pisco Sours in Patagonia with classmates over the break, I'm grateful for having stayed in Boston for most of the past two weeks because it gave me time and space to reflect. And especially as other business schools release their round two decisions, I've been able to reflect specifically on how I knew Sloan was right for me.
While it's fun to speculate, I couldn't tell you what the folks in admissions saw in me between an awkward (but endearing?) video of me singing Elton John and my essays on case writing and gluten-free baking that made them believe, "Erica should be here." But I'd like to believe it's because they believed what I believe: that this is a place that embraces all of me, the whole "personal brand" I drew on that page and so much more.
As I explained to my interviewer: I know myself well enough to know that I don't fit into a box. I don't think the way other people think. I don't solve problems or do things the way you're "supposed to." That's the spirit I bring to my work every day, and at MIT Sloan, I'm surrounded in classes by people who do the same.
I belong here because I don't belong. I fit in here because I don't fit in. It's a carefully-curated environment that lets me be completely and contradictorily myself. It's what makes MIT Sloan feel precisely like home.
I couldn't be more grateful to be here, and there's no place else I'd rather be.
And in case you were wondering, I got the offer.
Originally published at mitsloan.mit.edu on March 31, 2015.


Pizza For Breakfast? Yes You Can!
We may sound crazy suggesting pizza for breakfast but it's a great one for the weekend - especially if you happen to have leftover roast veggies hanging around, which is what inspired us to create this!
You could get creative with your breakfast pizza toppings. Try some smoked salmon or crack an egg on top before baking in the oven.
Ideal for a weekend morning in the kitchen, as making your own mini gluten-free pizza bases takes a little extra prep time. But they're well worth it!
Mix together pizza base ingredients until a dough-like consistency forms.
Line a cutting board with parchment paper, place dough on parchment and place another piece of parchment paper on top so the dough is between 2 layers of parchment paper. Roll dough out between pieces of parchment paper to desired thickness.
Using a bowl placed on top of rolled out dough, cut around the bowl for round pizza base. We went for small, single serving bases for our breakfast pizzas.
Place your pizza base on a lined baking tray and bake in the oven for 10 minutes.
Remove from oven and top with desired breakfast ingredients. Think about using lots of veggies!
Place back into the oven to cook for 15-20 minutes or until golden brown on the crust.
Top with fresh breakfast greens, avocado and a drizzle of yogurt!
What Would You Top Your Breakfast Pizza With?


Download Abelssoft YouTube Song Downloader Portable 2018 free standalone offline setup for Windows 32-bit and 64-bit. Portable Abelssoft YouTube Song Downloader 2018 is a reliable YouTube streaming video downloader application with a bundle of powerful features.
There are different applications which can download YouTube videos for offline viewing. Abelssoft YouTube Song Downloader 2018 provides a reliable environment to download streaming videos with minimum efforts. It provides a simple user interface for the ease of the users and quickly downloads the streaming videos. The main windows of the application also display different suggestions to download with just a few clicks.
Moreover, this powerful application not only downloads videos but also provides the opportunity to download only audio content. The batch processing support makes it possible to download multiple videos at the same time. A built-in player directly plays the media after downloader. All in all, it is a complete environment for downloader the YouTube streaming videos and extracting audio streams from the videos.
Before you download Portable Abelssoft YouTube Song Downloader 2018, make sure that your system meets the given requirements.
Clicking the below button will start downloader the standalone offline setup for Windows x86 and x64 architecture. You can also download YouTube By Click Premium.


New watch miraculously combines flight and writing, technology and poetry of both worlds, creating a system equipped with an elegant red gold case special edition watch. In large-scale pilot calendar watch "The Little Prince" special edition front, outstanding color combination appeared. Having radial sun shining brushed dark blue dial charming light, and red gold case, pointer, scale and brown calfskin strap Santoni together to create a unique timepiece While high-end temperament. Under carefully looked at, the wearer can be found in the "12 o'clock" position arranged in three separate semicircular windows, which display the month, date and week.


Need it by Thursday 25th April? Order in the next 1 hr 6 mins and select One Day Delivery at checkout. Details.
An excellent overall workplace first aid guide.
First aid and treatment poster.
This workplace first aid guide poster is designed to help you and your colleagues administer life saving first aid until trained help is at hand.
This first aid poster has clear step by step guidance on how to approach a danger, how to assess the casualty and their level of response. Further guidance informs how to call for help, what to be prepared for, how to check the casualties airways and assess their breathing.
For the unconscious and not breathing casualties first aid guidance is given on cpr for if the casualty is unresponsive, and defibrillation.
For the unconscious and breathing casualties step by step first aid guidance is given on how to turn the casualty into the recovery position, and what do do after that.
Information is also given on first aid for bleeding, burns and fractures.
Encapsulated for durability, easily wiped clean.
The size of the poster is 590mm x 420mm.


text:
package runtime

import (
	"encoding/json"
	"errors"
	"os/exec"
	"time"

	"github.com/minutelab/mless/lambda"
	"github.com/minutelab/mless/util/jproc"
)

// stdiocont is a runtime container that communication with the container over stdin/stdout
// (based on jproc)
type stdiocont struct {
	proc   *jproc.Process
	logger Logger
}

func (s *stdiocont) Done() <-chan struct{} { return s.proc.Done() }
func (s *stdiocont) Err() error            { return s.proc.Error() }
func (s *stdiocont) Close() error          { return s.proc.Close() }

func (s *stdiocont) Invoke(event interface{}, context lambda.Context, deadline time.Time) (json.RawMessage, error) {
	request := lambda.InvokeRequest{
		Context:  context,
		Event:    event,
		Deadline: deadline.UnixNano() / 1000000, // convert from nano to mili
	}
	var reply lambda.InvokeReply

	if err := s.proc.Send(request, &reply); err != nil {
		return nil, err
	}

	return processReply(reply, context.RequestID, s.logger)
}

func newStdiocont(cmdline []string, settings lambda.StartupRequest, logger Logger) (Container, error) {
	cmd := exec.Command(cmdline[0], cmdline[1:]...)

	p, err := jproc.StartWithStderr(cmd, logger.StdErr)
	if err != nil {
		return nil, err
	}

	var response lambda.StartupResponse
	if err := p.Send(settings, &response); err != nil {
		p.Close()
		return nil, err
	}
	if !response.OK {
		p.Close()
		return nil, errors.New("runner initialization failed")
	}

	return &stdiocont{
		proc:   p,
		logger: logger,
	}, nil
}

redpajama_set_name: RedPajamaGithub


text:
Q: Definition of a graph of a function question
Definition:
A graph $G_f$ of a function $f: A \rightarrow \mathbb{R}$ is a subset
of $A\times  \mathbb{R} $ with notation: $G_f = \{(x,y)\in
 A\times\mathbb{R}; y = f(x) \}$

I do not understand what does $A \times \mathbb{R}$ actually mean.

A: $A\times \mathbb{R}$ is the cartesian product and it's defined by $$A\times \mathbb{R}=\{(x,y): x\in A \wedge y\in \mathbb{R}\}.$$
In this case for example, we have that

*

*If $f:  \Omega\subseteq \mathbb{R}\to \mathbb{R}$ defined by $f(x)=x$, so we have that $$\operatorname{G}_{f}=\{(x,y)\in \Omega\times \mathbb{R}: x\in \Omega \wedge y\in \mathbb{R}\}$$and $\operatorname{G}_{f}\subseteq \mathbb{R}^{1+1}$.

*If $f: \Omega\subseteq \mathbb{R}^{2}\to \mathbb{R}$ defined by $f(x,y)=x+y$, so we have that $$\operatorname{G}_{f}=\{(x,y)\in \Omega\times \mathbb{R}: z=f(x,y)\}$$and $\operatorname{G}_{f}\subseteq \mathbb{R}^{2+1}$.

redpajama_set_name: RedPajamaStackExchange


text:
« JFK Refuses Irish Citizenship. Titanic at Queenstown. GAA Ban Revoked on this day in Irish History | Handel's Messiah. Thomas D'Arcy McGee. Catholic Emancipation on this day in Irish History »
Irish in American Civil War. Mother and Child Controversy on this day in Irish History
April 12: TODAY in Irish History (by IrishmanSpeaks)
1861: American Civil War begins, a war that would not only pit American against American but also Irish against Irish. An estimated 150,000 Irish fought on the Union side while about 40,00o fought for the confederacy. While the majority fought with the Union, many Irish had a strong antipathy to a northern culture which they saw as anti-Catholic and protestant dominated. The most famous Irish regiment was the Fighting 69th, led most famously by the flamboyant, sometimes drunken, Thomas Francis Meagher, often going into battle with an emerald flag and shouting an old Irish war cry "Fag an Bealagh" (Clear the way.)
Over the course of the war, the Irish Brigade would excel in numerous battles, most famously at Marye's Heights during the Battle of Fredericksburg. During the war, its leaders were General Thomas Francis Meagher, Colonel Patrick Kelly (killed), General Thos. A. Smyth (killed), Colonel Richard Byrnes (killed), and General Robert Nugent.
Brigadier General Thomas Francis Meagher
1951: Ireland's Minister for Health, Dr. Noel Browne resigns following confrontation with the Catholic hierarchy in Ireland over what became knows as the "Mother and Child" controversy.
Dr. Noel Browne
Brown attempted to introduce a very basic welfare plan for mothers and children which the Catholic Church somehow saw as being "in direct opposition to the rights of the family." The planned scheme would provide free maternity care for all mothers and free healthcare for all children up to the age of sixteen! Many in the medical community also opposed the legislation fearing it would impact income levels.
As government resolve faltered in the light of active church opposition, Browne was forced to resign. To some extent, the controversy was a watershed in the relations between Church and State. The Irish Times newspaper published the correspondence between Browne and the Irish bishops which led the paper to editorialize "The most serious revelation, however, is that the Roman Catholic Church would seem to be the effective Government of this country."
Although the Catholic Church would remain a potent political force in Ireland for another forty years, its powerful grip was waning.
BUY Quality Quality Guinness and Ireland Rugby Shirts
For the Love of Being Irish written by Chicago based Corkman Conor Cunneen and illustrated by Mark Anderson which is an A-Z of all things Irish. This is a book that contains History, Horror, Humor, Passion, Pathos and Lyrical Limericks that will have you giving thanks (or wishing you were) For the Love of Being Irish
Watch For the Love of Being Irish author Conor Cunneen – IrishmanSpeaks on his Youtube channel IrishmanSpeaks. Laugh and Learn.
This history is written by Irish author, business keynote speaker and award winning humoristIrishmanSpeaks – Conor Cunneen. If you spot any inaccuracies or wish to make a comment, please don't hesitate to contact us via the comment button.
Visit Conor's YouTube channel IrishmanSpeaksto Laugh and Learn. Tags: Best Irish Gift, Creative Irish Gift, Unique Irish Gifts, Irish Books, Irish Authors, Today in Irish History
Posted on April 12, at 6:06 am in Today in Irish History	| RSS feed | Reply	| Trackback URL
Tags: Brigadier General Thomas Francis Meagher, chicago motivationals, dr. noel browne, Fag an Bealagh, mother and child controversy ireland, on this day in ireland, on this day in Irish history


UXmatters has published 3 articles on the topic Industrial Design.
Much has been written about "the Prius Effect"—how the Prius and other hybrid vehicles change driving behavior by providing feedback that shows drivers how their actions affect their gas mileage.
I recently bought a Toyota Prius and was surprised to notice my driving behavior change to a more economical style of driving. Doing some research, I learned that I wasn't alone in this. Much has been written about "the Prius Effect"—how the Prius and other hybrid vehicles change driving behavior by providing feedback that shows drivers how their actions affect their gas mileage. Some people view this as a positive effect, while others, who are annoyed by slow Prius drivers, view it negatively.
Imagine that you're driving your luxury car down the road when your front-seat passenger decides to change the radio station, and all of a sudden your car unexpectedly shuts down and comes to a screeching halt. This is exactly what happened to at least one owner of a 2015 Lincoln MKC. How did this happen? The location of the Engine Start/Stop button was where the driver or a passenger could inadvertently hit it. In this day and age of better UX design, how could this design have made it to market? Could usability testing have prevented this?
The Polaroid camera forever bifurcated the product experience of photography into two tracks: cameras for professionals and personal cameras that small girls and other amateurs could easily and enjoyably use.
Most fathers would do anything for their daughters, but Edwin Land took a simple question from his inquisitive child and changed the world of photography forever. "Why can't I have them right away?" asked the small girl, as her father—a successful chemical scientist—took photographs on a family vacation.
Why couldn't she have the photographs right away? Keep in mind the context of the time in which she asked this question. In 1943, photography was the realm of serious professionals and ambitious hobbyists. Photographers needed to learn about chemical reactions to develop film and make prints. While working in a special darkroom, they had to give photos various types of chemical baths and patiently wait for prints to dry. Just the sorts of things small girls are rarely interested in.


The Bell Sleeve...how to wear in real life?
We love the look of a bell sleeve, but they always seem too long. Below are just a few examples.....who has arms that long?!?
So what do you do? Rolling the sleeve changes the whole look, but leaving them long is not an option either. It's just not practical to have sleeves that get in the way of your every day life....ArmBand-Its can easily solve this while keeping the look of the bell sleeve!


Breast augmentation is one of the most common plastic surgery procedures performed with excellent results by Dr. Spies. Breast implants can enhance breast size and fullness for many years. However, breast implants are not expected to be lifelong devices and may need to be replaced at some point. Breast revision surgery is the name that is used to describe any procedure required to replace breast implants. These operations can correct problems that may arise after breast augmentation and produce more satisfying results to give you a natural appearance and a more accentuated figure.
While uncommon, surgical complications can occur at any point after breast augmentation. Although not common, a woman may experience capsular contracture, implant rupture, double bubble deformity, bottoming out, or another problem that can adversely affect the shape, size, and feel of the breast. Breast revision reverses the effects of surgical complications and restores a balanced, natural, and beautiful breast appearance.
Even with a properly performed procedure by an experienced plastic surgeon, breast augmentation results may not turn out according to your realistic expectations. If you are dissatisfied with your results after breast augmentation, breast revision surgery can be performed to improve the aesthetic results and fully realize your personal vision for your appearance. With this procedure, women can achieve the results they sought from breast augmentation.
It is not uncommon for women to be pleased with their breast augmentation results but then change their minds about their breast size later. A common example is women who desire larger implants in their 20s but wish for smaller implants by the time they are in their 40s or 50s. Women who decide that they would like larger or smaller breasts can have their implants exchanged. Breast revision surgery can provide implant size change to better meet your current desires.
There are various approaches to breast revision surgery because there are multiple reasons to undergo this procedure. When possible, the same incision used for your initial breast augmentation will be used to limit your scarring after breast revision. For your procedure, your surgeon may remove excess scar tissue, tighten the tissues that support the pocket around the implant, perform a breast lift to reshape and reposition the breasts, and/or incorporate other techniques as necessary to achieve the desired results.
Is breast revision required for women with breast implants?
Breast revision is an elective procedure in many cases, but it may be required for the correction of surgical complications. Women with breast implants should recognize that it will likely be necessary for them to undergo breast revision at some point in the future. While most implants last up to 10 years or longer, in the event of implant failure or any other such issue, breast revision is the required corrective course. Breast revision is elective if a woman chooses to undergo revision surgery for cosmetic reasons. Women may voluntarily choose to undergo breast revision at any point if they would like to alter their breast size or results.
What complications may occur after breast augmentation?
Fortunately, these conditions are infrequent and not guaranteed to occur. However, if they do, breast revision surgery can correct them to restore your breasts.
Is breast revision the only option if I have surgical complications after breast augmentation?
For women with surgical complications after breast augmentation, breast revision surgery is typically the only recourse. This surgery can eliminate complications and greatly improve your results.
Will insurance cover my breast revision procedure?
Breast revision surgery is not usually covered by insurance, unless it is for implants that were originally placed after mastectomy in breast cancer patients. It is very rare today for any insurance company to cover complications after elective cosmetic breast augmentation surgery. Contact your insurance provider for more information regarding your eligibility for coverage.
What is recovery like after breast revision?
Your recovery after breast revision surgery will be reminiscent of your recovery after breast augmentation. However, most patients tell Dr. Spies that these procedures are easier to recover from than the initial operation. You should expect some swelling, bruising, discomfort, and tenderness in the days immediately following your procedure. Plan to rest at home and take several days off work. Dr. Spies will provide you with postoperative instructions and will recommend when it is safe to return to work and resume exercise.
What results should I expect after breast revision?
Breast revision surgery is performed to improve aesthetic results and correct surgical complications. Your breasts should appear more symmetrical, balanced, natural, shapely, and beautiful than they appeared before your revision surgery. Realistic expectations are a necessary component and can help you feel ultimately satisfied with your beautiful results after breast revision.


text:
Q: Medicine vs. Medication I'm wrote some documentation in which I needed to refer to the list of drugs that a person was taking at a given time. This list might also include a dosage as well (e.g. 'Aspirin 300mg daily').
I used the term 'medication(s)', but someone else suggested 'medicine(s)' as an alternative. Personally, I think it sounds worse and may be less clear, as 'medicine' can also refer to the general practice of medicine. But maybe that's just me.
Is there any reason why I should prefer one over the other?
Note: this is for labeling GUI elements and in related documentation.

A: Medications is the proper term for substances used for medical treatment, esp. pharmaceuticals. People can self-medicate (and they do all the time). They don't self-medicine. Medications includes vitamins and other supplements people take for health reasons. The verb medicate (to treat medicinally) is from 1620s. Health professionals usually refer to these as meds.
Medicine, though used by lay persons to indicate drugs, is actually the art or science of healing. There is holistic medicine, allopathic medicine, homeopathic medicine, etc.
On a medical chart, we often list drugs/alcohol separately, because it refers to illicit drugs.
We do not use the word prescriptions, because that would exclude over-the-counter medications the patient might be taking, e.g. aspirin, benadryl or other for allergies, decongestants, supplements, herbals, etc.
In addition to dosage, we usually have a space for start and stop dates for medications, as a past history of medications is important to know as well. It is important to know what the patient has taken before that has or hasn't worked for chronic or recurrent problems.

A: Looking at it as an outsider, it seems to me that it should be:
Medicine (noun) - 1) Referring to the field itself, the profession of healing.
Medication (noun) - 1) The act of using a method from the field of medicine to treat someone.
Medicate (verb) - 1) To treat someone using a method from the field of medicine.
As for the pills themselves, I would refer to them as pills, drugs, or as medical substances.
So when I hear someone say "Use this medication", I actually hear "Use this method of medication (the method of giving them this particular drug/substance/process)"
If that makes sense.

A: Neither term is preferable.
It is fashionable to say "medication" but both it and "medicine" mean drugs or other substances taken to treat or cure disease.
Any dictionary will verify this.

A: I think prescription is the term to use in this case.
Prescription:

*

*(Medicine)
a. written instructions from a physician, dentist, etc, to a pharmacist stating the form, dosage strength, etc, of a drug to be issued to a specific patient.


Doro has just revealed the ancient-Roman inspired Doro Liberto 810, a smartphone that aims to bring the digital age to everyone and make mobile networking easier.
According to Doro, its second smartphone, just revealed today, will be "sleek and stylish", and the company will reveal details of which Irish retailers will carry the phone in early October.
The Liberto 810 will deploy an Android 4.1 OS, while Doro's own software, dubbed 'Doro Experience', will be installed as the user interface.
Doro believes the phone will carry the idea of easy-to-use mobiles even further into the smartphone arena.
Chris Millington, managing director of Doro UK and Ireland, said the name Liberto was specifically chosen for the new smartphone as it "sums up" the essence of the device.
"In ancient Rome, servants and slaves of the empire could earn their full citizenship to become fully contributing members of society. Such people were known collectively as 'the Liberto'.
"This new mobile helps people who might be hesitant about using a smartphone to fully embrace modern society. We are liberating those who perceive smartphones to be overly complicated and crowded with difficult-to-use apps," he said in a statement.
Millington said Doro has "fused" its research on consumer needs with the latest smartphone technology to create something that is "easy and effortless".
"We have made functions, such as sharing photographs and sending emails, easier. The combination of our easy-to-use philosophy and smartphone technology make this a truly unique product. It certainly offers much more to Irish consumers and network operators alike," he said.
To innovate, Dodo collaborated with Silicon Sentier, which found that smartphone users want hard keys for back, home and menu navigation.
So there's a trio of physical keys on the front screen of the Liberto, while SwiftKey powers the touchscreen keyboard.
Users of the phone can opt to use Doro's own app selection, or those apps from Google Play.
Cost of the Liberto smartphone has yet to be released.


text:
\section{Introduction}
\blfootnote{
\hspace{-0.65cm}
This work is licensed under a Creative Commons Attribution 4.0 International License. License details: \url{http://creativecommons.org/licenses/by/4.0/}.}
The goal of entity disambiguation is to link a set of given query mentions in a document to their referent entities in a Knowledge Base (KB). As an essential and challenging task in Knowledge-Base Population (KBP) for text Analysis
\citep{tac:ji14,tac:ji15}, entity disambiguation has attracted many research efforts from the NLP community. Recently, deep learning based approaches have demonstrated strong performances on this task \citep{rel:hoffman,rel:ibm}.

A main challenge for entity disambiguation is to best identify and represent the appropriate context, which can be local or global. Different methods have been proposed to capture and represent different types of contexts. Textual context has been heavily investigated for local models that score each query's candidates independently. Representations of the textual contexts range from weighted combination of the word embeddings based on attention \citep{rel:hoffman}, to more fine-grained contextual representations using recurrent neural networks \citep{rel:ibm}. The global context of other entities in the document has also been studied for a more global and joint prediction view on the problem. \cite{rel:hoffman} use a Conditional Random Field (CRF) based model to capture the interrelationship among entities in the same document, whereas \cite{rel:google} introduce a soft k-max attention model to weigh the importance of other entities in the document in making prediction for any given query.

Working with the recently proposed models, we observe that local models that employ an appropriate attention mechanism often have a solid linking performance. In a single document, there are often a small number of hard queries for which the local model fails to make a correct decision. We conjecture that if some of these mistakes can be corrected, a global model that enforces coherence among entities will be able to propagate these corrections to improve the overall solution quite effectively.

This inspires us to consider the Limited Discrepancy Search (LDS) framework \citep{JMLR:v15:doppa14a}, which conducts a search over possible corrections on a complete output with the goal of improving the final output. Critically, LDS works well for cases where only a small number of local corrections are needed to reach a good global solution. This nicely matches up with our observation of the behavior of entity disambiguating models.

In this paper, we propose a LDS based global entity disambiguating system. Given a document and its query mentions, our system first applies a local disambiguation model to produce an initial solution. We then use LDS to conduct a shallow search in the space of possible corrections (with the focus on hard/least confident mentions) to find a better solution. Evaluation on CoNLL 2003 and TAC 2010 shows that our method outperforms the current state-of-the-art models. We also conduct an extensive ablation study on different variants of our model, providing insight into the strength of our method.

\section{Proposed Approach}
We are given a document $D$ containing $n$ mentions $[x_1, ... x_n]$. We assume that all mentions are linkable to a Knowledge Base (KB) by excluding the NILL mentions. We are interested in finding a joint assignment of all mentions to $\textbf{Y}=[y_1, ... y_n]$ of referent entities to maximize the following score:
\begin{equation}
s(\textbf{Y}) = \sum_{i=1}^{n}\psi(x_i, y_i) + \sum_{i=1}^{n}\sum_{j=1:j\neq i}^{n}\phi(y_i, y_j)
\label{map}
\end{equation}
where function $\psi(x_i, y_i)$ gives the local compatibility score between the mention $x_i$ and its candidate $y_i$ and $\phi(y_i, y_j)$ indicates the amount of relatedness between the assigned candidates $y_i$ and $y_j$. Optimizing this objective, however, is NP-hard. In this work, we develop a LDS-based search strategy for optimizing this objective.\\

\subsection{Overview of the Approach}
Given a document with $n$ mentions, we initialize the search with a solution acquired based solely on the local scoring function $\psi(\cdot, \cdot)$. We then conduct
a greedy beam search in the space of possible
discrepancies (changes/corrections) to this initial solution while focusing on mentions with least confident local scores in the hope of finding a better solution.
\begin{figure*}[h]
\centering
\includegraphics[width=0.94\textwidth,height=0.40\textwidth]{general_model_3.pdf}
\caption{\label{fig:general_model} The general framework of our proposed model with beam size $b$=1.}
\vspace{-0.15in}
\end{figure*}
Fig~\ref{fig:general_model} shows the overview of our search framework for beam size $b = 1$. Each state $S_i$ is a pair $(I, D_i)$ where $I = (e_1,e_2,...,e_n)$ is the initial solution given by the local model and $D_i$ is the discrepancy set for state $S_i$. For example, a discrepancy set $\{x_{k_1} :y_{k_1}, x_{k_2} :y_{k_2} \}$  contains two discrepancies, changing the assignment for mentions $x_{k_1}$ and $x_{k_2}$ from $e_{k_1}$ and $e_{k_2}$ in $I$ to $y_{k_1}$ and $y_{k_2}$ respectively.
Starting with initial state (I, {}), we utilize a heuristic function $h$ (Section~\ref{sec:h}) to sort the mentions in the increasing order of their local confidence. Let $(z_1,...,z_n)$ be the ordered mentions where $z_1$ is the least confident mention. Each iteration of the greedy beam search explores and prunes the space of discrepancy sets as follows:

We select the least confident mention $z_1$ and expand state $(I, \{\})$ to $k$ new
states $(I, \{z_1 : y_{1j}\})$ for $j = 1 \cdots k$ where $y_{1j}$
is the $j^{th}$ candidate for mention $z_1$ (we consider top $k$ most probable candidates). Each expanded
state $(I, \{z_1 : y_{1j}\}), j=1,\dots,k$ is given to a Discrepancy Propagator ($DP$) (Section~\ref{sec:dp}) to get
its discrepancy set propagated throughout the document and produce an updated complete solution $(o_1, ... o_n)_j$, for $j=1,\dots,k$.
Utilizing a trained pruning function $p$  (Section~\ref{sec:p}) we then rank the $k$ complete solutions and prune them
to top $b$ states ($b$ is beam size).

The search continues with the next least confident mention $z_2$ as
shown in Fig~\ref{fig:general_model}. Each iteration increases the size
of the discrepancy set by one. Note that a mention
is not repeated in a discrepancy set.\\
We consider two different
strategies for terminating the search depending
on the used heuristic function $h$ (Section~\ref{sec:p}).  Each strategy causes the search to terminate at different depth (length) of the discrepancy set. The output of the search is selected by the pruning function $p$ from the last set of complete solutions.\\
In the following, we will first explain our \textbf{local model} ($\psi(\cdot,\cdot)$) for producing the initial solution. We will then introduce our LDS search framework, and its key components including the \textbf{Discrepancy Propagator} to propagate a set of discrepancies to other mentions in the document; the \textbf{Heuristic Function} to compute the local confidence of the mentions in the document and identify the least confident ones; and finally the \textbf{Pruning Function} to guide the search and select the final solution.

\subsection{Local Model}
\label{sect:local}
Our local model utilizes contextual, lexical and prior evidences to compute the compatibility score $\psi(x_i, y_i)$ for assigning candidate $y_i$ to mention $x_i$. These evidences are extracted and used as follows:
\subsubsection{Contextual Evidence}
\label{subsec:contextual}
Given a query mention, a key challenge for the local model is to identify a minimum but sufficient contextual evidence to disambiguate the query. We first extract all sentences in the document relevant to the query mention. This is achieved by applying CoreNLP \citep{l:corenlp} to perform coreference resolution to all mentions in the document and extract all sentences containing a mention in the query's coreference chain.

The set of sentences are then concatenated to form the context for the query; $w_i=[w_{i1}, ... w_{im}]$, where $w_{ij}\in R^d$ is the embedding of the $j$-th word in the context. We then use an attention model introduced by \citep{rel:hoffman} to compress the context into a single embedding. Specifically, we define the contextual representation $c_i\in R^{d}$ for mention $x_i$ with candidate set $\{y_{i1}, y_{i2}, ... y_{ik}\}$ over context $w_i$ as
\begin{equation}
c_i = \sum_{l=1}^{m} \alpha_{il} w_{il}
\end{equation}
The weight vector $\alpha$ is computed using the following attention considering all $k$ entity candidates:
\begin{equation}
\alpha_i = \textbf{softmax} ([\max_{j \in 1..k} y_{ij}^{T}Aw_{i1}, ..., \max_{j \in 1..k}y_{ij}^{T}Aw_{im}])
\end{equation}
where $A$ is a learned matrix that scores the relatedness between word and entity.
This attention model computes the relatedness of each word with all of the entity candidates and takes the max as the score for each word. The scores of all context words are then passed through softmax to compute their weight. Under this model, if a word is strongly related to one of the candidates, it will be given a high weight. Subsequently, using $c_i$ we define the following contextual features for candidate $y_{ij}$ as $f^{(c)}_{ij}=[y_{ij}^T B c_{i}; y_{ij}^T B; c_i]$, where $B$ is a learned $R^d \times R^d$ matrix. Note that $f^{(c)}_{ij} \in R^{2d+1}$.

\subsubsection{Lexical Evidence}
\label{subsec:lexical}
The contextual features extracted above ignores any lexical/surface information between query mention and entity title, which can be useful. To this end we include some lexical features to our local model including variants of the edit distance between the surface strings of the mention and the candidate title, whether their surface strings follow an acronym pattern and etc. Detailed list can be found in the Table~\ref{tab:LFs}(a).
The extracted features are scalar real values. We use RBF binning \citep{rel:ibm} to transform each scalar to a $10$-d vector. Hence for each query $x_i$ and candidate $y_{ij}$ we have lexical vector feature $f_{ij}^{(l)}\in R^{10 \times |f|}$ where $|f|$ is the number of features listed in Table~\ref{tab:LFs}(a).
\begin{table}[h!]
\begin{minipage}[b]{0.50\linewidth}
\centering
(a)\\
\small
\begin{tabular}{|l|}
\hline \textbf{mention:} m = [$m_1$, ... $m_a$],  \textbf{entity title:} e = [$t_1$, ... $t_b$] \\
\hline
$f_1$:\hspace{1mm} mention length = $a$\\
$f_2$:\hspace{1mm} entity title length = $b$\\
$f_3$:\hspace{1mm} $\sum_{i=1}^{b}$ (occurrence counts of $t_i$ in the document)\\
$f_{4}$:\hspace{1mm} m is acronym\\
$f_{5}$:\hspace{1mm} e is acronym\\
$f_{6}$:\hspace{1mm} m and e acronym patterns are exact match\\
$f_{7}$:\hspace{1mm} m and e are non-acronyms and exact match\\
$f_{8}$:\hspace{1mm} min-edit(m, e)\\
$f_{10}$:\hspace{1mm} sum of partial min edits:\\ \hspace{10mm} $\sum_{i=1}^{a}(\min_{j=1}^{b}(\mbox{min-edit}(m_i, t_j)))$\\
\\
\hline
\end{tabular}
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.40\linewidth}
\centering
(b)\\
\begin{tabular}{|l|}
\hline local score for mention $m$:\\ $l$ = \textbf{sotmax}([$\psi(x_i, y_{i1})$, ... $\psi(x_i, y_{ik})$])\\
\hline
$f_1$:\hspace{1mm} max($l$)\\
$f_2$:\hspace{1mm} second-max($l$)\\
$f_3$:\hspace{1mm} entropy($l$)\\
$f_{4}$:\hspace{1mm} $m$ is an acronym\\
$f_{5}$:\hspace{1mm} length($m$)\\
\\
\\
\hline
\end{tabular}
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.30\linewidth}
\centering
\end{minipage}
\caption{(a) list of lexical features in the local model (b) list of the features to learn heuristic function $h_2$}
\label{tab:LFs}
\end{table}
\vspace{-0.15in}
\subsubsection{Prior Evidence}
\label{subsec:prior}
We consider $p(e|m)$, the prior probability that an entity $e$ is linked to a mention string $m$ as prior evidence. This is computed using hyper-link statistics from Wikipedia and aliases mapping from \citep{l:hoffart} obtained by extending the "means" tables of YAGO \citep{l:hoffart13}. The $p(e|m)$ is also transformed to a $10$-d vector using RBF binning \citep{rel:ibm} to create prior feature $f_{ij}^{(p)} \in R^{10}$.

\subsubsection{Overall local model}
The contextual, lexical and prior features are concatenated and fed through a Multi Layer Perceptron (MLP) with 2 hidden layers (relu, 200-d and 50-d respectively) to produce a final local score for all candidates as follows:
\begin{equation}
\psi(x_i, y_{ij}) = \sigma(W_s[f_{ij}^{(c)}; f_{ij}^{(l)}; f_{ij}^{(p)}] + b_s)
\end{equation}
Where $W_s$ and $ b_s$ are weight and bias parameters for the MLP. The learning of the model is two tiered. We first pre-train the matrices $A$ and $B$ using the cross-entropy loss by using $\textbf{softmax}([y_{ij}^{T}Bc_{i}]_{j \in 1..k})$ as the predicted probability for each candidate for mention $x_i$,
Keeping $A$ and $B$ fixed, we then train the MLP weights with a drop-out rate of 0.7 minimizing again the cross-entropy loss. Note that we use the entity embeddings produced by \citep{rel:hoffman} and the word embeddings produced by \citep{l:Mikolov} using skip-gram model.

\subsection{Global Model via LDS}
Our local model primarily focuses on the textual context of each mention in making its decisions and ignores the relationship between mentions. Our global model takes as input the local predictions for all the mentions in a single document and constructs a globally coherent final solution using Limited Discrepancy Search. Before we introduce our LDS search procedure, we will first describe the discrepancy propagator which is critical toward achieving an efficient search space.

\subsubsection{Discrepancy Propagator}
\label{sec:dp}
The purpose of the discrepancy propagator is to allow the influence of the local changes to propagate to other parts of the solution, thus reducing the necessary number of discrepancies needed.  Our discrepancy propagator is essentially a new scoring function that evaluates each candidate for a given mention not only based on the local compatibility but also the global coherence among the predictions.

Given that not all mentions in a document need to be related to one another, for each mention $x_i$ we construct an entity context $E_i$ considering a window of 30 mentions centered at query mention $x_i$. Given the current entity assignment $e_1, e_2, ... e_n$ to the mentions in the document, the entity context for mention $x_i$ will be $E_i=e_{i-15} ... , e_{i-1}, e_{i+1}, ... e_{i+15}$.\\
For a given mention $x_i$ and its entity context $E_i$, the new score of a candidate $y_{ij}$ is defined as:
\begin{equation}
\label{global}
g(x_i, y_{ij}) = \psi(x_i, y_{ij}) + \frac{1}{|E_i|}\sum_{e\in E_i} \phi(e, y_{ij})
\end{equation}
In equation~\ref{global}, the score of a candidate now considers both its local score $\psi$ as well as its average coherence with the other predictions in its entity context. The coherence score $\phi$ between two entities $e$ and $y_{ij}$ is defined as:
\begin{equation}
\label{compatibility}
\phi(e, y_{ij}) = e^TCy_{ij} + w^T r(e, y_{ij})
\end{equation}
where $e$ and $y_{ij}$ are entity embeddings and $r(e, y_{ij})$ is a vector of three pairwise features between the two entities: log transformed counts of co-ocurrences, shared in-links and shared out-links; $C \in R^{d\times d}$ and $w\in R^3$ are learned weights. \\
The score given by equation~\ref{global} is fed through a softmax activation to assign probabilities to each candidate of $x_i$. We train $W$ and $c$ in a mention-wise procedure using cross entropy loss. Specifically for each mention $x_i$ we use ground truth entities for the other mentions in $E_i$ and update weights of $C$ and $w$ such that the true candidate of $x_i$ gets higher score than its false candidates.\\
Note that we do not intend to use this scoring function to do joint inference on all mentions. Instead, it is used with LDS to propagate the discrepancies to the output of all related mentions as follows. Given the original solution $e_1, e_2, ... e_n$ and a set of discrepancies $\{x_k:y_k\}$, we first update $e_k$ to $y_k$. Then we re-evaluate equation~\ref{global} for all mentions that have $y_k$ in their entity context to produce a complete solution based on new entity context containing $y_k$.
\subsubsection{Heuristic Function}
\label{sec:h}
The heuristic function takes the initial solution and sort all the mentions based on their prediction confidence. In this work we consider two heuristic functions for computing the prediction confidence of the local model. For a given query $x_i$, our first heuristic function $h_1$ computes its confidence simply by taking the max of the local scores normalized by a softmax funtion:
\begin{equation}
h_1(x_i) = \textbf{max}(\textbf{softmax}([\psi(x_i, y_{i1}), ...\psi(x_i, y_{ik})]))
\end{equation}
where $\psi(x_i, y_{ij})$ is the local score for candidate $y_{ij}$.

For our second heuristic function $h_2$, we learn a binary classifier (a two layer MLP) to produce local confidence for each mention $x_i$. The binary classifier utilizes the features listed in Table~\ref{tab:LFs}(b). Each feature value is transformed into a $10$-d vector using RBF binning \citep{rel:ibm}. The training samples for the binary classifier are generated from the prediction of the local model on the training set. One training example is generated for each local prediction --- if the local model is correct about its decision then the label for the sample is 1. In order to balance the positive and negative training samples, we randomly sub-sample positive local predictions. For each local prediction, the learned classifier outs a probability of its being correct, which is used as the confidence score.
\subsubsection{Pruning Function}
\label{sec:p}
At each iteration of the search, each beam is expanded to $k$ new states. Following the expansion, the DP is applied to the $b\times k$ expanded nodes and re-evaluates equation~\ref{global} for all mentions with updated entity contexts due to the discrepancies. It hence propagates the discrepancies and produces a complete solution. Subsequently, the pruning function evaluates each of the $b\times k$ complete solutions and reduces the expansion list to the beam size $b$.

The pruning function is similar to equation~\ref{global} but scores all the mentions collectively. Given all the mentions in the document $x_1, ..., x_n$ and their predicted entities denoted as $o = o_1, ..., o_n$, our pruning function scores the solution $o$ as follows:
\begin{equation}
s(o) = \sum_i \psi(x_i, o_i) + \sum_{(o_i\in E_j \mbox{ or } o_j \in E_i)} \phi_g(o_i, o_j)
\end{equation}

Where constraint $(o_i\in E_j \mbox{ or } o_j \in E_i)$ indicates that we consider relation among pair of entities $(o_i, o_j)$ if they are in the entity context of one another. Here $\phi_g$ takes the same form as equation~\ref{compatibility} but uses a different set of weights $C_g$ and $w_g$.

Despite the similarity in forms, the pruning function serves a different purpose from that of equation~\ref{compatibility} and requires different training. We train the pruning function by reducing it to a rank learning problem. Specifically, in training, we collect all the complete solutions that are considered in each pruning step, and compute their hamming losses from the ground truth. Given a set of solutions in a pruning step, we will create ranking pairs  to require the solution with the least hamming loss to score higher than all the others. Given a ranking pair, $o^t$ and $o^f$, assuming $o^t$ has lower hamming loss than $o^f$, we use the following ranking loss for training:

\begin{equation}
max\left(0, \Delta(o^{t}, o^{f}) - s(o^{t}) + s(o^{f})\right)
\label{eq:hinge_rank}
\end{equation}
where $\Delta(o^{(t)}, o^{(f)})$ is the absolute difference of the hamming-loss between $o^{(t)}$ and $o^{(f)}$. This loss function penalizes the scoring function if it fails to score $o^t$ higher than $o^f$ by a margin specified by $\Delta(o^{(t)}, o^{(f)})$.

\paragraph{Terminating the search.}
We consider two different strategies for terminating the search depending on the heuristic function in use. When using $h_1$ as the heuristic function, search terminates when we reach a depth limit $\tau$ (a maximum $\tau$ discrepancies). The strategy with $h_2$ uses a flexible depth. For this strategy, we terminate the search when discrepancies have been introduced for all queries that are predicted to be incorrect by $h_2$.

\section{Experiments}
\label{sec:exp}

\subsection{Data Sets}
We use two datasets CoNLL 2003 \citep{l:hoffart} and TAC 2010 \citep{l:ji10} for evaluation. The CoNLL dataset is partitioned into train, test-a and test-b with 946, 216 and 231 documents respectively. Following our baselines we only use 27816 mentions with valid links to the KB. The TAC 2010 dataset is yet another popular NED dataset released by the Text Analysis Conference (TAC). The dataset contains training and test set with 1043 and 1013 documents respectively. Similar to CoNLL we only consider linkable mentions in TAC and report our performance on 1020 query mentions in the test set.\\
To learn and tune the parameters of the local models for CoNLL and TAC we use their own training and development splits. However, to learn and tune the parameters of the global model (the discrepancy propagator, the heuristic and pruning functions) we only use the CoNLL training and dev-sets.\\
The number of queries per document in the test sets of the CoNLL and TAC are approximately 20 and 1 respectively. In order to have a global setup for TAC we apply CoreNLP \citep{l:corenlp} mention extractor to the test documents of TAC and perform joint disambiguation of the extracted mentions together with the query mentions, increasing the number of mentions to approximately 4 per document. We only report the performance on the query mentions with the given standard ground truth by TAC.
\subsection{Hyper-parameters and Dimensions} Our model settings for the hyper-parameters and dimensionality of the embeddings and weights are as follows: We use entity/word embeddings of 300-d. We learned the embeddings using the mechanism proposed by \citep{rel:hoffman}. We use 2-layers MLPs for the local model and the heuristic $h_2$ with hidden layer sizes 200$\times$50 and 100$\times$20 for each respectively. The RBF binning always transfers a scalar to 10-d.  Although we analyze and compare different configurations for beam-size and depth limit in section~\ref{section:ablation}, we use beam size 5 and flexible depth limit $\tau$ with heuristic $h_2$ in our reported results.
\subsection{Results}
To evaluate the model performance we use the standard micro-average accuracies of the top-ranked candidate entities. We use different alias mappings for TAC and CoNLL. Specifically, for TAC we only use anchor-title alias mappings constructed from hyper-links in the Wikipedia. For CoNLL, in order to follow the experimental setup reported by \citep{rel:ibm}, in addition to the alias mappings of Wikipedia anchor-titles, we use the mappings produced by \citep{l:pershina} and \citep{l:hoffart}.\\
Tables~\ref{tab:TAC}(a) and (b) show our performance on the CoNLL and TAC datasets for our local and global models along with other competitive systems respectively. The prior state of the art performances on these two datasets are achieved by \citep{rel:ibm}. The results show that our global model outperforms all the competitors for both CoNLL 2003 and TAC 2010. It is interesting to note that our local model is solid, but is noticeably inferior to the stat-of-the-art local model. With an even stronger local model like that of \citep{rel:ibm}, one can potentially expect our LDS-based global model to push the state-of-the-art even further.
\begin{table}[h!]
\begin{minipage}[b]{0.45\linewidth}
\centering
\footnotesize
\begin{tabular}{|l|c|}
\hline \bf models & \bf In-KB acc\%\\
\hline
\multicolumn{2}{|l|}{\bf local} \\
\hline
\citep{l:He} &  85.6 \\
\citep{l:Francis} &  85.5 \\
\citep{l:sil:16} &  86.2 \\
\citep{l:lazic} &  86.4 \\
\citep{l:yamada} &  90.9 \\
\citep{rel:ibm} & 94.0 \\
\hline
\multicolumn{2}{|l|}{\bf global} \\
\hline
\citep{l:hoffart} &  82.5 \\
\citep{l:pershina} &  91.8 \\
\citep{rel:google} &  92.7 \\
\citep{l:yamada} &  93.1 \\
\hline
\multicolumn{2}{|l|}{\bf our model} \\
\hline
local &  90.89 \\
global & \textbf{94.44} \\
\hline
\end{tabular}\\
(a) CoNLL 2003
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.45\linewidth}
\centering
\footnotesize
\begin{tabular}{|l|c|}
\hline \bf models & \bf In-KB acc\%\\
\hline
\multicolumn{2}{|l|}{\bf local} \\
\hline
\citep{l:sil:16} & 78.6 \\
\citep{l:He} & 81.0 \\
\citep{l:sun} & 83.9 \\
\citep{l:yamada} & 84.6 \\
\citep{rel:ibm} & 87.4 \\
\hline
\multicolumn{2}{|l|}{\bf global} \\
\hline
\citep{l:yamada} & 85.2 \\
\citep{rel:google} & 87.2 \\
\hline
\multicolumn{2}{|l|}{\bf our model} \\
\hline
local & 85.73 \\
global & \textbf{87.9} \\
\hline
\end{tabular}\\
(b) TAC-2010
\end{minipage}
\hspace{0.01cm}
\vspace{-0.15in}
\caption{Evaluation on CoNLL 2003 Test-b and TAC-2010}
\label{tab:TAC}
\vspace{-0.25in}
\end{table}
\subsection{Ablation Study and Performance Analysis}
\label{section:ablation}
For ablation we analyze the impact of the features and search. We also analyze the behavior of our model based on the rarity of the entities.
\subsubsection{Feature Analysis}
We study the impact of features on the local and global models. For the local model, starting with only considering the contextual evidence as described in Section~\ref{subsec:contextual}, we see that the performance steadily increases as we add the prior and lexical features. As shown in tables~\ref{tab:TAC_F}(a) and (b) the prior and lexical features have very strong impact on TAC. The binning technique that projects the prior and lexical features to 10 dimensions gives an average of 0.94\% and 0.61\% percentage points for TAC and CoNLL respectively.\\
For the global model, entity pair compatibility is computed using both entity embeddings and log transformed counts of co-occurences, shared in-links and shared out-links. Using these features leads to a gain of 1.1\% and 0.43\% in accuracy for CoNLL and TAC respectively compared to the global model using only the embeddings in equation~\ref{compatibility}.
\begin{table}[h!]
\begin{minipage}[b]{0.45\linewidth}
\centering
\small
\begin{tabular}{|l|c|}
\hline \bf models & \bf In-KB acc\%\\
\hline
\multicolumn{2}{|l|}{\bf local} \\
\hline
Context only &  85.37 \\
Context + Prior + Lexical &  90.28 \\
Context + Prior + Lexical + Bin &  90.89 \\
\hline
\multicolumn{2}{|l|}{\bf global} \\
\hline
Our global & 94.44 \\
- log count features  &  93.34 \\
- LDS + 1-step global prop. &  93.14 \\
- LDS + conv. global prop. & 93.63 \\
\hline
\end{tabular}\\
(a) CoNLL 2003
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.45\linewidth}
\centering
\small
\begin{tabular}{|l|c|}
\hline \bf models & \bf In-KB acc\%\\
\hline
\multicolumn{2}{|l|}{\bf local} \\
\hline
Context & 70.86 \\
Context + Prior + Lexical & 84.79 \\
Context + Prior + Lexical + Bin & 85.73 \\
\hline
\multicolumn{2}{|l|}{\bf global} \\
\hline
Our global & 87.9 \\
- log count features & 87.47 \\
- LDS + 1 step global prop. & 86.21 \\
- LDS + conv. global prop. & 86.29 \\

 \hline
\end{tabular}\\
(b) TAC-2010
\end{minipage}
\hspace{0.01cm}
\vspace{-0.15in}
\caption{The performance of variants of our Local/Global models on CoNLL 2003 and TAC-2010}
\label{tab:TAC_F}
\vspace{-0.15in}
\end{table}
\subsubsection{Search Analysis}
In the last two rows of Table~\ref{tab:TAC_F}, we list variants of our model where LDS search is removed. Specifically, given the initial local solution, our discrepancy propagator (equation~\ref{global}) can be applied without any discrepancy to re-evaluate the candidates for all mentions and obtain a more globally compatible solution. Naturally, one can repeat this for multiple iterations till convergence, which gives us an alternative global model that does not rely on search. We consider this model and show its single iteration performance (-LDS + 1-step global prop.) as well as its converged performance (-LDS + conv.~global prop.) in Table~\ref{tab:TAC_F}. From the results we can see that a single iteration of the global propagation was able to significantly improve the initial local solution, but later iterations lead to very mild gain. This is because after the first propagation the convergence is almost immediate and there is a limited improvement after the first iteration. In contrast, our search based global model is able to achieve significant further performance gain 1.3\% for CoNLL and 1.68\% for TAC. The reason is that with local discrepancies introduced by LDS, we force the solution to escape the current local optimum and search for better ones.

Additionally, several parameters/choices in the search can potentially impact the performance: the beam size $b$, the depth of search, and the different heuristics for prioritizing the discrepancy locations. The following set of experiments explore these choices of parameters:
\paragraph{Beam size.} We compare model with beam size $b=5$ and a simple greedy model with $b=1$. For CoNLL 2003 and TAC-2010, the model with $b=5$ gives a gain of 0.24\% and 0.13\% compared to the greedy. Increasing the size of the beam further beyond 5 did not show significant gain.
\paragraph{Depth of search.} For heuristic $h_1$, we use a fixed depth strategy. In particular, given a document with $n$ mentions, we consider two different depth limits: $\tau=25\% n$ and $\tau=50\%n$, which lead to an average depth of 5 and 10 per document respectively. For heuristic $h_2$, the depth is flexible and determined by the number of mentions that are predicted to be incorrect by $h_2$. This strategy leads to an average depth of $4$. In Tables ~\ref{tab:confusion} (a) and (b), we report the confusion matrices given by $h_1$ applied to the local prediction on test-b of CoNLL 2003 with $\tau=25\%n$ and $\tau=50\%n$ respectively. In these tables correct/incorrect mean whether the local prediction is correct or not (comparing to the ground truth). Therefore the first cell with value 1134 indicates that there are 1134 mentions in test-b that are correctly predicted by the local model, but deemed as among the top 25\% least confident mentions (aka the hard queries) by $h_1$. The confusion matrix for a good heuristic will have small diagonal values and large anti-diagonal values.

In Table~\ref{tab:confusion} (c), we apply heuristic $h_2$ to the same data with flexible depth. These results show that heuristic $h_2$ gives the best precision as well as recall of the real mistakes made by the local model.
\begin{table}[h!]
\begin{minipage}[b]{0.31\linewidth}
\centering
\small
\begin{tabular}{|l|c|c|}
\hline $\tau=25\%n$ & r $\le$ 25\% & r $>$ 25\%\\
\hline
correct & 1134 & 2937  \\
incorrect & 276 & 136 \\
\hline
\end{tabular}
(a)
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.31\linewidth}
\centering
\small
\begin{tabular}{|l|c|c|}
\hline $\tau=50\%n$ & r $\le$ 50\% & r $>$ 50\%\\
\hline
correct & 2071 & 2000  \\
incorrect & 331 & 81 \\
\hline
\end{tabular}
(b)
\end{minipage}
\hspace{0.01cm}
\begin{minipage}[b]{0.305\linewidth}
\centering
\small
\begin{tabular}{|l|c|c|}
\hline $\tau$=flexible & label=0 & label=1\\
\hline
correct & 805 & 3266  \\
incorrect & 333 & 79 \\
\hline
\end{tabular}
(c)
\end{minipage}
\vspace{-0.15in}
\caption{Confusion Matrices for (a) using heuristic $h_1$ with $\tau=25\%n$, (b) heuristic $h_1$ with $\tau=50\%n$ and (c) heuristic $h_2$ with flexible $\tau$.}
\label{tab:confusion}
\vspace{-0.23in}
\end{table}
\begin{table}[h!]
\begin{center}
\small
\begin{tabular}{l|c|c|c|c}
\hline \bf Models & Heuristic & Depth ($\tau$) & Beam Size (b) & In-KB acc \% \\
\hline
Global + LDS & $h_1$ & $\tau=25\%n$ & 1 &  93.88 \\
Global + LDS & $h_1$ & $\tau=25\%n$ & 5 &  94.12 \\
Global + LDS & $h_1$ & $\tau=50\%n$ & 5 & 94.23 \\
Global + LDS & $h_2$ & flexible & 5 & 94.44 \\
\hline
\end{tabular}
\end{center}
\vspace{-0.15in}
\caption{\label{tab:HC} CoNLL 2003 Test-b}
\vspace{-0.15in}
\end{table}

In Table ~\ref{tab:HC}, we report the performance of our model on CoNLL 2003 with different choices for the heuristic, search depth, and beam size. The results show that using a beam of size 5 improves upon single greedy search, and using heuristic $h_2$  with flexible depth gives the best performance in terms of both  prediction accuracy and efficiency (due to smaller search trees). When $h_1$ is used, doubling the depth of the search tree brings about only a marginal improvement in accuracy at the cost of doubling the search depth and thus the prediction time.

\subsubsection{Performance Analysis Based on Entity Rarity} We also analyze the behavior of the coherent global models based on the rarity of the entities for the given mention. Specifically, we measure the rarity of $e$ for given query mention $m$ by $p(e|m)$, as defined in \ref{subsec:prior}, scaled to (0, 100). To this end we quantize the value of rarity measure into different bins. For each bin we compute the difference of accuracy between a coherent global model and the local model. Two coherent models are considered here; a global model without LDS (-LDS + conv.global prop in Table~\ref{tab:TAC_F}) and global model with LDS using $h_2$. Figure ~\ref{fig:gc} shows the difference of accuracy between the global and local models per bin. As shown in this figure both global models achieve gains mostly on bins with small $p(e|m)$, which are related to the mentions with rare true entity. Additionally, the impact of the global model when LDS is used is more significant, especially for the mentions whose true entities are most rare according to $p(e|m)$.
\begin{figure}[ht]
\centering
\includegraphics[width=0.75\textwidth,height=0.32\textwidth]{rarity_pair.png}
\vspace{-0.15in}
\caption{\label{fig:gc} Global accuracy minus local accuracy per bin of rarity measure $p(e|m)$ which is scaled to (0, 100) for two coherent global models; model without LDS and model with LDS.}
\vspace{-0.20in}
\end{figure}

\section{Related Work}
Deep learning has been leveraged in recent local and global models. In local models \cite{l:sun} use neural tensor networks to model mention, context and entity embeddings. \cite{rel:hoffman} develop an attention based model to weigh the importance of the words in the query document. The model by \cite{rel:ibm} utilizes neural tensor network, multi-perspective cosine similarity and lexical composition and decomposition. In global models, the early models \citep{l:Milne, l:Ferragina} decomposes the problem over mentions. \cite{l:hoffart} use an iterative heuristic to prune edges among mention and entity. \cite{l:Cheng} use an integer linear program solver and \cite{l:Ratinov} apply SVM to use relation scores as ranking features.

In recent global models, Personalized PageRank (PPR) \citep{l:Jeh} is adopted by several studies~\citep{l:Han,l:He,l:Alhelbawy,l:pershina}. \cite{l:yamada} extend the skip-gram model \citep{l:Mikolov} to learn the relatedness of entities using the linking structure of the KB. \cite{rel:hoffman} use a Conditional Random Field (CRF) based model to capture the interrelationship among entities in the same document whereas \cite{rel:google} introduce a soft k-max attention model to weight the importance of other entities in the document in making prediction for any given query.

In our proposed global model we address the intractable global optimization in a search framework. Specifically we use Limited Discrepancy Search \citep{JMLR:v15:doppa14a}. Initialized with a local solution, LDS only explores a small number corrections to the hard queries. The propagation of the corrections enables the correction of other mistakes (even those with high local confidence) and allows us to reach high quality solutions with shallow searches. Moreover, the heuristic to prioritize the discrepancies can noticeably reduce the time without hurting the performance.
\section{Conclusions} In this paper we study the problem of entity disambiguation. We are inspired by the observation that local models in this task tend to produce reasonable solutions, such that with only a small number of corrections and a proper propagation of  these corrections throughout the document, one can quickly find superior solutions that are globally more coherent.

Based on this observation, we propose a search based approach that starts from an initial solution from a local model, and uses Limited Discrepancy Search (LDS) to search through the space of possible corrections with the goal of improving the linking performance. The experimental results show that our global model improves the state of the art on both the CoNLL 2003 and TAC 2010 benchmarks. For future research, we are interested in further understanding of the strengths and weaknesses of the LDS-based approach for different types of queries and entities. We are also interested in applying different local models to initialize the LDS search.

\bibliographystyle{acl_natbib}

redpajama_set_name: RedPajamaArXiv


Recently a dear friend said to me 'Just be yourself'. How amazing. The most beautiful thing anyone ever said to me. Just to be myself is enough, I have learned. And you, just to be yourself is enough. You are a beautiful goddess, wild, free spirited, with wisdom, creativity and courage beyond that which you can even imagine you possess. When I am my true self, when I trust my instincts and intuition, I know I am safe. I know that the judgements and decisions I make are right for me and that I am being good to myself and caring for myself in the best way I possibly can. This may sound simple but it can be very difficult to do, which is why we often don't do it.
What stops us from being our true selves? Society as it is structured can find a so called 'alternative' point of view such as this challenging. We suddenly one day wake up and find ourselves trapped in a house we no longer like, perhaps in a relationship which no longer nurtures us and with a job which makes us stressed and then the whole scenario causes us to be depressed, lacking in energy and motivation and so we just trudge on day after day until we die. We have lost ourselves. Ask yourself, if this house, partner, job and everything which I feel identifies me were gone tomorrow, who would I be? Who are you? We can either give into the madness of the expectations placed upon us since birth, or we can rise up and re-birth and re-earth ourselves. In order to connect with ourselves we need to get back to basics, strip away all the false images and charades and so this involves returning to nature, to our feral roots. Go outdoors, out of the house, daytime, nighttime, anytime. Go to the ocean, to the woods, to the mountains, go where it is totally wild and free. Take off your shoes (and clothes maybe!) and feel the earth beneath your feet. Walk barefoot and breathe, breathe, breathe. Then light a fire and sit for a while, just allow yourself to be. Wild and free, in the elements, being yourself. See how you feel.
How do we harness this wildness and then manage to still function in everyday life? It is not easy and will result in upheaval and possible major life changes if you are currently living more conventionally. Tune in to your creativity, paint, draw and write, sing, play music and dance. Do not ever ever concern yourself about what other people may say. You will be judged, by family and friends as well as strangers. Do not let this distract you. You are only being true to yourself. Only you and you alone can do this for yourself, you must be brave, courageous and strong. There is no rational reason to feel that you need to conform to what everyone else believes you should be doing. You can choose to do whatever you like, when you like, with who you like.
Within this challenge of being yourself you are never alone. I have come to know so many inspirational so called everyday ordinary women. Know this, none of us are ordinary, we are all extraordinary human beings with incredible creative and passionate potential. Please never ever forget that.
Some women have found themselves trapped for an entire lifetime in domesticity and a marriage they regret but feel they cannot end, others have personal challenges which they wrangle with on a daily basis, others have physical and psychological health struggles, some have none of these things and are wild and free, but they still find life tough at times. We all bear the scars of this existence, because thats life. Below are the first names of some of these incredible women. This blog today is dedicated to them, with love.
Kate, Anna, Jenna, Trixy, Lara, Beryl, Kim, Donna, Trish, Maggie, Laura Grace, Christine, Janet, Emma, Kathy, Lisa, Sandra, Sue, Catherine, Kerstine, Sarah, Nicky, Annie, Liz, Debbie, Cheryl, Jane, Violeta, Karen, Amanda, Sian, Jess, Tash, Dawn, Emily, Penny, Alice, Lindsey, Sunita, Helen, Pat, Jackie.


Relax in style with our pretty pink floral slippers. These super soft, comfortable slippers are complete with pom pom trim and a memory foam sole.
Machine or hand wash separately in cold water with mild soap. Air dry. Do not put into dryer.


text:
CIMM Study Looks at Firms Offering Ad Attribution (B&C)
Companies include single-source providers and marketing mix modelers
Jon Lafayette
Attribution has become one of the advertising businesses biggest buzzwords as marketers seek proof that the campaigns they run and the media they buy are producing results.
Dozens of research and analytics companies have emerged to try to measure how much of a product's sales can be attributed to different ads on different platforms.
On Thursday, the Coalition for Innovative Media Measurement released a study that compares offerings in digital, cross-platform, multi-touch and television attribution and media mix modeling.
Commissioned by CIMM and the Four As, the study was presented at the 7th Annual Cross-Platform Media Measurement & Data Summit in New York.
"Attribution is the single most emerging critical topic in the industry today," said Jim Spaeth of Sequent Partners, who conducted the study. "Given the pace of change and innovation in the field, this document will serve as an industry resource and help advance the dialogue between buyers and sellers."
Companies examined in the study, which include Nielsen, Data + Math, iSpot.tv, Standard Media Index, Oracle and Samba TV, were grouped into four categories.
Marketing Mix Modelers with Attribution Products
Attribution Specialists With Cross-Platform Products
Television or Digital Attribution Providers
Single Source Providers
This study follows up on the white paper, Current Practices in Attribution and ROI Analysis, that was presented during the 6th Annual Summit in 2017. That study looked at best practices in cross-platform attribution and ROI analysis.
"The landscape of attribution providers is complex and constantly changing," said Jane Clarke, CEO and managing director, CIMM. "With attribution and mix-modeling gaining importance in the marketplace, buyers and sellers need an easy-to-understand guide to help identify which companies best suit their needs."
https://www.broadcastingcable.com/news/cimm-study-looks-firms-offering-ad-attribution-171506
CIMM Adds 26 New Companies, Increases Membership by More Than 50%
CIMM, 4A's and TVB Launch Study to Develop Action Plan for Local TV Measurement
Study Reveals Strong Consensus That Multi-Currency Transition Should Deliver Important Benefits, But Systems and Processes Need to Evolve
CIMM Names Tameka Kee As Deputy Managing Director
CIMM Establishes Five New Working Groups to Support Cross-Media Measurement
EACA and WFA Join International Knowledge Exchange on Audience Measurement, Metrics and Data