Abstract: Systems and methods for performing over-the-air verification tests for radar. A test chamber includes multiple sections, the sections separated by metal walls. The inner surfaces of the metal walls include absorbers. Each section includes defined testing devices to verify a defined function of a radar device. The defined testing devices can include a horn antenna and corner reflector. Each section has a defined number of rows. Each row has a defined testing device. Test fixtures hold a defined number of the radar devices in correspondence with the defined number of rows. The defined number of the radar devices placed on the test fixture via a placement device. A positioner to align under the sections and move the test fixtures through the sections of the test chamber and a controller to control operation of the positioner, the radar devices, and the placement device to execute over-the-air verification of the radar devices.

Abstract: The disclosed exemplary apparatuses, systems and methods provide at least two realizations of synchronized antenna probe arrays. These antenna probe arrays may be used to generate and receive RF signals in a compact anechoic chamber for over the air antenna testing, or other applications such as far-field antenna test chambers. A compact anechoic chamber for over-the-air antenna testing may include at least: a chamber housing; an interchangeable irradiating test panel, integral to the chamber; a plurality of absorbing material at least partially lining an interior of the chamber and capable of directing the irradiating; at least one moveable cart suitable for moving and removing the antenna from the chamber; at least one panel interface for interconnecting the antenna and equipment for the testing, wherein a response of the antenna to the irradiating is communicated through the panel interface to the testing equipment; and at least one switch matrix for multiplexed switching of ones of signals of the testing.

Abstract: The disclosed exemplary apparatuses, systems and methods provide at least a compact anechoic chamber for over-the-air antenna testing, which may include at least: a chamber housing; an interchangeable irradiating test panel, integral to the chamber; a plurality of absorbing material at least partially lining an interior of the chamber and capable of directing the irradiating; at least one moveable cart suitable for moving and removing the antenna within and from the chamber; and at least one panel interface for interconnecting the antenna and equipment for the testing, wherein a response of the antenna to the irradiating is communicated through the panel interface to the testing equipment.

Abstract: A system and method for intelligently and dynamically deploying a plurality of mobile robotic machines capable of carrying out a complex series of actions automatically to propagate wireless network connectivity comprising, at least, a mechanical framework, sensors, actuators, communications capability, an energy source, a propulsion means, a control mechanism, and a payload. The payload may comprise electronic or mechanical communication equipment to propagate services such as wireless networking services, in for example, a first responder or emergency environment, or electronic and mechanical jamming services in a military or anti-terrorism environment.

Abstract: The disclosed exemplary apparatuses, systems and methods provide at least two realizations of synchronized antenna probe arrays. These antenna probe arrays may be used to generate and receive RF signals in a compact anechoic chamber for over the air antenna testing, or other applications such as far-field antenna test chambers. A compact anechoic chamber for over-the-air antenna testing may include at least: a chamber housing; an interchangeable irradiating test panel, integral to the chamber; a plurality of absorbing material at least partially lining an interior of the chamber and capable of directing the irradiating; at least one moveable cart suitable for moving and removing the antenna from the chamber; at least one panel interface for interconnecting the antenna and equipment for the testing, wherein a response of the antenna to the irradiating is communicated through the panel interface to the testing equipment; and at least one switch matrix for multiplexed switching of ones of signals of the testing.

Abstract: The disclosed exemplary apparatuses, systems and methods provide at least a compact anechoic chamber for over-the-air antenna testing, which may include at least: a chamber housing; an interchangeable irradiating test panel, integral to the chamber; a plurality of absorbing material at least partially lining an interior of the chamber and capable of directing the irradiating; at least one moveable cart suitable for moving and removing the antenna within and from the chamber; and at least one panel interface for interconnecting the antenna and equipment for the testing, wherein a response of the antenna to the irradiating is communicated through the panel interface to the testing equipment.

Abstract: Systems and methods for determining by a first robotic device which portions of data received that is to be transmitted to one or more other robotic devices based on, at least, one or more functions of the data received, and characteristics of the data received. It may further be determined at a first robotic device an advanced communication technique may be executed by a first robotic device and/or one or more other robotic devices to improve communications between robotic devices.

Abstract: A system and method for intelligently and dynamically deploying a plurality of mobile robotic machines capable of carrying out a complex series of actions automatically to propagate wireless network connectivity comprising, at least, a mechanical framework, sensors, actuators, communications capability, an energy source, a propulsion means, a control mechanism, and a payload. The payload may comprise electronic or mechanical communication equipment to propagate services such as wireless networking services, in for example, a first responder or emergency environment, or electronic and mechanical jamming services in a military or anti-terrorism environment.

Abstract: Systems and methods for determining by a first robotic device which portions of data received that is to be transmitted to one or more other robotic devices based on, at least, one or more functions of the data received, and characteristics of the data received. It may further be determined at a first robotic device an advanced communication technique may be executed by a first robotic device and/or one or more other robotic devices to improve communications between robotic devices.

Abstract: A system and method for intelligently and dynamically deploying a plurality of mobile robotic machines capable of carrying out a complex series of actions automatically to propagate wireless network connectivity comprising, at least, a mechanical framework, sensors, actuators, communications capability, an energy source, a propulsion means, a control mechanism, and a payload. The payload may comprise electronic or mechanical communication equipment to propagate services such as wireless networking services, in for example, a first responder or emergency environment, or electronic and mechanical jamming services in a military or anti-terrorism environment.

