We have made an unbiased survey for molecular clouds in the Galactic Warp. This survey, covering an area of 56 square degrees at l = 252 to 266 and b = −5 to −1, has revealed 70 molecular clouds, while only 6 clouds were previously known in the region. The number of molecular clouds is, then, an order of magnitude greater than previously known in this sector at R > ∼ 14.5 kpc. The mass of the c...

This article exploits a method recently incorporated in the geometric morphometric toolkit that complements previous approaches to quantifying the facial features associated with specific body characteristics and trait attribution during social perception. The new method differentiates more globally encoded from more locally encoded information by a summary scaling dimension that is estimated b...

ÐIn this paper, we present a family of three algorithms which serve to perform checkpoints and to roll back Time Warp. These algorithms are primarily intended for use in simulations in which there are a large number of LPs and in which events have a small computational granularity. Important representatives of this class are VLSI and computer network simulations. In each of our algorithms, LPs ...

In Time Warp simulations, the overheads associated with rollbacks, state-saving and the communication induced by rollbacks are the chief contributors to the cost of the simulation; thus, these aspects of the simulation have been primary targets for optimizations. Unfortunately, the behavior of the Time Warp simulation is highly dynamic and greatly influenced by the application being simulated. ...

In Time Warp parallel simulation, a process executes every message as soon as it arrives. If a message with a smaller timestamp subsequently arrives, the process rolls back its state to the time of the earlier message and re-executes from that point. Clearly, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implem...

We consider the common problem of calculating routes from a starting point to a destination through a given space. This process typically involves discretizing the navigational space into a graph of intermediate waypoints linked together through transitions. A search for a solution that fits desired criteria can then be performed. Typical criteria include: minimum distance, minimum transit time...

The warp ikat method of making decorated textiles is one of the most geographically widespread in southeast Asia, being used by Austronesian peoples in Indonesia, Malaysia and the Philippines, and Daic peoples on the Asian mainland. In this study a dataset consisting of the decorative characters of 36 of these warp ikat weaving traditions is investigated using Bayesian and Neighbornet technique...

This work investigates a novel approach called configurable beamforming on wireless physical layer security against passive eavesdroppers with Wireless Open-Access Research Platform (WARP). The aim is to create physical regions surrounding the intended user by configuring antenna array. By adapting the array configuration according to the intended user’s channel state information, it allows the...

The aim of ARP/wARP is improved automation of model building and refinement in macromolecular crystallography. Once a molecular-replacement solution has been obtained, it is often tedious to refine and rebuild the initial (search) model. ARP/wARP offers three options to automate that task to varying extents: (i) autobuilding of a completely new model based on phases calculated from the molecula...