Making a data structure that performs like a dynamic array but functions in logarithmic time for all operations is the goal, but is by no means a trivial one. The obvious solution is to use a tree of some sort, but how? By using a binary tree in which values are stored at the leaf nodes and each node keeps track of how many leaves there are below it, we can quickly achieve logarithmic random ac...

Considering the strategic importance of coastal areas from various aspects, their protection against waves is a coast management necessity. Since long ago, strong coastal structures have protected coasts, but since they disturb the coastal ecosystem balance, effort has been made to use them less or make them more compatible with the coast. This research is specifically aimed to estimate the eff...

A subset M of a continuum X is called meager composant if maximal with respect to the property that every two its points are contained in nowhere dense subcontinuum . Motivated by questions Bellamy, Mouron and Ordoñez, we show no tree-like has proper open composant, either 1 or 2 ℵ 0 composants. We also prove decomposition theorem: If indecomposable dense, then partition into composants upper s...

GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem’s structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes,...