Abstract: A system and method for storing data representing a multidimensional entity using corresponding dimensions for the data, storing a further dimension for the data, the further dimension being a modification timestamp indicating a time when the data was modified, receiving a request for the data representing the multi-dimensional entity, the request including a request timestamp indicating a further time when a previous request for the data representing the multi-dimensional entity was received and transmitting the data only when the modification timestamp is later than the request timestamp.

Abstract: A system and method for storing a plurality data points, each data point representing a geographic location, a first set of data points representing a first geometric object and a second set of data points representing a second geometric object. The system and method then remove a first data point from the first set of data points representing the first geometric object based on at least a distance between a first location represented by the first data point and a second location represented by a second data point of the second set of data points representing a second geometric object.

Abstract: A system and method for storing a plurality data points, each data point representing a geographic location, a first set of data points representing a first geometric object and a second set of data points representing a second geometric object. The system and method then remove a first data point from the first set of data points representing the first geometric object based on at least a distance between a first location represented by the first data point and a second location represented by a second data point of the second set of data points representing a second geometric object.

Abstract: A system and method for storing data representing a multidimensional entity using corresponding dimensions for the data, storing a further dimension for the data, the further dimension being a modification timestamp indicating a time when the data was modified, receiving a request for the data representing the multi-dimensional entity, the request including a request timestamp indicating a further time when a previous request for the data representing the multi-dimensional entity was received and transmitting the data only when the modification timestamp is later than the request timestamp.

Abstract: A method and apparatus for enabling a calling party and a called party to exchange useful information with each other during a call setup process are disclosed. For example, the method receives user metadata from an originating party, and sends the user metadata provided by the originating party by embedding the user metadata in a Session Initiation Protocol (SIP) signaling message during a call setup.

Abstract: A system having a processor receiving a copy of a program and modifying the copy to create a modified program and a memory including a memory stack, the modified program being stored in the memory stack, wherein a first image of the memory stack storing the modified program is different from a second image of the memory stack storing the copy of the program.

Abstract: A system and method for storing data representing a multidimensional entity using corresponding dimensions for the data, storing a further dimension for the data, the further dimension being a modification timestamp indicating a time when the data was modified, receiving a request for the data representing the multi-dimensional entity, the request including a request timestamp indicating a further time when a previous request for the data representing the multi-dimensional entity was received and transmitting the data only when the modification timestamp is later than the request timestamp.

Abstract: A system generates a randomized hash value and/or verifies data against a randomized hash value. A hashing circuit can respond to data by randomly selecting a hashing algorithm parameter among a defined set of different hashing algorithm parameters, and by applying a hashing algorithm that uses the selected hashing algorithm parameter to hash the received data to generate a randomized hash value. Another hashing circuit randomly selects a hashing algorithm among a defined set of different hashing algorithms, and applies the selected hashing algorithm to hash the received data to generate a randomized hash value. Another hashing circuit applies a hashing algorithm to hash received data to generate an intermediate hash value that occupies a defined memory space, and randomly selects a partial segment of the hash value from a segment of the defined memory space to generate a randomized hash value.

Abstract: A method to install software by receiving a partially linked version of the software including a plurality of code modules, randomly ordering the code modules, assigning non-volatile memory addresses for the software and generating an executable image of the software. A system to install a software application having a partially linked object code version of the software application including a plurality of code modules and an installation program configured to randomly order the code modules, assign non-volatile memory addresses for the software, and generate an executable image of the software, wherein the installation program performs the ordering, assigning, and generating on a target computing device that is different from a development computing device that partially linked the software application.

Abstract: A system and method for storing data representing a multidimensional entity using corresponding dimensions for the data, storing a further dimension for the data, the further dimension being a modification timestamp indicating a time when the data was modified, receiving a request for the data representing the multi-dimensional entity, the request including a request timestamp indicating a further time when a previous request for the data representing the multi-dimensional entity was received and transmitting the data only when the modification timestamp is later than the request timestamp.

