Abstract: Systems and methods can support log synchronization associated with a complex event handler. An event log can support storing prior event indicators. A new event indicator may be received. Temporal indicators associated with the new event indicator may be analyzed to establish consistent relative ordering with respect to prior event indicators. A synchronized timestamp may be generated in response to analyzing the temporal indicators. The new event indicator may be translated into a canonical form. The translated event indicator may be stored into the event log according to the synchronized timestamp. A rule associated with the complex event handler may be evaluated to identify a stored event dependency within a rule condition of the rule. The event log may be searched to match the translated event indicator against the stored event dependency. The rule may be triggered, and its action executed, in response to satisfying the rule condition.

Abstract: Systems and methods can support log synchronization associated with a complex event handler. An event log can support storing prior event indicators. A new event indicator may be received. Temporal indicators associated with the new event indicator may be analyzed to establish consistent relative ordering with respect to prior event indicators. A synchronized timestamp may be generated in response to analyzing the temporal indicators. The new event indicator may be translated into a canonical form. The translated event indicator may be stored into the event log according to the synchronized timestamp. A rule associated with the complex event handler may be evaluated to identify a stored event dependency within a rule condition of the rule. The event log may be searched to match the translated event indicator against the stored event dependency. The rule may be triggered, and its action executed, in response to satisfying the rule condition.

Abstract: The invention is a modular, optimizing transmitter/bridge device for optimizing placement of a transmitter/bridge for WWAN communication for one or more WWAN service providers, comprising a transmitter/bridge for WWAN communication, including software for identifying signals from the one or more WWAN service providers, a WWAN interface for providing WWAN service from a preselected WWAN service provider in electronic communication with the transmitter/bridge, a connection to a power source in electronic communication with the transmitter/bridge; and a signal strength indicator in electronic communication with the transmitter/bridge for indicating signal strength of a preselected WWAN service. The device will also have a signal strength indicator to allow for optimal placement for maximum wireless connectivity.

Abstract: A portable wireless site qualifier device and associated computer systems, software, and methods are disclosed. The portable device comprises a self updating and self configuring portable measuring device that analyzes, tests, and measures quality of service on all available wireless networks and immediately displays an optimal choice(s) when choosing between multiple wireless data providers. All data is also sent to a central configuration, collection, and reporting facility.

Abstract: A system and method implemented, for example, by a C language compiler at either a source or target system, for translating between native data structures on arbitrary machines and specific message structures on communication media such that the byte order and word alignment on the native machine is translated as needed into the byte order and word alignment required in the communication media. In so doing, templates which represent data structures on the communication media and data structures in the host machine that represent the communication structures are defined. Then, translations adjusting for byte alignment (structure packing) and adjusting for byte order between these two representations are performed in either direction.

Abstract: A system and method for saving and restoring RAM-resident databases. Each structure within a database image written to storage includes a self-relative pointer to its actual location in RAM upon being written to disk and may include one or more memory-to-memory pointers to other structures within the database. Upon the database disk image being reloaded to RAM from storage, the self-relative pointers are used to reconstruct the memory-to-memory pointers.

Abstract: A protocol and data packaging format optimized for transmissions over noisy communications links is disclosed. The data packaging format provides a modified High-level Data Link Control (HDLC) control mechanism incorporated into a normal data communication header thus eliminating the requirement for control messages to acknowledge or reject transmissions. An eight bit value is used to encode a toggle bit status for each of eight possible transmit sequence numbers. The eight bit value when used alone, constitutes a null frame indicating data-free feedback. The null frame is used to confirm receipt of data frames. This eight bit value is also used as the first byte of every data frame. The second byte of the data frame consists of a four-bit logical channel index, a single bit transmit toggle bit and a three-bit transmit sequence number. The second byte of the data frame may be followed by zero or more eight-bit data bytes.

Abstract: Disclosed is a method of decompressing data mode up of a sequence of literal references, history references, and lexicon references. The method includes the steps of reading a reference from the sequence and emitting a lexicon string if the reference is of the type lexicon, emitting a history string if the reference is of the type history, and emitting a literal string if the reference is of the type literal. The string emitted is inserted into a history buffer and if the string is of the type history it is inserted in a lexicon.

Abstract: A method of early data frame release using a modified High-level Data Link Control (HDLC) protocol. A destination link station delivers received data frames immediately upon receipt. The data frames are directed to an intelligent application layer with sufficient information to permit resequencing the out-of-order data frames to maintain data synchronization. A transmitter maintains and assigns sequential sequence numbers to each of a plurality of data frames in a radix cycle from zero to seven and back to zero. A transmit toggle bit enables data frame receipt confirmation with the transmitter altering the transmit toggle bit each time the same sequence number is reused. Each data frame must be confirmed before a sequence number can be made available for reuse.

Abstract: Disclosed is a method of compressing a sequence of data symbols. The method includes the steps of sequentially appending symbols to a working substring to find the longest string that is duplicated in a history buffer or a lexicon. If the string is duplicated in the history buffer, then a history reference is emitted. If the string is duplicated in the lexicon, then a lexicon reference is emitted. If the string is not duplicated in either the history buffer or the lexicon, then a literal reference is emitted. The history buffer is a record of uncompressed data that has most recently been processed. The lexicon is a record of strings that has been emitted by means of history references.

Abstract: Disclosed is a method of decoding a stream of compressed data made up of a sequence of literal references, history references, and lexicon references. If the first bit of the stream is a zero, then the first reference is of the type literal and the first bit is followed by the 8-bit literal symbol itself. If the first bit is a one, then the first reference is either a history reference or a lexicon reference. If the second bit is a zero, then the first reference is of the type history and the second bit is followed by an offset value and a length value. If the second bit is a one, then the first reference is of the type lexicon and the second bit is followed by an index value. After the character of the first reference has been determined, the process is repeated starting with the first bit following the first reference.

Abstract: A method of encoding compressed data for transmission or storage. The method includes converting the input data stream into a sequence of literal references, history references, and lexicon references. Each literal reference includes a literal identifier. Each history reference includes a history identifier. Each lexicon reference includes a lexicon identifier. The history references and lexicon references specify the location of strings of symbols in a history buffer and lexicon, respectively. The encoding method of the present invention encodes the location information in an optimal manner.