The database search problem: a question of rational decision making

This paper applies probability and decision theory in the graphical interface of an influence diagram to study the formal requirements of rationality which justify the individualization of a person found through a database search. The decision-theoretic part of the analysis studies the parameters that a rational decision maker would use to individualize the selected person. The modeling part (in the form of an influence diagram) clarifies the relationships between this decision and the ingredients that make up the database search problem, i.e., the results of the database search and the different pairs of propositions describing whether an individual is at the source of the crime stain. These analyses evaluate the desirability associated with the decision of 'individualizing' (and 'not individualizing'). They point out that this decision is a function of (i) the probability that the individual in question is, in fact, at the source of the crime stain (i.e., the state of nature), and (ii) the decision maker's preferences among the possible consequences of the decision (i.e., the decision maker's loss function). We discuss the relevance and argumentative implications of these insights with respect to recent comments in specialized literature, which suggest points of view that are opposed to the results of our study.

Quadratic tranverse anisotropy term due to dislocations in Mn12 acetate crystals directly observed by EPR spectroscopy

High-sensitivity electron paramagnetic resonance experiments have been carried out in fresh and stressed Mn12 acetate single crystals for frequencies ranging from 40 GHz up to 110 GHz. The high number of crystal dislocations formed in the stressing process introduces a E(Sx2-Sy2) transverse anisotropy term in the spin Hamiltonian. From the behavior of the resonant absorptions on the applied transverse magnetic field we have obtained an average value for E=22 mK, corresponding to a concentration of dislocations per unit cell of c=10-3.

Reforming the Iowa Civil Justice System, January 30, 2012

Executive Summary I. Survey The Task Force conducted a wide-ranging survey of more than 9,000 licensed Iowa attorneys and judges to obtain their input on a variety of civil justice system topics. The survey results helped inform the Task Force of problem areas in Iowa’s civil justice system. II. Two-Tier Justice System The Task Force recommends a pilot program based on a two-tier civil justice system. A two-tier system would streamline litigation processes—including rules of evidence and discovery disclosures—and reduce litigation costs of certain cases falling below a threshold dollar value. III. One Judge/One Case and Date Certain for Trial Some jurisdictions in Iowa have adopted one judge/one case and date certain for trial in certain cases. The assignment of one judge to each case for the life of the matter and the establishment of dates certain for civil trials could enhance Iowans’ access to the courts, improve judicial management, promote consistency and adherence to deadlines, and reduce discovery excesses. IV. Discovery Processes Reforms addressing inefficient discovery processes will reduce delays in and costs of litigation. Such measures include adopting an aspirational purpose for discovery rules to “secure the just, speedy, and inexpensive determination of every action,” holding discovery proportional to the size and nature of the case, requiring initial disclosures, limiting the number of expert witnesses, and enforcing existing rules. V. Expert Witness Fees The Task Force acknowledges the probable need to revisit the statutory additional daily compensation limit for expert witness fees. Leaving the compensation level to the discretion of the trial court is one potential solution. VI. Jurors Additions to the standard juror questionnaire would provide a better understanding of the potential jurors’ backgrounds and suitability for jury service. The Task Force encourages adoption of more modern juror educational materials and video. Rehabilitation of prospective jurors who express an unwillingness or inability to be fair should include a presumption of dismissal. VII. Video and Teleconferencing Options When court resources are constrained both by limited numbers of personnel and budget cuts, it is logical to look to video and teleconferencing technology to streamline the court process and reduce costs. The judicial branch should embrace technological developments in ways that will not compromise the fairness, dignity, solemnity, and decorum of judicial proceedings. VIII. Court-Annexed Alternative Dispute Resolution(ADR) Litigants and practitioners in Iowa are generally satisfied with the current use of private, voluntary ADR for civil cases. There is concern, however, that maintaining the status quo may have steep future costs. Court-annexed ADR is an important aspect of any justice system reform effort, and the Task Force perceives benefits and detriments to reforming this aspect of the Iowa civil justice system. IX. Relaxed Requirement of Findings of Fact and Conclusions of Law A rule authorizing parties to waive findings of fact and conclusions of law could expedite resolution of nonjury civil cases. X. Business (Specialty) Courts Specialty business courts have achieved widespread support across the country. In addition, specialty courts provide excellent vehicles for implementing or piloting other court innovations that may be useful in a broader court system context. A business specialty court should be and could be piloted in Iowa within the existing court system framework of the Iowa Judicial Branch. Appendix included as a separate document, is 176 pages.

