The asynchronous dynamics associated with a Boolean network f : {0, 1} → {0, 1} is a finite deterministic automaton considered in many applications. The set of states is {0, 1}, the alphabet is [n], and the action of letter i on a state x consists in either switching the ith component if fi(x) 6= xi or doing nothing otherwise. This action is extended to words in the natural way. We then say tha...

SymRK is one of the key genes involved in initial steps of legume symbiotic association with fungi (mycorrhization) and nitrogen-fixing bacteria (nodulation). A large portion of the sequence encoding the extracellular domain of SYMRK was obtained for 38 lupine accessions and 2 outgroups in order to characterize this region, to evaluate its phylogenetic utility, and to examine whether its molecu...

Attached is a formal analysis of a large sample of cartel overcharges that I believe is relevant to your consideration of remedies for naked price fixing. This research suggests that differences in methods of calculating overcharges do not have much effect on variation in the size of those calculations. That is, antitrust prosecutors may be unjustified in their concerns about the difficulties o...

Variable fixing is an important technique when solving combinatorial optimization problems. Unique profitable variable values are detected with respect to the objective function and to the constraint structure of the problem. Relying on that specific structure, effective variable fixing algorithms (VFAs) are only suited for the problems they have been designed for. Frequently, new combinatorial...

In the last round of FIFA World Cup group stage, games for which outcome does not affect selection qualified teams are played with little enthusiasm. Furthermore, a team that has already may take into account other factors, such as opponents it will face in next stage competition so that, depending on results groups and scheduling winning game be its best interest. Even more critically, there s...