Beru was the first to make his move . His Sovereign had given him only one order
'Defeat the enemy without harming her . '.
Beru once stood at the peak of his species, and he knew what the best method to perfectly fulfil that order was . And that would be this: Make the opponent lose her will to fight by imprinting the clear gap in power between them in her mind
Paht!.
Beru disappeared from Cha Hae-In's view the moment he moved, before reappearing right in front of her nose even before she had the chance to realise it
" . !!".
Cha Hae-In's animal-like instinct kicked in even as the astonishment at Beru's speed nearly overwhelmed her, and she swung her sword at her opponent . She followed that up with dozens more
However, Beru stood in the spot and evaded all of her attacks without taking a single step
It was a precise movement that eliminated all necessary motion . He was so bloody quick that afterimages were left behind in his wake . This was the display of an unbridgeable gap in their power levels
'This is impossible!'.
Cha Hae-In's eyes shook hard every time she missed
'It can dodge all my attacks at such a close distance without moving its legs once?'.
Just one more time!.
She took aim at the neck of her opponent and took a swing, but the creature lightly evaded it by leaning back slightly . No matter where she attacked from, or how she changed her attacks, her opponent easily dodged them all
'How can this be ?!'.
This thing wasn't even alive anymore . This thing was a summon borrowing the powers of the dead monster, so how could it still be this strong?.
And also .
'Mister Seong Jin-Woo, who can freely control such a summon, just what . '.
Cha Hae-In's movements became a tad dull from the vague fear invading her, and Beru seized upon this opportunity to smack her incoming sword away with the back of his hand . And then, pressed his face closer to hers
Cha Hae-In froze up on the spot as the stench of death blew right into her face
'This is the end . '.
She inadvertently gasped out the moment those huge mandibles filled up her view
"Ah!".

She was knocked away ungainly from the screech containing his magical energy
"Kyahk!".
Jin-Woo grimaced while watching that . Indeed, there was no way he'd start enjoying the sight of someone else getting knocked around one-sidedly like this
However, she stood back up again and fixed the grip on the sword as if to show that she wasn't giving up at all . Jin-Woo tilted his head
'What is she trying to do?'.
The Cha Hae-In he knew wasn't a low-class Hunter who didn't want to accept the difference between her and her opponent even after confirming the truth with her own eyes
'And she's definitely not reckless enough to keep attacking when she knows of the gap, too . '.
In that case, could she still be in possession of one more card up her sleeve?.
'Whatever it is, I hope she's not making an incorrect call . '.
Jin-Woo was mentally linked with Beru, so he could feel how much his soldier was suppressing its killing intent at the moment . On the other hand, Cha Ha-In's will remained unyielding, even though she found herself in an absolutely disadvantageous position
He was getting a bad premonition here . Jin-Woo's expression became even more serious as he watched the two of them
'… ?'.
On the hand, Beru had failed to understand Cha Ha-In's decision
He had displayed their overwhelming gap in power several times by now . So, why hadn't she stop her challenges yet?.
The former king of ants, a being who lorded over others at the apex of the food chain, was beginning to get displeased by the human female's stubbornness . The basis of his anger stemmed from the past memory of him being a ruler
'How dare . '.
The moment Beru made up his mind, he arrived before Cha Hae-In in the blink of an eye . He then pressed his face closer to glare straight into her eyes
Any lifeform still breathing would've immediately realised who was the predator and the prey in this situation just from their gazes meeting like this . It would be a warning from one's primal instinct
Beru planned to awaken that instinct of his opponent and make her lose her will to fight in that manner, but unfortunately, his ploy wasn't as effective as he thought
Just as Jin-Woo had predicted, Cha Hae-In still held one last trump card to fall back on
The skill, 'Sword Dance', one she was most proficient in wielding . Her movements sped up as if she was performing a deadly dance, and the tip of her sword drew splendid arcs in the air
Paht! Paht! Paht!.
Too bad .
Beru used his claws to easily defend against all those smoothly flowing attacks that had no interruptions in between . At the end of the barrage, his expression crumpled unsightly
'No more playing around . '.
Beru snatched the sword flying at him with his bare hand and crushed it
Kwajeeck!!.
She only had half a sword left, but rather than falling into despair, her glare became icy cold, instead
'I have only one last chance!'.
Every single drop of magic energy in her was poured into the broken sword to activate her skill, 'Blade of Light'
The magic energy expenditure for this skill was far too great and she could only use it as the final hurrah . And for the first time during this fight, she revealed it in its full glory
The blade of light shone brilliantly
Beru had lowered his guard for a moment after breaking her sword, and she used that opening to jump into his front and stabbed the blade of light forward
Jin-Woo's eyes widened
'Nooo!'.
Of course, he wasn't worried about Beru . Utterly disregarding his worries, the blade glowing in golden light pierced deeply into Beru's tummy
"Kiiieehhk-!!".
In that brief moment, Beru's mind spun quickly
'This woman is an enemy . '.
It'd not be a problem for him to die . However, if he fell here, then this woman's sword would point towards his Sovereign next
It was then
An instinct buried deep within all Shadow Soldiers' psyche, one designed to activate in times of great distress and override everything else, wiggled back into life
- "Protect the Sovereign!".
In that moment, inside of Beru's head blanked out into a 'reset' state and the order Jin-Woo gave him, 'defeat the enemy without harming her' was wiped away completely
Beru transformed into a terrifying monster in order to protect Jin-Woo . His body ballooned up to a giant proportions . His mandibles split wide open as if he was getting ready to chew on steel, and finally, his claws extended out to resemble a group of sharp blades!.
"Stop!!".
Beru finished getting ready to rip apart his owner's enemy, and swung all ten of his claws and their sharp edges at his target
Swish-!!.
Just before all ten blades reached Cha Hae-In .
Grab!.
Jin-Woo managed to make it just in time
" I told you to stop, didn't I?".
Jin-Woo stopped both sets of Beru's claws with his bare hands and began glaring at his soldier . Beru met that enraged glare and began shuddering . He quickly leapt back and, while not even bothering to pull that sword of light from his midriff, prostrated flat on the ground and begged for forgiveness
"Oh, oh my king . Mercy . ".
Jin-Woo knew what this guy was thinking of the moment he was about to act . Hell, the singular thought of 'Protect the Sovereign' was ringing really loud inside his head, too
'… . '.
Jin-Woo glared at Beru for a little while, before shifting his gaze away
Plop
Cha Hae-In was completely spent and, unable to stand any longer, plopped down to the ground .
Jin-Woo walked closer . She was trying to push herself back up, but gave up in the end and, while keeping her gaze rooted to the floor, nodded her head
"I am fine . ".
'Fine, my foot . '.
 I mean, you shouldn't have any reasons to enter my Guild while putting yourself through a wringer like this, right?".
" . ".
Indeed, this was supposed to be a simple test . More than that, this was a 'test' he cooked up to reject her tactfully . But, to think, she'd be this obsessed about winning, even to the extent of using such a dangerous skill, too
This couldn't be chalked up to her desire to win at all costs . That was why .
"Could it be . ".
… . Jin-Woo cautiously asked her, so as to not damage her ego
"Are you perhaps interested in me?".
"Excuse me??".
Cha Hae-In got flustered and formed a dazed expression of someone getting hit in the back of her head . Jin-Woo tilted his head
'That wasn't it, either?'.
But then, Cha Hae-In carefully reorganised her thoughts and corrected her answer
" Yes, I think so . ".
***.
Within the United States' Hunter Bureau
The director was feeling rather unhappy after receiving the news of Hunter Seong Jin-Woo's recruitment ending in failure . Instead of getting a report, he summoned the deputy director to the conference chamber
The deputy director brought Madam Selner with him
"Explain what happened back there . ".
The director asked even before they had the chance to sit down . This was the first time since the founding of the Hunter Bureau that their scouting offer, accompanied by Madam Selner no less, had been rejected by the subject
The deputy stood up with a darkened expression and lowered his head
"I'm truly sorry, sir . ".
"I didn't call you here for your apologies, Michael . ".
The director pressed a certain button, and all the glass walls were covered up and the exit was locked tight . The interior had become perfectly soundproof
In order to prevent the leakage of information, all matters pertaining to Madam Selner were never discussed over the phone or through emails . That was why the director was still unaware of what went down in South Korea until now
"Now, please explain to me what happened . ".
The deputy director glanced at Madam Selner for a moment or two . She slowly nodded her head, and only then did the deputy open his tightly-shut lips once more
"Madam Selner was able to 'observe' Hunter Seong Jin-Woo . ".
"What was the result?".
The director knew how her power operated, so the result of her 'observation' was as important as the result of the 'recruitment' itself
"Hunter Seong Jin-Woo is ".
The deputy licked his dried-up lips from tension and continued on
" Is apparently one of the 'kings' . ".
"What?!".
The director jumped up from his seat
Of all the powerful Hunters she had met over the years, she described only three people as 'kings' . And all three of them were powerful enough to shake the world by the scruff of its neck, too
Quite literally, they were the zenith of Hunters! And the man named Seong Jin-Woo had to be included in that list now, as well
The director shifted his gaze over to Madam Selner and asked her
"Does that mean Hunter Seong Jin-Woo possesses the level of power equal to other Special Authority-rank Hunters?".

