Abstract: Methods and computer readable medium for collaborating on geographical maps between two or more computers are disclosed. In particular, sharing a geographical location on a map between two or more computers and co-navigating a map between two or more computers are disclosed. With respect to sharing a geographical location, the geographical location is retrieved to the first computer. The geographical location is added to the map being rendered at the first computer and is sent to a second computer. A map including the geographical location is rendered at the second computer. With respect to co-navigating, a map is displayed from a map perspective at the first computer. The map perspective is sent to the second computer. A map from the same map perspective being displayed at the first computer is rendered at the second computer.

Abstract: Techniques for managing mortgage delinquency information are described.

Abstract: An electronic price label (ESL) system with automatic assignment of an ESL to an appropriate CBS and timeslot is described. In one aspect, the ESL system automatically assigns a missing ESL to an appropriate CBS and timeslot following a successful find command. After a find command has been transmitted and responded to by the missing ESL, a host computer system has a record of the CBS nearest the ESL and the timeslot that the ESL responded on. The host computer then determines a new timeslot for use by the ESL. The new timeslot is one of the timeslots normally used by the nearest CBS for communication. The host computer may select a timeslot which is currently assigned to fewer ESLs, to allow for even distribution of messages across the timeslots. An assign command is then transmitted to the ESL on the current timeslot, instructing the ESL to change to new timeslot when listening for messages. The host computer system then updates an ESL data file to include the correct CBS and timeslot information.

Abstract: Techniques for more accurately analyzing the additional capacity of very large hierarchical databases are described. More particularly, techniques and tools for looking at physical sequential data files, such as the OSAM files used in IMS databases, to determine how much file space an IMS OSAM dataset is using are described. These tools may be effectively utilized to generate appropriate reports if the database is running out of space, thereby allowing a user to take proactive steps.

Abstract: A data storage device having mediametric properties used as a source of data for cryptoprocessing keys. A memory array is formed by a plurality of memory cells, each cell containing a level of trapped charges that are difficult or impossible to set to a specific value, but which may be read relatively precisely. The levels of trapped charges are read from selected cells. Data relating to the level of the trapped charges is used to produce the cryptoprocessing keys. In addition, data relating to the charge levels in a memory array is used in generation of random numbers. When a random number is desired, data is written to selected cells of the memory array in order to establish random charge levels in the cells. The data is then read from the selected cells and processed to yield a random number.

Abstract: A reconfigurable register file system is described. The reconfigurable register file system includes an instruction register for storing an instruction specifying an operational requirement, a reconfigurable register file comprising an odd register file having at least one data read port, and an even register file having at least one data read port. The reconfigurable register file system may further suitably include an execution unit connected to the data read ports of the odd and even register files and port usage control logic connected to the instruction register and the reconfigurable register file to control the odd register file and the even register file port address input so that data read port lines change only as needed to support the operational requirement specified by the instruction.

Abstract: In an injection pump element 2, a communication route for communicating an injection pipe 3 connected to a fuel liquid outlet 212 and an inner peripheral surface of a plunger barrel 25 is formed by a purge passage 242 formed in a delivery valve seat 24, a purge passage 252 formed in the plunger barrel 25, and a purge port 253. When the injection pump element 2 is in a non-injection state, the plunger 26 is rotated circumferentially to such a rotational position that a purge groove 265 formed in an outer peripheral surface of the plunger 26 and a purge port 253 formed in an inner peripheral surface of the plunger barrel 25 are communicated to each other. The purge groove 265 is communicated to a fuel gallery 11 via a hole 263 and a notch 262. When the injection pump element 2 is in the non-injection state, the injection pipe 3 is communicated to the fuel gallery 11 even if the delivery valve 23 is closed.

Abstract: General purpose flags (ACFs) are defined and encoded utilizing a hierarchical one-, two- or three-bit encoding. Each added bit provides a superset of the previous functionality. With condition combination, a sequential series of conditional branches based on complex conditions may be avoided and complex conditions can then be used for conditional execution. ACF generation and use can be specified by the programmer. By varying the number of flags affected, conditional operation parallelism can be widely varied, for example, from mono-processing to octal-processing in VLIW execution, and across an array of processing elements (PE)s. Multiple PEs can generate condition information at the same time with the programmer being able to specify a conditional execution in one processor based upon a condition generated in a different processor using the communications interface between the processing elements to transfer the conditions.

Abstract: A variety of advantageous mechanisms for improved data transfer control within a data processing system are described. A DMA controller is described which is implemented as a multiprocessing transfer engine supporting multiple transfer controllers which may work independently or in cooperation to carry out data transfers, with each transfer controller acting as an autonomous processor, fetching and dispatching DMA instructions to multiple execution units. In particular, mechanisms for initiating and controlling the sequence of data transfers are provided, as are processes for autonomously fetching DMA instructions which are decoded sequentially but executed in parallel.

Abstract: Systems and techniques for providing an improved coin acceptor are described. In one aspect, an electronic coin acceptor exaggerates relatively small differences in coin diameters. A coin deposited into the coin acceptor passes along a coin path through two sensing beams, with at least one of the beams positioned at a nonperpendicular angle to the coin path. Timing information relating to the coin's passage through the beams is recorded and utilized to identify the coin. In another aspect, the thickness of the coin is determined as the coin passes through the sensing beams.

Abstract: Techniques for a pipelined bus which provides a very high performance interface to computing elements, such as processing elements, host interfaces, memory controllers, and other application-specific coprocessors and external interface units. The pipelined bus is a robust interconnected bus employing a scalable, pipelined, multi-client topology, with a fully synchronous, packet-switched, split-transaction data transfer model. Multiple non-interfering transfers may occur concurrently since there is no single point of contention on the bus. An aggressive packet transfer model with local conflict resolution in each client and packet-level retries allows recovery from collisions and buffer backups. Clients are assigned unique IDs, based upon a mapping from the system address space allowing identification needed for quick routing of packets among clients.

Abstract: A value storage system in which information representing value is directly written to an easily portable storage medium as a reference fingerprint. The value storage system includes a plurality of read/write units for storing and retrieving the value information. Each of the read/write units may include a data authenticator for authenticating information previously stored on the storage medium, the authentication information consisting of a numerical representation of a level of trapped charges representing the reference fingerprint. The read/write units may be connected to a central server which retrieves information from each of the read write units, stores information, and provides various accounting and statistical analyses, as well as reconciling transactions between two or more read/write units.