Abstract: An apparatus including logic to receive a data packet comprising a string of characters, said apparatus having a plurality of states and at least one state for every character position in the string of characters; logic to examine the string of characters for matches with a plurality of predefined values, beginning with an initial character; and logic to execute forward exit transitions from any of the plurality of states based upon the examination of the characters, wherein a current state of the apparatus represents a count of a number of characters from the initial character of the string of characters.

Abstract: An apparatus including logic to receive a data packet comprising a string of characters, said apparatus having a plurality of states and at least one state for every character position in the string of characters; logic to examine the string of characters for matches with a plurality of predefined values, beginning with an initial character; and logic to execute forward exit transitions from any of the plurality of states based upon the examination of the characters, wherein a current state of the apparatus represents a count of a number of characters from the initial character of the string of characters.

Abstract: A deterministic finite state machine organised for the detection of positionally significant matches of characters in a string of characters examines each character in turn to determine a exit transition for a current state of the machine to another state The machine responds to an examination of the string of characters by executing in response to a first character at the commencement of the string a transition from an initial state to another state. The machine has at least one state for every character position, includes a exit transition from each state for each character to another state; and possesses only forward exit transitions each from any of the states whereby the current state of the machine unambiguously represents a count of the number of characters from the commencement of the string. The machine may include at least one match state which indicates that all character matches in the string required by at least one respective rule have been detected.

Abstract: A method of detecting signatures in message segments comprises employing a state machine for the detection of character strings in the message segments. The state machine executes for each input character a transition determined by a current state of the machine and a current input character. The message segments conform to TCP or other ordering transport protocol. The order of arrival of the message segments is monitored. In the event that an intermediate message segment is missing between a processed segment and an immediately subsequent message segment, the current state of said state machine at the end of the said processed segment is stored. The machine is restarted from its null or datum state for the examination of the immediately subsequent message segment, which is then temporarily stored. When the missing segment eventually arrives, it and the stored segment are successively examined for signatures by means of the state machine, beginning at the stored state.

Abstract: Deciphering and verification of the checksum of enciphered and encapsulated UDP datagrams, particularly those which enclose a tunneling protocol such as L2TP, are achieved by the provision of a checksum verifier in parallel with a decipher block. Checksum logic creates a pseudo UDP header needed for checksum verification using fields that would occur at the start of the packet that encapsulates the UDP datagram. The first part of the packet to be deciphered is the UDP header; checksum logic can latch the checksum field into a local register. As the rest of the packet is deciphered the checksum verifier processes the data at the same time. Eventually the checksum logic will acquire a complete checksum which can be compared with the checksum that had been previously latched, so as to verify the checksum.

Abstract: The deciphering of fragmented enciphered IP packets is performed without requiring reassembly of the fragments. fragmented packets. When a first frame is deciphered a characteristic poly-tuple is saved against the state of the cipher, particularly an output vector. When the next frame comes in, the cipher would continue on from that previously saved state after a look-up of the poly-tuple. Each frame would then be sent on, deciphered, but still representing a fragment of the original packet. The poly-tuple employed for the look-up includes the identity and protocol fields from the IP header and at least one of the source IP address and the destination IP address. The deciphering process may commence with the combination of input data with an initializing vector and proceed by combining input data with a vector fed back from the output of the deciphering engine. The saved cipher state is employed as the initializing vector for the next frame.

Abstract: A method and switch for controlling the allocation of priority of TCP packets, more particularly for distinguishing between data and control packets and assigning an increased priority to control packets. The layer 4 information in the form of the flag bits of the header are snooped in the switch to determine whether any flag other than PSH is set and if so to allocate a priority to that packet, which will usually be a higher priority than data packets.

Abstract: For each metered flow in a network unit there is a memory entry which defines a time stamp and a rate parameter. When a packet in the respective flow arrives, the time of arrival is compared with the time stamp. If the time of arrival is before the time stamp the packet is discarded. If the packet arrives after the date stamp, it is allowed to proceed and a new time stamp is computed in accordance with the rate parameter. One exemplary computation adds to the time stamp a time interval obtained by dividing the size of the packet by the rate parameter and preferably subtracting from the quotient the time interval between the arrival time and the previous time stamp.

Abstract: A deterministic finite state machine organised for the detection of positionally significant matches of characters in a string of characters examines each character in turn to determine a exit transition for a current state of the machine to another state The machine responds to an examination of the string of characters by executing in response to a first character at the commencement of the string a transition from aninitial state to another state. The machine has at least one state for every character position, includes a exit transition from each state for each character to another state; and possesses only forward exit transitions each from any of the states whereby the current state of the machine unambiguously represents a count of the number of characters from the commencement of the string. The machine may include at least one match state which indicates that all character matches in the string required by at least one respective rule have been detected.

Abstract: A universal interface apparatus having a processor for receiving one or more Network Interface signals having a transport mechanism associated therewith. The transport mechanism may include Asynchronous Transfer Mode, Internet Protocol, Frame Relay, Integrated Services Digital Network, High bit-rate Digital Subscriber Line, Asymmetric Digital Subscriber Line, Very High Data Rate Digital Subscriber Line, Symmetric Digital Subscriber Line, 10 base T, 100 Base T, Gigabit Ethernet and E1/T1. The processor may recognize the transport mechanism associated with each Network Interface signal. In the event Asynchronous Transfer Mode is recognized as the transport mechanism, the processor may also segment perform Asynchronous Transfer Mode (ATM) adaptation layer processing on each Network Interface signal.