In this note we present numerical simulations of binary mixtures. We study the diffusion of particles and the response to an external driving force. We find evidence for the validity of the Cugliandolo Kurchan off-equilibrium fluctuation dissipation relation. The results are in agreement with the predictions of one step replica symmetry breaking and the dependance of the breakpoint parameter on...

There are many frame-based knowledge representation formalisms, mainly because of the diversity of applications. Their characteristics are generally incompatible and difficult to extend, and it is also difficult to share the knowledge bases built using them. That is why we have taken an interest in definition of a common substratum for all these formalisms. The system we propose, called BRS for...

Our study revisits the problem of accuracyfairness tradeoff in binary classification. We argue that comparison of non-discriminatory classifiers needs to account for different rates of positive predictions, otherwise conclusions about performance may be misleading, because accuracy and discrimination of naive baselines on the same dataset vary with different rates of positive predictions. We pr...

Metabolic pathway alignment has been widely used to find one-to-one and/or one-to-many reaction mappings to identify the alternative pathways that have similar functions through different sets of reactions, which has important applications in reconstructing phylogeny and understanding metabolic functions. The existing alignment methods exhaustively search reaction sets, which may become infeasi...

For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set o...

Rough set theory (RST) and formal concept analysis (FCA) are two formal settings in information management, which have found applications in learning and in data mining. Both rely on a binary relation. FCA starts with a formal context, which is a relation linking a set of objects with their properties. Besides, a rough set is a pair of lower and upper approximations of a set of objects induced ...

Expressions like know and stand on are standardly interpreted as binary relations between entities. Sentence (1) can be paraphrased by requiring that every element of the set {Mary, Sue,Jane} is in the know relation with every other element of this set. By contrast, in sentence (2) an analogous interpretation is highly unlikely. We describe the contrast in Figure 1, modeling binary relations us...

Expressions like know and stand on are standardly analyzed as denoting binary relations between entities. Sentence (1) can be paraphrased by requiring that every element of the set {Mary,Sue,Jane} is in the know relation with every other element of this set. By contrast, in sentence (2) an analogous interpretation is highly unlikely. We describe the contrast in Figure 1, modeling binary relatio...

Order-preserving matching is a string matching problem of two numeric strings where the relative orders of consecutive substrings are matched instead of the characters themselves. The order relation between two characters is a ternary relation (>,<,=) rather than a binary relation (>,<), but it was not su ciently studied in previous works [5, 7, 1]. In this paper, we extend the representations ...