Abstract: A method for assessing risk associated with a request from an inquirer for allele frequency from a database of genetic data, comprising: (i) generating an allele database comprising allele frequency information and request frequency information for each of a plurality of alleles; (ii) generating an inquirer database comprising allele request information about a plurality of inquirers; (iii) receiving a request for genetic data from an inquirer, comprising a request for allele frequency for one or more alleles and an identifier of the inquirer; (iv) updating the request frequency information based on the received request; (v) updating the allele request information for the requesting inquirer; (vi) calculating an allele risk score; (vii) calculating an inquirer risk score; and (viii) assessing, based on the allele risk score and the inquirer risk score, a risk associated with the received request.

Abstract: Various embodiments relate to a method and apparatus for building a pedigree for a disease based on a family tree, the method comprising the steps of receiving, by a pedigree service, a family health condition request, transmitting, by the pedigree service, a request for the family tree, transmitting, by the pedigree service, a data request for health conditions of relatives on the family tree to an access control system, verifying, by the access control system, consent of the relatives on the family tree, receiving, by the pedigree service, health conditions of the relatives from a health data storage and drawing, by the pedigree service, a pedigree for the disease based on the health conditions of the relatives.

Abstract: The amount of genomic data as well the sensitivity of the information carried necessitates the need to develop smart and efficient ways to transmit genomic data in a secure way. While encryption schemes exist, there is also the need to first reduce the amount of massive information and then apply an encoding and encryption method that will be effective both in the economic sense as well as for security of genomic data. In this invention, we discuss novel techniques to encode processed variant information and send it across to a remote site ensuring covert transmission. The protocols not only encode and encrypts the information; it condenses the information that needs to be transferred.

Abstract: Methods and apparatus for a secure framework for storing and analyzing genomic data. Embodiments of the present invention apply persistent governance to sensitive information and to the analytics that operate upon it, managing the interaction between the two.

Abstract: A method for assessing risk associated with a request from an inquirer for allele frequency from a database of genetic data, comprising: (i) generating an allele database comprising allele frequency information and request frequency information for each of a plurality of alleles; (ii) generating an inquirer database comprising allele request information about a plurality of inquirers; (iii) receiving a request for genetic data from an inquirer, comprising a request for allele frequency for one or more alleles and an identifier of the inquirer; (iv) updating the request frequency information based on the received request; (v) updating the allele request information for the requesting inquirer; (vi) calculating an allele risk score; (vii) calculating an inquirer risk score; and (viii) assessing, based on the allele risk score and the inquirer risk score, a risk associated with the received request.

Abstract: The amount of genomic data as well the sensitivity of the information carried necessitates the need to develop smart and efficient ways to transmit genomic data in a secure way. While encryption schemes exist, there is also the need to first reduce the amount of massive information and then apply an encoding and encryption method that will be effective both in the economic sense as well as for security of genomic data. In this invention, we discuss novel techniques to encode processed variant information and send it across to a remote site ensuring covert transmission. The protocols not only encode and encrypts the information; it condenses the information that needs to be transferred.

Abstract: Methods and apparatus for a secure framework for storing and analyzing genomic data. Embodiments of the present invention apply persistent governance to sensitive information and to the analytics that operate upon it, managing the interaction between the two.

Abstract: A method of determining proximity between a root node and a leaf node in a network is presented. The method comprises computing a link proximity value between any two mutually connected nodes in the network. At an initial node, a proximity computation request message is sent containing a proximity counter to an intermediate node to which the initial node is connected. At an intermediate node, being connected to a first node and to a second node, upon receipt of the proximity computation request message containing a proximity counter from the first node, the computed link is added to a proximity value and passed on the proximity computation request message to the second node. At a final node, upon receipt of the proximity computation request message, the proximity between the root node and the leaf node is determined as the value indicated by the proximity counter.

Abstract: A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.

Abstract: A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.

Abstract: A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.

Abstract: The invention relates to a method of determining a proximity between a root node (301) and a leaf node (303) in a network. The method comprises computing a link proximity value between any two mutually connected nodes in the network, at an initial node, sending a proximity computation request message containing a proximity counter to an intermediate node to which said initial node is connected, at an intermediate node (302) being connected to a first node and to a second node, upon receipt of the proximity computation request message containing a proximity counter from the first node, adding the computed link proximity value to the proximity counter and passing on the proximity computation request message to the second node, at a final node, upon receipt of the proximity computation request message, determining the proximity between the root node and the leaf node as the value indicated by the proximity counter.

Abstract: A method and apparatus are disclosed for streaming XML content in a manner that allows the receiver to decode the XML data that is actually received, even if an entire XML document is not received. Each XML document is decomposed and encoded as a collection of sub-trees. Each sub-tree from the larger XML document tree can be parsed and validated by the XML receiver as if it is an independent tree. Each streamed XML document utilizes a structure node that serves as a sub-tree wrapper function around each independent sub-tree. The structure node indicates the relationship of the sub-tree to other sub-trees, thereby allowing the XML receiver to reconstruct the full tree.

Abstract: A video processing device and method for generating a descriptor data structure representative of a feature that has been selected from among of plurality of features including visual, conceptual, textual and graphical of a visual animated data file includes a user input unit for selecting a desired feature and generating an associated descriptor data containing attribute values, and a processor identifies the selected feature inserts selected attribute values into a standard descriptor template. Various types of features, from concepts about a video sequence, to age identification, to images in a video clip, to particular objects or colors can all be classified in a standard descriptor template, to provide uniformity in storing and retrieving the various features currently lacking in freeform or single feature descriptors.

Abstract: A decision support system for managing an agile supply chain including a server side and a client side. The server side includes a decision support system database that interfaces with a model engine that performs analysis of the data to support planning decisions. The server side also includes a server manager that coordinates requests for service and information. The client side includes decision frames that present the various view points available in the system to the users. A frame manager coordinates the requests from the decision support frames to access the needed data and models.

Abstract: A decision support system for the management of an agile supply chain that provides an architecture including a server side and a client side. The server side includes a decision support system database that interfaces with a model engine that performs analysis of the data to support planning decisions. The server side includes a server manager that coordinates requests for service and information. The client side includes decision frames that present the various view points available in the system to the users. A frame manager coordinates the requests from decision support frames to access the needed data and models. The decision support frames provide a view into the supply chain and integrate analytical models responsive to the view point of a business process such as demand management. The frames include a supply management frame, a demand management frame, a vendor managed replenishment frame, a Planning, Sales and Inventory planning frame, and a distribution network design frame.