Abstract Cryptophytes are flagellated, eukaryotic phytoplankton found in environments ranging from tea-colored ponds to the blue-water open ocean. vary color green red, a trait that is imparted primarily by their phycobiliprotein (PBP) accessory pigments. These PBPs have likely played key role diversification of cryptophytes into wide range aquatic over evolutionary history. This review covers ...

We model the structure and strategy of social interactions prevailing at any point in time as a directed network and we address the following open question in the theory of social and economic network formation: given the rules of network and coalition formation, preferences of individuals over networks, strategic behavior of coalitions in forming networks, and the trembles of nature, what netw...

Colorful linear programming (CLP) is a generalization of linear programming that was introduced by Bárány and Onn. Given k point sets C1, . . . , Ck ⊂ R that each contain a point b ∈ R in their positive span, the problem is to compute a set C ⊆ C1 ∪ · · · ∪ Ck that contains at most one point from each set Ci and that also contains b in its positive span, or to state that no such set exists. CLP...

the present research deals with verbal and visual values of the persian alphabet. man had achieved common results in this respect in the course of the history, and graphical forms are believed to act as a strong bridge between the man and the universe. the theoretical research is aimed at responding to fundamental questions in this respect including those concerning scientific and historical re...

Context effects preference changes depending on the availability of other options have wide ranging implications across applied and theoretical domains, and have driven the development of new dynamic models of multi-attribute and multialternative choice. We propose the Multi-attribute Linear Ballistic Accumulator (MLBA), a new dynamic model that provides a quantitative account of the co-occurre...

Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an integer k, find a set of at least k pairwise non-adjacent vertices). Here, one encounters special graph classes like 2-union graphs (edge-wise unions of two interval graphs) and strip graphs (edge-wise unions of an in...