By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...

Driven by the urging need to thoroughly identify and accentuate the merits of agent technology, we present in this paper MEANDER, an integrated framework for evaluating the performance of agent-based systems. The proposed framework is based on the Agent Performance Evaluation (APE) methodology, which provides guidelines and representation tools for performance metrics, measurement collection an...

We consider matrix-model representations of the meander problem which describes, in particular, combinatorics for foldings of closed polymer chains. We introduce a supersymmetric matrix model for describing the principal meander numbers. This model is of the type proposed by Marinari and Parisi for discretizing a superstring in D = 1 while the supersymmetry is realized in D = 0 as a rotational ...

Meandering is one of the unique processes in Earth surface dynamics. Since 1960s, fluvial geomorphologists have generalized numerous widely-acknowledged empirical or semi-empirical formulae to describe meandering rivers' characteristics. The most frequently applied Kinoshita high-sinuosity curve meander channel planform geometry. Combining with Beck equations riverbed topography at equilibrium ...

Seagrass bed ecosystems occupy the most important part of coastal shelf in the French West Indies. They also constitute nurseries for many invertebrates and fishes harvested by local fisheries. In Guadeloupe, coastal fish stocks are declining meanwhile several agroecosystems revealed to be heavily contaminated by pollutants (agricultural lands, rivers, mangroves, seagrass beds, and coral reefs)...

Separatrix reconnection in the standard nontwist map is described, including exact methods for determining the reconnection threshold in parameter space. These methods are implemented numerically for the case of odd-period orbit reconnection, where meanders (invariant tori that are not graphs) appear. Nested meander structure is numerically demonstrated, and the idea of meander transport is dis...

We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a given number of points. This is done by the explicit Gram-Schmidt orthogonalization of certain bases of subspaces of the Temperley-Lieb algebra.