<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Choice &#38; Inference &#187; Gregory Wheeler</title>
	<atom:link href="http://choiceandinference.com/?feed=rss2&#038;author=6" rel="self" type="application/rss+xml" />
	<link>http://choiceandinference.com</link>
	<description></description>
	<lastBuildDate>Wed, 18 Aug 2010 10:33:08 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Probability Processing</title>
		<link>http://choiceandinference.com/?p=1007</link>
		<comments>http://choiceandinference.com/?p=1007#comments</comments>
		<pubDate>Wed, 18 Aug 2010 10:33:08 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[News]]></category>
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=1007</guid>
		<description><![CDATA[From Gigacom, news that Lyric Semiconductor, an MIT spinoff, is developing a new approach to data processing, which they call &#8220;probability processing&#8221;: For over 60 years, computers have been based on digital computing principles. Data is represented as bits (1s and 0s). Boolean logic gates perform operations on these bits. Lyric has invented a new [...]]]></description>
			<content:encoded><![CDATA[<p>From <a href="http://gigaom.com/2010/08/16/lyric-semiconducto/">Gigacom</a>, news that Lyric Semiconductor, an MIT spinoff, is developing a new approach to data processing, which they call &#8220;probability processing&#8221;:</p>
<blockquote><p>
 For over 60 years, computers have been based on digital computing principles. Data is represented as bits (1s and 0s). Boolean logic gates perform operations on these bits. Lyric has invented a new kind of logic gate circuit that uses transistors as dimmer switches instead of as on/off switches.  These circuits can accept inputs and calculate outputs that are between 0 and 1, directly representing probabilities – levels of certainty. A digital processor steps through these operations serially in order to perform a function. In order to improve efficiency even further, Lyric’s processors are designed to perform many probability computations in parallel. (Lyric Press Materials)
</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=1007</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Knock Yourself Out</title>
		<link>http://choiceandinference.com/?p=980</link>
		<comments>http://choiceandinference.com/?p=980#comments</comments>
		<pubDate>Sat, 07 Aug 2010 15:24:53 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[Puzzles and Paradoxes]]></category>
		<category><![CDATA[Teaching]]></category>
		<category><![CDATA[Tidbits]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=980</guid>
		<description><![CDATA[Some links: The Central Limit Theorem, Edges of Graphs, and Graph Layout, (Leland Wilkinson). The Monty Hall Problem, (The New York Times). Take this question out back&#8230;, (Language Log). Finally, the great Lenny Pickett, (circa 1973). He is the one in the bow tie.]]></description>
			<content:encoded><![CDATA[<p>Some links:<br />
<a href="http://www.cs.uic.edu/~wilkinson/Applets/clt.html">The Central Limit Theorem</a>, <a href="http://www.cs.uic.edu/~wilkinson/Applets/edges.html">Edges of Graphs</a>, and <a href="http://www.cs.uic.edu/~wilkinson/Applets/graphlayout.html">Graph Layout,</a> (Leland Wilkinson). </p>
<p><a href="http://www.nytimes.com/2008/04/08/science/08monty.html">The Monty Hall Problem</a>, (The New York Times).</p>
<p><a href="http://languagelog.ldc.upenn.edu/nll/?p=2530">Take this question out back&#8230;</a>, (Language Log).</p>
<p>Finally, the great <a href="http://www.youtube.com/watch?v=15v73Etc9SQ">Lenny Pickett</a>, (circa 1973). He is the one in the bow tie.</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=980</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Postdoc position at ENS Cachan, France</title>
		<link>http://choiceandinference.com/?p=965</link>
		<comments>http://choiceandinference.com/?p=965#comments</comments>
		<pubDate>Fri, 23 Jul 2010 13:20:55 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[News]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=965</guid>
		<description><![CDATA[Postdoctoral position at ENS Cachan &#8211; LSV and CEA LIST &#8211; MeASI &#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212; Credibilistic and Prevision-Theoretic Semantics and Analysis of Numerical Programs &#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212; For details and deadlines, contact: &#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212; Jean Goubault-Larrecq goubault@lsv.ens-cachan.fr Eric Goubault eric.goubault@cea.fr Olivier Bouissou olivier.bouissou@cea.fr Project description: This postdoctoral position is part of the ANR Blanc &#8220;Confidence, Proof and Probabilities&#8221; project. This [...]]]></description>
			<content:encoded><![CDATA[<p>Postdoctoral position at <a href="http://www.ens-cachan.fr/version-anglaise/">ENS Cachan</a> &#8211; LSV and CEA LIST &#8211; MeASI<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br />
<strong>Credibilistic and Prevision-Theoretic Semantics and<br />
Analysis of Numerical Programs</strong><br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;</p>
<p>For details and deadlines, contact:<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br />
Jean Goubault-Larrecq<br />
 goubault@lsv.ens-cachan.fr<br />
Eric Goubault<br />
 eric.goubault@cea.fr<br />
Olivier Bouissou<br />
 olivier.bouissou@cea.fr</p>
<p>Project description:</p>
<p>This postdoctoral position is part of the ANR Blanc &#8220;<a href="http://www.lix.polytechnique.fr/~bouissou/cpp/">Confidence, Proof and Probabilities</a>&#8221; project. This project aims at studying the joint use of probabilistic and deterministic semantics and analysis methods in order to improve the applicability and precision of static analysis methods on numerical programs. The project includes theoretical computer scientists, specialists of abstract interpretation based static analysis, applied mathematicians and control theoreticians as well as industrial partners. The project will contain the following steps:</p>
<p>* construction of good approximations of the semantics for non-deterministic and probabilistic behaviours.<br />
* abstraction of these semantics models for the tractable static analysis of complex programs and test case generation.<br />
* characterisation of the imprecision error due to the use of floating point numbers by the program.<br />
<span id="more-965"></span><br />
The role of this postdoctoral position is to explore the theoretical and practical aspects of these points. A first task will be to define a good semantics for probabilistic behaviours in numerical programms, building on work by Goubault-Larrecq at LSV [ICALP07,PRONOBIS], in particular the notion of prevision transition systems [FOSSACS08]. Then, the candidate will explore the abstraction semantics, based on deterministic abstractions using zonotopes as in [CAV09,arxiv2008,arxiv2010]. Finally, if time permits and according to the applicants preferences, he/she may look into the notion of bisimulation distances to characterize the imprecision error.</p>
<p>Qualifications:<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
The candidate must have a PhD in computer science or applied mathematics and be specialist of<br />
one of the following subject: probabiliy theory, static analysis, numerical programs analysis,&#8230;</p>
<p>Practical information:<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
This work will be done in very close collaboration with co-advisors from two sites (Jean Goubault-Larrecq at LSV and Eric Goubault at CEA LIST), and will be deeply associated with the project. The candidate will be located both at ENS Cachan, and at CEA Saclay nearby Paris. Salaries range from 27840 to 30000 euros per year.<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
[CAV2009] Khalil Ghorbal, Eric Goubault, Sylvie Putot, &#8220;The Zonotope Abstract Domain Taylor1+&#8221;, CAV 2009.</p>
<p>[Arxiv2010] Eric Goubault, Sylvie Putot, &#8220;A zonotopic framework for functional<br />
abstractions&#8221;, CoRR abs/0910.1763.</p>
<p>[Arxiv2008] Eric Goubault, Sylvie Putot, &#8220;Perturbed affine arithmetic for invariant computation in numerical program analysis&#8221;, CoRR abs/0807.2961</p>
<p>[ICALP07] Jean Goubault-Larrecq, &#8220;Continuous Capacities on Continuous State Spaces&#8221;, ICALP 07, LNCS 4596.</p>
<p>[FOSSACS08] Jean Goubault-Larrecq, &#8220;Prevision Domains and Convex Powercones&#8221;, FOSSACS 2008, LNCS 4962.</p>
<p>[PRONOBIS] Jean Goubault-Larrecq, &#8220;Une introduction aux capacites, aux jeux et aux previsions&#8221;, available at http://www.lsv.ens-cachan.fr/~goubault/ProBobis/pp.pdf.</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=965</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Martin Gardner: 1914-2010</title>
		<link>http://choiceandinference.com/?p=947</link>
		<comments>http://choiceandinference.com/?p=947#comments</comments>
		<pubDate>Mon, 24 May 2010 16:05:47 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[News]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=947</guid>
		<description><![CDATA[An obituary from the New York Times, and a notice from the OU Math Club in Norman.]]></description>
			<content:encoded><![CDATA[<p>An obituary from the New York <a href="http://www.nytimes.com/2010/05/24/us/24gardner.html?hpw">Times</a>, and a notice from the <a href="http://oumathclub.wordpress.com/2010/05/24/martin-gardner-1914-2010/">OU Math Club</a> in Norman.</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=947</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Out and About</title>
		<link>http://choiceandinference.com/?p=881</link>
		<comments>http://choiceandinference.com/?p=881#comments</comments>
		<pubDate>Tue, 30 Mar 2010 09:04:43 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[Tidbits]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=881</guid>
		<description><![CDATA[Here are some new papers that I will be peddling over the next few weeks. A lot of this is in preliminary form, so I am keen to have comments. &#8220;Character Matching and the Envelope of Belief&#8221;, at the APA-Pacific [slides][paper]. &#8220;Robustness of Evidential Probability&#8221; (with Choh Man Teng), NYU Bioinformatics Group, Courant Institute of [...]]]></description>
			<content:encoded><![CDATA[<p>Here are some new papers that I will be peddling over the next few weeks. A lot of this is in  preliminary form, so I am keen to have comments.</p>
<li>&#8220;Character Matching and the Envelope of Belief&#8221;, at the APA-Pacific [<a href="http://centria.di.fct.unl.pt/~greg/talks/2010-03-APA.pdf">slides</a>][<a href="http://apa-pacific.org/current/abstracts.php#12281">paper</a>].</li>
<li>&#8220;<a href="http://centria.di.fct.unl.pt/~greg/papers/Robust-Short.pdf">Robustness of Evidential Probability</a>&#8221; (with Choh Man Teng), NYU Bioinformatics Group, Courant Institute of Mathematical Sciences (April 6th), and then at LPAR-16, in Dakkar, Senegal (end of April).</li>
<li>&#8220;<a href="http://centria.di.fct.unl.pt/~greg/papers/E-AGM.pdf">Belief revision in monotone modal logics</a>&#8220;,  LPAR-16, in Dakkar, Senegal.</li>
<li> &#8220;Tutorial on Probabilistic Logic&#8221;, <a href="http://www.uni-log.org/start3.html">Third World Congress on Universal Logic and School</a>, Lisbon, Portugal (April 18-21).</li>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=881</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CfP: CLIMA XI Workshop</title>
		<link>http://choiceandinference.com/?p=848</link>
		<comments>http://choiceandinference.com/?p=848#comments</comments>
		<pubDate>Tue, 02 Mar 2010 14:02:34 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[News]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=848</guid>
		<description><![CDATA[************************************************************************ Special session on Logics for Games and Strategic Reasoning at CLIMA XI (Computational Logic in Multi-Agent Systems) Lisbon, Portugal, August 16-17, 2010 (colocated with ECAI&#8221;10) http://centria.di.fct.unl.pt/events/climaXI/sessions.html 1st Call for Papers ************************************************************************ Submission deadline: May 7th. Proceedings: LNCS/LNAI volume (available at the workshop). Postproceedings: extended versions of selected papers will be published in a special [...]]]></description>
			<content:encoded><![CDATA[<p>************************************************************************</p>
<p>   Special session on <strong>Logics for Games and Strategic Reasoning</strong><br />
      at <a href="http://centria.di.fct.unl.pt/events/climaXI/sessions.html">CLIMA XI</a> (Computational Logic in Multi-Agent Systems)<br />
              Lisbon, Portugal, August 16-17, 2010<br />
                    (colocated with ECAI&#8221;10)</p>
<p>http://centria.di.fct.unl.pt/events/climaXI/sessions.html</p>
<p>                      1st Call for Papers</p>
<p>************************************************************************<br />
Submission deadline: May 7th.<br />
Proceedings: LNCS/LNAI volume (available at the workshop).<br />
Postproceedings: extended versions of selected papers will be published<br />
in a special issue of Annals of Mathematics and Artificial Intelligence.<br />
************************************************************************</p>
<p><span id="more-848"></span><br />
INTRODUCTION</p>
<p>Strategic reasoning occurs in many multi-agent systems. This is<br />
especially evident in game-theoretical and decision-theoretical models<br />
of MAS, but also in more informal settings using the game metaphor (like<br />
computer games or social network services). Mathematical logic can<br />
contribute to this view in many ways by providing specifications,<br />
models, and/or algorithms for game-like scenarios. We invite papers that<br />
address how logic can contribute to our understanding, modeling and<br />
analysis of games, but also ones that investigate how the metaphor of<br />
games and strategies can help in constructing and using logical formalisms.</p>
<p>The list of subjects includes (but is not limited to) the following topics:<br />
- Logics for reasoning about games and strategies<br />
- Modal logics of strategic ability<br />
- Logical foundations of game and decision theory<br />
- Logical approaches to rationality and bounded rationality<br />
- Solving games and verification of strategies by model checking<br />
- Logics for mechanism design<br />
- Game semantics for logics<br />
- Games in verification of logical specifications</p>
<p>SUBMISSION</p>
<p>We encourage submission of high quality, original papers which have not<br />
been accepted for publication nor are currently under review for another<br />
journal or conference. Submissions should not exceed 16 pages in the<br />
Springer LNCS format. For templates and instructions for authors, see<br />
http://www.springer.de/comp/lncs/authors.html . Papers should be<br />
submitted electronically via EasyChair:<br />
http://www.easychair.org/conferences/?conf=clima2010 .</p>
<p>PROCEEDINGS AND POST-PROCEEDINGS</p>
<p><strong>LNCS Proceedings</strong>: All the accepted papers (including special session<br />
papers) will be published by Springer as a volume in Lecture Notes in<br />
Computer Science, and will be available in time for the workshop.</p>
<p><strong>AMAI Special Issue</strong>: After the workshop, authors of selected papers will<br />
be invited to extend and re-submit their work to a special issue of<br />
Annals of Mathematics and Artificial Intelligence.</p>
<p>IMPORTANT DATES</p>
<p><strong>Paper submission</strong>:                              May 7, 2010<br />
Author notification:                          June 4, 2010<br />
Camera-ready deadline:                       June 16, 2010<br />
Workshop:                               August 16-17, 2010</p>
<p>ORGANIZATION AND CONTACT</p>
<p>The special session is organized by Wojtek Jamroga, University of<br />
Luxembourg. In case of questions, please do not hesitate to contact us<br />
at wojtek.jamroga@uni.lu . General questions about CLIMA XI should be<br />
sent to clima2010@easychair.org .</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=848</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Packing tetrahedron</title>
		<link>http://choiceandinference.com/?p=690</link>
		<comments>http://choiceandinference.com/?p=690#comments</comments>
		<pubDate>Thu, 07 Jan 2010 12:51:30 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[Tidbits]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=690</guid>
		<description><![CDATA[What&#8217;s the most efficient way to pack a group of identical spheres? It is to stack them like your grocer stacks oranges, which Kepler conjectured would yield a packing density of 74%, and Thomas Hales proved Kepler right in 1998. What&#8217;s the most efficient way to pack a group of identical, regular tetrahedron? Here answers [...]]]></description>
			<content:encoded><![CDATA[<p>What&#8217;s the most efficient way to pack a group of identical <i>spheres</i>? It is to stack them like your grocer stacks oranges, which Kepler conjectured would yield a packing density of 74%, and  Thomas Hales proved Kepler right in 1998.</p>
<p>What&#8217;s the most efficient way to pack a group of identical, regular <i>tetrahedron</i>? Here answers have been all over the board. Aristotle thought they would pack together perfectly. That&#8217;s false; it turns out they don&#8217;t pack together very easily at all. Is their packing density greater than that of the sphere problem? Around 2006, the answer appeared to be negative. <a href="http://www.nytimes.com/2010/01/05/science/05tetr.html">Now we know it is positive, and the race is on to find the upper limit</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=690</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>On Spotting Terrorists</title>
		<link>http://choiceandinference.com/?p=663</link>
		<comments>http://choiceandinference.com/?p=663#comments</comments>
		<pubDate>Thu, 31 Dec 2009 17:26:10 +0000</pubDate>
		<dc:creator>Gregory Wheeler</dc:creator>
				<category><![CDATA[Tidbits]]></category>

		<guid isPermaLink="false">http://choiceandinference.com/?p=663</guid>
		<description><![CDATA[The foiled underpants bomber, Umar Farouk Abdulmutallab, raises anew the question of how to spot a terrorist. Clear hindsight obscures how hard a task this is. After the 2001 attacks on New York City and Washington, D.C., the German authorities analyzed data for some 8 million potential terrorists living in Germany by a variety of [...]]]></description>
			<content:encoded><![CDATA[<p>The foiled underpants bomber, Umar Farouk Abdulmutallab, raises anew the question of how to spot a terrorist. Clear hindsight obscures how hard a task this is. After the 2001 attacks on New York City and Washington, D.C., the German authorities analyzed data for some 8 million potential terrorists living in Germany by a variety of categories and whittled that list down to 1689 individuals, each of whom they hauled in for an interview. Not one turned out to be a threat, according to the social scientists Diego Gambetta and Steffen Hertog in a <a href="http://www.newscientist.com/article/mg20227127.200-can-university-subjects-reveal-terrorists-in-the-making.html?full=true">New Scientist</a> comment.</p>
<p>Gambetta and Hertog mention this and other failed attempts to find good classifiers for profiling terrorist by way of arguing that engineers are three to four times as likely as other graduates to be affiliated with Islamic terrorist groups since 1970. Perhaps, they argue, university subjects provide a key to better classifiers.</p>
<p><span id="more-663"></span>Slate has recently picked up their thesis, but <a href="http://www.slate.com/id/2240157/">the Slate article</a> is less concerned with the data than with Gambetta and Hertog&#8217;s speculation on root causes:</p>
<blockquote><p>We reckon that something else is going on, something at the individual level, that is, relating to cognitive traits. According to polling data, engineering professors in the US are seven times as likely to be right-wing and religious as other academics, and similar biases apply to students. In 16 other countries we investigated, engineers seem to be no more right-wing or religious than the rest of the population, but the number of engineers combining both traits is unusually high. A lot of piecemeal evidence suggests that characteristics such as greater intolerance of ambiguity, a belief that society can be made to work like clockwork, and dislike of democratic politics which involves compromise, are more common among engineers.</p></blockquote>
<p>I found the last line about compromise very peculiar, since engineering <em>as a profession</em> is essentially concerned with compromising between <a href="http://models.street-artists.org/?p=252">price and performance</a>. I am not quarreling with the basic picture here: we could surely tell a story about Hank the vegan engineer that was just as confounding as the one told about Linda the feminist bank teller.</p>
<p>Rather, my point is that &#8216;trained engineer&#8217; and &#8216;practicing engineer&#8217; might be a worthwhile distinction in exploring engineering studies as a classifier. I&#8217;d also add that, in so far as engineering students can be a bit singleminded, increasing the number and variety of optimization problems in the curriculum that include social or economic parameters might not be a bad idea.</p>
]]></content:encoded>
			<wfw:commentRss>http://choiceandinference.com/?feed=rss2&amp;p=663</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
