Argumentation-based negotiation has emerged as an important topic in multi-agent systems over the last years. Although there are many studies of frameworks that enable agents to negotiate through the exchange of arguments, there is a lack of reasoning methods that employ the (usually incomplete) knowledge an agent may have about his opponent. This work addresses this issue by providing a reason...

The orthodox view in statistics has it that frequentism and Bayesianism are diametrically opposed—two totally incompatible takes on the problem of statistical inference. This paper argues to the contrary that the two approaches are complementary and need to mesh if probabilistic reasoning is to be carried out correctly.

In this article, a natural symplectic form on the space of all smooth sections with compact support of an arbitrary fiber bundle admitting a global section is constructed. If one has a local field theory whose Lagrangian’s kinetic term is a nondegenerate bilinear form on the total space, then the corresponding Poisson bracket produces the usual commutation relations for sections of low momentum...

We study rank aggregation algorithms that take as input the opinions of players over their peers, represented as rankings, and output a social ordering of the players (which reflects, e.g., relative contribution to a project or fit for a job). To prevent strategic behavior, these algorithms must be impartial, i.e., players should not be able to influence their own position in the output ranking...

A common feature of the recent calls for reform of the undergraduate biology curriculum has been for better coordination between biology and the courses from the allied disciplines of mathematics, chemistry, and physics. Physics has lagged behind math and chemistry in creating new, biologically oriented curricula, although much activity is now taking place, and significant progress is being mad...

Let G be a multigraph of maximum degree Ll and with a set oft vertices of degree one, called terminals. We call G a (Ll, t)-network if for any pairing of its terminals there exist edge-disjoint paths in G between those pairs (tis even). The concept of (Ll, t)-networks is introduced to model the situation when switching processors having Ll ports are to be connected in such a way that simultaneo...

We study twenty four written natural languages. We draw in the log scale, number of words starting with a letter vs rank of the letter, both normalised. We find that all the graphs are of the similar type. The graphs are tantalisingly closer to the curves of reduced magnetisation vs reduced temperature for magnetic materials. We make a weak conjecture that a curve of magnetisation underlies a w...

Arrestins (Arrs) are ubiquitous regulators of the most numerous family of signaling proteins, G protein-coupled receptors. Two models of the Arr-receptor interaction have been proposed: the binding of one Arr to an individual receptor or to two receptors in a dimer. To determine the binding stoichiometry in vivo, we used rod photoreceptors where rhodopsin (Rh) and Arr are expressed at comparabl...