Today scientists are producing large volumes of data that they wish to explore and visualize. In this paper we describe a system that combines range-based queries with fast lookup to allow a scientist to quickly and efficiently ask “what if?” questions. Unique to our system is the ability to perform “cumulative queries” that work on both an intraand inter-time step basis. The results of such qu...

Facebook has established itself as one of the major players in social networking, claiming that it helps members connect and share with the people in their lives. But what if the people you want to connect and share with are your artistic collaborators? Can Facebook be used creatively, as a collaborative artistic environment? This paper explores the creative use of Facebook as a tool for creati...

This paper investigates the powerplay in one-day cricket. The rules concerning the powerplay have been tinkered with over the years, and therefore the primary motivation of the paper is the assessment of the impact of the powerplay with respect to scoring. The form of the analysis takes a “what if” approach where powerplay outcomes are substituted with what might have happened had there been no...

شرایط افروزش و اشتعال سوخت‌های گداخت هسته‌ای در حضور ناخالص­‌ها، یکی از موارد مهمی است که طراحی قرص‌های سوخت باید مورد توجه قرار گیرد. این مقاله اثر ناخالصی هسته سنگین طلا بر کلیه فرایندهای احتراق پلاسمای غیرتعادلی دوتریم- تریتیم مدل چهار دمایی آن شکل تابع توزیع انرژی رفتار فوتون‌ها تأثیر می‌گذارد بررسی گرفته است. مطالعه شامل اثرات منفی سوخت، طول زمان تشکیل لکه داغ نتایج محاسبات عددی به­ دست آم...

In security games, the solution concept commonly used is that of a Stackelberg equilibrium where the defender gets to commit to a mixed strategy. The motivation for this is that the attacker can repeatedly observe the defender’s actions and learn her distribution over actions, before acting himself. If the actions were not observable, Nash (or perhaps correlated) equilibrium would arguably be a...

Research on heuristic functions is all about estimating the length (or cost) of solution paths. But what if there is no such path? Many known heuristics have the ability to detect (some) unsolvable states, but that ability has always been treated as a by-product. No attempt has been made to design heuristics specifically for that purpose, where there is no need to preserve distances. As a case ...