Abstract: A map control module receives a stream of map data characterizing a geographic region proximal to a vehicle and outputs a moving map, and the moving map is divisible into a matrix of cells. A map item control receives a stream of point of interest (POI) data characterizing a plurality of POIs within the boundary and categorizes each of the plurality of POIs to define a set of categories. The map item control determines a display location of a map item within the matrix of cells for each of the plurality of POIs and determines an importance for each POI within a same category. The map item control forms a set of clusters of map items. Each map item in a given cluster of map items has a same cell and a same category. The map item control selects a top-item for each cluster of map items.

Abstract: One example includes a radar image interface system. The system includes an image processor configured to receive synthetic aperture radar (SAR) image data associated with a region of interest and to generate a radar image of the region of interest based on the SAR image data. The image processor can be further configured to divide the radar image into a plurality of sequential units corresponding to respective zones of the region of interest. The system also includes a display system configured to display zoomed sequential units corresponding to respective zoomed versions of the sequential units of the radar image to a user. The system further includes an input interface configured to facilitate sequentially indexing through each of the zoomed versions of the sequential units on the display system in response to an indexing input provided by the user.

Abstract: A method for using shadow Java classes to provide private metadata in an application. An XML schema defining a public API is used by a generator to create the public API data classes and a corresponding set of shadow classes. The shadow classes contain metadata describing each corresponding API class, including overall class metadata, and metadata pertaining to each field in the class. When a public class is to be encoded and sent out over the wire, the encoder looks up the shadow metadata—which includes the class structure and eliminates the need to use Java reflection to expand the class. The encoder then walks through the fields of the class and encodes the object—using shorthand simplifications enabled by the metadata. The encoding process is fast because of the avoidance of reflection, and the encoded data is compact due to the simplifications. A similar process is used for de-serializing.

Abstract: A method for high speed interprocess communications comprises four steps. Initially, first and second processes can be attached to a message buffer in a shared region of user memory. In addition, each process can have a corresponding message queue. In a preferred embodiment, the attaching step comprises the step of attaching first and second processes to a message buffer in a shared region of user memory exclusive of operating system kernel space. Second, message data from the first process can be accumulated in a location in the message buffer. Third, a memory offset corresponding to the location in the message buffer can be placed in the message queue of the second process. Finally, the accumulated data at the location corresponding to the offset can be used in the second process. Consequently, the accumulated message data is transferred from the first process to the second process with minimal data transfer overhead.

Abstract: A method for structuring satellite command and control directives in a hierarchical syntax comprises the steps of: defining at least one satellite command and control directive; and, associating the directive with a family of directives. The method can further comprise the step of compiling the associated families and directives into a binary persistent library. In addition, the method can include the step of displaying in a graphical user interface (GUI) a hierarchy representing the associations among the families and directives in order to assist a user in assembling satellite directives, and, in a complex system, subdirectives. Advantageously, the inventive method can present the hierarchy in a tree-structure. In addition, the method can accept a selection of a subnode; and, in response to a selection, display in the GUI parameters corresponding to the directive associated with the selected subnode.

Abstract: A method for using a computer system to dynamically represent the state of any device comprising a plurality of sub-systems. The method includes the steps of providing a modeling language for permitting a user to define a hierarchical data structure comprised of a plurality of leaves. Each leaf represents a discrete symbol associated with a sub-system of the device. A parent symbol is similarly defined representing a level of abstraction of the device which is higher in said hierarchy than the plurality of leaves. In response to updated data received for any said leaf symbol, the system automatically determines an updated state of the leaf symbol based on the updated data and automatically propagates the updated state to the parent symbol. Consequently, a state of any device and its sub-systems can be dynamically represented, without the need for customized computer programming, once the hierarchical data structure has been defined by a user.

Abstract: A system, method, and data structure are delineated for use in data storage and retrieval. An array of records stored in shared memory contains data entries, and associated hash codes computed from a predetermined hash function. A search request, consisting of one or more data entries, uses the same hash function to generate user codes. The records are searched to find one with hash codes that equal the user codes. This search involves comparisons of native data type entry, which are much faster than character string comparisons. Only after a record is identified with hash codes matching the user codes will a more time-consuming comparison be made between the selected record and the respective data entries of the search request.

Abstract: A method for graphically assisting system commanding can comprise the steps of: receiving a user-specified command; retrieving from a command database a command template corresponding to the specified command, the command template including at least one operational parameter corresponding to the specified command; for each retrieved operational parameter in the command template, adding to a graphical user interface (GUI) a GUI element corresponding to characteristics of the operational parameter; and, displaying the GUI. The user interface elements can include drop down boxes, sliders and text fields. The method can further comprise the steps of: for each GUI element in the GUI, accepting a value; and, formatting a command string containing the accepted values.

Abstract: A method and system for dynamic distributed memory locking in a computer network. According to the method, a local lock process executing on a node receives from an application program a lock request for exclusive access to a memory location. The lock process identifies a first lock process executing on any node of the network that is currently a designated lock manager for granting locks for the particular memory location for which the lock was requested. Subsequently, the local lock process requests from the designated lock manager a lock for the particular memory location. Finally, the local lock process notifies the requesting application program when a lock has been granted by the lock manager. The method also includes designating a local lock process executing on a selected node as the lock manager when no lock manager is currently designated for the particular memory location for which a lock has been requested.

Abstract: A method for distributing data for one or more controlled devices having defined subsystems which generate data. The method includes the steps of partitioning and labeling the data to establish a set of defined data views, so that each data view contains data for a predetermined set of the subsystems. The data is stored on a server node of a computer network and is subsequently broadcast over the network using multicast techniques. The broadcasted data contains a plurality of the data views from the server which are received by at least one client node via the network. The client node selectively processes a predetermined set of the data in accordance with the data views assigned to the client node and rejects all other data views.

Abstract: A method for receiving requested multicast data over a plurality of multicast communications channels includes the steps of determining a source communications channel for receiving requested multicast data; enabling the source communications channel; receiving the requested multicast data through the source communications channel; and, forwarding the requested multicast data to requesting processes. In the preferred embodiment, the source communications channel is overloaded with multicast data from a plurality of multicast data sources. In consequence, the method can further include both the steps of filtering from the received multicast data, unwanted multicast data; and, routing the filtered multicast data to requesting processes. In a preferred embodiment, the determining step can further include hashing an identifier corresponding to a multicast data source of the requested multicast data; and, identifying as the source communications channel, the hashed identifier.