Today’s disks are inexpensive and have a large amount of capacity. As a result, most disks have a significant amount of excess capacity. At the same time, the performance gap between disks and processors has widened to the point that many workloads have become disk bound. To improve the performance of disks, we propose using the excess capacity of disks to replicate blocks. To do this, the disk...

In fractal compression technique, an image is partitioned into sub blocks called range blocks, each of which is encoded by matching it (after an appropriate affine transformation) with a block chosen from a large pool of domain blocks, which is constructed from the image itself. The problem is that the encoding is very time consuming because of the need to search in a very large domain pool. Ou...

We compute the entanglement entropy in a two dimensional conformal field theory at finite size and temperature large central charge limit via replica trick. first generalize known monodromy method for calculation of blocks on plane to torus. Then, we derive zero-point partition function. explain differences between methods before applying them entropy. find that contribution vacuum exchange dom...

We study ‘Myers effect’ for a bunch of D1-branes with IIB superstrings moving in one direction along the branes. We show that the ‘blown-up’ configuration is the helical D1-brane, which is self-supported from collapse by the axial momentum flow. The tilting angle of the helix is determined by the number of D1-branes. The radius of the helix is stabilized to a certain value depending on the numb...

This paper proposes a method for the development of AI for autonomous agents in game worlds modeled by fixed regular grids. This approach uses context behaviors driven by distance maps to support multiple agents in a dynamic environment. This paper introduces the notion of hierarchical distance maps which allow for higher-level goals to be easily specified by designers. We also discuss potentia...

This paper describes plan reuse in multiagent domains. In distributed planning, a plan is created by distributed centers of planner agents that have their own viewpoints. Plan reuse where a past plan result is reused for the new problem was proposed for single-agent planning and can achieve efficient planning. A special issue for applying it to distributed planning is that, even if the local ag...

In this paper, we study the problem of mapping natural language instructions to complex spatial actions in a 3D blocks world. We first introduce a new dataset that pairs complex 3D spatial operations to rich natural language descriptions that require complex spatial and pragmatic interpretations such as “mirroring”, “twisting”, and “balancing”. This dataset, built on the simulation environment ...

Relational reinforcement learning combines traditional reinforcement learning with a strong emphasis on a relational (rather than attribute-value) representation. Earlier work used relational reinforcement learning on a learning version of the classic Blocks World planning problem (a version where the learner does not know what the result of taking an action will be). “Structural” learning resu...

Looking for string vacua with fixed moduli, we study compactifications of type IIA string theory on Calabi-Yau fourfolds in the presence of generic Ramond-Ramond fields. We explicitly derive the (super)potential induced by Ramond-Ramond fluxes performing a Kaluza-Klein reduction of the ten-dimensional effective action. This can be conveniently achieved in a formulation of the massive type IIA s...