Abstract:
In a computerized data mining context, user input relating to positive and negative information is incorporated into node proximity measurements on a weighted, directed graph. Starting from a source node, links are added to nodes for which positive feedback is received. Where negative information is received, a sink node is substituted for nodes receiving negative information. Nodes neighboring that sink node have links added to the sink. These changes yield an altered graph. Afterwards, proximity information is determined from the altered graph.
Abstract:
A scheduling system and method for high-performance computing (HPC) applications includes a network management component stored in physical memory and executed by a processor. The management component is configured to transform HPC resources into a schedulable resource catalog by transforming multi-dimensional HPC resources into a one dimension versus time resource catalog with a dependent graph structure between resources such that HPC resources are enabled to be provisioned into a service environment with predictable provisioning using the resource catalog. A graphical user interface component is coupled to the network management component and configured to provide scheduling visibility to entities and to enable a plurality of different communication modes for scheduling and communication between entities.
Abstract:
A plurality of requests for service are obtained, each of the requests specifying a description of work, at least one constraint, and at least one objective function. Each request is routed to a corresponding first target resource, according to a routing table, in a manner to satisfy the at least one constraint and the at least one objective function. Tracking is carried out to determine whether the first target resource accepts a given request, rejects the given request, or passes on the given request to a second resource. The routing table is updated based on the tracking.
Abstract:
Techniques for dispatching one or more services requests to one or more agents are provided. The techniques include obtaining one or more attributes of each service request, obtaining one or more attributes of each agent, obtaining feedback from each of one or more agent queues, and using the one or more attributes of each service request, the one or more attributes of each agent and the feedback from each of the one or more agent queues to determine one or more suitable agents to receive a dispatch for each of the one or more service requests. Techniques are also provided for generating a database of one or more attributes of one or more service requests and one or more attributes of one or more agents.
Abstract:
Techniques for dispatching one or more services requests to one or more agents are provided. The techniques include obtaining one or more attributes of each service request, obtaining one or more attributes of each agent, obtaining feedback from each of one or more agent queues, and using the one or more attributes of each service request, the one or more attributes of each agent and the feedback from each of the one or more agent queues to determine one or more suitable agents to receive a dispatch for each of the one or more service requests. Techniques are also provided for generating a database of one or more attributes of one or more service requests and one or more attributes of one or more agents.
Abstract:
A system and method for scheduling resources includes a memory storage device having a resource data structure stored therein which is configured to store a collection of available resources, time slots for employing the resources, dependencies between the available resources and social map information. A processing system is configured to set up a communication channel between users, between a resource owner and a user or between resource owners to schedule users in the time slots for the available resources. The processing system employs social mapping information of the users or owners to assist in filtering the users and owners and initiating negotiations for the available resources.
Abstract:
A method and system for ensuring the authenticity of server returned information displayed at a client browser is provided. The method comprises receiving the server returned information at a client computer; storing a copy of the server returned information at the client computer; inspecting the server returned information for one or more locked objects; allowing the client browser to operate one or more client installed scripts; inspecting the server returned information for any modifications to the one or more locked objects; and in response to determining that the one or more client installed scripts have made modifications to the one or more locked objects, replacing the modified locked objects with unmodified versions of the locked objects from the stored copy of the server returned information.
Abstract:
A plurality of equivalent representations of a process are identified. The process has a plurality of tasks. Each of the representations specifies a different order of the tasks. The plurality of equivalent representations are consolidated into a single representation. The single representation captures, in at least one flexible order grouping, at least two of the tasks that may be performed in more than one order. At least one constraint is specified for the at least one flexible order grouping. Techniques for merging two or more flexible representations are also provided.
Abstract:
A method (which can be computer implemented) for inferring component associations among a plurality of components in a distributed computing system includes the steps of obtaining status information for each pertinent component of the plurality of components, forming an N by D matrix, X, based on the status information, and factorizing the matrix X to obtain a first matrix indicative of the component associations to be inferred and a second matrix indicative of failure explanations for corresponding ones of the probe instances. N is a number of probe instances associated with a given time frame. D is a number of the plurality of components for which the associations are to be inferred. Techniques are also presented for forming a database with the status information.
Abstract:
Techniques for providing a reservation system are provided. The techniques include displaying a scalable visualization object, wherein the scalable visualization object comprises an expanded view element of the reservation system depicting information in connection with a selected interval of time and a compressed view element of the reservation system depicting information in connection with one or more additional intervals of time, maintaining a visual context between the expanded view and the compressed view within the visualization object, and enabling a user to switch between the expanded view and the compressed view to facilitate use of the reservation system.