In this paper, a new notion of sequential compactness is introduced in L-topological spaces, which is called sequentially S∗-compactness. If L = [0, 1], sequential ultra-compactness, sequential N-compactness and sequential strong compactness imply sequential S∗-compactness, and sequential S∗-compactness implies sequential F-compactness. The intersection of a sequentially S∗-compact L-set and a ...

This paper presents the design and evaluation of a sequential access memory (SAM) that provides low power and high performance by replacing address decoders with special locally-communicating sequencers. A test chip containing one 16x16-b SAM and one 64x16-b SAM (consisting of four 16x16-b banks) has been designed, fabricated, and evaluated using a 0.25-μm CMOS process. With a clock frequency o...

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or Borda maximin—maximize the minimum rank, or the Borda score, of the items received by a player. Although SA...

Territoriality, spatial exploration and social hierarchy are strictly related behaviors in gregarious fishes, often under-appreciated farms where the individuals confined within crowded spaces. In this study, we investigated role of exploration, elucidating importance time upon forming organization, territoriality gilthead seabream (Sparus aurata), using two experimental approaches. first appro...

We present a time-optimal implementation for bulk execution of an oblivious sequential algorithm. Our second contribution is to develop a tool, named C2CU, which automatically generates a CUDA C program for a bulk execution of an oblivious sequential algorithm. C2CU: A CUDA C Program Generator for Bulk Execution