Patent application number | Description | Published |
20110135707 | POLYHYDROXYALKANOATES FOR IN VIVO APPLICATIONS - Polyhydroxyalkanoates (PHAs) from which pyrogen has been removed are provided for use in numerous biomedical applications. PHAs which have been chemically modified to enhance physical and/or chemical properties, for targeting or to modify biodegradability or clearance by the reticuloendothelial system (RES), are described. Methods for depyrogenating PHA polymers prepared by bacterial fermentation processes are also provided, wherein pyrogens are removed from the polymers without adversely impacting the polymers' inherent chemical structures and physical properties. PHAs with advantageous processing characteristics, including low melting points and/or solubility in non-toxic solvents, are also described. PHAs are provided which are suitable for use in in vivo applications such as in tissue coatings, stents, sutures, tubing, bone and other prostheses, bone or tissue cements, tissue regeneration devices, wound dressings, drug delivery, and for diagnostic and prophylactic uses. Properties which are selected for include degradability, elasticity, inclusion of functional groups or derivatized groups, which can in turn be used to attach targeting agents, and bioadhesion. | 06-09-2011 |
20120328523 | POLYHYDROXYALKANOATES FOR IN VIVO APPLICATIONS - Polyhydroxyalkanoates (PHAs) from which pyrogen has been removed are provided. PHAs which have been chemically modified to enhance physical and/or chemical properties, for targeting or to modify biodegradability or clearance by the reticuloendothelial system (RES), are described. Methods for depyrogenating PHA polymers prepared by bacterial fermentation processes are also provided, wherein pyrogens are removed from the polymers without adversely impacting the polymers' inherent chemical structures and physical properties. PHAs with advantageous processing characteristics, including low melting points and/or solubility in non-toxic solvents, are also described. The PHAs are suitable for use in in vivo applications such as in tissue coatings, stents, sutures, tubing, bone, other prostheses, bone or tissue cements, tissue regeneration devices, wound dressings, drug delivery, and for diagnostic and prophylactic uses. | 12-27-2012 |
Patent application number | Description | Published |
20120166390 | METHOD AND APPARATUS FOR MAINTAINING REPLICA SETS - Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node. | 06-28-2012 |
20120226889 | SYSTEM AND METHOD FOR DETERMINING EXACT LOCATION RESULTS USING HASH ENCODING OF MULTI-DIMENSIONED DATA - Aspects of the present invention are directed to system and methods for optimizing identification of locations within a search area using hash values. A hash value represents location information in a single dimension format. Computing points around some location includes calculating an identification boundary that surrounds the location of interest based on the location's hash value. The identification boundary is expanded until it exceeds a search area defined by the location and a distance. Points around the location can be identified based on having associated hash values that fall within the identification boundary. Hashing operations let a system reduce the geometric work (i.e. searching inside boundaries) and processing required, by computing straightforward operations on hash quantities (e.g. searching a linear range of geohashes), instead of, for example, point to point comparisons. | 09-06-2012 |
20120254175 | SYSTEM AND METHOD FOR OPTIMIZING DATA MIGRATION IN A PARTITIONED DATABASE - According to one aspect, provided is a horizontally scaled database architecture. Partition a database enables efficient distribution of data across a number of systems reducing processing costs associated with multiple machines. According to some aspects, the partitioned database can be manages as a single source interface to handle client requests. Further, it is realized that by identifying and testing key properties, horizontal scaling architectures can be implemented and operated with minimal overhead. In one embodiment, databases can be partitioned in an order preserving manner such that the overhead associated with moving the data for a given partition can be minimized during management of the data and/or database. In one embodiment, splits and migrations operations prioritize zero cost partitions, thereby, reducing computational burden associated with managing a partitioned database. | 10-04-2012 |
20130110771 | SYSTEMS AND METHODS FOR DURABLE DATABASE OPERATIONS IN A MEMORY-MAPPED ENVIRONMENT | 05-02-2013 |
20130290249 | LARGE DISTRIBUTED DATABASE CLUSTERING SYSTEMS AND METHODS - Systems and methods are provided for managing asynchronous replication in a distributed database environment, while providing for scaling of the distributed database. A cluster of nodes can be assigned roles for managing partitions of data within the database and processing database requests. In one embodiment, each cluster includes a node with a primary role to process write operations and mange asynchronous replication of the operations to at least one secondary node. Each cluster or set of nodes can host one or more partitions of database data. Collectively, the cluster or set of nodes define a shard cluster that hosts all the data of the distributed database. Each shard cluster, individual nodes, or sets of nodes can be configured to manage the size of any hosted partitions, splitting database partitions, migrating partitions, and/or managing expansion of shard clusters to encompass new systems. | 10-31-2013 |
20140032525 | AGGREGATION FRAMEWORK SYSTEM ARCHITECTURE AND METHOD - Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations. | 01-30-2014 |
20140032579 | AGGREGATION FRAMEWORK SYSTEM ARCHITECTURE AND METHOD - Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations. | 01-30-2014 |
20140164831 | METHOD AND APPARATUS FOR MAINTAINING REPLICA SETS - Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node. | 06-12-2014 |
20140258255 | SYSTEM AND METHOD FOR MINIMIZING LOCK CONTENTION - According to one aspect, provided are methods and systems for minimizing lock contention in a distributed database environment. The methods and systems can include a database management component configured to manage database instances, the database management component also configured to receive a first data request operation on the distributed database, an execution component configured to process the first data request operation including at least one write request on at least one database instance managed by the database management component, and a fault prediction component configured to detect a potential page fault responsive to a target data of the write request, wherein the execution component is further configured to suspend execution of the first data request operation, request access a physical storage to read the target data into active memory, and re-execute the first data request operation after a period of time for suspending the first data request operation. | 09-11-2014 |
20150161122 | SYSTEM AND METHOD FOR DETERMINING EXACT LOCATION RESULTS USING HASH ENCODING OF MULTI-DIMENSIONED DATA - Aspects of the present invention are directed to system and methods for optimizing identification of locations within a search area using hash values. A hash value represents location information in a single dimension format. Computing points around some location includes calculating an identification boundary that surrounds the location of interest based on the location's hash value. The identification boundary is expanded until it exceeds a search area defined by the location and a distance. Points around the location can be identified based on having associated hash values that fall within the identification boundary. Hashing operations let a system reduce the geometric work (i.e. searching inside boundaries) and processing required, by computing straightforward operations on hash quantities (e.g. searching a linear range of geohashes), instead of, for example, point to point comparisons. | 06-11-2015 |
20150193463 | SYSTEMS AND METHODS FOR DURABLE DATABASE OPERATIONS IN A MEMORY-MAPPED ENVIRONMENT - A durable memory-mapped database system includes a first memory-mapped view of a database, a second memory-mapped view of the database, a journal buffer and a journal. The first memory-mapped view of the database is a protected view and includes copies of a plurality of datafiles from the database. The second memory-mapped view of the database is a write view and includes copies of the plurality of datafiles. The journal buffer is a buffer in random access memory configured to record datafile updates. The journal is configured to periodically receive recorded datafile updates from the journal buffer. | 07-09-2015 |
20150278295 | AGGREGATION FRAMEWORK SYSTEM ARCHITECTURE AND METHOD - Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations. | 10-01-2015 |
Patent application number | Description | Published |
20120267362 | Expanding Garbage Receptacle - A garbage receptacle made of a plurality of side walls, where at least one side wall is connected to a hinge, which allows the side wall to fold outward, decreasing the resistance between the garbage bag and receptacle, making it less strenuous to remove the garbage bag. Built in obstructions block side walls from folding in or out too far and with the use of elastic and/or magnetic materials, the side walls return to their default upright positions. The position of the side walls can be controlled by hand, pedal or handle. | 10-25-2012 |
20120295773 | Combined Exercise Strap - The Combined Exercise Strap of the invention is a strap that reduces the amount of objects a user needs to carry while exercising. The strap has at least one pouch or a plurality of pouches. The pouch can hold objects including a pedometer, weight, watch, pulse monitor, cell phone, music player, or money. | 11-22-2012 |
20120318820 | Multiple Liquid Dispenser - A Multiple Liquid Dispenser of the invention holds at least one or a plurality of liquids that are dispensed from a single appliance. The dispenser may contain liquids including beverages, sanitizers, hand soap and dish washing soap. The dispenser also has an elongated spout, a stable wide base and the option for a liquid temperature controller. Using a single appliance minimizes the amount of separated liquids containers that might be otherwise placed near the sink of the bathroom or kitchen. | 12-20-2012 |
20130113234 | Automatic Window Cover - An Automatic Window Cover of the invention allows a vehicle user to activate motorized window shades that may include a reflective surface to reflect light that may otherwise cause the vehicle to heat up. | 05-09-2013 |
Patent application number | Description | Published |
20110182354 | Low Complexity, High Frame Rate Video Encoder - Disclosed herein are techniques and computer readable media containing instructions arranged to utilize existing video compression techniques to enhance a visually appealing high frame rate, without incurring the bitrate and computational complexity common to high frame rate coding using conventional techniques. SVC skip slices—slices in which the slice_skip_flag in the slice header is set to a value of | 07-28-2011 |
20120082214 | Delay Aware Rate Control In The Context Of Hierarchical P Picture Coding - The present invention provides bit rate control techniques for a hybrid block based motion compensated predictive video encoder (e.g., H.264, as well as other video coding algorithms and standards). The techniques aim to reduce the picture-to-picture bit rate fluctuations within a prediction structure or over a short time interval that can lead to undesirable additional delay on links without over-provisioned capacity. In one embodiment of the present invention, the end to end delay is estimated. The end to end delay is used to determine limits on the modulation of the target coded picture size, with the goal of trading an acceptable amount of additional delay for a better coding efficiency. | 04-05-2012 |
20120082237 | Automatic Temporal Layer Bit Allocation - Disclosed herein are techniques and computer readable media containing instructions arranged to determine a bit allocation for a temporal base layer and at least one temporal enhancement layer. The techniques are enhanced to yield improved reproduced quality for the case where both a temporal base layer and at least one temporal enhancement layer is being used. An exemplary method for determining a bit allocation to one base layer includes initializing a bit allocation between the base layer and the at least one enhancement layer, determining a quality difference between the base layer and the at least one enhancement layer, expressed, for example, in the Quantizer Parameter of the last picture of each layer within a GOP, and determining a new bit allocation between the base layer and the at least one enhancement layer based on the quality difference and at least one constant factor. | 04-05-2012 |
20120134425 | Method and System for Adaptive Interpolation in Digital Video Coding - Disclosed are techniques for adaptive interpolation filtering of luminance and chrominance samples in the context of motion compensation in video encoding or decoding. A two-dimensional interpolation filter of n×m coefficients may be separable, i.e., it may be separated into two one-dimensional filters with m and n coefficients, respectively. The bitstream may include, per video unit and sub-sample position, information indicating whether to use a newly-generated, a cached, or a default filter that may be a separable two-dimensional filter. The information may be structured in a way that takes advantage of the two-dimensional filter being separable. When a newly-generated filter is signalled, the bitstream may contain information pertaining to the characteristics of the newly-generated filter, such as its coefficients. A decoder may fetch this information from the bitstream to create the filters which are applied to samples of the video unit. An encoder may create a bitstream as described. | 05-31-2012 |
20120163452 | METHOD AND SYSTEM FOR SELECTIVELY BREAKING PREDICTION IN VIDEO CODING - Described are techniques in video coding and/or decoding that allow for selectively breaking prediction and/or in loop filtering across segment boundaries between different segments of a video picture. A high layer syntax element, such as a parameter set or a slice header, may contain one or more indications signalling to an encoder and/or decoder whether an associated prediction or loop filtering tool may be applied across the segment boundary. In response to such one or more indications, the encoder and/or decoder may then control the prediction or loop filtering tool accordingly. | 06-28-2012 |
20120163453 | METHOD AND SYSTEM FOR PICTURE SEGMENTATION USING COLUMNS - Described is picture segmentation through columns and slices in video encoding and decoding. A video picture is divided into a plurality of columns, each column covering only a part of the video picture in a horizontal dimension. All coded tree blocks (“CTBs”) belonging to a slice may belong to one or more columns. The columns may be used to break the same or different prediction or in-loop filtering mechanisms of the video coding, and the CTB scan order used for encoding and/or decoding may be local to a column. Column widths may be indicated in a parameter set and/or may be adjusted at the slice level. At the decoder, column width may be parsed from the bitstream, and slice decoding may occur in one or more columns. | 06-28-2012 |
20120183055 | Temporal Prediction Structure Aware Temporal Filter - Disclosed are a system, method, apparatus, and computer readable media containing instructions for pre-filtering one or more pictures of a prediction structure. In an exemplary embodiment, a system includes an input for receiving the one or more pictures and a pre-filter, operatively coupled to the input and receiving the one or more pictures. The pre-filter can include a prediction position determining module for determining a position of at least one picture in the prediction structure, a context memory for storing determined position information, and a filter module for selecting a filter context based on the determined position and using the selected filter context to filter the at least one picture. | 07-19-2012 |
20120189064 | ADAPTIVE LOOP FILTERING USING MULTIPLE FILTER SHAPES - Disclosed are adaptive loop filtering techniques in the context of video encoding and/or decoding. For each video unit, the encoder can select a filter shape, and can place into the bitstream information that identifies the filter shape. At least one filter whose shape is the selected filter shape is used to loop filter at least one sample. At the decoder, a filter shape is obtained by decoding information that identifies the filter shape. At least one filter whose shape is the obtained filter shape is used to loop filter at least one reconstructed sample. Different filter shapes are also disclosed. | 07-26-2012 |
20120192240 | PARTICIPANT AWARE CONFIGURATION FOR VIDEO ENCODER - Systems and methods for multipoint video distribution are disclosed herein. In some embodiments, system for multipoint video distribution include at least one endpoint including a EECM and a DECM, and at least one server including a SECM, the server being coupled to the endpoint. In some embodiments, methods for configuring an encoder include receiving at least one property related to a capability of a decoder, determining a number of layers to be coded by the encoder, and configuring the encoder based on that at least one property. | 07-26-2012 |
20120195365 | SPATIAL SCALABILITY USING REDUNDANT PICTURES AND SLICE GROUPS - Systems and methods for using redundant pictures and slice groups to encode spatially scalable H.264 Baseline profile conformant video and to route that video to endpoints of varying capabilities without using the Scalable Video extension of H.264 or transcoding. Reduced resolution versions of primary coded pictures are encoded as slice groups in a full-resolution composite pictures, which are added to the video bitstream as redundant pictures. A router then processes the spatially scaled video bitstream into separate streams having different resolutions and routes these to endpoints of varying capabilities. | 08-02-2012 |
20120195367 | ADAPTIVE LOOP FILTERING USING TABLES OF FILTER SETS FOR VIDEO CODING - Disclosed are adaptive loop filtering techniques for video encoding and/or decoding. For a video unit, the encoder selects a set of predefined filters or generates a set of new filters, and places into the bitstream information identifying the set of predefined filters, or information defining the set of new filters. The set of filters may be used for loop filtering of at least one of the reconstructed samples of the video unit. At the decoder, a set of filters may be obtained by, decoding an index that identifies a set of predefined filters, or by decoding information related to a set of new filters. The obtained set of filters may be used for loop filtering of at least one decoded and reconstructed sample of the video unit. | 08-02-2012 |
20130322521 | AUTOMATIC TEMPORAL LAYER BIT ALLOCATION - Disclosed herein are techniques and computer readable media containing instructions arranged to determine a bit allocation for a temporal base layer and at least one temporal enhancement layer. The techniques are enhanced to yield improved reproduced quality for the case where both a temporal base layer and at least one temporal enhancement layer is being used. An exemplary method for determining a bit allocation to one base layer includes initializing a bit allocation between the base layer and the at least one enhancement layer, determining a quality difference between the base layer and the at least one enhancement layer, expressed, for example, in the Quantizer Parameter of the last picture of each layer within a GOP, and determining a new bit allocation between the base layer and the at least one enhancement layer based on the quality difference and at least one constant factor. | 12-05-2013 |
20150092842 | Method and System for Picture Segmentation Using Columns - Described is picture segmentation through columns and slices in video encoding and decoding. A video picture is divided into a plurality of columns, each column covering only a part of the video picture in a horizontal dimension. All coded tree blocks (“CTBs”) belonging to a slice may belong to one or more columns. The columns may be used to break the same or different prediction or in-loop filtering mechanisms of the video coding, and the CTB scan order used for encoding and/or decoding may be local to a column. Column widths may be indicated in a parameter set and/or may be adjusted at the slice level. At the decoder, column width may be parsed from the bitstream, and slice decoding may occur in one or more columns. | 04-02-2015 |
20150237352 | Method and System for Selectively Breaking Prediction in Video Coding - Described are techniques in video coding and/or decoding that allow for selectively breaking prediction and/or in loop filtering across segment boundaries between different segments of a video picture. A high layer syntax element, such as a parameter set or a slice header, may contain one or more indications signalling to an encoder and/or decoder whether an associated prediction or loop filtering tool may be applied across the segment boundary. In response to such one or more indications, the encoder and/or decoder may then control the prediction or loop filtering tool accordingly. | 08-20-2015 |
20150245025 | Method and System for Selectively Breaking Prediction in Video Coding - Described are techniques in video coding and/or decoding that allow for selectively breaking prediction and/or in loop filtering across segment boundaries between different segments of a video picture. A high layer syntax element, such as a parameter set or a slice header, may contain one or more indications signalling to an encoder and/or decoder whether an associated prediction or loop filtering tool may be applied across the segment boundary. In response to such one or more indications, the encoder and/or decoder may then control the prediction or loop filtering tool accordingly. | 08-27-2015 |
20160028995 | SYSTEM AND METHOD FOR POINT TO POINT INTEGRATION OF PERSONAL COMPUTERS WITH VIDEOCONFERENCING SYSTEMS - A system and method for integrating a personal computer based presentation with a videoconferencing system. A coupling device includes a card, insertable into a PCMCIA slot of a laptop computer or like machine, which includes a cable coupled to the card at a first end and to a connector coupled at a second end. The card includes firmware for loading into RAM of the computer and software operable to execute code. | 01-28-2016 |
Patent application number | Description | Published |
20110054953 | Travel Passenger Check-In - This document describes a computer-implemented method for guiding a user through a travel check-in procedure. The method includes receiving passenger identification information associated with a passenger checking in for a travel segment, and determining a check-in status of the passenger using the passenger identification information. The method also includes generating a check-in workflow based on the check-in status of the passenger. The method further includes providing for display on a user interface a current step in the check-in workflow, the current step corresponding to a current action in the check-in workflow to be completed by a user, and upon request of the user to continue to a next step in the workflow, providing for display on the user interface the next step in the check-in workflow, the next step corresponding to a next action in the check-in workflow to be completed by the user. | 03-03-2011 |
20110054954 | Passenger Check-In Finalization - This document describes a computer-implemented method for facilitating a check-in finalization process for a travel passenger. The method includes receiving one or more check-in parameters related to a check-in procedure for a passenger checking in for a travel segment, and determining from the received check-in parameters a check-in workflow status corresponding to which of a plurality of steps of the check-in procedure have been completed. The method also includes identifying one or more finalization actions that are available for finalizing the check-in procedure based on the check-in workflow status. The method further includes determining a primary finalization action from the one or more finalization actions, the primary finalization action being the finalization action most likely to be taken to finalize the check-in procedure. The method also includes providing for display on a user interface the available finalization actions, where the primary finalization action is pre-selected on the user interface. | 03-03-2011 |
20120123812 | EVALUATING CUSTOMERS - Scarce resources, such as goods and/or services, can be allocated to customers according to score values associated with each customer that is a candidate to receive such resources in order to achieve an optimal allocation of resources, as determined by a business or other entity or organization that provides the goods and/or services. Each score value is generated automatically according to a set of predetermined rules based on profile information associated with the customer, including attributes of the customer, and based on information regarding goods and/or services purchased by the customer. A current context is used to determine an event and/or an event class, and the set of rules associated with the event or event class is used in generating the score value for one or more customers that are implicated by the current context, such as individuals affected by or eligible for the event. | 05-17-2012 |
20140058771 | PASSENGER CHECK-IN FINALIZATION - This document describes a computer-implemented method for facilitating a check-in finalization process for a travel passenger. The method includes receiving one or more check-in parameters related to a check-in procedure for a passenger checking in for a travel segment, and determining from the received check-in parameters a check-in workflow status corresponding to which of a plurality of steps of the check-in procedure have been completed. The method also includes identifying one or more finalization actions that are available for finalizing the check-in procedure based on the check-in workflow status. The method further includes determining a primary finalization action from the one or more finalization actions, the primary finalization action being the finalization action most likely to be taken to finalize the check-in procedure. The method also includes providing for display on a user interface the available finalization actions, where the primary finalization action is pre-selected on the user interface. | 02-27-2014 |
20140200933 | TRAVEL PASSENGER CHECK-IN - This document describes a computer-implemented method for guiding a user through a travel check-in procedure. The method includes receiving passenger identification information associated with a passenger checking in for a travel segment, and determining a check-in status of the passenger using the passenger identification information. The method also includes generating a check-in workflow based on the check-in status of the passenger. The method further includes providing for display on a user interface a current step in the check-in workflow, the current step corresponding to a current action in the check-in workflow to be completed by a user, and upon request of the user to continue to a next step in the workflow, providing for display on the user interface the next step in the check-in workflow, the next step corresponding to a next action in the check-in workflow to be completed by the user. | 07-17-2014 |