The topology of an ad hoc network has a significant impact on its performance in that a dense topology may induce high interference and low capacity, while a sparse topology is vulnerable to link failure and network partitioning. Topology control aims to maintain a topology that optimizes network performance while minimizing energy consumption. Existing topology control algorithms utilize eithe...

This paper presents new fixed point results for weakly sequentially upper semicontinuous maps defined on locally convex Hausdorff topological spaces which are angelic when furnished with the weak topology. Moreover, we establish an applicable Leray-Schauder alternative (Theorem 2.12) for a certain subclass of these maps. Our alternative combines the advantages of the strong topology (i.e., the ...

The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal o...

Although MMOGs have been gaining most popularity over the years, RTS games have not been considerate a strong candidate for using this model because of the limited number of players supported for the usually employed network topologies, large number of game entities and strong consistency requirements. To deal with this situation, the notion of location-awareness can be extremely useful to conf...

We prove that the Büchi topology, the automatic topology, the alphabetic topology and the strong alphabetic topology are Polish, and provide consequences of this. 1998 ACM Subject Classification F.1.1 Models of Computation, F.1.3 Complexity Measures and Classes, F.4.1 Mathematical Logic, F.4.3 Formal Languages

Graph pattern matching is to find all matches in a data graph for a given pattern graph, and it is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow graph pattern matching to be conducted in cubic-time. However, they fall short of capturing the topology of d...