Frowns formed on the director's forehead
The deputy could amply understand how his boss must be feeling right about now . He, too, had displayed a similar reaction back when he heard the exact same answer, after all
Madam Selner let out a long sigh
"Looks like . I'll have to explain myself a little . ".
Her talk began from those words
"First of all I'll assume that both of you know just what kind of an ability I possess . ".
The director and his deputy both nodded their heads simultaneously . The former spoke first
"You said that the Awakened are people connected to the powers of the 'other side' . ".
By staring into the eyes of the Awakened, Madam Selner could sense the 'passageway' connecting said Awakened to the other side
However, she said that there were certain Awakened who were receiving so much incredible power from the 'other side' that it ends up resembling a blinding flood of light, instead
These were precisely the 'kings' she talked about
"So, what is different about Hunter Seong Jin-Woo, then?".
"He doesn't have a passageway . ".
Madam shivered in fear again
"When I looked into his eyes, the darkness within him was staring back at me . Oh, my god . He was the darkness itself . ".
The deputy director refuted this immediately
"But, he has helped out a lot of people during his tenure as a Hunter, and I can't see him as someone as evil as you describe him to be ".
If Hunter Seong Jin-Woo was indeed a vicious, evil individual, he'd have immediately killed the two agents who pointed guns at him where they stood . However, he just let that slide without caring too much about it
Madam shook her head
"I wasn't talking about whether Hunter Seong Jin-Woo was a good or evil man, deputy director . ".
The light shining in her eyes was determined
"No, I'm talking about the origin of his power . ".

Madam nodded her head
"Hunter Seong Jin-Woo, he's not borrowing someone else's power . He only relies on the power residing within him, so he's not restricted by the passageway . Which means . ".
"There's no limit to his power . ".
The deputy director muttered absently before breaking into an abrupt shudder . He couldn't even begin to imagine how absurd the level of power gushing out without any limit could potentially be
The director fell into a deep thought after he heard both of his guests . And a short while later, he nodded his head, evidently having made his mind up over something
"Madam, thank you for your hard work . ".
After seeing Madam Selner off, the director headed down to the underground floors of the Hunter Bureau with his deputy in tow
"Director, where are we going?".
"Ninth basement floor . ".
"Isn't that where we store old records?".
"We have something else secured there besides the records . ".
The director watched as the number on the elevator's display panel steadily decrease and continued on
"If we can't rely on Madam Selner's power, then we should use a different method to bring him in . ".
That man was still so young .  And the director wanted to possess the knife called Seong Jin-Woo
They arrived at their destination, and while unlocking a series of electronic door locks, steadily walked deeper into the ninth underground floor . A few Bureau agents greeted them as they walked past, but the director didn't even spare a single glance
"Do you still recall the very first rank S Gate ever to appear?".
"Of course . ".
How could anyone forget the worst dungeon break in history that destroyed a portion of the Western United States?.
The American government summoned in the world's most powerful Hunters with an unbelievably huge amount of reward on offer, and eventually, they succeeded in killing the boss-level monster that emerged from that rank S Gate
However, only five survived that encounter .  Without their sacrifice, the nation of the United States of America might have ceased to exist altogether
That was why the American government bestowed the five remaining saviours the rights equalling that of the country itself, and that's where the term 'Special Authority-rank' originated from
The director mouthed the name of the monster that brought upon one of the worst tragedies in the history of mankind
"Kamish the Dragon ".
Didn't the Mage-type Hunters say that 'Kamish' meant an undying flame?.
They entered the deepest room on the floor, and the director opened the safe found in there . And that's when a single Rune Stone, under a heavy guard and being monitored constantly, revealed itself
The deputy director flinched in surprise
"In that case, could that thing be ?".
"Your guess is correct . ".
The director placed his hand on top of the reinforced glass shielding the Rune Stone and formed a smile
"This Rune Stone came out from that Kamish's corpse . ".
Two of the Special Authority-rank Hunters settled down in the US after the end of the Kamish raid . In a way, they were the gifts that Kamish managed to deliver to the US
To avoid another calamity like this, the Americans established the Hunter Bureau and focused all their might on improving the strengths of the Hunters . Around eight years passed by since then
Simply because no Mage-type Hunters were among the surviving Special Authority-rank Hunters, Kamish's Rune Stone was tucked away in this cold underground storage beneath the Hunter Bureau, waiting for a new owner to come along
The director formed a meaningful smile as he peered into the glass case
"Kamish will present us with yet another invaluable gift to our beautiful country very soon . ".
< Chapter 135 > Fin


This web site and the material contained in it were originally created in support of an annual short course on Model Fitting and Inference for Infectious Disease Dynamics at the London School of Hygiene & Tropical Medicine. All material is under a MIT license. Please report any issues or suggestions for improvement on the corresponding GitHub issue tracker. We are always keen to hear about any uses of the material here, so please do get in touch using the Discussion board if you have any questions or ideas, or if you find the material here useful or use it in your own teaching.


Home
Sales
Contact Us
Contact Us
First Name
Last Name
Email
Phone
Message
Email Us
<EMAIL_ADDRESS>Call Us
+1-202-555-0155
Address
Seatle


I am a Masters student in Computational Science and Engineering in the School of Computing at Georgia Tech.
My areas of interests are Computer Vision and Machine Learning. I am currently a graduate researcher at Centre for Spatial Planning Analytics and Visualization at Georgia Tech, wherein I am working on modeling traffic flow and pavement vulnerability using agent based simulation.
I am particularly interested in Visual Scene Interpretation of outdoor scenarios including scene classification, object detection and semantic segmentation. I am interested in the applications of urban scene understanding for automotive applications and virtual 3D augmented reality.
Topic: Smart Funding Strategies for Maintaining Interdependent Transportation Infrastructure Assets
Mentor: Dr. Zhaohua Wang
I am primarily involved in formulating the infrastructure (pavement/bridges) maintenance optimization problem, modeling the interdependency using network flow models and implementing a parallel computing framework for large scale optimization
Developed machine learning models and provided analytics consulting to Mastercard’s merchant partners on customer persona identification and spending behaviour using 100TB card transaction data. Extensively worked on Hive, R, Python and Spark
Category sales & customer purchase behaviour analysis and campaign performance modeling for a leading South African grocery retailer
Led a team of three analysts to develop machine learning models for providing behavioural insights and optimize campaign targeting for Future Group's customer base enrolled in Payback loyalty program. Payback is a multi-brand loyalty program and Future Group is India's leading multi-format retailer with popular supermarket chains like Big Bazaar, Central, FBB, BrandFactory
Pricing analytics and supply chain consulting to Fortune 500 US insurer managing the pre-owned mobile device trade-in
program for T-Mobile - Led a team of 10 consultants and handled recruitment of new team members
Mobile Buyback Pricing
Responsibilities included financial analysis, budget planning, client seating optimization, marketing collateral development and operations performance tracking for Insurance outsourcing operations ($250M revenue). High Performer - Rated ‘Exceeds all expectations’ (5/5)
Full-Stack developer responsible for maintenance & enhancement of Travelocity’s checkout web application by resolving high impact booking issues, developing unit tests and coordinating testing with QA team
Journal Publications
Oral/Poster Presentations
Topic: Early detection of Oral Cancer through multi-modal texture analysis of oral submucous fibrosis images
Topic: Texture based segmentation of cerebellar region in MRI images using SVM & deformable registration
Topic: An entropy based multi-thresholding method for semi-automatic segmentation of liver tumors
The work was done as part of European Commission backed Accurobas (Accurate Robot Assistant) project and involved developing an automated liver tumor extraction algorithm on Computed Tomography images for guiding minimally invasive robotic surgery. The algorithm was incorporated into MiroSurge platform. I was involved in the following aspects:
The project involved developing a pan-tilt unit controller & setting up a Serial Communication interface between a remote robot & the base station for region mapping. I created GUI’s in Visual C++ for the Sensor Data Acquisition model & incorporated a module to calculate robotic arm’s orientation using color-based segmentation
Tools/Libraries used: Visual C++, Visual Studio
*Report unavailable due to confidentiality clause
Tools/Libraries used: Python, OpenCV, VLFeat


ME-TA is ready to serve you from 01. Jan 2016
ME-TA was created to be a resource to existing biometric departments. With an ambition to further develop the role of statisticians and statistical programmers. ME-TA will help statisticians and programmers increase their effectiveness by encouraging innovative initiatives. ME-TA strive to make the complicated simpler and transparent.
Within the traditional roles of programmer and statistician we are a resource on expert level. Together, we have the ambition and the know how to bring a good idea into a daily implemented innovative solution. ME-TA will help your statisticians and programmers increase their effectiveness in their roles by encouraging best practices and support innovative initiatives.
We have expertise within biostatistics and sas programming. Through experience in expert roles in pharmaceutical companies, we document the level of expertise that our service provides. As Global Development Team - project statistician at Takeda and as Senior Specialist SAS programmer at Lundbeck, Martin Eeg and Toni Awwad have been recognized as experts within their fields by both Nycomed/Takeda and Lundbeck.
We co-author development plans to maximize the impact of investment with a focus on time and the price re-imbursement negotiations in mind. We use rational and economical sound principles to build the value proposition for market access.
We program visualization tools to integrate and leverage research and clinical data and transform it into actionable insights, to advance molecular medicine faster for a better health and safety of people.
We want to be the preferred provider for reporting of clinical trials, delivering data according to CDISC standards and statistical outputs according to ICH E3. The services require that the processes are described in SOPs and that the systems follow the regulations with regards to system validation.
With an ambition to further develop the role of statisticians and statistical programmers, ME-TA is a resource to your biometric department.
ME-TA will help your statisticians and programmers increase their effectiveness by encouraging innovative initiatives. We make the complicated simpler and transparent and within the
traditional roles of programmer and statistician we have the ambition and the knowhow to change a good idea into an implemented innovative solution.
ME-TA was founded by Martin Eeg and Toni Awwad, both with a history of expert roles within biometrics in pharmaceutical companies, to provide services within statistical consultancy, statistical reporting and general sas programming.
Combined the partners at ME-TA have worked for 5 of the Top 10 Pharma companies and 9 of the Danish Pharma companies.
ME-TA started at COBIS, sharing offices with more than 50 companies within pharmaceutics and biotechnology.
Partner - Statistician
MSc Statistics
Partner - Programmer
MSc Economics
ME-TA was founded by Martin Eeg and Toni Awwad, both with a history of expert roles within biometrics in pharmaceutical companies, to provide services within statistical consultancy, statistical reporting and general sas programming.


