Results from lattice theory have successfully been applied by several researchers, e.g. [1, 7, 9, 10], to reduce the complexity of verification of distributed computations. The set of all reachable states of a distributed computation forms a lattice under a certain partial order relation. A property is said to exhibit meet-closure if the set of reachable states satisfying it is closed under the...

The aim of this paper is to initiate and investigate new (soft) hyperstructures, particularly (soft) join spaces, using important classes of lattices: modular and distributive. They are used in order to study (soft) hyperstructures constructed on the set of all convex sublattices of a lattice.

We study the decisions of state-chartered banks to join Fed in its first decade. Ours is combine state regulatory environment characteristics and individual bank explain membership choice. Regulatory environments that reduced benefit discount window access or increased cost joining led fewer joining. Individual affected magnitude benefits from accessing (either passing on liquidity risk reducti...

Continuous queries over data streams have gained popularity as the breadth of possible applications, ranging from network monitoring to online pattern discovery, have increased. Joining of streams is a fundamental issue that must be resolved to enable complex queries over multiple streams. However, as streams can represent potentially infinite data, it is infeasible to have full join evaluation...