| Patent application number | Description | Published |
|---|
| 20130085801 | Supply Chain Performance Management Tool Having Predictive Capabilities - A method for providing a supply chain management tool may include generating a representation of a supply chain of an organization where the representation is generated responsive to identification of supply chain entities and corresponding flows therebetween. The flows may include transactional layer activities at a stock keeping unit level. The method may further include referencing the representation to determine historical data indicative of supply chain performance, and utilizing processing circuitry to employ the historical data to generate at least one prediction regarding future operating performance of the supply chain. | 04-04-2013 |
| 20130085812 | Supply Chain Performance Management Tool for Profiling A Supply Chain - A method for providing a supply chain performance management tool may include receiving an identification of supply chain entities and corresponding operational activities therebetween for an organization to generate a functional representation of the supply chain, receiving natively formatted data from the entities of the organization where the natively formatted data is indicative of transactional layer activities, converting, via processing circuitry, the natively formatted data to processed data using a rule set for data conversion developed for the organization, and associating the processed data to the functional representation for generation of one or more reports indicative of supply chain performance. | 04-04-2013 |
| 20130085813 | Method, Apparatus and Computer Program Product for Providing a Supply Chain Performance Management Tool - A method for providing a supply chain performance management tool may include profiling a supply chain by obtaining data indicative of stock keeping unit level activity associated with flows of items between entities within the supply chain of an organization, cleansing, via processing circuitry, the obtained data based on reconciliation of input from each functional category of entities within the supply chain, and providing performance results based on the cleansed data. | 04-04-2013 |
| Patent application number | Description | Published |
|---|
| 20140133302 | TUNING ROUTING METRICS TO REDUCE MAXIMUM LINK UTILIZATION AND END-TO-END DELAY VIOLATIONS - A metric tuning technique optimizes the link utilization of a set of links in a network and end-to-end delay or latency constraints. In the embodiments, a delay constraint between node pairs in the network is determined and used in addition to the link utilization to optimize the network. An interactive user interface is provided to allow a user to specify limits and the delay constraints, and to select the sets of links to be addressed. The delay constraints may be specified on an end-to-end or per-link basis. In addition, the latency requirements may be specified for various types of traffic, such as voice, streaming, etc. In one embodiment, the link utilization is minimized within a node pair latency constraint. Link utilization constraints may be preferred before satisfying delay or latency constraints. | 05-15-2014 |
| 20150149828 | MANAGEMENT OF CLOUD-BASED APPLICATION DELIVERY - The techniques described herein provides troubleshooting, monitoring, reporting and dynamic adjustments and virtualization to management of application delivery. A system can be completely external to an application delivery data path, or can be highly compatible for integration to the application delivery path. Entities can be billed on a per user, per application, per usage, or any combination of consumption-based billing. | 05-28-2015 |
| Patent application number | Description | Published |
|---|
| 20090052333 | TRAFFIC INDEPENDENT SURVIVABILITY ANALYSIS - First-order effects of hypothesized fault conditions are determined by propagating discrete test packets between select nodes and noting the change of path, if any, taken by the test packet under each condition relative to the fault-free path. Tools are provided to create classes of node pairs of interest, and test packets are created only for select classes. The network is analyzed to identify fault conditions that are likely to impact system performance, and only these fault conditions are simulated. By providing a methodology for selecting classes of node pairs to test, and prioritizing the faults to simulate, a first-order survivability analysis of large networks can be performed efficiently and effectively. The efficiency of this technique is also enhanced by providing test packets that are representative of a wide range of possible source-destination combinations, and by evaluating only the source-destination combinations that may be directly affected by each fault condition. | 02-26-2009 |
| 20100138688 | MANAGING SERVICE LEVELS ON A SHARED NETWORK - Devices and methods for modeling and analysis of services provided over a common network include a processor configured to track services connected to the common network through nodes and links; run service models associated with the services under selected conditions, the selected conditions including failure and repair of one of the nodes or links; and propose corrective action and/or change of network resources of the common network to minimize impact of the failure. The processor may also run Network models. The models may be executed successively or simultaneously, and outputs of one model may be used as input to other models, including any necessary conversions for compatibility. | 06-03-2010 |
| 20110085449 | NETWORK PATH DISCOVERY AND ANALYSIS - A network analysis system invokes an application specific, or source-destination specific, path discovery process. The application specific path discovery process determines the path(s) used by the application, collects performance data from the nodes along the path, and communicates this performance data to the network analysis system for subsequent performance analysis. The system may also maintain a database of prior network configurations to facilitate the identification of nodes that are off the path that may affect the current performance of the application. The system may also be specifically controlled so as to identify the path between any pair of specified nodes, and to optionally collect performance data associated with the path. | 04-14-2011 |
| 20110085450 | NETWORK PATH DISCOVERY AND ANALYSIS - A network analysis system invokes an application specific, or source-destination specific, path discovery process. The application specific path discovery process determines the path(s) used by the application, collects performance data from the nodes along the path, and communicates this performance data to the network analysis system for subsequent performance analysis. The system may also maintain a database of prior network configurations to facilitate the identification of nodes that are off the path that may affect the current performance of the application. The system may also be specifically controlled so as to identify the path between any pair of specified nodes, and to optionally collect performance data associated with the path. | 04-14-2011 |
| 20120163197 | ROUTING VALIDATION - A simulator simulates routing system protocols to build routing tables corresponding to a modeled network, and a comparator compares the routing tables in the actual network to these simulator-created routing tables. Because the modeled system represents a fault-free version of the actual system, and assuming that the modeled routing system protocols are representative of the algorithms used in the actual routers, these simulator-produced routing tables can represent steady-state routing tables that should be present in the routers of the actual network at steady state. By querying each router in the actual network for its routing table and comparing each routing table to the corresponding simulator-produced routing table, any differences from the steady state can be identified. | 06-28-2012 |
| 20130007524 | MULTI-VARIATE NETWORK SURVIVABILITY ANALYSIS - Network survivability is quantified in such a way that failure cases can be compared and ranked against each other in terms of the severity of their impact on the various performance measures associated with the network. The degradation in network performance caused by each failure is quantified based on user-defined sets of thresholds of degradation severity for each performance measure. Each failure is simulated using a model of the network, and a degradation vector is determined for each simulated failure. A comparison function is defined to map the degradation vectors into an ordered set, and this ordered set is used to create an ordered list of network failures, in order of the network degradation caused by each failure. | 01-03-2013 |
| 20140328169 | NETWORK SIMULATION AND ANALYSIS USING OPERATIONAL FORWARDING DATA - A hybrid approach to populating forwarding tables in a virtual network obtains forwarding data both by simulating routing protocol behavior in the virtual network to build forwarding tables, and by importing operational forwarding data from corresponding physical nodes in a physical network. The use of operational forwarding data improves the fidelity of the simulation by closely conforming forwarding behavior in the simulation to that which occurs in the physical network. | 11-06-2014 |
| Patent application number | Description | Published |
|---|
| 20110096721 | SYSTEMS AND METHODS FOR SELECTING TRACKING AREAS AND REDUCING PAGING - Some embodiments provide methods for selecting tracking areas in a network, including: generating and storing a plurality of tracking area groups based on which tracking areas of a plurality of tracking areas are served by which base transceiver stations of a plurality of base transceiver stations, each tracking area group including at least one tracking area; receiving a request for a tracking area list from user equipment connected to the network from a first tracking area belonging to a first tracking area group of the stored plurality of tracking area groups; based on the stored plurality of tracking area groups and the first tracking area group, generating a list comprising at least one tracking area; and sending the list comprising at least one tracking area to the user equipment. | 04-28-2011 |
| 20110096731 | SYSTEMS AND METHODS FOR SELECTING TRACKING AREAS AND REDUCING TRACKING AREA UPDATES - Some embodiments provide methods for selecting tracking areas in a network, comprising: receiving messages from a plurality of base transceiver stations, the messages identifying a previous tracking area identity and a current tracking area identity; storing probabilities based on a count of transitions between the received previous tracking area identities and current tracking area identities; receiving a message from a user equipment device indicating the user equipment device is located in a first tracking area identified by a first tracking area identity; and selecting at least a second tracking area identity based on the stored probabilities and the first tracking area identity; and sending a tracking area identity list to the user equipment device based on the selected second tracking area. | 04-28-2011 |
| 20110098031 | SYSTEMS AND METHODS FOR REDUCED LATENCY TRACKING AREA SELECTION - Some embodiments provide methods for selecting tracking areas, including: receiving a plurality of messages from a plurality of base transceiver stations, each message including a list of tracking areas handled by the base transceiver station from which the message is received; performing domain name system queries for the tracking areas to retrieve information identifying serving gateways serving the tracking areas; based on the information identifying serving gateways, storing, in a local memory, a list of tracking area identities handled by each identified serving gateway; receiving a message from user equipment indicating a first tracking area; selecting at least one tracking area handled by a serving gateway serving the first tracking area based on the list of tracking areas handled by each identified serving gateway stored in the memory; and sending a tracking area identity list to the user equipment based on the selected at least one tracking area. | 04-28-2011 |
| 20110098050 | SYSTEMS AND METHODS FOR SELECTING SERVING GATEWAYS TO SERVICE USER EQUIPMENT - Some embodiments provide methods for selecting a serving gateway, including: receiving a message from a base transceiver station including a list of tracking areas handled by the base transceiver station; performing a domain name system query for at least one tracking area to retrieve and store in a local memory information identifying a serving gateway serving the at least one tracking area; receiving an attach request from the base transceiver station identifying the user equipment and a tracking area from which the user equipment is connected to the network; searching the information identifying a serving gateway serving the at least one tracking area stored in the local memory to identify a serving gateway to service the user equipment based on the tracking area from which the user equipment is connected to the network; and sending a message identifying the identified serving gateway to the base transceiver station. | 04-28-2011 |
| 20110098051 | SYSTEMS AND METHODS FOR CLASSIFYING USER EQUIPMENT AND SELECTING TRACKING AREAS - Some embodiments disclose methods for classifying user equipment in a network, comprising: recording a first number of times a tracking area identity has changed for a user equipment device during a period of time based on messages exchanged between the user equipment device and a mobility management entity; recording a second number of times the user equipment device is paged during a second period of time; classifying the user equipment device into one of at least three categories based on the first and second recorded numbers; generating a tracking area identity list for the user equipment based device on its category; and sending the generated tracking area identity list to the user equipment device. | 04-28-2011 |
| 20130128873 | METHOD FOR CORRELATING CONNECTION INFORMATION WITH MOBILE DEVICE IDENTITY - A method comprising establishing a first control connection between a home node and a home node gateway having a first control connection identity, establishing a second control connection between the home node gateway and a mobility management device having a second control connection identity, communicating network traffic sent between the home node and the mobility management device on behalf of a mobile device using the first control connection and the second control connection, receiving a mobile device identifier included in a control message sent from the mobility management device using the second control connection in response to an entity type indication sent to the mobility management device from the home node gateway, the mobile device identifier uniquely identifying the mobile device, and correlating the mobile device identifier with a context including the first control connection identity and the second control connection identity. | 05-23-2013 |
| 20130142122 | SYSTEMS AND METHODS FOR SELECTING SERVING GATEWAYS TO SERVICE USER EQUIPMENT - Some embodiments provide methods for selecting a serving gateway to service user equipment in communication with a network, including: receiving a message from a base transceiver station including a list of tracking areas handled by the base transceiver station, initiating a domain name system query for at least one tracking area in the list of tracking areas to identify information indicating a serving gateway serving the at least one tracking area, storing, in local memory, the information indicating the serving gateway serving the at least one tracking area, and upon an occurrence of a triggering event, retrieving, from the local memory, the stored information indicating the serving gateway serving the at least one tracking area. | 06-06-2013 |
| 20130157658 | SYSTEMS AND METHODS FOR CLASSIFYING USER EQUIPMENT AND SELECTING TRACKING AREAS - Some embodiments disclose a method for providing a tracking area identity list in a communications network. The method includes maintaining a tracking area transition likelihood and a tracking area group transition likelihood, and recording a mobility number and a paging number. The method further includes determining a category associated with the user equipment device based on the recorded mobility number and the recorded paging number, and generating the tracking area identity list for the user equipment device based on the category associated with the user equipment device and one or both of the tracking area transition likelihood and the tracking area group transition likelihood. | 06-20-2013 |
| Patent application number | Description | Published |
|---|
| 20090006065 | METHOD TO PRODUCE SUBSTRATE NOISE MODEL AND RELATED SYSTEM AND ARTICLE OF MANUFACTURE - A method is provided to produce a model of an integrated circuit substrate, the method comprising: providing a tile definition that specifies an electrical model associated with instances of the tile; mapping a plurality of respective tile instances to respective locations of the substrate; and connecting the mapped tile instances to each other to produce a tile grid that models overall electrical behavior of the substrate. | 01-01-2009 |
| 20090007032 | METHOD AND APPARATUS FOR SUBSTRATE NOISE ANALYSIS USING SUBSTRATE TILE MODEL AND TILE GRID - A method is provided to evaluate substrate noise propagation in an integrated circuit design, the method comprising: providing a tile definition that specifies an electrical model associated with instances of the tile; mapping a plurality of respective tile instances to respective locations of the substrate; obtaining respective waveforms indicative of digital switching induced power grid fluctuations associated with the respective identified contacts; and associating a voltage with a selected tile instance of the tile grid that is indicative of substrate noise injection due to waveforms associated with contacts encompassed by the selected tile instance. | 01-01-2009 |
| 20090199140 | METHOD AND APPARATUS FOR THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of an integrated circuit (“IC”) layout that includes numerous circuit modules. In some embodiments, the method initially defines several power dissipation equations that express the temperature dependence of the power dissipation for several circuit modules. In some embodiments, the power dissipation equations express a non-linear relationship between power dissipation and temperature. The method defines a heat flow equation based on the specified power dissipation equations. The method then solves the heat flow equation to identify a temperature distribution for the design layout. | 08-06-2009 |
| 20090319964 | METHOD AND APPARATUS FOR THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of an integrated circuit (“IC”) design layout that includes numerous circuit modules. The method divides the IC design layout into a set of elements, where at least one element includes several wires. The method computes a set of conductivity groups of values for the set of elements. The method identifies a temperature distribution for the IC design layout based on the set of conductivity groups of values. In some embodiments, each of these elements corresponds to a particular portion of a particular layer of the IC design layout. Each element includes several nodes. Each conductivity group of values is defined by entry values. Each entry value describes how heat flow at a particular node of the element is affected by a temperature change at another particular node of the element. | 12-24-2009 |
| 20090319965 | METHOD AND APPARATUS FOR THERMAL ANALYSIS OF THROUGH-SILICON VIA (TSV) - Some embodiments of the invention provide a method for performing thermal analysis of an integrated circuit (“IC”) design layout. The IC design layout includes several wiring layers in some embodiments. The IC design layout includes a substrate that has at least one through-silicon via (“TSV”). The method divides the IC design layout into a set of elements. The method identifies a temperature distribution for the IC design layout by using the set of elements. In some embodiments, at least one element includes a metal component and a non-metal component. The non-metal component is silicon in some embodiments, and a dielectric in other embodiments. | 12-24-2009 |
| 20100023903 | METHOD AND APPARATUS FOR MULTI-DIE THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of a multi-die integrated circuit (IC) design layout. The thermal analysis produces a temperature distribution for analyzing internal properties of each die within the multi-die design and for analyzing thermal interactions between two or more dies of the design based on an internal configuration of the two or more dies. Therefore, in some embodiments, the temperature distribution shows a temperature distribution for each die and the individual temperature distribution show varying temperature across each of the dies. Some embodiments reduce the number of iteration required to perform the thermal analysis by constructing a high quality preconditioner based on thermal conducting segments introduced to model thermal effects at the boundaries between two dies. | 01-28-2010 |
| 20120102449 | METHOD AND APPARATUS FOR THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of an integrated circuit (“IC”) design layout that includes numerous circuit modules. The method divides the IC design layout into a set of elements, where at least one element includes several wires. The method computes a set of conductivity groups of values for the set of elements. The method identifies a temperature distribution for the IC design layout based on the set of conductivity groups of values. In some embodiments, each of these elements corresponds to a particular portion of a particular layer of the IC design layout. Each element includes several nodes. Each conductivity group of values is defined by entry values. Each entry value describes how heat flow at a particular node of the element is affected by a temperature change at another particular node of the element. | 04-26-2012 |
| 20120210285 | METHOD AND APPARATUS FOR THERMAL ANALYSIS OF THROUGH-SILICON VIA (TSV) - Some embodiments of the invention provide a method for performing thermal analysis of an integrated circuit (“IC”) design layout. The IC design layout includes several wiring layers in some embodiments. The IC design layout includes a substrate that has at least one through-silicon via (“TSV”). The method divides the IC design layout into a set of elements. The method identifies a temperature distribution for the IC design layout by using the set of elements. In some embodiments, at least one element includes a metal component and a non-metal component. The non-metal component is silicon in some embodiments, and a dielectric in other embodiments. | 08-16-2012 |
| 20120297357 | METHOD AND APPARATUS FOR MULTI-DIE THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of a multi-die integrated circuit (IC) design layout. The thermal analysis produces a temperature distribution for analyzing internal properties of each die within the multi-die design and for analyzing thermal interactions between two or more dies of the design based on an internal configuration of the two or more dies. Therefore, in some embodiments, the temperature distribution shows a temperature distribution for each die and the individual temperature distributions show varying temperature across each of the dies. Some embodiments reduce the number of iteration required to perform the thermal analysis by constructing a high quality preconditioner based on thermal conducting segments introduced to model thermal effects at the boundaries between two dies. | 11-22-2012 |
| 20120304137 | METHOD AND APPARATUS FOR MULTI-DIE THERMAL ANALYSIS - Some embodiments of the invention provide a method for performing thermal analysis of a multi-die integrated circuit (IC) design layout. The thermal analysis produces a temperature distribution for analyzing internal properties of each die within the multi-die design and for analyzing thermal interactions between two or more dies of the design based on an internal configuration of the two or more dies. Therefore, in some embodiments, the temperature distribution shows a temperature distribution for each die and the individual temperature distributions show varying temperature across each of the dies. Some embodiments reduce the number of iteration required to perform the thermal analysis by constructing a high quality preconditioner based on thermal conducting segments introduced to model thermal effects at the boundaries between two dies. | 11-29-2012 |
| Patent application number | Description | Published |
|---|
| 20090018078 | Apoptosis-Modulating Protein Therapy for Proliferative Disorders and Nanoparticles Containing the Same - Protein containing nanoparticles and methods of use thereof for the treatment of proliferative disorders are disclosed. | 01-15-2009 |
| 20090136585 | SURFACE-MODIFIED NANOPARTICLES FOR INTRACELLULAR DELIVERY OF THERAPEUTIC AGENTS AND COMPOSITION FOR MAKING SAME - Surface-modified polymeric nanoparticles (NPs), compositions for making them, and their use in drug delivery are disclosed. | 05-28-2009 |
| 20110130325 | Apoptosis-Modulating Protein Therapy for Proliferative Disorders and Nanoparticles Containing the Same - Protein containing nanoparticles and methods of use thereof for the treatment of proliferative disorders are disclosed. | 06-02-2011 |
| 20140100182 | Nanogel-Mediated Drug Delivery - Provided herein are methods of inhibiting proliferation of one or more tumor cells comprising contacting the one or more tumor cells with a composition comprising one or more epigenetic drugs that inhibit one or more epigenetic mechanisms of the tumor cells, wherein the one or more epigenetic drugs are encapsulated in a nanogel. The invention is also directed to methods of treating a tumor, metastasis of a tumor or a combination thereof in an individual in need thereof. The invention is also directed to a method of sequentially delivering one or more epigenetic drugs that alter one or more epigenetic mechanisms of a tumor cell and one or more chemotherapeutic drugs to an individual that has a tumor. Compositions which comprise one or more epigenetic drugs that alter one or more epigenetic mechanisms of a tumor cell, wherein the one or more epigenetic drugs are encapsulated in a nanogel. | 04-10-2014 |
| 20150374798 | Methods of Treating Spinal Cord Injury - The invention is directed to a method of treating a spinal cord injury, a neurodegenerative disease or a neuronal injury in an individual in need thereof comprising administering an effective amount of superoxide dismutase (SOD) and catalase to the individual, wherein the superoxide dismutase and the catalase are encapsulated in one or more nanoparticles that release the SOD and catalase upon administration. Another aspect of the invention is directed to compositions comprising superoxide dismutase (SOD) and catalase encapsulated in one or more nanoparticles. | 12-31-2015 |
| Patent application number | Description | Published |
|---|
| 20110102318 | USER INPUT BY POINTING - Presented is apparatus for capturing user input by pointing at a surface using pointing means. The apparatus comprises: a range camera for producing a depth-image of the pointing means; and a processor. The processor is adapted to determine from the depth-image the position and orientation of a pointing axis of the pointing means; extrapolate from the position and orientation the point of intersection of the axis with the surface; and control an operation based on the location of the point of intersection. | 05-05-2011 |
| 20110219340 | SYSTEM AND METHOD FOR POINT, SELECT AND TRANSFER HAND GESTURE BASED USER INTERFACE - A system and method for a point, select and transfer hand gesture based user interface is disclosed. In one embodiment, a depth image of a hand gesture is captured using an in-front camera substantially on a frame by frame basis within a predefined interaction volume. Also, a nearest point of the hand gesture to a display screen of a display device is found using a substantially nearest depth value in the captured depth image for each frame. Further, an image-to-screen mapping of the captured depth image and the found nearest point to the display screen is performed upon validating the found nearest point as associated with the hand for each frame. Moreover, one of select options displayed on the display screen is pointed and selected when the substantially nearest depth value is within one or more predetermined threshold ranges, and based on the outcome of the image-to-screen mapping. | 09-08-2011 |
| 20120093360 | HAND GESTURE RECOGNITION - Systems, methods, and machine readable and executable instructions are provided for hand gesture recognition. A method for hand gesture recognition can include detecting, with an image input device in communication with a computing device, movement of an object. A hand pose associated with the moving object is recognized and a response corresponding to the hand pose is initiated. | 04-19-2012 |
| 20140219517 | METHODS, APPARATUSES AND COMPUTER PROGRAM PRODUCTS FOR EFFICIENTLY RECOGNIZING FACES OF IMAGES ASSOCIATED WITH VARIOUS ILLUMINATION CONDITIONS - An apparatus for recognizing faces with different illuminations may include a processor and memory storing executable computer program code causing the apparatus to at least perform operations including detecting and extracting face data of a first candidate face of a first image and a second candidate face of a second image. The first image is associated with a first light intensity and the second image associated with a second light intensity different from the first light intensity. The computer program code may further cause the apparatus to analyze face data to determine whether the first candidate face corresponds to an area in the first image that is substantially the same as an area of the second candidate face and evaluate data of the first and second areas to determine whether the first and second candidate faces are valid or invalid faces. Corresponding methods and computer program products are also provided. | 08-07-2014 |
| 20140294300 | FACE MATCHING FOR MOBILE DEVICES - A method includes receiving an image of a face to match with images of known faces, extracting blocks multiple blocks from the received image, calculating local binary pattern histograms for each block, generating matching scores for each block against block of the images of known faces, determining a top number, N, of matching scores less than the number of blocks, and matching the received image to an image of a known face as a function of the top number of matching scores. | 10-02-2014 |
| 20150030987 | FLARE STACK MONITORING - Methods, systems, and computer-readable and executable instructions are described herein. One method includes receiving a sequence of images of a flare stack area from a thermal imaging component, identifying a first portion of the flare stack area moving at a first threshold optical flow using the sequence of images of the flare stack area, and identifying a second portion of the flare stack area moving at a second threshold optical flow using the sequence of images of the flare stack area. | 01-29-2015 |
| 20150223743 | METHOD FOR MONITORING A HEALTH CONDITION OF A SUBJECT - Embodiments of the present disclosure provide a method and a computing unit to monitor health condition of a subject. The computing unit receives physiological signals from a plurality of sensors placed on the subject. The computing unit detects a work-type based on the physiological signals received from the plurality of sensors and assigns a weight to each of the plurality of sensors based on the work-type. Thereafter, the computing unit generates a fatigue score using the physiological signals and the weight of the plurality of sensors. The fatigue score indicates the health condition of the subject. | 08-13-2015 |
| 20150305688 | METHOD OF DETERMINING DISCHARGE READINESS CONDITION FOR A PATIENT AND SYSTEM THEREOF - Embodiments of the present disclosure provide a method of determining discharge readiness condition for a patient. The sensors are placed on patient to monitor the physiological condition of the patient and to transmit physiological data to computing device. The patient also provides non-physiological data using mobile device to computing device. The processor configured in computing unit assigns predefined weighted ratio to each of the physiological data and non-physiological data to generate weighted physiological and non-physiological data. The processor generates recovery score using the weighted physiological data and the non-physiological data and compares the recovery score with reference recovery score. The reference recovery score is personalized for each patient using weighted personal reference score and weighted EMR reference score. If recovery score exceeds reference recovery score then patient is ready for discharge else the patient is not ready to be discharged and hence appropriate suggestions are provided to improve recovery score. | 10-29-2015 |
| Patent application number | Description | Published |
|---|
| 20110243320 | Efficient Homomorphic Encryption Scheme For Bilinear Forms - In one exemplary embodiment, a computer readable storage medium tangibly embodying a program of instructions executable by a machine for performing operations including: receiving information B to be encrypted as a ciphertext C in accordance with an encryption scheme having an encrypt function; and encrypting B in accordance with the encrypt function to obtain C, the scheme utilizes at least one public key A, where B, C, and A are matrices, the encrypt function receives as inputs A and B and outputs C as C→AS+pX+B (mod q), S is a random matrix, X is an error matrix, p is in integer, q is an odd prime number. In other exemplary embodiments, the encryption scheme includes a decrypt function that receives as inputs at least one private key T (a matrix) and C and outputs B as B=T | 10-06-2011 |
| 20150033033 | Efficient Homomorphic Encryption Scheme for Bilinear Forms - In one exemplary embodiment, a computer readable storage medium tangibly embodying a program of instructions executable by a machine for performing operations including: receiving information B to be encrypted as a ciphertext C in accordance with an encryption scheme having an encrypt function; and encrypting B in accordance with the encrypt function to obtain C, the scheme utilizes at least one public key A, where B, C, and A are matrices, the encrypt function receives as inputs A and B and outputs C as C←AS+pX+B(mod q), S is a random matrix, X is an error matrix, p is in integer, q is an odd prime number. In other exemplary embodiments, the encryption scheme includes a decrypt function that receives as inputs at least one private key T (a matrix) and C and outputs B as B=T | 01-29-2015 |
| Patent application number | Description | Published |
|---|
| 20120155635 | ATTRIBUTE BASED ENCRYPTION USING LATTICES - A master public key is generated as a first set of lattices based on a set of attributes, along with a random vector. A master secret key is generated as a set of trap door lattices corresponding to the first set of lattices. A user secret key is generated for a user's particular set of attributes using the master secret key. The user secret key is a set of values in a vector that are chosen to satisfy a reconstruction function for reconstructing the random vector using the first set of lattices. Information is encrypted to a given set of attributes using the user secret key, the given set of attributes and the user secret key. The information is decrypted by a second user having the given set of attributes using the second user's secret key. | 06-21-2012 |
| 20120155641 | NON-INTERACTIVE VERIFIABLE, DELEGATED COMPUTATION - A processor on a delegator receives an input upon which an expensive function is to be evaluated. The delegator incorporates the input into a request to perform a task that is different from evaluating the function. When the task is performed, it provides a secondary result that is observable by the delegator. The secondary result is different from an answer to the expensive function and can be verified by the delegator with less computational expense than evaluation of the expensive function. The task can be performed by the server only after the server has verifiably evaluated the function based on the input. Request data, that is indicative of the request to perform a task with the input incorporated therein is transmitted to the server for performance of the task. The delegator then receives a returned result from the server indicative of the server performing the task. The returned result has a value that reflects both an answer to which the server has evaluated the function, and whether the answer is verified as being correct. | 06-21-2012 |
| 20120159179 | DIGITAL SIGNATURES WITH ERROR POLYNOMIALS - Representations of polynomials a, s, t, e | 06-21-2012 |
| 20120331283 | USER-CONTROLLED DATA ENCRYPTION WITH OBFUSCATED POLICY - An obfuscated policy data encryption system and method for re-encrypting data to maintain the confidentiality and integrity of data about a user when the data is stored in a public cloud computing environment. The system and method allow a user to specify in a data-sharing policy who can obtain the data and how much of the data is available to them. This policy is obfuscated such that it is unintelligible to the cloud operator and others processing and storing the data. In some embodiments, a patient species with whom his health care data should be shared with and the encrypted health care data is stored in the cloud in an electronic medical records system. The obfuscated policy allows the electronic medial records system to dispense the health care data of the patient to those requesting the data without disclosing the details of the policy itself. | 12-27-2012 |
| 20140129845 | ATTRIBUTE BASED ENCRYPTION USING LATTICES - A master public key is generated as a first set of lattices based on a set of attributes, along with a random vector. A master secret key is generated as a set of trap door lattices corresponding to the first set of lattices. A user secret key is generated for a user's particular set of attributes using the master secret key. The user secret key is a set of values in a vector that are chosen to satisfy a reconstruction function for reconstructing the random vector using the first set of lattices. Information is encrypted to a given set of attributes using the user secret key, the given set of attributes and the user secret key. The information is decrypted by a second user having the given set of attributes using the second user's secret key. | 05-08-2014 |
| Patent application number | Description | Published |
|---|
| 20090030792 | CONTENT RECOMMENDATION SERVICE - A method and system for content recommendation make such recommendations possible, even if users are in different geographic locations, use different network service providers and different services, user different types of device, etc. A method for communicating a content recommendation comprises receiving a recommendation for content, the content recommendation originating from a first client device communicating using a first network and destined for a second client device communicating using a second network, determining access information for the second client device to access the content using the second network, and transmitting the determined access information. | 01-29-2009 |
| 20090030931 | MULTI-SOURCE MULTI-NETWORK ELECTRONIC SERVICE GUIDE - A method and system by which a client device can gather ESG data from disparate sources and present them to a user in a unified manner via a single user interface provides improved usability of the ESG. A method for providing an electronic service guide comprises acquiring a plurality of electronic service guides, translating each of the plurality of electronic service guides that was not acquired in a specified representation to the specified representation, combining the plurality of electronic service guides in the specified representation to form a unified electronic service guide, and providing the unified electronic service guide for display. | 01-29-2009 |
| 20120122490 | LOCATION SPECIFIC EVENT BROADCASTING - Applications in a broadcast environment distribute events in real-time to a large number of receivers within specified geographic locations while efficiently sharing bandwidth resources with other applications using the same broadcast network. Applications need not be aware of the other applications sharing the resources, nor of the methods, protocols, and other mechanisms used to actually broadcast the data over the broadcast medium. Server-side applications that serve data, send notifications, or distribute events to specific locations within the network use a broadcast location manager. Client applications that receive such data, notifications, or events use a client location filter to obtain events that are relevant based on the location of the device. The broadcast location manager and client location filter work together to reliably and efficiently transmit data, notifications, and events to specific locations over the broadcast network for all applications involved. | 05-17-2012 |
| 20120230195 | RELIABLE EVENT BROADCASTER WITH MULTIPLEXING AND BANDWIDTH CONTROL FUNCTIONS - Data may be transmitted in a broadcast mode to multiple devices operating in a network. Efficient utilization of bandwidth while providing a desired level of quality of service is enabled for the applications executing on the devices that utilize the broadcasted data. A set of bandwidth constraints may be utilized in combination with a set of heuristics and rules for the allocation and re-allocation of bandwidth among multiple applications in a manner that minimizes the impact on the quality of service metrics of importance to the affected applications when contention exists for the network resources. Quality of service provided to each application may be degraded smoothly, with certain priorities and guarantees being maintained. Event segmentation and reassembly functions for applications may be provided, as well as reliability mechanisms to increase the ability to provide data to client devices that have not been actively receiving for significant periods of time. | 09-13-2012 |
| 20130166735 | LOCATION SPECIFIC EVENT BROADCASTING - Applications in a broadcast environment distribute events in real-time to a large number of receivers within specified geographic locations while efficiently sharing bandwidth resources with other applications using the same broadcast network. Applications need not be aware of the other applications sharing the resources, nor of the methods, protocols, and other mechanisms used to actually broadcast the data over the broadcast medium. Server-side applications that serve data, send notifications, or distribute events to specific locations within the network use a broadcast location manager. Client applications that receive such data, notifications, or events use a client location filter to obtain events that are relevant based on the location of the device. The broadcast location manager and client location filter work together to reliably and efficiently transmit data, notifications, and events to specific locations over the broadcast network for all applications involved. | 06-27-2013 |
| 20140125590 | SYSTEMS AND METHODS FOR ALTERNATIVE CONTROL OF TOUCH-BASED DEVICES - A computer-implemented method, a system, and software includes providing output from a touch-based device to an external display; detecting gestures from a user located away from and not physically touching the touch-based device; and translating the detected gestures into appropriate commands for the touch-based device. The systems and methods provide alternative control of touch-based devices such as mobile devices. The systems and methods can include a mobile device coupled to an external display device and controlled via user gestures monitored by a collocated sensor. Accordingly, the systems and methods allow users to operate applications (“apps”) on the mobile device displayed on the external display device and controlled without touching the mobile device using gestures monitored by the collocated sensor. This enables the wide variety of rich apps to be operated in a new manner. | 05-08-2014 |
| Patent application number | Description | Published |
|---|
| 20120227053 | DISTRIBUTED RESOURCE MANAGEMENT IN A PORTABLE COMPUTING DEVICE - In a portable computing device having a node-based resource architecture, a first or distributed node controlled by a first processor but corresponding to a second or native node controlled by a second processor is used to indirectly access a resource of the second node. In a resource graph defining the architecture each node represents an encapsulation of functionality of one or more resources, each edge represents a client request, and adjacent nodes represent resource dependencies. Resources defined by a first graph are controlled by the first processor but not the second processor, while resources defined by a second graph are controlled by the second processor but not the first processor. A client request on the first node may be received from a client under control of the first processor. Then, a client request may be issued on the second node in response to the client request on the first node. | 09-06-2012 |
| 20120239812 | BATCHING RESOURCE REQUESTS IN A PORTABLE COMPUTING DEVICE - In a portable computing device having a node-based resource architecture, resource requests are batched or otherwise transactionized to help minimize inter-processing entity messaging or other messaging or provide other benefits. In a resource graph defining the architecture, each node or resource of the graph represents an encapsulation of functionality of one or more resources controlled by a processor or other processing entity, each edge represents a client request, and adjacent nodes of the graph represent resource dependencies. A single transaction of resource requests may be provided against two or more of the resources. | 09-20-2012 |
| 20130019249 | System and Method For Managing Resources of A Portable Computing Device - A method and system for managing resources of a portable computing device is disclosed. The method includes receiving node structure data for forming a node, in which the node structure data includes a unique name assigned to each resource of the node. A node has at least one resource and it may have multiple resources. Each resource may be a hardware or software element. The system includes a framework manger which handles the communications between existing nodes within a node architecture. The framework manager also logs activity of each resource by using its unique name. The framework manager may send this logged activity to an output device, such as a printer or a display screen. The method and system may help reduce or eliminate a need for customized APIs when a new hardware or software element (or both) are added to a portable computing device. | 01-17-2013 |
| 20130031560 | Batching and Forking Resource Requests In A Portable Computing Device - In a portable computing device having a node-based resource architecture, resource requests are batched or otherwise transactionized to help minimize inter-processing entity messaging or other messaging or provide other benefits. In a resource graph defining the architecture, each node or resource of the graph represents an encapsulation of functionality of one or more resources controlled by a processor or other processing entity, each edge represents a client request, and adjacent nodes of the graph represent resource dependencies. A single transaction of resource requests may be provided against two or more of the resources. Additionally, this single transaction may become forked so that parallel processing among a client issuing the single transaction and the resources handling the requests of the single transaction may occur. | 01-31-2013 |
| 20130061235 | METHOD AND SYSTEM FOR MANAGING PARALLEL RESOURCE REQUESTS IN A PORTABLE COMPUTING DEVICE - A method and system for managing parallel resource requests in a portable computing device (“PCD”) are described. The system and method includes generating a first request from a first client, the first request issued in the context of a first execution thread. The first request may be forwarded to a resource. The resource may acknowledge the first request and initiate asynchronous processing. The resource may process the first request while allowing the first client to continue processing in the first execution thread. The resource may signal completion of the processing of the first request and may receive a second request. The second request causes completion of the processing of the first request. The completion of the processing of the first request may include updating a local representation of the resource to a new state and invoking any registered callbacks. The resource may become available to service the second request, and may process the second request. | 03-07-2013 |
| 20130227583 | Method and System For Scheduling Requests In A Portable Computing Device - A method and system for managing requests among resources within a portable computing device include a scheduler receiving data from a client for scheduling a plurality of requests. Each request identifies at least one resource and a requested deadline. Next, data from the client is stored by the scheduler in a database. The scheduler then determines times and a sequence for processing the requests based on requested deadlines in the requests and based on current states of resources within the portable computing device. The scheduler then communicates the requests to the resources at the determined times and according to the determined sequence. The scheduler, at its discretion, may schedule a request after its requested deadline in response to receiving a new request command from a client. The scheduler may allow a sleep set corresponding to a sleep processor state to power off a processor. | 08-29-2013 |
| 20130283276 | METHOD AND SYSTEM FOR MINIMAL SET LOCKING WHEN BATCHING RESOURCE REQUESTS IN A PORTABLE COMPUTING DEVICE - Requests of a PCD are determined if they are part of a transaction involving a plurality of resources. Next, each resource that is part of the request involving multiple resources is identified. As each resource is identified, a framework manager determines if a resource has completed processing the request directed at it. If the resource has returned a value that it has completed the request, then the framework manager allows the resource to return to an unlocked state while other requests in the transaction are being processed. If the resource has not completed processing and has deferred some of the processing to the end of the transaction, then the resource is added to a deferred unlock list. It is determined if the resource is a dependent on another resource in the current request path. If it is dependent, then the other resource is also placed on the deferred unlock list. | 10-24-2013 |
| Patent application number | Description | Published |
|---|
| 20120030760 | METHOD AND APPARATUS FOR COMBATING WEB-BASED SURREPTITIOUS BINARY INSTALLATIONS - The present invention relates to a method and apparatus for combating web-based surreptitious binary installations. One embodiment of a method combating web-based surreptitious binary installations on a computing device includes intercepting a download of a file to a local file system of the computing device, storing the file in the local file system when the file is correlated with a user consent, and storing the file in a secure zone of the computing device when the file is not correlated with a user consent, wherein files stored in the secure zone cannot be executed or propagated. | 02-02-2012 |
| 20140075498 | SECURITY MEDIATION FOR DYNAMICALLY PROGRAMMABLE NETWORK - A network security policy may be implemented at network switches as a set of active packet disposition directives. In a dynamically programmable network, the network switches can be dynamically reprogrammed with new packet disposition directives. A security mediation service permits such dynamic reprogramming as long as the new directives are consistent with the then-current network security policy. The security mediation service evaluates candidate packet disposition directives for conflicts with the currently active security policy, before instantiating the candidate packet disposition directives at the network switches. | 03-13-2014 |
| 20140075519 | SECURITY MEDIATION FOR DYNAMICALLY PROGRAMMABLE NETWORK - A network security policy may be implemented at network switches as a set of active packet disposition directives. In a dynamically programmable network, the network switches can be dynamically reprogrammed with new packet disposition directives. A security mediation service permits such dynamic reprogramming as long as the new directives are consistent with the then-current network security policy. The security mediation service evaluates candidate packet disposition directives for conflicts with the currently active security policy, before instantiating the candidate packet disposition directives at the network switches. | 03-13-2014 |