Abstract: This is a method for use in conducting online and/or proxy-based auctions. This method achieves the best possible price in a timely manner, by more closely simulating the mechanics of a face-to-face auction transaction where bidding is not closed at a preset time but by balancing bid frequency against conducting a timely transaction. The process extends the auction closing time by a geometrically decreasing amount to accommodate bids entered near the end of the auction.

Abstract: For each process a stack data structure that includes two stacks, which are joined at their bases, is created. The two stacks include a normal stack, which grows downward, and an inverse stack, which grows upward. Items on the stack data structure are segregated into protected and unprotected classes. Protected items include frame pointers and return addresses, which are stored on the normal stack. Unprotected items are function parameters and local variables. The unprotected items are stored on the inverse stack.

Abstract: A method for selecting a path in a physical network that selects nodes for the path based on the coordinates of the nodes in a representation of the subject network in space. From a working node M that is included in the selected path, the next node that is selected for the path is a node N such that (a) a link MN exists, and (b) the link MN forms an angle relative to a line that connects working node with the destination node that is smaller than the angle that any other link from node M forms with the line that connects working node with the destination node.

Abstract: In accordance with the teachings of the present invention, a method and apparatus is presented for alerting an operator of a network problem using a variety of contact devices. A server receives notification of a network problem. The server accesses presence information detailing the current location of an operator. The server then uses push technology to transmit alert information to the operator. As such, the alert information may be communicated directly to a client machine used by the operator. In the case where the operator is communicating through a contact device, which communicates with an interactive system, the alert information is forwarded to the interactive system, which communicates with the contact device.

Abstract: A plurality of disk drives in a disk drive array are synchronized. A synchronization signal is generated at a master disk drive. The synchronization signal is encoded as a radio frequency signal for transmission over a radio frequency network in communication with the plurality of disk drives. The transmitted radio frequency signal is received at a slave disk drive and decoded to recover the synchronization signal. Rotation of a disk in the slave disk drive is synchronized with rotation of a disk in the master disk drive based on the recovered synchronization signal.

Abstract: A system generates a randomized hash value and/or verifies data against a randomized hash value. A hashing circuit can respond to data by randomly selecting a hashing algorithm parameter among a defined set of different hashing algorithm parameters, and by applying a hashing algorithm that uses the selected hashing algorithm parameter to hash the received data to generate a randomized hash value. Another hashing circuit randomly selects a hashing algorithm among a defined set of different hashing algorithms, and applies the selected hashing algorithm to hash the received data to generate a randomized hash value. Another hashing circuit applies a hashing algorithm to hash received data to generate an intermediate hash value that occupies a defined memory space, and randomly selects a partial segment of the hash value from a segment of the defined memory space to generate a randomized hash value.

Abstract: This is a method for use in conducting online and/or proxy-based auctions. This method achieves the best possible price in a timely manner, by more closely simulating the mechanics of a face-to-face auction transaction where bidding is not closed at a preset time but by balancing bid frequency against conducting a timely transaction. The process extends the auction closing time by a geometrically decreasing amount to accommodate bids entered near the end of the auction.

Abstract: Methods, systems, and computer-readable media provide for determining an optimum buffer width for an above ground or buried asset. According to the method, a restorability measurement and a revenue measurement for the asset are determined. The restorability measurement indicates an ability for a technician to restore the asset when the asset becomes damaged. The revenue measurement indicates a value of a service provided through the asset. The optimum buffer width is determined based on the restorability measurement and the revenue measurement. The optimum buffer width includes a width of a buffer indicating an approximate location of the asset.

Abstract: For each process a stack data structure that includes two stacks, which are joined at their bases, is created. The two stacks include a normal stack, which grows downward, and an inverse stack, which grows upward. Items on the stack data structure are segregated into protected and unprotected classes. Protected items include frame pointers and return addresses, which are stored on the normal stack. Unprotected items are function parameters and local variables. The unprotected items are stored on the inverse stack.

Abstract: A method for selecting a path in a physical network that selects nodes for the path based on the coordinates of the nodes in a representation of the subject network in space.