Patent application number | Description | Published |
20080307308 | Creating Web Clips - Methods, computer program products, systems and data structures are described to assist a user in identifying a number of potential areas of interest and selecting an area of interest suitable for clipping as the user navigates around a content source. In some implementations, the content source can be parsed and evaluated to identify one or more structural elements that may contain one or more potential areas of interest. The identified elements are then presented to the user. | 12-11-2008 |
20100187311 | BLURRING BASED CONTENT RECOGNIZER - Methods, systems, and apparatus, including computer program products, for identifying regions of interest in an image and identifying a barcode in a degraded image are provided. A region of interest is identified by pre-processing an image, generating a binary image based on a metric calculated on the pre-processed image, and analyzing regions of the image identified using connected components and other analysis. A barcode is identified by searching a population of barcodes, degrading ideal image intensity profiles of candidate barcodes, and comparing the degraded ideal image intensity profiles to an image intensity profile of the degraded image. | 07-29-2010 |
20100189367 | BLURRING BASED CONTENT RECOGNIZER - Methods, systems, and apparatus, including computer program products, for identifying regions of interest in an image and identifying a barcode in a degraded image are provided. A region of interest is identified by pre-processing an image, generating a binary image based on a metric calculated on the pre-processed image, and analyzing regions of the image identified using connected components and other analysis. A barcode is identified by searching a population of barcodes, degrading ideal image intensity profiles of candidate barcodes, and comparing the degraded ideal image intensity profiles to an image intensity profile of the degraded image. | 07-29-2010 |
20100191785 | METHOD AND SYSTEM FOR SEAMLESSLY ACCESSING REMOTELY STORED FILES - A system and method by which users via programs on one computer may seamlessly access files remotely stored on other computers that run a well known file access protocol. An operating system extension and an application level network access program are provided. The operating system extension receives file system requests for remote files from the operating system that were issued according to a well known application program interface. The operating system extension forwards the remote file system request to the network access program. The network access program reformats the request according to a well known application level network protocol extension and sends it over a network to a remote computer system. | 07-29-2010 |
20100198784 | Method and System Using Reusable State Information for Synchronization and Maintenance of Data - A system for synchronization whereby metadata repository maintains information regarding the history and status of data items in a data repository. Data items are associated with states and such states changes (e.g. increment) in response to changes to the data items. History statements associated with the same states describe the changes in a generic enough fashion that multiple data items may be associated with a single state (e.g. if multiple data items share a common history such as that they were all edited by a user on the same device). The history repository is synchronized with other history repositories so as to reflect the states of data items on multiple devices. The synchronized history stores are used during synchronization to identify and resolve data conflicts through ancestry of data item history. | 08-05-2010 |
20110173311 | Invitation to Bind to a Device - A server device sends a list of account holders together with an invitation to bind to the server. A client device can decide to present the invitation to a user for decision only if the client device finds a match between the list and the user. | 07-14-2011 |
20110292051 | Automatic Avatar Creation - A three-dimensional (“3D”) avatar can be automatically created that resembles the physical appearance of an individual captured in one or more input images or video frames. The avatar can be further customized by the individual in an editing environment and used in various applications, including but not limited to gaming, social networking and video conferencing. | 12-01-2011 |
20120066135 | Method and Apparatus for Enforcing Software Licenses - A method and apparatus for enforcing software licenses for resource libraries such as an application program interface (API), a toolkit, a framework, a runtime library, a dynamic link library (DLL), an applet (e.g., a Java or ActiveX applet), or any other reusable resource. The resource library can be used by authorized end user software programs. A “per-program” licensing scheme for a resource library can allow a resource library to be licensed only for use with particular software programs. | 03-15-2012 |
20120284337 | Invitation to Bind to a Device - A server device sends a list of account holders together with an invitation to bind to the server. A client device can decide to present the invitation to a user for decision only if the client device finds a match between the list and the user. | 11-08-2012 |
20130084003 | Psychovisual Image Compression - Psychovisual image compression techniques are disclosed that compress pixel data by a fixed compression ratio with little or no perceptual loss of detail. In some implementations, a psychovisual compression process is selected among several psychovisual compression processes based on characteristics of the pixel data. Compression is achieved during encoding by discarding psychovisually unnecessary bits from the pixel data. The psychovisual compression processes can be implemented in hardware and operate on scan lines of pixels captured by the image sensor. The psychovisual compression techniques can be used with image compression techniques to compress further the pixel data. | 04-04-2013 |
20130179989 | METHOD AND APPARATUS FOR ENFORCING SOFTWARE LICENSES - A method and apparatus for enforcing software licenses for resource libraries such as an application program interface (API), a toolkit, a framework, a runtime library, a dynamic link library (DLL), an applet (e.g., a Java or ActiveX applet), or any other reusable resource. The resource library can be used by authorized end user software programs. A “per-program” licensing scheme for a resource library can allow a resource library to be licensed only for use with particular software programs. | 07-11-2013 |
20130198462 | REUSABLE CONTENT ADDRESSABLE STORES AS BUILDING BLOCKS FOR CREATING LARGE SCALE STORAGE INFRASTRUCTURES - Techniques are described for using chunk stores as building blocks to construct larger chunk stores. A chunk store constructed of other chunk stores (a composite chunk store) may have any number and type of building block chunk stores. Further, the building block chunk stores within a composite chunk store may be arranged in any manner, resulting in any number of levels within the composite chunk store. The building block chunk stores expose a common interface, and apply the same hash function to content of chunks to produce the access key for the chunks. Because the access key is based on content, all copies of the same chunk will have the same access key, regardless of the chunk store that is managing the copy. In addition, no other chunk will have that same access key. | 08-01-2013 |
20130198475 | CONTENT ADDRESSABLE STORES BASED ON SIBLING GROUPS - A content addressable storage (CAS) system is provided in which each storage unit is assigned to one of a plurality of sibling groups. Each sibling group is assigned the entire hash space. Within each sibling group, the hash space is partitioned into hash segments which are assigned to the individual storage units that belong to the sibling group. Chunk retrieval requests are submitted to all sibling groups. Chunk storage requests are submitted to a single sibling group. The sibling group to which a storage request is submitted depends on whether any sibling group already stores the chunk, and which sibling groups are considered full. | 08-01-2013 |
20130218839 | METHOD AND SYSTEM USING REUSABLE STATE INFORMATION FOR SYNCHRONIZATION AND MAINTENANCE OF DATA - A system for synchronization whereby metadata repository maintains information regarding the history and status of data items in a data repository. Data items are associated with states and such states changes (e.g. increment) in response to changes to the data items. History statements associated with the same states describe the changes in a generic enough fashion that multiple data items may be associated with a single state (e.g. if multiple data items share a common history such as that they were all edited by a user on the same device). The history repository is synchronized with other history repositories so as to reflect the states of data items on multiple devices. The synchronized history stores are used during synchronization to identify and resolve data conflicts through ancestry of data item history. | 08-22-2013 |
20140188816 | DETECTING DEVIATION BETWEEN REPLICAS USING BLOOM FILTERS - Techniques are provided for using near-full bloom filters for efficiently identifying hash slices in which the deviation between replicas is sufficient to justify remedial measures. Techniques are also described for adjusting the size of slices and the size of the bloom filters, so that the bloom-filter-to-bloom-filter comparison serves as an accurate indicator of the degree to which the contents of the slices of a slice pair have deviated. Slice size may vary from slice pair to slice pair, so that relatively sparsely populated portions of the ring (access key ranges into which fewer chunks fall) are represented by relatively larger slices, while relatively densely populated portions of the ring (access key ranges into which more chunks fall) are represented by relatively smaller slices. | 07-03-2014 |
Patent application number | Description | Published |
20080216092 | SYSTEM AND METHOD FOR OPPORTUNISTIC IMAGE SHARING - A system for requesting data from another includes means for automatically appending a request for certain information to an outgoing message. In one embodiment, an e-mail editor provides the sender-user with an option for causing the email to include a request for missing or desired contact information, such as a picture. The appended request may be in the form of an added e-mail header, e.g. “I need your picture.” On the receiving side of the email, the incoming messages may be parsed for such requests. Any requests that are found in incoming email may be remembered by the receiving system using a dedicated data structure or some indications (e.g. flags) in an existing data structure. When email is composed on the receiving system, the “remembered” request information may be used to facilitate responses to pending requests. In this manner, email correspondents may opportunistically use their email traffic to maintain updated information regarding each other. | 09-04-2008 |
20080307174 | Dual Use Memory Management Library - A dual-use library that is able to handle calls from programs requiring either reference count or garbage collected memory management is described. This capability may be provided by introducing a new assignment routine, assign( ), and instrumenting the reference count routines responsible for updating an object's reference count—e.g., addReference( ) and removeReference( ) routines. The assign( ), addReferenc( ) and removeReference( ) routines determine, at runtime, which memory management scheme is appropriate and execute the appropriate instructions (i.e., reference count or garbage collection specific instructions). The described dual-use library provides equivalent functionality as prior art two library implementations, but with a significantly lower memory footprint. | 12-11-2008 |
20090177748 | SYSTEM AND METHOD FOR AUTOMATIC OPPORTUNISTIC DATA AND IMAGE SHARING - A system for requesting data from another includes means for automatically appending a request for certain information to an outgoing message. In one embodiment, an e-mail editor includes an on-screen “radio button” for causing a request for missing contact information to be appended to the message being composed. The system may automatically parse incoming messages for the requested information which may be extracted and stored automatically. Information may be associated with a date which triggers an automatic request for updated information. Certain embodiments of the invention may be one-sided—implemented on a single programmed system. Other embodiments are implemented on multiple systems such that the process may be automated on both the requesting and replying systems. In yet other embodiments, a website or file server is employed to upload and download requested information. | 07-09-2009 |