Abstract:
Disclosed is a method for optimizing internet traffic flow through a web network including the steps of collecting content data corresponding to the content elements, determining a revenue value for each content element, calculating an overall content value for each content element based on the corresponding revenue value and revenue generated from subsequent traffic flow of a user during a visit to the web network, and modifying the web network based on the overall content value and the content data, so as to maximize the value of the web network. Also disclosed is a system for determining overall content values for a plurality of content elements including an analytic server for receiving content data corresponding to the content elements, and a processor for determining a revenue value for each content element, and to calculate an overall content value for each content element based on the corresponding revenue value and revenue generated from subsequent traffic flow of a user during a visit to the web network.
Abstract:
An archive cluster application runs in a distributed manner across a redundant array of independent nodes. Each node preferably runs a complete archive cluster application instance. A given nodes provides a data repository, which stores up to a large amount (e.g., a terabyte) of data, while also acting as a portal that enables access to archive files. Each symmetric node has a set of software processes, e.g., a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests to the node for data (i.e., file data), the storage manager manages data read/write functions from a disk associated with the node, and the metadata manager facilitates metadata transactions and recovery across the distributed database. The policy manager implements one or more policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. Preferably, the application permanently associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. As a result, the archive manages itself independently of client applications, acting automatically to ensure that all object policies are valid.
Abstract:
A system is disclosed. The system includes a first information handling system (“IHS”) for receiving, via a user input, data associated with an inspection of a home for energy efficiency, and outputting the data to a network. The system also includes a second IHS for receiving the data from the network, and in response to the data, generating a report.
Abstract:
A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN—C] where IN is an n×n identity sub-matrix and C is a k×n sub-matrix of code blocks. The identity sub-matrix is used to preserve the data blocks intact. The sub-matrix C preferably comprises a set of permutation ring operators that are used to generate the code blocks. The operators are preferably superpositions that are selected from a group ring of a permutation group with base ring Z2.
Abstract:
An archive cluster application runs in a distributed manner across a redundant array of independent nodes. Each node preferably runs a complete archive cluster application instance. A given nodes provides a data repository, which stores up to a large amount (e.g., a terabyte) of data, while also acting as a portal that enables access to archive files. Each symmetric node has a set of software processes, e.g., a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests to the node for data (i.e., file data), the storage manager manages data read/write functions from a disk associated with the node, and the metadata manager facilitates metadata transactions and recovery across the distributed database. The policy manager implements one or more policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. Preferably, the application permanently associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. As a result, the archive manages itself independently of client applications, acting automatically to ensure that all object policies are valid.
Abstract:
A method and apparatus for providing information to a plurality of users based on the relevancy of the information to the users are disclosed. An incoming message is received. Similarity scores are generated indicating similarities of the incoming message to features of a plurality of messages. Relevancy scores are generated for the plurality of users, the relevancy scores indicating relevancies of the incoming message to the plurality of users based on the similarity scores and a plurality of user profiles including information descriptive of the plurality of users' preferences for the features of the plurality of users. Message information derived from the incoming message, the relevancy scores, and the plurality of user profiles is delivered to at least some of the plurality of users.
Abstract:
A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN—C] where IN is an n×n identity sub-matrix and C is a k×n sub-matrix of code blocks. The identity sub-matrix is used to preserve the data blocks intact. The sub-matrix C preferably comprises a set of permutation ring operators that are used to generate the code blocks. The operators are preferably superpositions that are selected from a group ring of a permutation group with base ring Z2.
Abstract:
Systems, devices, and methods for software development or modification. The disclosed technology relates to transforming interactions with physical blocks by a human developer on an activity surface into computer-understandable digital information or logic for developing or modifying software (e.g., websites or mobile applications) in real-time or near real-time. The physical blocks are representative of software elements used in software development. For example, the structures, colors, shapes or hardness/softness/squeeze/bend/flex/elastic/shape-memory/rigid properties, whether symmetrical or asymmetrical, whether open-shaped or close-shaped of the physical blocks can determine which software elements are being developed and the arrangement of the blocks can be mapped to how the software elements are to be included in the software. Users located remotely from the developer can provide annotations or feedback to the software being developed in real-time.
Abstract:
Embodiments of the present invention involve a refill apparatus comprising at least one pump, a plurality of reservoirs, a plurality of reservoir fluid channels each associated with one of the reservoirs, a plurality of valves, each having a cracking pressure, for fluidically sealing the reservoir fluid channels and the outlet fluid channel, an outlet fluid channel fluidically connected to the reservoir fluid channels, and a needle having a lumen in fluid communication with the outlet fluid channel. A parameter such as a pressure level is monitored, and one or more pumps and various ones of the valves are actuated in accordance with a protocol comprising a sequence of steps whereby fluidic pathways are opened between different ones of the reservoirs and the needle in a washing and filling sequence, each of the steps being associated with an expected pressure level.
Abstract:
Embodiments of the present invention involve a refill apparatus comprising at least one pump, a plurality of reservoirs, a plurality of reservoir fluid channels each associated with one of the reservoirs, a plurality of valves, each having a cracking pressure, for fluidically sealing the reservoir fluid channels and the outlet fluid channel, an outlet fluid channel fluidically connected to the reservoir fluid channels, and a needle having a lumen in fluid communication with the outlet fluid channel. A parameter such as a pressure level is monitored, and one or more pumps and various ones of the valves are actuated in accordance with a protocol comprising a sequence of steps whereby fluidic pathways are opened between different ones of the reservoirs and the needle in a washing and filling sequence, each of the steps being associated with an expected pressure level.