Abstract: A radioactive containment composition may be created for containing radionuclides from a radioactive material by mixing a clay mineral with water. This mixture may form an aqueous clay suspension, which in turn can be refined by filtering to remove coarse material. The aqueous clay suspension may be applied to a radioactive material, allowing the radionuclides to be exchanged with cations in the aqueous clay suspension. The resulting aqueous slurry may be collected, heated and analyzed.

Abstract: An egocentric display that corresponds to a multidimensional frame of reference. The multidimensional frame of reference may include an ego center, a nadir below the ego center, and a zenith above the ego center. The egocentric display includes a center point, an inner concentric circle and an outer concentric circle. The center point represents the nadir. The inner concentric circle is centered about the center point and represents a horizon plane that is perpendicular to a zenith-nadir line that passes through the zenith, the ego center, and the nadir. The outer concentric circle that represents the zenith should have a radius larger that the inner concentric circle and should also be centered about the center point.

Abstract: Disclosed is a system for modeling, analyzing, and responding to network attacks. Machines are mapped to components, components are mapped to vulnerabilities, and vulnerabilities are mapped to exploits. Each of the exploits includes at least one precondition mapped to at least one postcondition. An attack graph which defines inter-exploit distances is generated using at least one of the exploits. The attack graph is aggregated. At least one hardening option is determined using the aggregated attack graph. Hardening options include applying at least one corrective measure to at least one initial condition, where the initial condition is the initial state of a precondition.

Abstract: A multidimensional sensor data analyzer that includes: discretizing values in multidimensional sensor data at index locations in value surfaces that reside in a multidimensional value space; deriving surface components resulting from the intersection of a geometric beam shape function that describing the sensor beam with the value surfaces; determining minimum-maximum index location limits for the surface components; determining surface component index points by identifying the index locations that are located within the minimum-maximum index location limits for the surface components; and generating a beam value by performing a beam function using the values at the surface component index points.

Abstract: Disclosed is a temporally threaded copyright management information watermark where fragile watermarks containing CMI are spread throughout a digital work temporally. In one embodiment of this invention, the copyright management information is divided into a multitude of copyright management information subparts; the copyright management subparts are applied to fragile sub-watermarks; and fragile watermarks are applied to temporally separated portions of the digital work.

Abstract: An interval centroid-based watermark encoder encodes a watermark into a packet flow. Intervals are defined for the packet flow. Some of the intervals are selected as group A intervals while other intervals are selected as group B intervals. Group A and group B intervals are paired and assigned to watermark bits. A first or second value may be encoded by increasing the relative packet time between packets in either the group A (for the first bit value) or group B (for the second bit value) interval(s) of the interval pair(s) assigned to the watermark bits that are to represent the first or second bit value and the beginning of the same group interval(s). The relative packet times may be measured by a decoder and used to calculate a centroid difference for each interval pair. The centroid differences may be used to reconstruct the watermark.

Abstract: A packet flow side channel encoder and decoder embeds and extracts a side channel communication in an overt communication data stream transmitted over a network. The encoder selects more than one group of related packets being transmitted on the network, relates a packet of one group to a packet of another group to form a pair of packets; and delays the timing of at least one packet from each pair of packets The decoder determines inter-packet delays that are the difference in timing between two packets in a pair of packets; determines at least one inter-packet delay difference between two or more determined inter-packet delays; and extracts a bit using the at least one interpacket delay difference.

Abstract: Disclosed is a system for correlating intrusion events using attack graph distances. The system includes an attack graph generator, an exploit distance calculator, an intrusion detector, an event report/exploit associator, an event graph creator, an event graph distance calculator, a correlation value calculator, and a coordinated attack analyzer. An attack graph is constructed for exploits and conditions in a network. The exploit distance calculator determines exploit distances for exploit pair(s). The intrusion detector generates event. Events are associated with exploits. Event graph distances are calculated. Correlation values are calculated for event pair(s) using event graph distances. The correlation values are analyzed using a correlation threshold to detect coordinated attacks.

Abstract: Disclosed is a fragile watermarking scheme for detecting and localizing malicious alterations made to a database relation with categorical attributes without introducing distortions to cover data. A watermark for a tuple group may be inserted by selectively switching the position of tuples in tuple pairs using a tuple hash associated with each tuple in the tuple pair; and a corresponding bit in a watermark derived from the tuple group using a embedding key, a primary key and hash functions.

Abstract: Disclosed is a geographic information system which comprises a multithreading client and a multithreading server cluster. The multithreading client includes at least one user interface, at least one client coordinator, map data, at least one map manager, at least one client-side spatial analyzer, at least one cache manager, at least one data requester, and at least one information communicator. The multithreading server cluster includes: at least one servlet, at least one image accessor, at least one map configuration mechanism; at least one data storage access mechanism, at least one data source manager, and at least one server-side spatial manager.

