In the attraction, compromise, and similarity effects, alternatives are repeatedly compared in pairs on single dimensions

In multi-alternative choice, the attraction, compromise, and similarity effects demonstrate that the value of an alternative is not independent of the other alternatives in the choice-set. Rather, these effects suggest that a choice is reached through the comparison of alternatives. We investigated exactly how alternatives are compared against each other using eye-movement data. The results indicate that a series of comparisons is made in each choice, with a pair of alternatives compared on a single attribute dimension in each comparison. We conclude that psychological models of choice should be based on these single-attribute pairwise comparisons

EVIDENCE -ADMISSIBILITY OF STATEMENTS OF FACT MADE DURING NEGOTIATION FOR COMPROMISE

At present, the various jurisdictions hold with comparative uniformity that while offers to settle a dispute are not admissible in evidence, statements of independent fact made during such compromise negotiation are admissible. The routes of logic by which the courts arrive at this similarity in result are marked by some fundamental differences, as will be shown later, but the result is the same under any theory. The question therefore presents itself, whether the distinction made by the courts between the admissibility of offers to compromise and statements of fact made during compromise negotiations can be justified under a system of jurisprudence whose essential aim is justice between litigants

Suffix Tree of Alignment: An Efficient Index for Similar Data

We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and $B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of $A$ and $B$. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of $A$ and $B$ has $|A| + l_d + l_1$ leaves where $l_d$ is the sum of the lengths of all parts of $B$ different from $A$ and $l_1$ is the sum of the lengths of some common parts of $A$ and $B$. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern $P$ in $O(|P|+occ)$ time where $occ$ is the number of occurrences of $P$ in $A$ and $B$. We also present an efficient algorithm to construct the suffix tree of alignment. When the suffix tree is constructed from scratch, the algorithm requires $O(|A| + l_d + l_1 + l_2)$ time where $l_2$ is the sum of the lengths of other common substrings of $A$ and $B$. When the suffix tree of $A$ is already given, it requires $O(l_d + l_1 + l_2)$ time.Comment: 12 page

Exceptional sperm cooperation in the wood mouse

Spermatozoa from a single male will compete for fertilization of ova with spermatozoa from another male when present in the female reproductive tract at the same time. Close genetic relatedness predisposes individuals towards altruism, and as haploid germ cells of an ejaculate will have genotypic similarity of 50%, it is predicted that spermatozoa may display cooperation and altruism to gain an advantage when inter-male sperm competition is intense. We report here the probable altruistic behaviour of spermatozoa in an eutherian mammal. Spermatozoa of the common wood mouse, Apodemus sylvaticus, displayed a unique morphological transformation resulting in cooperation in distinctive aggregations or 'trains' of hundreds or thousands of cells, which significantly increased sperm progressive motility. Eventual dispersal of sperm trains was associated with most of the spermatozoa undergoing a premature acrosome reaction. Cells undergoing an acrosome reaction in aggregations remote from the egg are altruistic in that they help sperm transport to the egg but compromise their own fertilizing ability

Automatic Wrapper Adaptation by Tree Edit Distance Matching

Information distributed through the Web keeps growing faster day by day,\ud and for this reason, several techniques for extracting Web data have been suggested\ud during last years. Often, extraction tasks are performed through so called wrappers,\ud procedures extracting information from Web pages, e.g. implementing logic-based\ud techniques. Many fields of application today require a strong degree of robustness\ud of wrappers, in order not to compromise assets of information or reliability of data\ud extracted.\ud Unfortunately, wrappers may fail in the task of extracting data from a Web page, if\ud its structure changes, sometimes even slightly, thus requiring the exploiting of new\ud techniques to be automatically held so as to adapt the wrapper to the new structure\ud of the page, in case of failure. In this work we present a novel approach of automatic wrapper adaptation based on the measurement of similarity of trees through\ud improved tree edit distance matching techniques

Optimal sub-arraying of compromise planar arrays through an innovative ACO-weighted procedure

In this paper, the synthesis of sub-arrayed monopulse planar arrays providing an optimal sum pattern and best compromise difference patterns is addressed by means of an innovative clustering approach based on the Ant Colony Optimizer. Exploiting the similarity properties of optimal and independent sum and difference excitation sets, the problem is reformulated into a combinatorial one where the definition of the sub-array configuration is obtained through the search of a path within a weighted graph. Such a weighting strategy allows one to effectively sample the solution space avoiding bias towards sub-optimal solutions. The sub-array weight coefficients are then determined in an optimal way by exploiting the convexity of the problem at hand by means of a convex programming procedure. Representative results are reported to assess the effectiveness of the weighted global optimization and its advantages over previous implementations. (c) The Electromagnetics Academy - The final version of this article is available at the url of the journal PIER (Progress In Electromagnetics Research): http://www.jpier.org/PIER/pier.php?paper=1009200