Patent application number | Description | Published |
20120196644 | Dynamic Network Connection System and Method - A method and system for selecting a network to establish a connection to from a set of available network includes a network database providing historical information about each of the networks and sends the database information to end user terminals. The end user terminals monitor real-time performance information about each of the available networks and can send this information to the network database. The end user terminals also include network connection policy information which can be used to make the selection decision. The end user terminal determines a network quality score for each available network as a function of the historical information from the network database, the real-time performance information about each available network and the network connection policy information. The end user terminal can select the available network as a function of the network quality score, for example, selecting the available network with the highest network quality score. | 08-02-2012 |
20130162430 | Method and System for Charging Mobile Devices - A method and system for determining charging opportunities includes monitoring the location of a mobile device and the location of the mobile device when it is charging to develop a list or database of locations where the mobile device can be charged. The location can include that the mobile device is in a car or on a train, where the user can connect the mobile device to a power source to charge the device. After a list of charging locations is identified, the mobile device can determine whether the user is staying in a favorite location and after predefined period of time send an alert to the user to charge the device. The alert can be sent to the user before the device has reached the low battery threshold. | 06-27-2013 |
20140080539 | DYNAMIC NETWORK CONNECTION SYSTEM AND METHOD - A method and system for selecting a network to establish a connection to from a set of available network includes a network database providing historical information about each of the networks and sends the database information to end user terminals. The end user terminals monitor real-time performance information about each of the available networks and can send this information to the network database. The end user terminals also include network connection policy information which can be used to make the selection decision. The end user terminal determines a network quality score for each available network as a function of the historical information from the network database, the real-time performance information about each available network and the network connection policy information. The end user terminal can select the available network as a function of the network quality score, for example, selecting the available network with the highest network quality score. | 03-20-2014 |
Patent application number | Description | Published |
20140082190 | METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR WIRELESS NETWORK DEPLOYMENT - Systems, methods, and computer-readable media for wireless network deployment are disclosed. The systems, methods, and computer-readable media receive data from one or more client devices regarding one or more data sessions, wherein the received data comprises one or more identifiers and one or more data session characteristics. The systems, methods, and computer-readable media determine one or more locations associated with the one or more data sessions based on the one or more identifiers, and determine one or more deployment values for each of the one or more locations associated with the one or more data sessions based on the one or more data session characteristics. In addition, systems, methods, and computer-readable media output data associated with one or more wireless network deployment candidate locations based on the one or more locations associated with the one or more data sessions and the one or more deployment values. | 03-20-2014 |
20140156625 | METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR WIRELESS NETWORK DEPLOYMENT - Systems, methods, and computer-readable media for wireless network deployment are disclosed. The systems, methods, and computer-readable media receive data from one or more client devices regarding one or more data sessions, wherein the received data comprises one or more identifiers and one or more data session characteristics. The systems, methods, and computer-readable media determine one or more locations associated with the one or more data sessions based on the one or more identifiers, and determine one or more deployment values for each of the one or more locations associated with the one or more data sessions based on the one or more data session characteristics. In addition, systems, methods, and computer-readable media output data associated with one or more wireless network deployment candidate locations based on the one or more locations associated with the one or more data sessions and the one or more deployment values. | 06-05-2014 |
Patent application number | Description | Published |
20080226017 | Data Handling and Analysis in Computed Tomography With Multiple Energy Windows - An apparatus includes a computed tomography (CT) scanner ( | 09-18-2008 |
20120087463 | PHOTON COUNTING AND ENERGY DISCRIMINATING DETECTOR THRESHOLD CALIBRATION - An imaging system includes an x-ray source, a detector that receives x-rays emitted from the x-ray source, a DAS configured to count photon hits in the detector that occur at photon energies above at least a low keV threshold, a medium keV threshold, and a high keV threshold, and a computer operably coupled to the DAS. The computer is programmed to vary each of the medium keV threshold and the high keV threshold over a continuous keV range during data acquisition to define low, medium, and high keV bins that are based on the low, medium, and high keV thresholds, obtain photon counts in the low, medium, and high keV bins in a plurality of keV threshold combinations, calculate a noise variance as a function of at least one of the keV thresholds, and identify a noise minimum and low, medium, and high keV thresholds that correspond thereto. | 04-12-2012 |
Patent application number | Description | Published |
20100057518 | Constraint Programming with Efficient Ordering of Variables - A method for resource management includes associating respective variables with resource consumers, and identifying resources as values applicable to the variables. A group of the variables are identified as preferred variables. An assignment of the values to the variables that satisfies constraints applying to the allocation of the resources is found by repeatedly performing the steps of choosing a variable from the group, instantiating the chosen variable with a value, removing the chosen variable from the group, and pruning the domains of the other variables by propagation of the constraints. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables. | 03-04-2010 |
20100161373 | Extending Constraint Satisfaction Problem Solving - A computer-implemented method for resource management includes storing in a memory a set of resource consumers, resources for allocation to the resource consumers, and initial binary constraints applying to the allocation of the resources. Respective variables are associated with the resource consumers, and the resources are identified as values applicable to the variables. A non-binary scoring criterion is applied to generate scores on a graded scale for proposed assignments of one or more of the resources to respective ones of the resource consumers. One or more additional binary constraints are defined based on the graded scale of the scores. An assignment is found of the values to the variables that satisfies the initial and additional binary constraints using a constraint satisfaction problem (CSP) solver running on a processor that is coupled to the memory. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables. | 06-24-2010 |
20100312738 | CONTEXT-BASED FAILURE REPORTING FOR A CONSTRAINT SATISFACTION PROBLEM - A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint. | 12-09-2010 |
20110224817 | AUTOMATICALLY SOLVING A TRUCK CONFIGURATION PROBLEM - A truck configuration satisfying a truck configuration problem is automatically determined. The truck configuration problem is transformed to a target function, outputting values indicative of configurations satisfying the truck configuration problem. Stochastic local search methods are applied on the target function to determine the truck configuration. Preprocessing may be performed to improve efficiency, performance or the like of the stochastic local search methods. The truck configuration problem may be obtained from several sources, which may be independent of one another. | 09-15-2011 |
20120209648 | RESOURCE MANAGEMENT USING CONSTRAINT PROGRAMMING WITH EFFICIENT ORDERING OF VARIABLES - A method for resource management includes associating respective variables with resource consumers, and identifying resources as values applicable to the variables. A group of the variables are identified as preferred variables. An assignment of the values to the variables that satisfies constraints applying to the allocation of the resources is found by repeatedly performing the steps of choosing a variable from the group, instantiating the chosen variable with a value, removing the chosen variable from the group, and pruning the domains of the other variables by propagation of the constraints. The resources are assigned to the resource consumers responsively to the assignment of the values to the variables. | 08-16-2012 |
20130080363 | CONTEXT-BASED FAILURE REPORTING FOR A CONSTRAINT SATISFACTION PROBLEM - A method for solving a constraint satisfaction problem (CSP) comprises identifying a first illegal combination associated with at least one variable, wherein the first illegal combination contradicts at least one constraint; grouping the first illegal combination with a second illegal combination, in response to determining that the first and second illegal combinations contradict the same constraint; identifying at least one failure explanation for each group of illegal combinations, wherein the failure explanation is associated with at least one illegal combination in said group to provide a reason for a contradicted constraint associated with the illegal combination; assigning a value to each variable in the given domain to solve the CSP within the limitations defined by the constraints in a solution path; and generating a result, in response to determining that at least one assigned value to a variable contradicts a constraint. | 03-28-2013 |
20140203949 | Method and system for automatic residual consumption - A computer-implemented method performed by a computerized device, comprising: obtaining consumption data comprising readings indicating consumption of a product, the consumption data is monitored by a plurality of metering devices, wherein the metering devices are associated with a plurality of consumption entities, wherein the plurality of consumption entities comprising a consumption unit and one or more sub consumption units of the consumption unit, wherein the product is supplied serially to the one or more sub consumption units via the consumption unit; and calculating residual consumption of the plurality of consumption entities at a point in time, wherein the residual consumption is consumption of the consumption unit and which is not associated with a sub consumption unit, wherein the residual consumption is calculated based on the consumption by the plurality of consumption entities at a plurality of points in time. | 07-24-2014 |
20140278770 | GENERATING ECONOMIC MODEL BASED ON BUSINESS TRANSACTION MESSAGES - A computer-implemented method, computerized apparatus and computer program product for generating economic model based on business transaction messages. The method comprising obtaining business transactions from a business collaboration network, wherein each business transaction is a business-to-business transaction; and automatically generating, by a processor, based on the business transactions, an economic simulator capable of simulating economic activity within the business collaboration network, wherein the economic activity is associated with a business transaction that is transmitted via the business collaboration network. | 09-18-2014 |
20150018060 | SYSTEM AND METHOD FOR DECISION MAKING IN STRATEGIC ENVIRONMENTS - In one embodiment, payoffs to an actor during the strategic game according to a solution concept is simulated a predetermined number of times. A machine learning tool is used to predict a payoff based on the predetermined number of payoffs according to the solution concept, wherein the machine learning tool is trained with plurality of pairs, each pair comprising a set of simulated payoffs and an actual payoff, wherein the simulated payoffs are predetermined number of payoffs determined in accordance with the solution concept. In another embodiment, a process tree representative of a strategic game involving actors is obtained. The process tree may comprise computational nodes, and leaf nodes which define payoff based on computations of the computational nodes. | 01-15-2015 |