Abstract: An interval centroid-based watermark encoder encodes a watermark into a packet flow. Intervals are defined for the packet flow. Some of the intervals are selected as group A intervals while other intervals are selected as group B intervals. Group A and group B intervals are paired and assigned to watermark bits. A first or second value may be encoded by increasing the relative packet time between packets in either the group A (for the first bit value) or group B (for the second bit value) interval(s) of the interval pair(s) assigned to the watermark bits that are to represent the first or second bit value and the beginning of the same group interval(s). The relative packet times may be measured by a decoder and used to calculate a centroid difference for each interval pair. The centroid differences may be used to reconstruct the watermark.

Abstract: A system and method for processing a client request using single use virtual servers. The method: receives the client request from a network; passes the client request to a new virtual incoming client request server; passes an application request from the virtual incoming client request server to a new virtual application server; destroys the virtual incoming client request server; passes an application result from the virtual application server to a new virtual outgoing client result server; destroys the new virtual application server; passes the application result from the new virtual outgoing client request server to the network; and destroys the virtual outgoing client request server.

Abstract: Retinal images can be classified by selecting a classifier and a figure of merit for quantifying classification quality; selecting a transform to generate features from input data; using a recursive process of functional dissipation to generate dissipative features from the features generated according to the transform; computing the figure of merit for all of the dissipative features generated; searching for at least one of the dissipative features that maximize the figure of merit on a training set; and classifying a test set with the classifier by using the “at least one of the dissipative features.

Abstract: A watermarking system embeds a watermark into data values that may be streamed. A data hash is calculated using data values and a hash key. The data values are grouped. The groups include a first group and a second group. A first group hash is calculated using data values in the first group and a first group hash key. A second group hash is calculated using data values in the second group and a second group hash key. A watermark is constructed based on the first group hash and the second group hash. The value of at least one of the data values in the first group is modified using the watermark.

Abstract: An episode classification system including a multitude of diagnosis records. Each of the diagnosis records includes diagnoses information, time of diagnoses information, and patient information. A patient grouper generates at least one patient group by grouping patient records having similar patient information. A diagnosis grouper generates at least one diagnosis group from a patient group by grouping patient records from a patient group that have similar diagnosis information. An episode analyzer includes a probability analyzer, an episode grouper, and a severity analyzer. The probability analyzer performs probability calculations capable of generating a probability value using at least two of the diagnosis records as input entries. The probability value represents the probability that the input entries belong to a single episode. The episode grouper groups diagnosis records determined to belong to a single episode.

Abstract: A multidimensional sensor data analyzer that includes: discretizing values in multidimensional sensor data at index locations in value surfaces that reside in a multidimensional value space; deriving surface components resulting from the intersection of a geometric beam shape function that describing the sensor beam with the value surfaces; determining minimum-maximum index location limits for the surface components; determining surface component index points by identifying the index locations that are located within the minimum-maximum index location limits for the surface components; and generating a beam value by performing a beam function using the values at the surface component index points.

Abstract: A computer implemented method and system for assessing the risk of an anthropogenic event are disclosed. An anthropogenic event is defined and recursively decomposed into causal conditions with ascertainable probabilities. The causal conditions and probabilities are transformed into a comprehensive probability of the event. The risk related to the occurrence of the event, such as a monetary loss, is computed based on its derived probability.

Abstract: Disclosed is framework for aggregating network attack graphs. A network may be represented as a dependency graph. Condition set(s), exploit set(s) and machine set(s) may be generated using information from the dependency graph. Exploit-condition set(s) may be generated using the condition set(s) and the exploit set(s). Machine-exploit set(s) may be generated using the exploit-condition set(s) and machine set(s).

Abstract: A cellular network base station configured to operate in a cellular network having a service area divided into a multitude of cells through which mobile terminals can move through. The base station is configured to forwarding packets to and from the mobile terminals. The base station forwards packets to at least one label switching node. There is a means for determining a label switched path for directing packets between nodes and the base station. There is also a means for attaching a label to the packets. The label includes the label switched path and control information. Nodes forward the label switched packet along the label switched path. The base station uses wireless technology to communicate with the mobile terminals. The wireless technology uses a protocol layer architecture including a wireless physical layer; a wireless medium access control protocol layer; a radio link control layer; and a network layer.

Abstract: Disclosed is an interactive closed loop data entry mechanism with real-time graphical feedback. The mechanism includes a spatial display processor, a graphical feedback mechanism, an entry interface, a value updater, and a connected-system-interface.