Abstract: A secure search mechanism (or search engine) for use with content based information security repositories. The present invention may be embodied in an information security system or method. In accordance with the present invention, a search occurs in a protected device that contains classified metadata and addresses of encrypted headers relating to classified data or information objects. A search request comes in from a user in a particular access level and the search engine returns a set of addresses that are at appropriate access levels and satisfy the search criteria. These addresses are passed or transferred to another device that stores the encrypted headers, and the encrypted headers are sent to the user.

Abstract: Disclosed is an exemplary multiple hypothesis engine that provides situation assessment capabilities regarding cyber auto tactics techniques and procedures. Dynamic cyber adversarial operations are evaluated via a combination of techniques using a Bayesian multiple hypothesis tree, or graph, as a framework. A top-down probability propagation mechanism solves different aspects of the problem in a round-robin fashion. The top-down probability propagation mechanism comprises the Hypothesis Refinement Engine. A model-based abductive reasoner comprising The Hypothesis Validator is used to confirm or refute the refined hypothesis. A model-based learning engine comprising Behavior Model Trainer is used to incrementally augment the knowledge base of behavior models as new adversarial TTPs are discovered. These three techniques behave in a cooperative manner by operating upon the Bayesian multiple hypothesis tree framework.

Abstract: Precedence-based routing/rerouting algorithms or methods that work proactively and locally at each network node that engenders a collective restoral behavior that is uniquely rapid and anticipatory. The algorithms or methods are combined in a novel way with user precedence arbitration to provide superior performance in wireless dynamic ad hoc networks.

Abstract: Methods that perform message and real-time data and computational flow routing across networks comprised elements with a dynamic time-varying network topology and loading. The unique algorithms and protocols for allocation of network resources embodied in the present methods provide optimal performance for high precedence traffic while providing as good as possible performance for lower precedence traffic.

Abstract: Optical apparatus that uses optically-actuated optical switches in conjunction with an optical codeword addressing scheme to provide for time division multiplexing and demultiplexing of high data rate optical data. Optical codewords traveling simultaneously with the data on a separate wavelength, in conjunction with the optical switches, enable all-optical multiplexing and demultiplexing. The present invention can also switch packets of data while keeping the data entirely in the optical domain, and no optical to electrical conversions are necessary.

Abstract: Precedence-based routing/rerouting algorithms or methods that work proactively and locally at each network node that engenders a collective restoral behavior that is uniquely rapid and anticipatory. The algorithms or methods are combined in a novel way with user precedence arbitration to provide superior performance in wireless dynamic ad hoc networks.