Exact solution to the mean exit time problem for free inertial processes driven by Gaussian white noise

We obtain the exact analytical expression, up to a quadrature, for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise from a region (0,L) in space. We obtain a completely explicit expression for T(x,0) and discuss the dependence of T(x,v) as a function of the size L of the region. We develop a new method that may be used to solve other exit time problems.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

The problem of physical coordinates in predictive Hamiltonian systems

In the Hamiltonian formulation of predictive relativistic systems, the canonical coordinates cannot be the physical positions. The relation between them is given by the individuality differential equations. However, due to the arbitrariness in the choice of Cauchy data, there is a wide family of solutions for these equations. In general, those solutions do not satisfy the condition of constancy of velocities moduli, and therefore we have to reparametrize the world lines into the proper time. We derive here a condition on the Cauchy data for the individuality equations which ensures the constancy of the velocities moduli and makes the reparametrization unnecessary.

Subclass problem-dependent design for error-correcting output codes

A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word for each class, where each position of the code identifies the membership of the class for a given binary problem. A classification decision is obtained by assigning the label of the class with the closest code. One of the main requirements of the ECOC design is that the base classifier is capable of splitting each subgroup of classes from each binary problem. However, we cannot guarantee that a linear classifier model convex regions. Furthermore, nonlinear classifiers also fail to manage some type of surfaces. In this paper, we present a novel strategy to model multiclass classification problems using subclass information in the ECOC framework. Complex problems are solved by splitting the original set of classes into subclasses and embedding the binary problems in a problem-dependent ECOC design. Experimental results show that the proposed splitting procedure yields a better performance when the class overlap or the distribution of the training objects conceal the decision boundaries for the base classifier. The results are even more significant when one has a sufficiently large training size.

Pionic branches in neutron matter and the problem of pion condensation

The pion spectrum for charged and neutral pions is investigated in pure neutron matter, by letting the pions interact with a neutron Fermi sea in a self-consistent scheme that renormalizes simultaneously the mesons, considered the source of the interaction, and the nucleons. The possibility of obtaining different kinds of pion condensates is investigated with the result that they cannot be reached even for values of the spin-spin correlation parameter, g', far below the range commonly accepted.

Uniform-price assignment markets

Uniform-price assignment games are introduced as those assignment markets with the core reduced to a segment. In these games, for all active agents, competitive prices are uniform although products may be non-homogeneous. A characterization in terms of the assignment matrix is given. The only assignment markets where all submarkets are uniform are the Bohm-Bawerk horse markets. We prove that for uniform-price assignment games the kernel, or set of symmetrically-pairwise bargained allocations, either coincides with the core or reduces to the nucleolus

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game

All assignment games with the same core have the same nucleolus

There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Multi-sided Böhm-Bawerk assignment markets: the nucleolus and the core-center

En aquest treball mostrem que, a diferència del cas bilateral, per als mercats multilaterals d'assignació coneguts amb el nom de Böhm-Bawerk assignment games, el nucleolus i el core-center, i. e. el centre de masses del core, no coincideixen en general. Per demostrar-ho provem que donant un m-sided Böhm-Bawerk assignment game les dues solucions anteriors poden obtenir-se respectivament del nucleolus i el core-center d'un joc convex definit en el conjunt format pels m sectors. Encara més, provem que per calcular el nucleolus d'aquest últim joc només les coalicions formades per un jugador o m-1 jugadors són importants. Aquests resultats simplifiquen el càlcul del nucleolus d'un multi-sided ¿¿ohm-Bawerk assignment market amb un número molt elevat d'agents.

The Lorenz-maximal core allocations and the kernel in some classes of assignment games

En aquest treball demostrem que en la classe de jocs d'assignació amb diagonal dominant (Solymosi i Raghavan, 2001), el repartiment de Thompson (que coincideix amb el valor tau) és l'únic punt del core que és maximal respecte de la relació de dominància de Lorenz, i a més coincideix amb la solucié de Dutta i Ray (1989), també coneguda com solució igualitària. En segon lloc, mitjançant una condició més forta que la de diagonal dominant, introduïm una nova classe de jocs d'assignació on cada agent obté amb la seva parella òptima almenys el doble que amb qualsevol altra parella. Per aquests jocs d'assignació amb diagonal 2-dominant, el repartiment de Thompson és l'únic punt del kernel, i per tant el nucleolo.