Patent application number | Description | Published |
20100174686 | Generating Equivalence Classes and Rules for Associating Content with Document Identifiers - A system of reducing the possibility of crawling duplicate document identifiers partitions a plurality of document identifiers into multiple clusters, each cluster having a cluster name and a set of document parameters. The system generates an equivalence rule for each cluster of document identifiers, the rule specifying which document parameters associated with the cluster are content-relevant. Next, the system groups each cluster of document identifiers into one or more equivalence classes in accordance with its associated equivalence rule, each equivalence class including one or more document identifiers that correspond to a document content and having a representative document identifier identifying the document content. | 07-08-2010 |
20100191856 | REDUCING NETWORK CONNECTION LATENCY - Methods, systems, and apparatus, including medium-encoded computer program products, for decreasing latency perceived by a user in retrieving data from a data server. A user-initiated interaction with a user interface can be detected and a user-generated request to retrieve data automatically predicted, based at least in part on the user-initiated interaction. Resolution of a domain name into a network address can be initiated, based on the predicted user-generated request to retrieve data, prior to receiving a user-initiated submission of the user-generated request to retrieve data. In certain instances, a network communication synchronization sequence with a data server associated with the predicted user-generated request to retrieve data can be initiated prior to receiving a user-initiated submission of the user-generated request to retrieve data. | 07-29-2010 |
20120254721 | METHODS AND SYSTEMS FOR GENERATING AND DISPLAYING A PREVIEW IMAGE OF A CONTENT AREA - Systems, methods and articles of manufacture for generating and displaying a preview image of a content area are described herein. An embodiment includes rendering an image representing the content area requested by a browser, providing the rendered image to the browser for display, and enabling the browser to display the requested content area in place of the rendered image when the content area is received by the browser. The method further includes updating language defining the requested content area to reference the rendered image and to enable transition from a display of the rendered image to a display of the requested content area, and providing the updated language to the browser to enable the browser to display the rendered image while the requested content area is being provided to the browser. | 10-04-2012 |
20120254727 | METHODS AND SYSTEMS FOR GENERATING AND DISPLAYING A PREVIEW IMAGE OF A CONTENT AREA - Systems, methods and articles of manufacture for generating and displaying a preview image of a content area are described herein. An embodiment includes rendering an image representing the content area requested by a browser, providing the rendered image to the browser for display, and enabling the browser to display the requested content area in place of the rendered image when the content area is received by the browser. The method further includes updating language defining the requested content area to reference the rendered image and to enable transition from a display of the rendered image to a display of the requested content area, and providing the updated language to the browser to enable the browser to display the rendered image while the requested content area is being provided to the browser. | 10-04-2012 |
Patent application number | Description | Published |
20110295763 | MULTI-ATTRIBUTE SYSTEM FOR PROJECT PLANNING - A method of planning a project includes receiving project requirements for a project to be planned and assigning scores to the project requirements based on user preferences associated with the attributes of the requirements. The method further includes generating a numerical model of the project based on the scored requirements and optimizing the score of the numerical model to generate a matching solution that matches the project requirements to vendor offerings. | 12-01-2011 |
20120095805 | ACQUIRING CUSTOMER INSIGHT IN A RETAIL ENVIRONMENT - The present disclosure provides a computer-implemented method of acquiring customer insight information in a retail environment. The method includes receiving a product interaction from a mobile device, the product interaction comprising a product identifier corresponding to a product located in the retail environment. The method also includes determining a customer location within the retail environment based on a planned location of the product. The method also includes performing a business action based, at least in part, on the product interaction. The method also includes storing customer insight information corresponding to the product interaction to a data structure. | 04-19-2012 |
20130246109 | SYSTEM, ARTICLE, AND METHOD FOR ANNOTATING RESOURCE VARIATION - A system and article are disclosed for annotating resource variation. In one example, the system discloses an installation | 09-19-2013 |
20140372574 | SYSTEMS AND METHODS FOR REMOTE DEVICE CONFIGURATION - Systems and methods for remote device configuration is provided. In one embodiment, a method comprises outputting, from a computer, to a first computing device, configuration options for a second computing device; receiving, at the computer, from the first computing device, configuration data associated with the configuration options for the second computing device; associating a first security identifier with the configuration data for the second computing device; and in response to a request for the configuration data for the second computing device, outputting, from the computer, to the second computing device, the configuration data for the second computing device. | 12-18-2014 |
Patent application number | Description | Published |
20120159094 | ASSIGNING READ REQUESTS BASED ON BUSYNESS OF DEVICES - Techniques are provided for assigning read requests to storage devices in a manner that reduces the likelihood that any storage device will become overloaded or underutilized. Specifically, a read-request handler assigns read requests that are directed to each particular item among the storage devices that have copies of the item based on how busy each of those storage devices is. Consequently, even though certain storage devices may have copies of the same item, there may be times during which one storage device is assigned a disproportionate number of the reads of the item because the other storage device is busy with read requests for other items, and there may be other times during which other storage device is assigned a disproportionate number of the reads of the item because the one storage device is busy with read request for other items. Various techniques for estimating the busyness of storage devices are provided, including fraction-based estimates, interval-based estimates, and the response-time-based estimates. Techniques for smoothing those estimates, and for handicapping devices, are also provided. | 06-21-2012 |
20150363123 | ASSIGNING READ REQUESTS BASED ON BUSYNESS OF DEVICES - Techniques are provided for assigning read requests to storage devices in a manner that reduces the likelihood that any storage device will become overloaded or underutilized. Specifically, a read-request handler assigns read requests that are directed to each particular item among the storage devices that have copies of the item based on how busy each of those storage devices is. Consequently, even though certain storage devices may have copies of the same item, there may be times during which one storage device is assigned a disproportionate number of the reads of the item because the other storage device is busy with read requests for other items, and there may be other times during which other storage device is assigned a disproportionate number of the reads of the item because the one storage device is busy with read request for other items. Various techniques for estimating the busyness of storage devices are provided, including fraction-based estimates, interval-based estimates, and the response-time-based estimates. Techniques for smoothing those estimates, and for handicapping devices, are also provided. | 12-17-2015 |
Patent application number | Description | Published |
20120201153 | ADAPTIVE TECHNIQUES FOR FULL DUPLEX COMMUNICATIONS - In one aspect there is provided a method. The method may include receiving a first analog radio frequency signal including a signal of interest and an interference signal caused by a second analog radio frequency signal transmitted in full duplex over a channel from which the first analog transmission is received; adjusting at least one of the first analog radio frequency signal and a portion of the second analog radio frequency signal to enable at least one of a reduction or an elimination of the interference signal in an output analog radio frequency signal; combining the first analog radio frequency signal and the portion of the second analog radio frequency signal to generate the output analog radio frequency signal characterized by at least the reduction or the elimination of the interference signal included in the output analog radio frequency signal; and providing the output analog radio frequency signal. Related apparatus, systems, methods, and articles are also described. | 08-09-2012 |
20120201173 | SINGLE CHANNEL FULL DUPLEX WIRELESS COMMUNICATIONS - In one aspect there is provided a method. The method may include receiving a first analog radio frequency signal including a signal of interest and an interference signal caused by a second analog radio frequency signal transmitted in full duplex over a channel from which the first analog transmission is received; combining the first analog radio frequency signal and a portion of the second analog radio frequency signal to generate an output analog radio frequency signal characterized by at least a reduction or an elimination of the interference signal included in the output analog radio frequency signal; and providing the output analog radio frequency signal. Related apparatus, systems, methods, and articles are also described. | 08-09-2012 |
20140169236 | FEED FORWARD SIGNAL CANCELLATION - A circuit that cancels a self-interference signal includes, in part, a pair of signal paths that are substantially in phase, each of which paths includes a passive coupler, a delay element and a variable attenuator. The circuit further includes, in part, a first group of P signal paths each of which is substantially in phase with the pair of paths, and a second group of M signal paths each of which is substantially out-of-phase relative to the pair of signal paths. Each of the P and M signal paths includes a delay element and a variable attenuator. Furthermore, (P−1) signal paths of the first group of P signal paths, and (M−1) signal paths of the second group of M signal paths include a passive coupler. Optionally, each of the M signal paths is optionally 180° out-of-phase relative to the pair of signal paths. | 06-19-2014 |
20140204808 | TUNING ALGORITHM FOR MULTI-TAP SIGNAL CANCELLATION CIRCUIT - A self-interference signal cancellation circuit includes a transmitter for transmitting a transmit signal, a plurality of signal paths, a controller, and a receiver for receiving a signal. Each signal path includes a delay element and a variable attenuator having attenuation levels set by the controller. A combiner generates an output signal by combining outputs of the signal paths. The circuit computes a matrix based on first and second output signals associated with first and second attenuation levels. The controller concurrently varies the attenuation level of each signal path so that a product of the matrix and the attenuation levels of the signal paths is substantially equal to the received signal. The circuit may iteratively compute the matrix using different transmit signal frequencies or with an FFT. The controller iteratively varies the attenuation level of the attenuators until a sum of the product and the received signal satisfies a predefined condition. | 07-24-2014 |
20140219139 | SIGNAL CANCELLATION USING FEEDFORWARD AND FEEDBACK PATHS - A circuit that cancels a self-interference signal includes, in part, a pair of signal paths that are substantially in phase, each of which paths includes a passive coupler, a delay element and a variable attenuator. The circuit further includes, in part, a first group of P signal paths each of which is substantially in phase with the pair of paths, a second group of M signal paths each of which is substantially out-of-phase relative to the pair of signal paths, and at least a pair of feedback paths. Each of the P and M signal paths, as well as the feedback paths includes a delay element and a variable attenuator. Optionally, each of the M signal paths is optionally 180° out-of-phase relative to the pair of signal paths. | 08-07-2014 |
20150063176 | FULL-DUPLEX RELAYS - A relay including a first transmitter that converts a first digital transmit signal to a first analog transmit signal, a first receiver that converts a first analog receive signal to a first digital receive signal, a second transmitter that converts a second digital transmit signal to a second analog transmit signal, a second receiver that converts a second analog receive signal to a second digital receive signal, and a self-interference canceller that generates a first self-interference cancellation signal based on at least one of the first digital transmit signal and the first analog transmit signal, and combines the first self-interference cancellation signal with at least one of the first digital receive signal and the first analog receive signal. | 03-05-2015 |
20150280893 | SYSTEMS AND METHODS FOR NEAR BAND INTERFERENCE CANCELLATION - A method for self-interference canceller tuning for a near band radio includes receiving, in a first frequency band, an RF transmit signal of the near band radio; receiving, in a second frequency band, an RF receive signal of the near band radio; generating a self-interference cancellation signal from the RF transmit signal based on a set of configuration parameters; combining the self-interference cancellation signal with the RF receive signal to create a composite receive signal; and adapting the set of configuration parameters based on the composite receive signal. | 10-01-2015 |
20150341125 | SYSTEMS AND METHODS FOR MULTI-RATE DIGITAL SELF-INTERFERENCE CANCELLATION - A system for multi-rate digital self-interference cancellation including a signal component generation system coupled to a digital transmit signal of a communication system that generates a set of signal components from the digital transmit signal; a multi-rate adaptive filter that transforms the set of signal components into a digital self-interference cancellation signal, according to a transform configuration, to form an interference-reduced receive signal; and a transform adaptor that dynamically sets the transform configuration in response to changes in the interference-reduced receive signal. | 11-26-2015 |
20160112226 | SYSTEMS FOR ANALOG PHASE SHIFTING - A system for phase shifting that produces an output signal by modifying a phase of an input signal, including a primary phase shifting stage that modifies the input signal phase in increments set by a first tuning resolution; a secondary phase shifting stage that modifies the input signal phase in increments set by a second tuning resolution; and, a tuning circuit that controls the primary phase shifting stage and the secondary phase shifting stage according to control input. | 04-21-2016 |
Patent application number | Description | Published |
20110063972 | Duplicate traffic avoidance in a point to multi-point network - Provided is a method for avoiding traffic duplication in a point to multi-point network, the method including monitoring a status of first interconnection links in a first data path from a source to a destination, the first data path including an ingress node, an egress node, and one or more intermediate nodes. The method further includes establishing a second data path if a link of the first interconnecting links is determined to be an inoperable link, the second data path including the ingress node, the egress node, at least one of the one or more intermediate nodes and second interconnecting links, the second interconnecting links including new interconnecting links and a subset of the first interconnecting links, the subset not including the inoperable link in the first interconnecting links. | 03-17-2011 |
20110063973 | Fast upstream source failure detection - One example embodiment of the method includes receiving first control packets, by a first node, from a source node. The first control packets indicate the status of the source node. Whether the source node is operational and if a connection path between the first node and the source node is operational is determined based on the received first control packets. The method further includes sending a second control packet to a downstream node if the source node is non-operational, or the connection is non-operational. The second control packet includes at least one value indicating the source node is unreliable. | 03-17-2011 |
20120026866 | METHOD AND APPARATUS FOR RAPID SWITCHOVER FROM PRIMARY TO STANDBY MULTICAST TREES - A capability is provided for switching between primary and standby multicast trees on a network egress node of a multicast network. The network egress node includes a first MPLS LABEL Record including a first tree identifier of the first multicast tree, a second MPLS LABEL Record including a second tree identifier of the second multicast tree, and a MULTICAST Record including a plurality of primary tree identifiers and a plurality of standby tree identifiers. The MPLS LABEL Records include parameters, respectively, where the values of the parameters are indicative of respective packet processing rules to be applied for determining whether to accept or discard packets. When the parameter of an MPLS LABEL Record is set to a first value, a determination as to whether to accept or discard a packet received via the associated multicast tree is performed by comparing the tree identifier of the MPLS LABEL Record only to primary tree identifiers of the MULTICAST Record. When the parameter of an MPLS LABEL Record is set to a second value, a determination as to whether to accept or discard a packet received via the associated multicast tree is performed by comparing the tree identifier of the MPLS LABEL Record to primary tree identifiers of the MULTICAST Record or standby tree identifiers of the MULTICAST Record. | 02-02-2012 |
20120033667 | METHOD AND APPARATUS FOR PERFORMING MULTICAST TRACES IN MPLS NETWORKS - A multicast path trace capability is provided for tracing a multicast path from a root node to a leaf node where the trace originates at the leaf node. The leaf node sends a multicast trace request to the root node. The root node receives the multicast trace request and initiates a path trace request for collecting path information associated with the multicast path. The root node receives at least one path trace response, in response to the path trace request, which includes path information associated with the multicast path. The root node sends a multicast trace response, including the collected path information, to the leaf node. The leaf node receives the multicast trace response including the path information. The leaf node derives end-to-end path information for the multicast path using the path information received in the multicast trace response. The multicast path trace capability may be used for tracing an MPLS multicast path (e.g., a P2MP LSP) from a root node to a leaf node of the MPLS multicast tree. The multicast path trace capability may be used for tracing multicast paths in other types of multicast networks. | 02-09-2012 |
20130322291 | SYSTEM AND METHOD FOR EFFICIENT MVPN SOURCE REDUNDANCY WITH S-PMSI - A system, method and apparatus for source redundant MVPN in which a number of Interface Indices is reduced by leaf node Incoming Label Maps (ILM) including one or more Interface Indices common to multiple tunnels. | 12-05-2013 |
20140029414 | SYSTEM, METHOD AND APPARATUS FOR SIGNALING AND RESPONDING TO ERO EXPANSION FAILURE IN INTER-DOMAIN TE LSP - A system, method and apparatus for performing a constraint base shortest path computation (CSPF) in a manner excluding those nodes indicated as having failed an ERO expansion, the indication being provided via an error code within an RSVP path message associated with setup of an alternate LSP. | 01-30-2014 |
20140269737 | SYSTEM, METHOD AND APPARATUS FOR LSP SETUP USING INTER-DOMAIN ABR INDICATION - A system, method and apparatus for causing network routers such as Area Border Routers (ABRs) to perform an ERO expansion in response to ERO expansion trigger indicia included within an RSVP Path message. | 09-18-2014 |
20140301392 | NETWORK DEVICE WITH TUNNEL ESTABLISHMENT CONTROL BASED ON SITE-TYPE ATTRIBUTE RECEIVED FROM OTHER NETWORK DEVICE - In one embodiment, a first network device is configured to receive from a second network device a site-type attribute of the second network device, and to control establishment of a tunnel between the first network device and the second network device based at least in part on the received site-type attribute. The site-type attribute may be received in the first network device as part of a Border Gateway Protocol (BGP) message transmitted by the second network device to the first network device, and may comprise a Multicast Virtual Private Network (MVPN) site-type attribute indicating whether the second network device is a sender site of the MVPN. Controlling establishment of the tunnel between the first network device and the second network device may comprise preventing setup of the tunnel if the received site-type attribute indicates that the second network device is a sender site of the MVPN. | 10-09-2014 |
20140348006 | System and Method for Detecting a Virtual Extensible Local Area Network (VXLAN) Segment Data Path Failure - Methods and apparatuses for determining a VXLAN data path failure are provided. In an embodiment, a first data packet comprising an echo request is generated at an originating tunnel end point device in a network. The echo request includes a VXLAN network identifier (VNI) associated with a selected VXLAN segment. A second data packet is generated comprising a header having a format associated with a VXLAN technology, the header comprising a network identifier portion including the VXLAN network identifier (VNI). The first data packet is encapsulated in the second data packet, and the second data packet is transmitted via the selected VXLAN segment. | 11-27-2014 |
20140348167 | SYSTEM AND METHOD FOR TRANSMITTING AN ALERT USING A NETWORK VIRTUALIZATION USING GENERIC ROUTING ENCAPSULATION (NVGRE) TUNNELING MECHANISM - A data packet comprising a header, the header having a format associated with a Network Virtualization Using Generic Routing Encapsulation (NVGRE) technology is generated at an originating tunnel end point device in a network. A predetermined bit in a reserved portion of the header is set to a predetermined value. In one embodiment, the reserved portion comprises a Reserved0 portion of the data packet. The data packet is then transmitted. | 11-27-2014 |
20140348168 | SYSTEM AND METHOD FOR TRANSMITTING AN ALERT USING A VIRTUAL EXTENSIBLE LAN (VXLAN) TUNNELING MECHANISM - A data packet comprising a header, the header having a format associated with a Virtual Extensible LAN (VXLAN) technology is generated at an originating tunnel end point device in a network. A predetermined bit in a reserved portion of the header is set to a predetermined value. The data packet is then transmitted. | 11-27-2014 |
20140351645 | System and Method for Detecting a Network Virtualization Using Generic Routing Encapsulation (NVGRE) Segment Data Path Failure - Methods and apparatuses for determining an NVGRE data path failure are provided. In an embodiment, a first data packet comprising an echo request is generated at an originating tunnel end point device in a network. The echo request includes an NVGRE network identifier (VSID) associated with a selected NVGRE segment. A second data packet is generated comprising a header having a format associated with an NVGRE technology, the header comprising a network identifier portion including the NVGRE network identifier (VSID). The first data packet is encapsulated in the second data packet, and the second data packet is transmitted via the selected NVGRE segment. | 11-27-2014 |
20140355423 | SYSTEM AND METHOD FOR RAPID PROTECTION OF RSVP BASED LSP - Various exemplary embodiments relate to a method performed by a network node in a resource reservation protocol (RSVP) based label switch path (LSP) network, the method including: receiving a message to establish a LSP; receiving a resv message; initiating the establishment of a backup path; determining that the establishment of the backup path failed; setting a backup timer; and initiating the establishment of a backup path upon the expiration of the backup timer. | 12-04-2014 |
20150188814 | SYSTEM, METHOD AND APPARATUS PROVIDING BI-DIRECTIONAL FORWARDING DETECTION SUPPORT TO UNNUMBERED IP INTERFACES - A system, method and apparatus providing BFD support to unnumbered IP Interfaces in MPLS networks using a newly defined interface identifier (IF-ID) sub-object included within one or more BFD protocol messages to extend the use of BFD protocol to unnumbered IP interfaces. | 07-02-2015 |
Patent application number | Description | Published |
20120005467 | Streaming Virtual Machine Boot Services Over a Network - Embodiments of the invention are directed to streaming virtual machine boot services over a network. An aspect of the invention includes booting a first virtual machine and recording data and metadata from a virtual machine boot image into a virtual machine boot file. The data and metadata are accessed in the process of booting the first virtual machine. The virtual machine boot image has setup information of the virtual machine type of the first virtual machine. The virtual machine boot file is configured for the virtual machine type of the first virtual machine. A descriptor is added to metadata of the virtual machine boot image, which references a location of the virtual machine boot file for the virtual machine type of the first virtual machine. When subsequently booting a second virtual machine of the same type of virtual machine as the first virtual machine, data are streamed from the virtual machine boot file to a virtual machine monitor of a second virtual machine without the need to stream data from the virtual machine boot image. | 01-05-2012 |
20120042033 | MIGRATING VIRTUAL MACHINES ACROSS NETWORK SEPARATED DATA CENTERS - Embodiments of the present invention provide an approach for migrating virtual machines across network (e.g., WAN) separated data centers (e.g., storage clouds). Specifically, under embodiments of the present invention, a first storage system associated with a first data center is synchronized with a second storage system associated with a second data center via a storage system link. Then, a minimal state of a virtual machine is migrated from a first computer in the first data center to a second computer in the second data center via a WAN link. Using the minimal state, the virtual machine is stored in the second computer. Thereafter, the storage system link is terminated. In addition, as updated pages are received in memory of the first computer, they are migrated to the second computer via the WAN link. Once this migration is complete, the WAN link can be terminated. Therefore, embodiments of the present invention provide at least two forms of synchronization: computational synchronization and storage synchronization. | 02-16-2012 |
20120047394 | HIGH-AVAILABILITY COMPUTER CLUSTER WITH FAILOVER SUPPORT BASED ON A RESOURCE MAP - Embodiments of the invention relate to handling failures in a cluster of computer resources. The resources are represented as nodes in a dependency graph in which some nodes are articulation points and the removal of any articulation point due to a resource failure results in a disconnected graph. The embodiments perform a failover when a resource corresponding to an articulation point fails. The failover is to a local resource if the failed resource does not affect all local resources. The failover is to a remote resource if no local resource can meet all resource requirements of the failed resource, and to a remote resource running in a degraded mode if the remote resource cannot meet all of the requirements. | 02-23-2012 |
20160062795 | MULTI-LAYER QOS MANAGEMENT IN A DISTRIBUTED COMPUTING ENVIRONMENT - A technique for multi-layer quality of service (QoS) management in a distributed computing environment includes: receiving a workload to run in a distributed computing environment; identifying a workload quality of service (QoS) class for the workload; translating the workload QoS class to a storage level QoS class; scheduling the workload to run on a compute node of the environment; communicating the storage level QoS class to a workload execution manager of the compute node; communicating the storage level QoS class to one or more storage managers of the environment, the storage managers managing storage resources in the environment; and extending, by the storage managers, the storage level QoS class to the storage resources to support the workload QoS class. | 03-03-2016 |
20160065492 | MULTI-LAYER QOS MANAGEMENT IN A DISTRIBUTED COMPUTING ENVIRONMENT - A system for multi-layer quality of service (QoS) management in a distributed computing environment includes: a management node hosting a workload scheduler operable to receive a workload and identify a workload QoS class for the workload; and a plurality of distributed compute nodes, the workload scheduler operable to schedule running of the workload on the compute nodes. The workload scheduler is operable to: translate the workload QoS class to a storage level QoS class; communicate the storage level QoS class to a workload execution manager of the compute nodes; and communicate the storage level QoS class to one or more storage managers, the storage managers managing storage resources. The storage managers are operable to extend the storage level QoS class to the storage resources to support the workload QoS class. | 03-03-2016 |
Patent application number | Description | Published |
20100185503 | Product Warranties Having a Residual Value - The present disclosure is directed to product warranties having a residual value and a potential rebate based on the residual value. The residual value can thus be inversely related to the number of claims filed against the warranty. | 07-22-2010 |
20110202382 | WORKFORCE PLANNING - Systems, methods, and other embodiments associated with workforce planning. One example method includes receiving a project data associated with a project opportunity. The project data includes a probability data. The probability data describes the likelihood of a project opportunity being selected. The project data includes a workforce demand. The example method may also include establishing an objective function that is based, at least in part, on the project data, and a set of constraints. The objective function concerns a workforce allocation plan. The example method may also include minimizing a workforce cost by solving the objective function in light of the set of constraints. Solving the objective function includes optimizing a tradeoff between labor utilization and project demand fulfillment. The example method may also include providing the workforce allocation plan. | 08-18-2011 |
20110208557 | Supply and Demand Consolidation in Employee Resource Planning - A method of employee resource planning includes consolidating and defining a demand for employee resources needed to accomplish a potential project in terms of a plurality of jobs and a supply of employee resources in terms of a plurality of employees, each job and each employee having a plurality of job attributes uniformly categorized into indices. Employees in the supply are mapped to corresponding jobs in the demand according to the job attributes. | 08-25-2011 |
20110231215 | OPTIMIZATION OF A RESOURCE MATCHING MODEL BY MAPPING A MODEL TO A BIPARTITE GRAPH - Example embodiments disclosed herein relate to a mechanism for optimizing a resource matching model. In particular, a mechanism is provided to access, in a resource matching system, input data for a mixed integer programming (MIP) model, which may include resource data describing resources and demand data describing corresponding demand instances. Mechanisms are also provided to convert the MIP model to a binary integer programming (BIP) model by redefining the input data to unary data and to map the BIP model to a bipartite graph using the unary data. The resulting bipartite graph may include a number of nodes including a first set corresponding to the resources and a second set corresponding to the demand instances, and a number of edges corresponding to decision variables of the BIP model, each edge representing a potential allocation of a resource in the first set to a demand instance in the second set. | 09-22-2011 |
20120087486 | CALL CENTER RESOURCE ALLOCATION - A method for determining call center resource allocation can include modeling call center performance over an operations time period using a computer. A number of replicas of the modeled call center performance are simulated, using the computer, over a planning time period, each replica having random contact arrivals and contact service times following a stochastic arrival and service process according to a probability distributions of inter-arrival time and service time. Multiple iterations of each simulation are run on the computer to optimize call center resource allocation. A particular simulation iteration is tested against a criterion of convergence, and call center resource is allocated based on the particular simulation iteration with a successful criterion of convergence. | 04-12-2012 |
20120123816 | SELECTING SUPPLIERS TO PERFORM SERVICES FOR AN ENTERPRISE - One embodiment is a method that receives historical data of suppliers and applies, to the historical data, a mathematical optimization system that includes a set of mathematical equations and inequalities that express capabilities and capacities of the suppliers. The mathematical optimization system includes an objective function that minimizes a number of the suppliers to perform third-party labor services for an enterprise. The method selects a sub-set of the suppliers to perform the third-party labor services for the enterprise. | 05-17-2012 |
20120130915 | SCORING A MATCHING BETWEEN A RESOURCE AND A JOB - A resource is scored based on a matching of the resource to a job. Job attributes for the job and resource attributes for the resource are identified. A hierarchy of the job attributes that includes dependencies between the job attributes is determined. A score for the resource is determined using the hierarchy of the job attributes and the resource attributes. The score represents a matching between the resource and the job. | 05-24-2012 |
20120226640 | Behavior and information model to yield more accurate probability of successful outcome - A report indicating a user-reported probability of a successful outcome is received. A behavior and information model is estimated based on the report. The behavior and information model includes a behavior model component having a bias parameter and a consistency parameter. The behavior and information model includes an information model component having a first user-believed probability of a successful outcome and a second user-believed probability of a successful outcome. The behavior and information model is used to yield a model-determined probability of a successful outcome that more accurately reflects a probability of a successful outcome than the user-reported probability of a successful outcome does. | 09-06-2012 |
20120253879 | Optimizing workforce capacity and capability - A workforce capacity and capability at an entity is optimized. Values for parameters related to the workforce capacity and capability at the entity are received. A workforce capacity and capability model is used to generate values for decision variables related to the workforce capacity and capability at the entity, based on the values for the parameters that have been received. The workforce capacity and capability model models uncertainty associated with a workforce. The values for the decision variables assist evaluation of workforce capacity and capability strategic decisions | 10-04-2012 |
20120265569 | DETERMINING WORK PLACEMENT PREFERENCES - Example methods, apparatus and articles of manufacture to determine work placement preferences are disclosed. A disclosed example method includes receiving, via a processor, a request for a resource to fill an open position within an organization, the request including a primary resource group for the open position, determining with the processor resource group preferences of resource groups using a structure of the organization that includes functional relationships between the resource groups, calculating weights for the resource group preferences based on respective organizational distances in the structure of the respective resource groups from the primary resource group, determining a target resource group with a greatest calculated weight for a resource group preference from among the resource groups that have at least one available resource, and selecting a resource within the target resource group to fill the open position. | 10-18-2012 |
20130060649 | Selecting Products for Retailer to Offer for Sale to Consumers - Each product of a number of products is assigned to one of a number of popularity tiers. The popularity tiers are ordered from a most popular tier to a least popular tier. The popularity tiers indicate how popular the products are expected to be among consumers. Each product is assigned to one of a number of margin tiers. The margin tiers are ordered from a highest margin tier to a lowest margin tier. The margin tiers indicate how much money a retailer makes in selling the products to the consumers. Which of the products to offer for sale by the retailer to the consumers are selected by applying decision rules to the products as have been assigned to the popularity tiers and to the margin tiers. | 03-07-2013 |
Patent application number | Description | Published |
20120195209 | SYSTEM TO SHARE NETWORK BANDWIDTH AMONG COMPETING APPLICATIONS - The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained. | 08-02-2012 |
20120195324 | SHARING BANDWIDTH AMONG MULTIPLE USERS OF NETWORK APPLICATIONS - A system and method are provided that allocate bandwidth on a global large scale network. Bandwidth allocation is based on the predicted bandwidth demands of the network users. Each user may be assigned one of a plurality of different values that determines the amount of bandwidth allocated to that user. In instances where an application runs on behalf of a plurality of remote clients, a system and method is provided that allows for the allocation of bandwidth based each individual remote client. | 08-02-2012 |
20140119181 | TRAFFIC ENGINEERING SYSTEM FOR PREVENTING DEMAND DEADLOCK AND ACHIEVING UNIFORM LINK UTILIZATION - Exemplary traffic engineering solutions are described herein. According to exemplary embodiments, multiple tiered thresholds representing allocatable capacities of links in the network may be provided. The tiered thresholds may effectively limit the amount of data that a traffic engineering system is permitted to allocate on links in the network. The traffic engineering system may attempt to allocate data flows in the network according to the smallest threshold. If the network cannot accommodate the data flows according to the smallest threshold, then the next-smallest threshold may be attempted. The thresholds may be sequentially tested in increasing order until the largest threshold is attempted. If a workable threshold is found, then the data flow may be allocated to a path in the network. If the traffic engineering system is unable to accommodate the data flows at any of the tiered thresholds, then the traffic engineering system may report a failure. | 05-01-2014 |
20150188844 | System to Share Network Bandwidth Among Competing Applications - The present invention pertains to the allocation of bandwidth on a global large scale network. Systems and methods are provided to base bandwidth allocation on the predicted bandwidth demands of the network users. In allocating bandwidth, each user is assigned a user weight value, and is to be allocated bandwidth in proportion to that value. In addition, the bandwidth allocation is enforced so as to ensure that bandwidth allocation policies are maintained. | 07-02-2015 |