I did an analysis of historical
flood maps versus actual flood maps for a series of post on social media for the company I
was working for, Tenko. This analysis highlighted the fact the historical flood maps are
becoming outdated.
I was part of a team that implemented a script to download
data and generate aggregated flood maps based on coordinates and timestamps. Historical data
from FEMA and recent flood data was compiled to created this data
visualization.
The code source is property of Tenko.


{% extends 'base.html' %} {% block content %}
Choice Coin is a governance token that powers the Fortior Voting Protocol, which leverages Artificial Intelligence and Quantum Computing to voting algorithms that are secure, equitable, and efficient.
View our main website!Choice Coin is not just a governance token; rather, it is a representation of a world that is moving toward decentralization and openess.
Fortior's voting algorithm is simple; it allows anyone who should have a say vote without difficulty.


Rusty Steele
Hi I'm a dog
Some of my favourite places
The beach
The dog park
The fire hydrant
Make sure to follow me on
Instagram


Pull requests welcome
.


JavaScript JSON formatter
This is pure JS JSON formatter. We don't call any API or store data on server
Try it


Seems like they're trying to tell us something, hmmm...
We need to dig deeper
--
/* where there is a sh
ell, there is a way */


Academic Competition Foundation (ACF) Question Writing Guidelines
version = 1.7
date = 12 January 1995
author = Marc Swisdak
Acknowledgements
These guidelines are originally based on the Question Writing
Guidelines prepared by the Stanford College Bowl Club and edited by Pat
Matthews of the University of Pennsylvania, and the 10 Commandments of
Question Writing composed by Carol Guthrie for the 1993 Masters tournament.
Revisions have been made using Jim Dendy's question guidelines for the
1994 ACF Nationals. I would like to thank everyone who has made
suggestions/corrections.
Introduction
By far, the most critical component of any tournament is the
quality of the questions. Question quality, while ultimately the
responsibility of the tournament director, strongly depends on the packets
which are submitted. As veteran tournament directors know, it is difficult
to have to rewrite a bad packet (especially one submitted at the last
minute) while still taking care of the other details of running a
tournament. This guide is designed to raise the quality of questions
which are written and submitted to invitational (and specifically, ACF)
tournaments.
Packets
General Notes
Usually, teams write a new packet of questions for each
tournament. While this may prove to be time-consuming during the school
year, under no circumstances is it acceptable to use questions previously
submitted to another tournament. Furthermore, most tournament directors
are not omniscient, so the submitting team has the responsibility of making
sure every part of their packet is factually correct. If there is any doubt
about a particular question, it is best to leave it out of the packet
entirely.
The tournament director (TD) always has complete control over
the content of the submitted packets. If the TD explicitly requests a
specific distribution, then the submitting teams should follow that
distribution, despite any philosophical differences they may have with
it. Finally, teams should make every effort to submit packets to
tournaments by the required due date. Submitting late packets only result
in a harder, and possibly sloppier, editing job by the tournament director.
Packet Length
Since ACF games consist of 20 (and occasionally tie-breaking)
toss-ups, any submitted packet should contain at least 25 GOOD toss-ups.
The extra toss-ups are crucial for three reasons. First, tie-breaking
toss-ups are occasionally needed; second, in case of similarities between
separately submitted questions between rounds, the extra toss-ups provide
a safety margin for the TD; and third, the TD may not agree with your high
opinion of some of the first 20 toss-ups and choose to reorder the packet.
For similar reasons, a packet should also contain 25 GOOD bonuses.
Question Quality
The purpose of writing ACF questions is not to show off the
question-writer's mastery of esoteric knowledge. Instead, a balance must
be struck between writing questions that realistically test the
knowledge of the competitors and questions written to "stump the chump."
The ability to distinguish between what is reasonable and what isn't is
best acquired by writing packets and having others play on and critique
them. Attending invitational tournaments also can help one get a feel
for what is and is not an acceptable question. It is usually difficult
for someone who has just been introduced to the sport to write a good
question packet.
Distribution
The distribution of a packet is ultimately in the hands of the
TD. If he or she requests a specific distribution, the attending teams
are obligated to follow those guidelines. With that in mind, the following
question balance is that used at the 1994 ACF Nationals with Jim Dendy as
TD. It is offered as one suggestion of a balanced 30-question distribution
Packets should be balanced with questions coming from a number of
different subject areas as shown below. Moreover, questions should also be
balanced within disciplines, i.e. Social Science/Geography questions
should not all be about geography. While this distribution is not set in
stone, changes should be kept to a minimum, unless the TD suggests otherwise.
Literature
English/American 4
World/Ancient 1
Miscellaneous 1
Science
Physics/Astronomy/Engineering 2
Biology/Earth Sciences 2
Chemistry/Biochemistry 1
Miscellaneous 1
History
American 3
European 2
Miscellaneous 1
Fine Arts/Music/Film
Classical Music/Dance 1
Painting/Sculpture/Architecture 1
Miscellaneous 1
Social Science/Geography 3
Religion/Mythology/Philosophy 3
Current Events/Sports/Entertainment 1
Miscellaneous
(Usually from lit/science/history) 2
Literature
Literature questions should cover a broad range of geographical
areas and chronological periods. Authors, literary movements, characters,
plot summaries, and titles are all valid subjects for questions. Note
that literature is not confined to novels. Drama, poetry, and short stories
are all included here . A number of good references for this category are
available at any bookstore.
Science
This subject covers everything from botany, zoology and other
biological sciences to chemistry, physics, and other physical sciences.
Care should be taken to achieve a balance between the different branches
of science, as is done in the above breakdown. Questions should generally
focus on the science itself instead of the scientists who made the
discoveries - i.e, asking about the photoelectric effect instead of
Einstein. Questions of the latter type are more concerned with the
history of science which only marginally falls under this heading.
Sources for these types of questions include textbooks and various
scientific journals aimed at the general public.
History
As with literature, these questions should cover a large range of
geographical areas and chronological periods. European and American
history are the most common areas of focus, however.
Fine Arts/Music/Film
The fine arts include painting, sculpture, engraving, ballet,
architecture, film and other similar categories. Music questions do not
have to be constrained to classical music, although the emphasis is generally
on this area. Other types of music from Gregorian chants to jazz are
also viable questions sources.
Social Sciences/Geography
These questions focus on areas such as anthropology, economics,
sociology, and psychology which are traditionally separated from the
natural sciences. As with the science category, question should be evenly
distributed within various subfields. Geography questions are also included
here.
Religion/Mythology/Philosophy
A variety of topics are included in this category. Mythology
questions can range over any mythology (Babylonian, Celtic, American Indian)
but the mainstay of questions have been about Greek, Roman, and Norse myths.
Current Events/Sports/Entertainment
Current events questions focus on recent news stories and events.
Daily newspapers and weekly news magazines are good sources for these
questions. In keeping with the academic nature of ACF, questions of this
sort should focus on items of long-term importance. A general rule of
thumb is that if the question would be unanswerable 1 year after it was
written, it should probably not be included.
Sports and entertainment questions focus on popular culture
including music, fashion, television, and movies. In keeping with the
academic nature of ACF, questions from this area are generally few in
number.
Toss-ups
Structure
Toss-ups should be ordered like 30-20-10 bonuses (see below) --
the most difficult clues are given at the beginning of the toss-up while
the easier "give-away" clues are given nearer the end. This rewards teams
with deeper knowledge, while still allowing teams that are not as familiar
with the topic to have a chance at answering the question.
The first pronoun in a toss-up should always refer to the answer.
Also, that pronoun should occur as close as possible to the beginning of
the question. This eliminates any ambiguity for the players and generally
improves the flow of the question. Note that toss-ups should almost always
ask for one piece of information. If two pieces of information are needed,
the question must begin with "2 answers are required," or an equivalent
phrase.
To avoid monotony, toss-ups should not all follow the exact same
blueprint. For instance, a packet which has ten toss-ups starting "Born
in [...] he went to school at [...] and later ..." is unacceptable.
While some toss-ups of this type are perfectly acceptable, too many can make a
packet very dull.
All toss-ups should include the magic words "for ten points"
(sometimes abbreviated FTP). These words should appear IMMEDIATELY before
the last clue is given. The reason for this convention is that allows
the player to know when the question is completed, and thus when it it safe to
buzz without risking a penalty.
Ex. ... for ten points, identify this author of _Great Expectations_.
... FTP, name this largest U.S. state.
The answer to a toss-up should be clearly visible beneath the
question. The pertinent part of the answer should be marked (usually
underlined). Full names should be required only when there is the
possibility of confusion. All alternate answers should be anticipated
and noted.
Ex. Possible Answers _William Harrison_
_Benjamin Harrison_
Thomas _Jefferson_
_FDIC_ or (_Federal Deposit Insurance Corporation_)
Difficulty
Deciding the difficulty of a toss-up can be challenging since
different people possess different bodies of knowledge. However, a
general rule is that in a game between two medium-level teams, 80-90% of the
toss-ups should be answerable BY THE END OF THE QUESTION. Notice that this
does not mean that everyone should be able to answer every question.
However at least one member of a well-balanced team should usually have the
answer when the question finishes.
Misleading Toss-ups
The following types of toss-ups should be avoided at all costs.
a. Toss-ups which are written in such a way that they encourage teams to
jump in early with the wrong answer.
Ex: 1, 1, 2, 3, 5, 8 are the first few terms of the Fibonacci series.
FTP, spell Fibonacci.
b. Toss-ups which use pronouns incorrectly. The first pronoun used in a
question should always refer to the answer.
Ex: _His_ theorem stating that one cannot find a, b, c integers so that
a^n + b^n = c^n for n>2 enabled _Fermat_ to go down in history...
The question could be rewritten to start "Fermat's Theorem which
states that ...)
c. Questions with irrelevant information.
Ex: Paris is the capital of France, but FTP who killed Paris in the Trojan
War.
Length
While the ACF format does allow questions to be longer than other
formats (due to the untimed nature of the game) this should not be taken as
a license to write unnecessarily long questions. A balance should be struck
between giving various clues (arranged from hardest to easiest) which reward
deeper knowledge and giving extraneous information that merely adds to the
word count. Good toss-ups are generally more than one sentence long since
they contain a variety of clues leading to the correct answer. As a general
guide, questions should be kept between 2-5 sentences in length.
Spelling Toss-ups
Because spelling toss-ups are so easy to abuse, they should be
avoided when writing packets. If a spelling question must be part of a
round, make it a bonus.
Sample Questions
a. One of only 2 Americans wounded at the Battle of Trenton, he served
in a Virginia regiment during the Revolutionary War. He was a US Senator
in 1790, minister to France 1794-96 and governor of Virginia 1799-1802.
After helping negotiate the Louisiana Purchase, he served as both
Secretary of State and War. FTP, name this President who William Plumer
prevented from being unanimously elected.
James _MONROE_
The question starts with a difficult clue (the Battle of Trenton) and
then gets easier (governor of Virginia ... Louisiana Purchase ...
Secretary of State and War). Finally, it ends with a clue that should b
recognizable to most teams (President almost unanimously elected).
b. Born in 1885, she and her husband owned a coffee plantation which she ran
after his death. The collapse of the coffee industry lead her to sell the
property after which she began writing. Her first work was _Seven Gothic
Tales_ followed by others such as _The Angelic Avengers_, _Winter's
Tales_, and _Shadows on the Grass_. FTP, name this author of _Out of
Africa_.
Isak _DINESEN_ (or Baroness Karen _BLIXEN_)
Again, the question starts with a difficult clue and proceeds through
more and more well-known works until it reaches the final clue of _Out of
Africa_. Also, the writer was sure to include possible alternate answers
to the question (Dinesen's real name). Noting alternate answers is a
necessity for question writers.
Bonuses
Structure
While all toss-ups follow the same general structure, bonuses allow
for some creativity on the part of the question writer. That creativity does
have some limits however, since all bonuses should be worth 30 points. By
making all bonuses the same value, teams can be certain of the number of
points available in a game. Of course, this means that since all bonuses
are worth the same amount, the question writer must take care to write
all of the bonuses for a round on an equal level.
Bonuses are subdivided into smaller parts, usually worth 5, 10,
or 15 points each. One part bonuses should not be used. In fact , one
part bonuses already exist in any packet - they are called toss-ups.
Bonuses are intended to award the team who gets them, so they should
usually have at least one part which is answerable by most teams (even
if only worth 5 points).
Even though all bonuses are worth 30 points, there are a number
of different ways of reaching this total. These include 6 parts worth 5 pts,
3 parts worth 10, 30-20-10 (see below), two parts each 15-10-5, three
parts each 10-5, three increasingly difficult parts worth 5, 10, and 15,
and many others. However, just as with toss-up, it is extremely boring
if a packet contains 10 bonuses of the same type. So, care must be taken
to vary the presentation as well as the subject material.
Cautions
One type of popular bonus is the 30-20-10. This question offers
30 points if a team can get the answer off the first, fairly difficult clue,
20 off the second, and 10 off the third. Variants of this type include
the 30-20-10-5 and other permutations. These types of questions should
be used sparingly however since a 30-20-10 bonus is essentially a
toss-up in disguise.
Writers should avoid bonuses which reward random guessing by teams.
These include so-called binary bonuses where the range of possible
answers is small, i.e., True/False and Yes/No bonuses. Ordering
bonuses that require a list of things to be put in a sequence are
obviously more difficult, but should be used sparingly since misplacing
one item can cause a team to earn 0 points, despite knowing a good
deal about the subject.
Finally, packets should never contain all-or-nothing bonuses (of
which one-part bonuses are a subgroup). Bonuses where "a miss stops you"
should also be avoided since they can penalize teams even if they know
the subject well.
Difficulty
The difficulty of bonuses, like toss-ups, can be hard to judge.
However, since teams are allowed to confer on bonuses and since they are
potentially worth more points, they should be more difficult than
toss-ups. Two medium-level teams should expect to convert somewhere
around 50% of available bonus points. Combining this guideline and the
one given above for toss-up difficulty, two evenly-matched average teams
should expect to have a combined score between 400 and 500 points.
Sample Question
a. (30) The promiscuity of Edward III of England caused major problems
for the lines of royal succession. His tangled bloodlines were not
straightened out until 100 years after his death. Identify these
descendants of Edward III for the stated number of points.
1. For 5 points, this eldest son of Edward defeated the French at
Poitiers and was the father of Richard II.
_EDWARD_ the _BLACK PRINCE_
2.  As the earl of Richmond, his
claim to the throne was tenuous at best.
_HENRY VII_
3. For 15 points, he was both the grandson and great-great-grandson of
Edward III. He began the War of the Roses at the Battle of St. Albans and
would have become king on the defeat of Henry VI, except for the fact
that he had died 3 months before the war's end.
_RICHARD_, Duke of _YORK


Mother of Two Fur Babies
Lucy, the Love Bug
Rigby, the Cowardly Cuddler TEST
I have lived in Washington for 28 years (which is all of them)!
Parts of WA I have called home:
- Vashon Island
- Port Orchard
- Ellensburg
- Seattle (Beacon Hill)
- Seattle (Central District)
- Seattle (Beacon Hill, again)
- West Seattle
- Seattle (Magnolia)
- Burien
- Seattle (Hillman City)
- Tacoma (my current home-a!)
I graduated from Central Washington University in 2011
And I am currently working in the industry I studied, which is film. 8 years later, my parents are still in shock.
My body hates Sugar and Dairy, two of nature's greatest offerings.
I started seeing a naturopath last year, who helped me figure out why I felt like crap all the time: I was unintentionally eating things that inflame my cells. As a result, I have an alternative recipe for EVERYTHING (seriously, try me) that doesn't include suagr or dairy. I am a wealth of healthy knowledge!
I am a proud feminist!
 Sorry to tell you."
Haley's Top Five Favortie Movies
In the Order in which the occured to her:
- The Big Lebowski
- When Harry Met Sally
- Fight Club
- High Fidelity
- Dedication


Toggle navigation
Home
Profile
Messages
Dropdown
Home
Profile
Messages
MALE
FEMALE
BCA
MCA
BTech
MTech
BSc
0-6
6-12
1
2
3
marketing
marketing
sales
programing


 Anyway, this is less a trip report but more an attempt to characterize GHB.
I have explored GHB at various dosages, in various situations for over a year, and I like it! I don't take it daily, never used it to rape someone and never been admitted to an emergency ward because of it.  I just don't understand.
I don't really understand it being called liquid X. It is what it is: A relatively safe euphoriant with few side effects. MDMA is an incredible, powerful drug, worthy of respect, which is very damaging when used irresponsibly, which is V.easy to do!
People seem quite disappointed with GHB, expecting MDMA, not me!
All doses are of the mono-sodium salt, mostly dissolved in water, and drunk like a shot followed by non salty tasting water. It's not the most pleasant of drinks.
SUBJECTIVE EFFECTS:
SMALL DOSE (1g-2.5g):
A barely perceptible removal of any edginess I might have had, followed by a return of edginess, and perhaps a difficulty sleeping if I took it within 3 hours of going to bed.
MEDIUM DOSE (3g-5g)
A pleasant euphoric state lasting about an hour and a half, accompanied by some optimistic excitement. Reasonably easy to get to sleep if I lie down before I peak, hard if I let myself come down. Next day I can notice I took it the night before, but only just.
HIGH DOSE (5g-10g)
Intense experience! Eyes closed imagery, bright colors, difficulty seeing, nausea, diarrhea (not unpleasant), writhing and muscle stretching. lmost guaranteed to pass out, if taken during the day, to wake up 4 hours later, if taken before bed time, the next morning. At this level it does produce a hangover, but it is more on a par with marijuana than whiskey: Slightly cloudy thinking, and a strange 'pressure' type feeling the next day.
EXCESSIVE DOSE (15g-20g)
See above followed by passing out and a nasty version of the hangover described above, not recommended, only done once to see what happens! There is nothing to gain in going over 10g, except pain and probably some kind of damage. (It's obvious but: moderation IS the key to all drugs, it's sad seeing people racing thru' their youth being 'cool'.)
DAILY USE (~4g a day)
Tolerance develops quickly, I have never noticed any addiction however, except perhaps to alleviate the hangover sensations. I like my thinking to be clear during the day so this behavior is not for me, so I don't have much experience.
SHULGIN LIKE REPORT ATTEMPT (gone to shit)
This was written whilst on 5.3g, it ends when I go to bed
5.3g GHB (mono-sodium salt)
T: 0:00
T: +6mins first alert.
T: +10mins still at alert
T: +12mins dizzy, smile, slight head 'warmth' or 'pressure'
T: +13mins building
T: +15mins vision 'slow', slow focus, auditory distortion! wow!
T: +20mins quite simply fucked, that's about it.
T: +21mins having to read and type out of one eye.

Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


LLVM Atomic Instructions and Concurrency Guide¶
Introduction¶
LLVM supports instructions which are well-defined in the presence of threads and asynchronous signals.
The atomic instructions are designed specifically to provide readable IR and optimized code generation for the following:
- The C++11
<atomic>
header. (C++11 draft available here.) (C11 draft available here.) - Proper semantics for Java-style memory, for both
volatile
and regular shared variables. (Java Specification) - gcc-compatible
__sync_*
builtins. (Description) - Other scenarios with atomic semantics, including
static
variables with non-trivial constructors in C++.
Atomic and volatile in the IR are orthogonal; “volatile” is the C/C++ volatile, which ensures that every volatile load and store happens and is performed in the stated order. A couple examples: if a SequentiallyConsistent store is immediately followed by another SequentiallyConsistent store to the same address, the first store can be erased. This transformation is not allowed for a pair of volatile stores. On the other hand, a non-volatile non-atomic load can be moved across a volatile load freely, but not an Acquire load.
This document is intended to provide a guide to anyone either writing a frontend for LLVM or working on optimization passes for LLVM with a guide for how to deal with instructions with special semantics in the presence of concurrency. This is not intended to be a precise guide to the semantics; the details can get extremely complicated and unreadable, and are not usually necessary.
Optimization outside atomic¶
The basic 'load'
and 'store'
allow a variety of optimizations, but can
lead to undefined results in a concurrent environment; see NotAtomic. This
section specifically goes into the one optimizer restriction which applies in
concurrent environments, which gets a bit more of an extended description
because any optimization dealing with stores needs to be aware of it.
From the optimizer’s point of view, the rule is that if there are not any instructions with atomic ordering involved, concurrency does not matter, with one exception: if a variable might be visible to another thread or signal handler, a store cannot be inserted along a path where it might not execute otherwise. Take the following example:
/* C code, for readability; run through clang -O2 -S -emit-llvm to get
equivalent IR */
int x;
void f(int* a) {
for (int i = 0; i < 100; i++) {
if (a[i])
x += 1;
}
}
The following is equivalent in non-concurrent situations:
int x;
void f(int* a) {
int xtemp = x;
for (int i = 0; i < 100; i++) {
if (a[i])
xtemp += 1;
}
x = xtemp;
}
However, LLVM is not allowed to transform the former to the latter: it could
indirectly introduce undefined behavior if another thread can access x
at
the same time. (This example is particularly of interest because before the
concurrency model was implemented, LLVM would perform this transformation.)
Note that speculative loads are allowed; a load which is part of a race returns
undef
, but does not have undefined behavior.
Atomic instructions¶
For cases where simple loads and stores are not sufficient, LLVM provides various atomic instructions. The exact guarantees provided depend on the ordering; see Atomic orderings.
load atomic
and store atomic
provide the same basic functionality as
non-atomic loads and stores, but provide additional guarantees in situations
where threads and signals are involved.
cmpxchg
and atomicrmw
are essentially like an atomic load followed by an
atomic store (where the store is conditional for cmpxchg
), but no other
memory operation can happen on any thread between the load and store.
A fence
provides Acquire and/or Release ordering which is not part of
another operation; it is normally used along with Monotonic memory operations.
A Monotonic load followed by an Acquire fence is roughly equivalent to an
Acquire load, and a Monotonic store following a Release fence is roughly
equivalent to a Release store. SequentiallyConsistent fences behave as both
an Acquire and a Release fence, and offer some additional complicated
guarantees, see the C++11 standard for details.
Frontends generating atomic instructions generally need to be aware of the target to some degree; atomic instructions are guaranteed to be lock-free, and therefore an instruction which is wider than the target natively supports can be impossible to generate.
Atomic orderings¶
In order to achieve a balance between performance and necessary guarantees, there are six levels of atomicity. They are listed in order of strength; each level includes all the guarantees of the previous level except for Acquire/Release. (See also LangRef Ordering.)
NotAtomic¶
NotAtomic is the obvious, a load or store which is not atomic. (This isn’t really a level of atomicity, but is listed here for comparison.) This is essentially a regular load or store. If there is a race on a given memory location, loads from that location return undef.
- Relevant standard
- This is intended to match shared variables in C/C++, and to be used in any other context where memory access is necessary, and a race is impossible. (The precise definition is in LangRef Memory Model.)
- Notes for frontends
- The rule is essentially that all memory accessed with basic loads and stores by multiple threads should be protected by a lock or other synchronization; otherwise, you are likely to run into undefined behavior. If your frontend is for a “safe” language like Java, use Unordered to load and store any shared variable. Note that NotAtomic volatile loads and stores are not properly atomic; do not try to use them as a substitute. (Per the C/C++ standards, volatile does provide some limited guarantees around asynchronous signals, but atomics are generally a better solution.)
- Notes for optimizers
- Introducing loads to shared variables along a codepath where they would not otherwise exist is allowed; introducing stores to shared variables is not. See Optimization outside atomic.
- Notes for code generation
- The one interesting restriction here is that it is not allowed to write to bytes outside of the bytes relevant to a store. This is mostly relevant to unaligned stores: it is not allowed in general to convert an unaligned store into two aligned stores of the same width as the unaligned store. Backends are also expected to generate an i8 store as an i8 store, and not an instruction which writes to surrounding bytes. (If you are writing a backend for an architecture which cannot satisfy these restrictions and cares about concurrency, please send an email to llvm-dev.)
Unordered¶
Unordered is the lowest level of atomicity. It essentially guarantees that races produce somewhat sane results instead of having undefined behavior. It also guarantees the operation to be lock-free, so it does not depend on the data being part of a special atomic structure or depend on a separate per-process global lock. Note that code generation will fail for unsupported atomic operations; if you need such an operation, use explicit locking.
- Relevant standard
- This is intended to match the Java memory model for shared variables.
- Notes for frontends
- This cannot be used for synchronization, but is useful for Java and other “safe” languages which need to guarantee that the generated code never exhibits undefined behavior. Note that this guarantee is cheap on common platforms for loads of a native width, but can be expensive or unavailable for wider loads, like a 64-bit store on ARM. (A frontend for Java or other “safe” languages would normally split a 64-bit store on ARM into two 32-bit unordered stores.)
- Notes for optimizers
- In terms of the optimizer, this prohibits any transformation that transforms a single load into multiple loads, transforms a store into multiple stores, narrows a store, or stores a value which would not be stored otherwise. Some examples of unsafe optimizations are narrowing an assignment into a bitfield, rematerializing a load, and turning loads and stores into a memcpy call. Reordering unordered operations is safe, though, and optimizers should take advantage of that because unordered operations are common in languages that need them.
- Notes for code generation
- These operations are required to be atomic in the sense that if you use
unordered loads and unordered stores, a load cannot see a value which was
never stored. A normal load or store instruction is usually sufficient, but
note that an unordered load or store cannot be split into multiple
instructions (or an instruction which does multiple memory operations, like
LDRD
on ARM without LPAE, or not naturally-alignedLDRD
on LPAE ARM).
Monotonic¶
Monotonic is the weakest level of atomicity that can be used in synchronization primitives, although it does not provide any general synchronization. It essentially guarantees that if you take all the operations affecting a specific address, a consistent ordering exists.
- Relevant standard
- This corresponds to the C++11/C11
memory_order_relaxed
; see those standards for the exact definition. - Notes for frontends
- If you are writing a frontend which uses this directly, use with caution. The
guarantees in terms of synchronization are very weak, so make sure these are
only used in a pattern which you know is correct. Generally, these would
either be used for atomic operations which do not protect other memory (like
an atomic counter), or along with a
fence
. - Notes for optimizers
- In terms of the optimizer, this can be treated as a read+write on the relevant memory location (and alias analysis will take advantage of that). In addition, it is legal to reorder non-atomic and Unordered loads around Monotonic loads. CSE/DSE and a few other optimizations are allowed, but Monotonic operations are unlikely to be used in ways which would make those optimizations useful.
- Notes for code generation
- Code generation is essentially the same as that for unordered for loads and
stores. No fences are required.
cmpxchg
andatomicrmw
are required to appear as a single operation.
Acquire¶
Acquire provides a barrier of the sort necessary to acquire a lock to access other memory with normal loads and stores.
- Relevant standard
- This corresponds to the C++11/C11
memory_order_acquire
. It should also be used for C++11/C11memory_order_consume
. - Notes for frontends
- If you are writing a frontend which uses this directly, use with caution. Acquire only provides a semantic guarantee when paired with a Release operation.
- Notes for optimizers
- Optimizers not aware of atomics can treat this like a nothrow call. It is also possible to move stores from before an Acquire load or read-modify-write operation to after it, and move non-Acquire loads from before an Acquire operation to after it.
- Notes for code generation
- Architectures with weak memory ordering (essentially everything relevant today
except x86 and SPARC) require some sort of fence to maintain the Acquire
semantics. The precise fences required varies widely by architecture, but for
a simple implementation, most architectures provide a barrier which is strong
enough for everything (
dmb
on ARM,sync
on PowerPC, etc.). Putting such a fence after the equivalent Monotonic operation is sufficient to maintain Acquire semantics for a memory operation.
Release¶
Release is similar to Acquire, but with a barrier of the sort necessary to release a lock.
- Relevant standard
- This corresponds to the C++11/C11
memory_order_release
. - Notes for frontends
- If you are writing a frontend which uses this directly, use with caution. Release only provides a semantic guarantee when paired with a Acquire operation.
- Notes for optimizers
- Optimizers not aware of atomics can treat this like a nothrow call. It is also possible to move loads from after a Release store or read-modify-write operation to before it, and move non-Release stores from after an Release operation to before it.
- Notes for code generation
- See the section on Acquire; a fence before the relevant operation is usually sufficient for Release. Note that a store-store fence is not sufficient to implement Release semantics; store-store fences are generally not exposed to IR because they are extremely difficult to use correctly.
AcquireRelease¶
AcquireRelease (acq_rel
in IR) provides both an Acquire and a Release
barrier (for fences and operations which both read and write memory).
- Relevant standard
- This corresponds to the C++11/C11
memory_order_acq_rel
. - Notes for frontends
- If you are writing a frontend which uses this directly, use with caution. Acquire only provides a semantic guarantee when paired with a Release operation, and vice versa.
- Notes for optimizers
- In general, optimizers should treat this like a nothrow call; the possible optimizations are usually not interesting.
- Notes for code generation
- This operation has Acquire and Release semantics; see the sections on Acquire and Release.
SequentiallyConsistent¶
SequentiallyConsistent (seq_cst
in IR) provides Acquire semantics for loads
and Release semantics for stores. Additionally, it guarantees that a total
ordering exists between all SequentiallyConsistent operations.
- Relevant standard
- This corresponds to the C++11/C11
memory_order_seq_cst
, Java volatile, and the gcc-compatible__sync_*
builtins which do not specify otherwise. - Notes for frontends
- If a frontend is exposing atomic operations, these are much easier to reason about for the programmer than other kinds of operations, and using them is generally a practical performance tradeoff.
- Notes for optimizers
- Optimizers not aware of atomics can treat this like a nothrow call. For SequentiallyConsistent loads and stores, the same reorderings are allowed as for Acquire loads and Release stores, except that SequentiallyConsistent operations may not be reordered.
- Notes for code generation
- SequentiallyConsistent loads minimally require the same barriers as Acquire operations and SequentiallyConsistent stores require Release barriers. Additionally, the code generator must enforce ordering between SequentiallyConsistent stores followed by SequentiallyConsistent loads. This is usually done by emitting either a full fence before the loads or a full fence after the stores; which is preferred varies by architecture.
Atomics and IR optimization¶
Predicates for optimizer writers to query:
isSimple()
: A load or store which is not volatile or atomic. This is what, for example, memcpyopt would check for operations it might transform.isUnordered()
: A load or store which is not volatile and at most Unordered. This would be checked, for example, by LICM before hoisting an operation.mayReadFromMemory()
/mayWriteToMemory()
: Existing predicate, but note that they return true for any operation which is volatile or at least Monotonic.isStrongerThan
/isAtLeastOrStrongerThan
: These are predicates on orderings. They can be useful for passes that are aware of atomics, for example to do DSE across a single atomic access, but not across a release-acquire pair (see MemoryDependencyAnalysis for an example of this)- Alias analysis: Note that AA will return ModRef for anything Acquire or Release, and for the address accessed by any Monotonic operation.
To support optimizing around atomic operations, make sure you are using the right predicates; everything should work if that is done. If your pass should optimize some atomic operations (Unordered operations in particular), make sure it doesn’t replace an atomic load or store with a non-atomic operation.
Some examples of how optimizations interact with various kinds of atomic operations:
memcpyopt
: An atomic operation cannot be optimized into part of a memcpy/memset, including unordered loads/stores. It can pull operations across some atomic operations.- LICM: Unordered loads/stores can be moved out of a loop. It just treats monotonic operations like a read+write to a memory location, and anything stricter than that like a nothrow call.
- DSE: Unordered stores can be DSE’ed like normal stores. Monotonic stores can be DSE’ed in some cases, but it’s tricky to reason about, and not especially important. It is possible in some case for DSE to operate across a stronger atomic operation, but it is fairly tricky. DSE delegates this reasoning to MemoryDependencyAnalysis (which is also used by other passes like GVN).
- Folding a load: Any atomic load from a constant global can be constant-folded, because it cannot be observed. Similar reasoning allows sroa with atomic loads and stores.
Atomics and Codegen¶
Atomic operations are represented in the SelectionDAG with ATOMIC_*
opcodes.
On architectures which use barrier instructions for all atomic ordering (like
ARM), appropriate fences can be emitted by the AtomicExpand Codegen pass if
setInsertFencesForAtomic()
was used.
The MachineMemOperand for all atomic operations is currently marked as volatile; this is not correct in the IR sense of volatile, but CodeGen handles anything marked volatile very conservatively. This should get fixed at some point.
One very important property of the atomic operations is that if your backend supports any inline lock-free atomic operations of a given size, you should support ALL operations of that size in a lock-free manner.
When the target implements atomic cmpxchg
or LL/SC instructions (as most do)
this is trivial: all the other operations can be implemented on top of those
primitives. However, on many older CPUs (e.g. ARMv5, SparcV8, Intel 80386) there
are atomic load and store instructions, but no cmpxchg
or LL/SC. As it is
invalid to implement atomic load
using the native instruction, but
cmpxchg
using a library call to a function that uses a mutex, atomic
load
must also expand to a library call on such architectures, so that it
can remain atomic with regards to a simultaneous cmpxchg
, by using the same
mutex.
AtomicExpandPass can help with that: it will expand all atomic operations to the
proper __atomic_*
libcalls for any size above the maximum set by
setMaxAtomicSizeInBitsSupported
(which defaults to 0).
On x86, all atomic loads generate a MOV
. SequentiallyConsistent stores
generate an XCHG
, other stores generate a MOV
. SequentiallyConsistent
fences generate an MFENCE
, other fences do not cause any code to be
generated. cmpxchg
uses the LOCK CMPXCHG
instruction. atomicrmw xchg
uses XCHG
, atomicrmw add
and atomicrmw sub
use XADD
, and all
other atomicrmw
operations generate a loop with LOCK CMPXCHG
. Depending
on the users of the result, some atomicrmw
operations can be translated into
operations like LOCK AND
, but that does not work in general.
On ARM (before v8), MIPS, and many other RISC architectures, Acquire, Release,
and SequentiallyConsistent semantics require barrier instructions for every such
operation. Loads and stores generate normal instructions. cmpxchg
and
atomicrmw
can be represented using a loop with LL/SC-style instructions
which take some sort of exclusive lock on a cache line (LDREX
and STREX
on ARM, etc.).
It is often easiest for backends to use AtomicExpandPass to lower some of the atomic constructs. Here are some lowerings it can do:
- cmpxchg -> loop with load-linked/store-conditional
by overriding
shouldExpandAtomicCmpXchgInIR()
,emitLoadLinked()
,emitStoreConditional()
- large loads/stores -> ll-sc/cmpxchg
by overriding
shouldExpandAtomicStoreInIR()
/shouldExpandAtomicLoadInIR()
- strong atomic accesses -> monotonic accesses + fences by overriding
shouldInsertFencesForAtomic()
,emitLeadingFence()
, andemitTrailingFence()
- atomic rmw -> loop with cmpxchg or load-linked/store-conditional
by overriding
expandAtomicRMWInIR()
- expansion to __atomic_* libcalls for unsupported sizes.
For an example of all of these, look at the ARM backend.
Libcalls: __atomic_*¶
There are two kinds of atomic library calls that are generated by LLVM. Please
note that both sets of library functions somewhat confusingly share the names of
builtin functions defined by clang. Despite this, the library functions are
not directly related to the builtins: it is not the case that __atomic_*
builtins lower to __atomic_*
library calls and __sync_*
builtins lower
to __sync_*
library calls.
The first set of library functions are named __atomic_*
. This set has been
“standardized” by GCC, and is described below. (See also GCC’s documentation)
LLVM’s AtomicExpandPass will translate atomic operations on data sizes above
MaxAtomicSizeInBitsSupported
into calls to these functions.
There are four generic functions, which can be called with data of any size or alignment:
void __atomic_load(size_t size, void *ptr, void *ret, int ordering)
void __atomic_store(size_t size, void *ptr, void *val, int ordering)
void __atomic_exchange(size_t size, void *ptr, void *val, void *ret, int ordering)
bool __atomic_compare_exchange(size_t size, void *ptr, void *expected, void *desired, int success_order, int failure_order)
There are also size-specialized versions of the above functions, which can only be used with naturally-aligned pointers of the appropriate size. In the signatures below, “N” is one of 1, 2, 4, 8, and 16, and “iN” is the appropriate integer type of that size; if no such integer type exists, the specialization cannot be used:
iN __atomic_load_N(iN *ptr, iN val, int ordering)
void __atomic_store_N(iN *ptr, iN val, int ordering)
iN __atomic_exchange_N(iN *ptr, iN val, int ordering)
bool __atomic_compare_exchange_N(iN *ptr, iN *expected, iN desired, int success_order, int failure_order)
Finally there are some read-modify-write functions, which are only available in
the size-specific variants (any other sizes use a __atomic_compare_exchange
loop):
iN __atomic_fetch_add_N(iN *ptr, iN val, int ordering)
iN __atomic_fetch_sub_N(iN *ptr, iN val, int ordering)
iN __atomic_fetch_and_N(iN *ptr, iN val, int ordering)
iN __atomic_fetch_or_N(iN *ptr, iN val, int ordering)
iN __atomic_fetch_xor_N(iN *ptr, iN val, int ordering)
iN __atomic_fetch_nand_N(iN *ptr, iN val, int ordering)
This set of library functions have some interesting implementation requirements to take note of:
- They support all sizes and alignments – including those which cannot be implemented natively on any existing hardware. Therefore, they will certainly use mutexes in for some sizes/alignments.
- As a consequence, they cannot be shipped in a statically linked compiler-support library, as they have state which must be shared amongst all DSOs loaded in the program. They must be provided in a shared library used by all objects.
- The set of atomic sizes supported lock-free must be a superset of the sizes
any compiler can emit. That is: if a new compiler introduces support for
inline-lock-free atomics of size N, the
__atomic_*
functions must also have a lock-free implementation for size N. This is a requirement so that code produced by an old compiler (which will have called the__atomic_*
function) interoperates with code produced by the new compiler (which will use native the atomic instruction).
Note that it’s possible to write an entirely target-independent implementation of these library functions by using the compiler atomic builtins themselves to implement the operations on naturally-aligned pointers of supported sizes, and a generic mutex implementation otherwise.
Libcalls: __sync_*¶
Some targets or OS/target combinations can support lock-free atomics, but for various reasons, it is not practical to emit the instructions inline.
There’s two typical examples of this.
Some CPUs support multiple instruction sets which can be swiched back and forth on function-call boundaries. For example, MIPS supports the MIPS16 ISA, which has a smaller instruction encoding than the usual MIPS32 ISA. ARM, similarly, has the Thumb ISA. In MIPS16 and earlier versions of Thumb, the atomic instructions are not encodable. However, those instructions are available via a function call to a function with the longer encoding.
Additionally, a few OS/target pairs provide kernel-supported lock-free atomics. ARM/Linux is an example of this: the kernel provides a function which on older CPUs contains a “magically-restartable” atomic sequence (which looks atomic so long as there’s only one CPU), and contains actual atomic instructions on newer multicore models. This sort of functionality can typically be provided on any architecture, if all CPUs which are missing atomic compare-and-swap support are uniprocessor (no SMP). This is almost always the case. The only common architecture without that property is SPARC – SPARCV8 SMP systems were common, yet it doesn’t support any sort of compare-and-swap operation.
In either of these cases, the Target in LLVM can claim support for atomics of an
appropriate size, and then implement some subset of the operations via libcalls
to a __sync_*
function. Such functions must not use locks in their
implementation, because unlike the __atomic_*
routines used by
AtomicExpandPass, these may be mixed-and-matched with native instructions by the
target lowering.
Further, these routines do not need to be shared, as they are stateless. So, there is no issue with having multiple copies included in one binary. Thus, typically these routines are implemented by the statically-linked compiler runtime support library.
LLVM will emit a call to an appropriate __sync_*
routine if the target
ISelLowering code has set the corresponding ATOMIC_CMPXCHG
, ATOMIC_SWAP
,
or ATOMIC_LOAD_*
operation to “Expand”, and if it has opted-into the
availability of those library functions via a call to initSyncLibcalls()
.
The full set of functions that may be called by LLVM is (for N
being 1, 2,
4, 8, or 16):
iN __sync_val_compare_and_swap_N(iN *ptr, iN expected, iN desired)
iN __sync_lock_test_and_set_N(iN *ptr, iN val)
iN __sync_fetch_and_add_N(iN *ptr, iN val)
iN __sync_fetch_and_sub_N(iN *ptr, iN val)
iN __sync_fetch_and_and_N(iN *ptr, iN val)
iN __sync_fetch_and_or_N(iN *ptr, iN val)
iN __sync_fetch_and_xor_N(iN *ptr, iN val)
iN __sync_fetch_and_nand_N(iN *ptr, iN val)
iN __sync_fetch_and_max_N(iN *ptr, iN val)
iN __sync_fetch_and_umax_N(iN *ptr, iN val)
iN __sync_fetch_and_min_N(iN *ptr, iN val)
iN __sync_fetch_and_umin_N(iN *ptr, iN val)
This list doesn’t include any function for atomic load or store; all known architectures support atomic loads and stores directly (possibly by emitting a fence on either side of a normal load or store.)
There’s also, somewhat separately, the possibility to lower ATOMIC_FENCE
to
__sync_synchronize()
. This may happen or not happen independent of all the
above, controlled purely by setOperationAction(ISD::ATOMIC_FENCE, ...)
.


{% extends "base.html" %} {% block main %}
This playlist is constructed based on the artists and genres that you had listened the most in the last month.
It is also fully-customizable using the audio features that you can select with the bars given below. The genre selection part shows your top 3 most listened genres of this month. Pick a genre and start playing with the features of your playlist!
{{item.decode('utf-8')}}
{% endfor %}You can give your playlist a name and save it to your Spotify library.
You can choose one of your most listened genres and use the bars below to arrange the features of your playlist.
Creating your playlist...
This can take upto one minute, please be patient.


Typedefs | |||
| typedef char | INT8 | ||
| Signed eight bit. | |||
| typedef unsigned char | UINT8 | ||
| Unsigned eight bit. | |||
| typedef int | INT16 | ||
| Signed sixteen bit. | |||
| typedef unsigned int | UINT16 | ||
| Unsigned sixteen bit. | |||
| typedef long | INT32 | ||
| Signed 32 bit. | |||
| typedef unsigned long | UINT32 | ||
| Unsigned 32 bit. | |||
| typedef int | size_t | ||
| typedef UINT16 | clock_t | ||
| Returned from clock. More... |
| typedef UINT16 clock_t |


Nigeria begins e-passport issuance in Tokyo, Seoul
by Agency ReportThe Nigeria Immigration Service has inaugurated two more passport and biometric visa facilities in Tokyo, Japan; and Seoul, South Korea.
The Service Public Relations Officer, Mr. Sunday James, disclosed this in a statement made available to News Agency of Nigeria on Friday in Abuja.
James said the operation desks were inaugurated by the Minister of interior, Mr. Rauf Aregbesola, on November 21, 2019.
He said this was done in a bid to further expand the service operations and service delivery abroad.
According to him, the Comptroller General, NIS, Mr. Muhammad Babandede, wishes to inform the general public that these facilities are expected to start attending to passport and visa applications with immediate effect.
(NAN)


| Date | Start of Day | Start of lunch | End of lunch | End of Day | Hours worked | Notes | Edit |
|---|---|---|---|---|---|---|---|
| {{ timecard.date }} | {{ timecard.start }} | {{ timecard.lunch_start }} | {{ timecard.lunch_end }} | {{ timecard.end }} | {{ hoursWorked[i] }} |
|
View |


CompareX
About Us
We are a comparison website. Our website is guaranteed to give you the best price comparison, detailed descriptions and accurate reviews on top purchased items on Amazon and Ebay.
Weekly we feature the top 10 most searched items on Amazon and Ebay.
How It Works
Login or sign up to save your product searches.
Browse through departments or use the search bar to find the item you are looking for.
CompareX will then show you the prices of each item from Amazon and Ebay with ratings and links to the product of your choice product included.
FAQ
You don't need an account to look through items. However, to save searches you will need an account.
No purchases are made on this website. Links to specfic retailers on the product page.
No worries! We update products daily. Check back the next day or write to us and leave a product suggestion.


Vince Lombardi
Barchelor of science degree Computer Science major
São Paulo - Brazil
2012 - 2016
Washington, PA - USA
2014 - 2015
Certified Electronic Technician
São Paulo - Brazil
2010-2011
Managed and owned the IT bussiness solutions (web based) for the business areas. Technically defined technology solutions. Acted as a tech liaison between the internal Siemens customer area and the technology providers. Implemented agile approaches on development and projects. Internal web and DB development. siemens.com
Mobile App developed to the Pennsylvania Arts Festival 2015, app with social media characteristics. The objective was to create an interaction among the event’s participants. Afterwards a research team analysed and interpreted the users’ data and interactions during the festival through generation of networks and graphical visualizations. Thus there was developed a scientific article based on how the interaction happened. psu.edu
Interacted with the company's sponsors. Acted as a liaison between the costumers and the company. Initiated strategies for events that were developed by the marketing team. Determined: prices, time frame and services included for commercial offers and contracts. siuspjr.com
Development of industrial automation’s systems using AutoCAD software. Implementation of Boolean logic among the automation tools in order to design and simulate the industrial operation.vkeng.com.br
Traveling, Technology, Data Analysis, Entrepreneurship, Business Inteligence, Education, Economics, Stock Market, Craft Beer, Front-end Development, Soccer, world wars, Global Politics, Renewable Sources of Energy and Traveling.
Best Game developed - CIS 101 Game Design Class
Fall 2014
TOEFL IBT - Academic english - Test of proeficiency
Grade 88/120 | Year 2013
Business Inteligence (USP/Itaú)
2013
Concepts of NoSQL (USP)
2013


Loading Test Harness
TinyTest JS
Red - Green - Refactor
by
Ben Nadel
Test Driven Development
Start
Run Selected Tests
You Ran {{ testResults.getTestCount() }} Tests In {{ testResults.getDuration() }} ms
Passed
Run Tests Again
You Ran {{ testResults.getTestCount() }} Tests In {{ testResults.getDuration() }} ms
Failed
Try Again
What Went Wrong
{{ stackItem.fileName }} : Line {{ stackItem.lineNumber }}
{{ testResults.getError().getErrorMessage() }}
You Have {{ testCases.length }} Test Cases
(
Select All
)
{{ testCase.name }}
Oops
: There are no test cases in your "specs" directory.
See the
Readme.md
file for instructions.
Auto-run tests when window is focused.
Running
{{ selectedTestCases.length }}
Test Cases
Get ready to refactor...


About the Common Terms Registry
The purpose of the Common Terms Registry is to encourage and enable all stakeholders to use the same terms when describing the same user needs and preferences sets.
The purpose of the Common Terms Registry is to encourage and enable all stakeholders to use the same terms when describing the same things (the same concept and value range) with regard to user need and preference sets in the User Preference server. The purpose, format (and maintenance?) of the Common Terms Registry will be defined in more detail by ISO 24751 REVISION (now underway).
The Common Terms Registry contains items like the following:
- Name, description and value range of a set of core terms used by the Cloud4All/GPII architecture, when users describe what needs and preferences they have and solutions declare what needs and preferences their settings cover. An example would be magnificationFactor, which would describe the magnification factor of a screen magnifier. By referring to this Common Term, it is ensured that users, solutions, etc., understand the same thing when talking about screen magnification in terms of unit, value range and meaning.
- Operators and Conditions used in the Needs and Preferences sets of users (again Cloud4All/GPII). Any operator and condition in the users needs and preferences set is defined in the registry, to ensure that no ambiguity arises and that the definitions can be looked up in a single place.


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
|---|---|
| Help | Gives the path to the help file. |
| Class Summary | |
|---|---|
| DataGeneratorActions | Here is where the actions caused by the UI main frame are handled. |
| DataGeneratorView | DataGeneratorView class is the main view. |
| DistributionPanel | This class gathers not only the probability distribution available to the system but also the parameters of those in a separate panel. |
| DistributionParameterPanel | This is an abstract class for all probability distributions to put their parameters in. |
| NormalDistributionPanel | This is an representation of parameters of the Normal probability distribution. |
| UniformDistributionPanel | This class represents the parameters of an Uniform probability distribution. |
| ViewFactory | This class handles the object creation of the view layer. |
Represents the view of the MVC pattern and interacts with the user through a UI. The view only has controll over its own layer and doesn't have any logic implemented conserning subjects of othe layers like the controller layer or the model layer. But this doesn't mean the view layer doesn't do anything on its own. It is, of course, responsible for the interaction with the user. Notice, this package also has a factory. Factories here are used to encapsulate the object creation from the actual use of that object. Factories are used when other layers use that object too. The package it resides is responsible for the creation and then passes it on.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


{% extends "layout.html" -%} {% set active_page = 'interactor' %} {% block content -%}
All names have been removed from this dataset for the confidentiality of those involved. To ensure the protection of that confidentiality, do not attempt to use this dataset in order to identify specific individuals.{% include "partials/advanced-search.html" %} {% if display_fields is not none %} {% include "partials/search-results.html" %} {% endif %} {%- endblock content %}


Job
public struct Job: Codable
Included when the resource is the main response of a request
-
Value uniquely identifying the job
Declaration
Swift
public let id: Int
-
The job’s allow_failure
Declaration
Swift
public let allowFailure: Bool
-
Incremental number for a repository’s builds
Declaration
Swift
public let number: String
-
Current state of the job
Declaration
Swift
public let state: String
-
When the job started
Declaration
Swift
public let startedAt: String
-
When the job finished
Declaration
Swift
public let finishedAt: String
-
The build the job is associated with
Declaration
Swift
public let build: Embed<MinimalBuild>
-
Worker queue this job is/was scheduled on
Declaration
Swift
public let queue: String
-
The commit the job is associated with
Declaration
Swift
public let commit: Embed<MinimalCommit>
-
GitHub user or organization the job belongs to
Declaration
Swift
public let repository: Embed<MinimalRepository>
-
When the job was created
Declaration
Swift
public let createdAt: String
-
When the job was updated.
Declaration
Swift
public let updatedAt: String
-
Undocumented
Declaration
Swift
public let owner: Embed<MinimalUser>


Happy, Texas
rated PG-13 98 minutes starring Jeremy Northam, Steve Zahn, Ally Walker, Illena Douglas, and William H. Macy directed by Mark Illsley
A Video Review by Frankie Paiva
This is a madcap comedy that simply does not deliver. While the premise of two escaped convicts stealing a motor home only to find out they are supposed to be gay beauty pageant directors sounds promising, the outcome is dismal. The script isn't nearly as full of life as it might seem, and the actors do nothing to make their characters more vibrant and exciting. This is really a shame considering the cast assembled for this small production.
Harry Sawyer (Jeremy Northam) and Wayne Wayne Wayne Jr. (Steve Zahn) portray the two convicts. They arrive in Happy, Texas where citizens are counting on them to help the town's girls win the Little Miss Fresh Squeezed beauty pageant. While in town, they come up with the idea to rob the bank after harvest checks are deposited. The bank is heavily unguarded. Joe McClintock (Ally Walker, formerly of NBC's The Profiler) runs the bank, and Harry figures the easiest way to get into the bank is to become close friends with Joe. Wayne gets left with the girls to teach and is aided by Ms. Schaefer (Illena Douglas), the girl's teacher. Thrown into the mix is Chappy (William H. Macy) the town's closeted gay sheriff who takes an interest in Harry. He's clueless to the fact that Harry is a wanted man, even though he's received several notices about him.
The film is about the relationships between the characters, as each one of them is falling in and out of love. The love they feel for each other (particularly in Wayne and Ms. Schaefer's case) seems to come out of nowhere, and never reaches any level of believability.  In probably the only truly funny scene of the movie, he takes Harry to a gay cowboy bar 2 1/2 hours from town. The awkwardness between the two in this scene is the movie's highlight. The memorable Chappy aside, there is no real reason to see Happy, Texas. Jeremy Northam who lately has been appearing in period films (The Winslow Boy, An Ideal Husband) seems uncomfortable with this modern comedic role. The rest of the cast does nothing with their roles, and the acting (and plot) get worse and worse as the movie goes on. Happy, Texas isn't helped by the bad makeup work and lack of good sound dubbing. Scenes where Wayne hits a man over the head with a dead armadillo, or runs out of a building with a real flaming baton appear contrived and stupid, and I was wondering when the movie was finally going to end. Chappy alone cannot save Happy, Texas, which is too lifeless, laughless, and boring for its own good.
D+
Frankie Paiva<EMAIL_ADDRESS>http://www.homestead.com/cinemaparadise/videoreviews.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Create Onfleet Heatmap
How does it work?
Download Onfleet File from Dashboard
Upload Onfleet File hiere
Toggle Heatmap
Change gradient
Change radius
Change opacity


CSS3 list scroll effects, inspired by: http://lab.hakim.se/scroll-effects
- Copyright:
- Copyright (c) 2014 Yaw Joseph Etse. All rights reserved.
- License:
- MIT
- Source:
- To Do:
-
- need to switch to node events
Requires
- module:classie
- module:util-extent
- module:util
- module:events
Members
-
init
-
create stroller elements
- Source:
-
setFutureAndPastClass
-
update classes for stroller
- Source:
Methods
-
getEffects()
-
get all effect options
- Source:
-
setStrollerEffect(neweffect, element)
-
set the stroller effect
Parameters:
Name Type Description neweffect
string string of new effect
element
object html element of stroller
- Source:


Bye Bye Marciano Museum
by Tom TeicholzLos Angeles’ Marciano Foundation Art Museum, the 3 year old art museum founded by Marciano brothers, Paul and Maurice,who made their fortune in the jeans business has unceremoniously closed.
Housed in a former Masonic Temple on Wilshire Boulevard in Hancock Park, the museum’s collection was not particularly focused and was very much an art-advised wealthy person’s hit list of contemporary artists. Nonethelss, the Museum in its brief existence, had many strong temporary or traveling exhibits by such artists as Ai Wei Wei, Yayoi Kusuma, Catherine Opie, and Olafur Eliasson.
Much as no one really knew why the Museum opened (Altruism? Philanthropy? Tax benefits?), the reasons for it closing are not known. Some have suggested that employees attempting to unionize recently was reason to close, but no one really knows at this time.
I can’t say it will be missed. And I can’t say it added to Los Angeles many museums by being distinctive. I do hope the collection, and sponsoring of exhibition by the Marcianos and their foundation continues, perhaps to bolster MOCA or add to the increasing influence of the Hammer.