| Patent application number | Description | Published |
|---|
| 20080300919 | ARCHITECTURE FOR HEALTH MONITORING SYSTEMS - An architecture allows individual system components to be developed and tested individually, i.e., as distinct modules, and to be subsequently combined through standardized electrical and communication interfaces. Any combination of these modules can be implemented to form different products that provide any number of functions, such as an integrated system for monitoring a health condition and/or delivering a medication. The architecture also provides an approach for dynamically updating the product and offering its users the latest generation of technology even after the users have already purchased the product. In particular, the embodiments employ the communication interfaces to also provide connection to a remote network that can update or upgrade the product's software when the product is out in the field. | 12-04-2008 |
| 20080300920 | HEALTH DATA MANAGEMENT DEVICE - A device for managing health data provides a first housing portion including a data storage system that stores health data and a second housing portion including a data communications element. The data communications element provides data communications between the data storage system and a processing device that processes the health data according to a data-management software. The first housing portion and the second housing portion are connected by a cable that communicates signals between the data communications element and other components in the first housing portion. Another device for managing health data provides a first housing portion including a health data management system and a data communications element that provides data communications between the health data management system and an external processing device. The second housing portion is removably coupled to the first housing portion, and includes at least one component used by the health data management system. | 12-04-2008 |
| 20080301158 | SYSTEM AND METHOD FOR MANAGING HEALTH DATA - A portable data-management system may be easily employed with multiple processing devices by eliminating the need to pre-install additional programs, agents, device drivers, or other software components on the hosts. A portable storage device contains software for a data-management application, which receives and processes test data from a meter that measures an analyte. The portable device may employ an interface protocol that makes the portable device immediately compatible with different operating systems and hardware configurations. Once the portable device is connected to the host, the data-management application can be automatically launched. The convenience and portability of a data-management system may be enhanced by integrating advanced data processing and display features with the portable device. The users may access some advanced presentations of health data without having to launch the data-management application on a separate host. | 12-04-2008 |
| 20080301665 | ARCHITECTURE FOR FIELD UPGRADE OF A HEALTH MONITORING SYSTEM - An architecture allows individual system components to be developed and tested individually, i.e., as distinct modules, and to be subsequently combined through standardized electrical and communication interfaces. Any combination of these modules can be implemented to form different products that provide any number of functions, such as an integrated system for monitoring a health condition and/or delivering a medication. The architecture also provides an approach for dynamically updating the product and offering its users the latest generation of technology even after the users have already purchased the product. In particular, the embodiments employ the communication interfaces to also provide connection to a remote network that can update or upgrade the product's software when the product is out in the field. | 12-04-2008 |
| 20090125636 | Payload allocation methods for scalable multimedia servers - The dynamic streaming of multimedia data between a data server and one or more clients is disclosed. Dynamic streaming enables the rapid and accurate characterization of the end-to-end path conditions in a server-client streaming session, as well as the rapid and intelligent response to those conditions in terms of source compression prior to data packetization. The most significant bits of an original bit stream can be adaptively and immediately selected in response to network conditions. The adaptive selection process is informed by feedback from the client receiver indicative of a time-to-transit the network from server to client. A control protocol and server architecture, including file format, data structure, data processing procedures, cache control mechanisms, and adaptation algorithms useful in implementing dynamic streaming are also disclosed. | 05-14-2009 |
| 20100299075 | SYSTEMS AND METHODS FOR CALCULATING AN AVERAGE ANALYTE CONCENTRATION VALUE - Embodiments provide methods and systems wherein analyte concentration readings taken over a first period of time are collected and processed to determine one or more analyte concentration averages. The methods include collecting samples with a measurement system (e.g., a Blood Glucose Meter) over a first period of time, dividing the first period of time into smaller time increments, and calculating an average analyte concentration based on first sub-averages obtained from each of the smaller time increments. Systems for carrying out the analyte concentration averages are described, as are other aspects. | 11-25-2010 |
| Patent application number | Description | Published |
|---|
| 20080205293 | Time Scale Separated Network Management and Network Provisioning Optimizations - A communication network is configured to implement time scale separated management and provisioning optimizations, for example, in a core optical network coupled to multiple data networks. Network management optimizations are performed at respective points in time separated by intervals of a first time scale, and network provisioning optimizations are performed at respective points in time separated by intervals of a second time scale, with the intervals of the second time scale being on average substantially longer than the intervals of the first time scale. Moreover, at least a given one of the intervals of the second time scale has a length which is determined based on results of performance of one or more of the network management optimizations. The core optical network maybe configured utilizing information specified by the network management and network provisioning optimizations. | 08-28-2008 |
| 20090055238 | Meeting optimizer - A meeting location that is “fair” to all the participants may be selected based on at least the travel circumstances and at least two initial criteria by which an optimal meeting location will be selected, at least one of which has values that are determined for each respective one of the meeting participants using at least information derived from the travel circumstances. Note that by “fair” it is generally intended that no participant can reduce his burden without significantly increasing the burden of some other participant. The meeting location may be determined using a multi-criterial approach. A criterion in this context is a particular property of the travel pertaining to a particular user. In the multi-criterial approach, one selects a preference relation based on each of the individual criteria, and the set of non-dominated alternatives is the outcome of the optimization process. | 02-26-2009 |
| 20120173394 | DEVICE AND METHOD FOR ALLOCATING REVENUE AMONG PROVIDERS OF BUNDLED OFFERINGS - An exemplary device for allocating revenue among providers of products that are offered together for purchase as part of a unit includes a processor that is configured to automatically determine a number of unit or offering purchases. The processor is configured to automatically issue a corresponding number of virtual shares to each of the providers. The number of virtual shares issued to each provider is based on the number of unit or offering purchases and a predetermined allocation of a number of virtual shares for each provider, respectively for each purchase. The processor is also configured to determine a value of each issued virtual share using at least one selected revenue sharing rule according to a determined schedule. A virtual share redemption module facilitates payment responsive to redemption of issued virtual shares at the determined value. | 07-05-2012 |
| Patent application number | Description | Published |
|---|
| 20080298766 | Interactive Photo Annotation Based on Face Clustering - An interactive photo annotation method uses clustering based on facial similarities to improve annotation experience. The method uses a face recognition algorithm to extract facial features of a photo album and cluster the photos into multiple face groups based on facial similarity. The method annotates a face group collectively using annotations, such as name identifiers, in one operation. The method further allows merging and splitting of face groups. Special graphical user interfaces, such as displays in a group view area and a thumbnail area and drag-and-drop features, are used to further improve the annotation experience. | 12-04-2008 |
| 20080304735 | Learning object cutout from a single example - Systems and methods are described for learning visual object cutout from a single example. In one implementation, an exemplary system determines the color context near each block in a model image to create an appearance model. The system also learns color sequences that occur across visual edges in the model image to create an edge profile model. The exemplary system then infers segmentation boundaries in unknown images based on the appearance model and edge profile model. In one implementation, the exemplary system minimizes the energy in a graph-cut model where the appearance model is used for data energy and the edge profile is used to modulate edges. The system is not limited to images with nearly identical foregrounds or backgrounds. Some variations in scale, rotation, and viewpoint are allowed. | 12-11-2008 |
| 20080304743 | ACTIVE SEGMENTATION FOR GROUPS OF IMAGES - Systems and methods of segmenting images are disclosed herein. The similarity of images in a set of images is compared. A group of images is selected from the set of images. The images in the group of images are selected based on compared similarities among the images. An informative image is selected from the group of images. User-defined semantic information of the informative image is received. The group of images as a graph is modeled as a graph. Each image in the group of images denotes a node in the graph. Edges of the graph denote a foreground relationship between images or a background relationship between images. One or more images in the group of images are automatically segmented by propagating the semantic information of the informative image to images in the group of images having a corresponding graph node that is related to a graph node corresponding to the informative image. Segmentation results can be refined according to user provided image semantics. | 12-11-2008 |
| 20080309617 | Graphical communication user interface - New devices, systems and methods are hereby provided that enable a user to open a communication channel by selecting an image on a monitor. A device that includes a monitor and a graphical position user input mechanism is configured to display one or more images on the monitor, to receive a graphical position user input selecting one of the images, and to open a communication channel directed to a contact information element associated with the selected image. For example, this may include placing a phone call to a selected recipient, or opening an email, instant messaging, or text message composition panel addressed to a selected recipient, by touching, clicking on, or otherwise selecting an image of the recipient, or an image that is associated with the recipient. | 12-18-2008 |
| 20100121792 | Directed Graph Embedding - Directed graph embedding is described. In one implementation, a system explores the link structure of a directed graph and embeds the vertices of the directed graph into a vector space while preserving affinities that are present among vertices of the directed graph. Such an embedded vector space facilitates general data analysis of the information in the directed graph. Optimal embedding can be achieved by measuring local affinities among vertices via transition probabilities between the vertices, based on a stationary distribution of Markov random walks through the directed graph. For classifying linked web pages represented by a directed graph, the system can train a support vector machine (SVM) classifier, which can operate in a user-selectable number of dimensions. | 05-13-2010 |
| 20100135584 | Image-Based Face Search - A search includes comparing a query image provided by a user to a plurality of stored images of faces stored in a stored image database, and determining a similarity of the query image to the plurality of stored images. One or more resultant images of faces, selected from among the stored images, are displayed to the user based on the determined similarity of the stored images to the query image provided by the user. The resultant images are displayed based at least in part on one or more facial features. | 06-03-2010 |
| 20120093411 | Active Segmentation for Groups of Images - Systems and methods of segmenting images are disclosed. The similarity of images in a set of images is compared. A group of images is selected from the set of images. The images in the group of images are selected based on compared similarities among the images. An informative image is selected from the group of images. User-defined semantic information of the informative image is received. The group of images is modeled as a graph. Each image in the group of images denotes a node in the graph. Edges of the graph denote a foreground or background relationship between images. One or more images in the group of images may be automatically segmented by propagating semantic information of the informative image to images in the group having a graph node corresponding to the informative image. Segmentation results can be refined according to user provided image semantics. | 04-19-2012 |
| Patent application number | Description | Published |
|---|
| 20120220792 | PROCESS FOR PRODUCING ALDEHYDES OR KETONES BY OXIDIZING ALCOHOLS WITH OXYGEN - Provided is a process for producing aldehydes or ketones by oxidizing alcohols with oxygen, which comprises oxidizing alcohols to aldehydes or ketones in an organic solvent at room temperature with oxygen or air as an oxidant, wherein ferric nitrate (Fe(NO3)3.9H2O), 2,2,6,6-tetramethylpiperidine N-oxyl (TEMPO) and an inorganic chloride are used as catalysts, the reaction time is 1-24 hours, and the molar ratio of said alcohols, 2,2,6,6-tetramethylpiperidine N-oxyl and the inorganic chloride is 100:1˜10:1˜10:1˜10. The present process has the advantages of high yield, mild reaction conditions, simple operation, convenient separation and purification, recoverable solvents, substrates used therefor being various and no pollution, and therefore it is adaptable to industrialization. | 08-30-2012 |
