Patent application number | Description | Published |
20120281005 | Method Of And Apparatus For Encoding And Decoding Data - Each block of texture data elements is encoded as a block of texture data that includes a set of integer values to be used to generate a set of base data values for the block, and a set of index values indicating how to use the base data values to generate data values for the texture data elements that the block represents. The integer values and the index values are both encoded in an encoded texture data block using a combination of base-n values, where n is greater than two, and base-2 values. Predefined bit representations are used to represent plural base-n values (n>2) collectively, and the bits of the bit representations representing the base-n values are interleaved with bits representing the base-2 values in the encoded texture data block. | 11-08-2012 |
20120281006 | Method Of And Apparatus For Encoding And Decoding Data - A texture map | 11-08-2012 |
20120281007 | Method Of And Apparatus For Encoding And Decoding Data - Each block of texture data elements is encoded as a block of texture data that includes: data indicating how to generate a set of data values to be used to generate data values for a set of the texture data elements that the block represents; data indicating a set of integer values to be used to generate the set of data values to be used to generate data values for a set of the texture data elements that the block represents; data indicating a set of index values indicating how to use the generated set of data values to generate data values for texture data elements of the set of texture data elements that the generated set of data values is to be used for; and data indicating the indexing scheme that has been used for the block. | 11-08-2012 |
20120281925 | Method Of And Apparatus For Encoding And Decoding Data - Each block of texture data elements is encoded as a block of texture data. The encoding process includes determining for each block of texture data elements whether the set of texture data elements of the block all have sufficiently similar data values. If they do, the extent of a region within the texture including the block in which every texture data element has sufficiently similar data values is then determined, and an encoded texture data block to represent the block of texture data elements that indicates that the block specifies a region within the texture in which every texture data element is to be allocated the same data value when decoded, and that includes data indicating the constant data value for the block and data indicating the extent of the region within the texture that the block relates to, is generated. | 11-08-2012 |
20140267283 | METHODS OF AND APPARATUS FOR ENCODING AND DECODING DATA - To encode a texture to be used in a graphics processing system, the texture is first downscaled to generate a lower resolution representation of the texture | 09-18-2014 |
20140327688 | GRAPHICS PROCESSING SYSTEMS - A tile-based graphics processing pipeline comprising a rasteriser | 11-06-2014 |
20140368521 | GRAPHICS PROCESSING SYSTEMS - A tile-based graphics processing pipeline comprising a rasteriser | 12-18-2014 |
Patent application number | Description | Published |
20140014768 | WING FOLD CONTROLLER - Illustrative embodiments may provide for an apparatus and method of controlling the folding of a wing. The apparatus may include a sensor, an actuator, and a wing fold controller. The method may include receiving a status of at least one of an aircraft and a wing fold system of the aircraft by the wing fold controller of the wing fold system. The method may also include receiving an automated command by the wing fold controller in response to receiving the status. The method may also include operating the wing fold system by the wing fold controller based on the automated command and the status. The method may also include transitioning a wingtip of a wing of the aircraft to one of a flight position and a folded position by an actuator of the wing fold system in response to commands from the wing fold controller. | 01-16-2014 |
20140061371 | WING FOLD SYSTEM WITH LATCH PINS THROUGH MULTIPLE MATING LUGS - A wing fold system of a wing of an aircraft. The system may include a first lock of a latch to prevent movement of a latch pin of the latch to prevent movement of an unfixed portion of the wing with respect to a fixed portion of the wing, the first lock may include a first cam configured to prevent the second lock from transitioning to a second engaged position until the first lock may be in a first engaged position via contact with a second cam of the second lock. A second lock of the latch, the second lock may include the second cam configured to prevent the first lock from transitioning away from the first engaged position until the second lock transitions away from the second engaged position. | 03-06-2014 |
20150014478 | WING FOLD CONTROLLER - Illustrative embodiments may provide for an apparatus and method of controlling the folding of a wing. The apparatus may include a sensor, an actuator, and a wing fold controller. The method may include receiving a status of at least one of an aircraft and a wing fold system of the aircraft by the wing fold controller of the wing fold system. The method may also include receiving an automated command by the wing fold controller in response to receiving the status. The method may also include operating the wing fold system by the wing fold controller based on the automated command and the status. The method may also include transitioning a wingtip of a wing of the aircraft to one of a flight position and an on-ground position by an actuator of the wing fold system in response to commands from the wing fold controller. | 01-15-2015 |
Patent application number | Description | Published |
20100274734 | Credit Portfolio Benchmarking System and Method - A portfolio benchmarking system comprises a repository of trade data, a repository of consumer data, a build computer, and a benchmarking query application. The repository of trade data comprises a plurality of data items regarding trade lines. The repository of consumer data comprises a plurality of data items regarding consumers, wherein at least some information in the consumer data is not in the trade data and at least some information in the trade data is not in the consumer data. The build computer periodically generates at least one data file comprising a plurality of data items, each data item combining information from the trade data and the consumer data, such that searches can be performed on the combined data without joining trade data and consumer data at query run time. The benchmarking query application executes queries on the data file generated by the build computer. | 10-28-2010 |
20110137824 | CREDIT PORTFOLIO BENCHMARKING SYSTEM AND METHOD - A portfolio benchmarking system comprises a repository of trade data, a repository of consumer data, a build computer, and a benchmarking query application. The repository of trade data comprises a plurality of data items regarding trade lines. The repository of consumer data comprises a plurality of data items regarding consumers, wherein at least some information in the consumer data is not in the trade data and at least some information in the trade data is not in the consumer data. The build computer periodically generates at least one data file comprising a plurality of data items, each data item combining information from the trade data and the consumer data, such that searches can be performed on the combined data without joining trade data and consumer data at query run time. The benchmarking query application executes queries on the data file generated by the build computer. | 06-09-2011 |
20130124392 | SYSTEMS AND METHODS FOR LARGE-SCALE CREDIT DATA PROCESSING - Systems and methods are provided for processing large volumes of credit-related data and other data, and generating products based on the processed data. Data received from a number of different data sources may be processed in parallel and stored in memory. Reporting rules may be defined in association with each of a number of different accounts. Products, such as credit reports, may then be generated based on one or more rule sets. | 05-16-2013 |
20140156500 | SYSTEMS AND METHODS FOR PROVIDING A CUSTOMIZABLE CREDIT REPORT - Systems and methods are provided for enabling a user to select the types of data to be included in a credit reporting product, and for generating credit reports that are configured to be dynamically updated with additional data in response to user selections. In some embodiments, data selectable by a user for inclusion in a credit report or other product may include a variety of data not typically found on traditional credit reports. | 06-05-2014 |
20140156503 | SYSTEMS AND METHODS FOR PROVIDING A CUSTOMIZABLE CREDIT REPORT - Systems and methods are provided for enabling a user to select the types of data to be included in a credit reporting product, and for generating credit reports that are configured to be dynamically updated with additional data in response to user selections. In some embodiments, data selectable by a user for inclusion in a credit report or other product may include a variety of data not typically found on traditional credit reports. | 06-05-2014 |
20140258083 | SYSTEMS AND METHODS FOR MICROFINANCE CREDIT DATA PROCESSING AND REPORTING - Systems and methods are provided for processing microfinance-related credit data and generating credit reports based on the processed microfinance credit data. Payment status may be determined for each entry in a payment grid, which may correspond to a payment interval such as, for example, daily, weekly or monthly. Credit reports may be generated with selectable options enabling the user to view at least one other payment grid having entries corresponding to a different payment interval. | 09-11-2014 |
Patent application number | Description | Published |
20110019769 | MULTI STAGE CODE GENERATOR AND DECODER FOR COMMUNICATION SYSTEMS - A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols. | 01-27-2011 |
20110103519 | Systems and processes for decoding chain reaction codes through inactivation - A method for processing a chain reaction code includes first selecting a source symbol which is associated with an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one. | 05-05-2011 |
20120136973 | SCHEDULING OF MULTIPLE FILES FOR SERVING ON A SERVER - Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates. | 05-31-2012 |
Patent application number | Description | Published |
20080309525 | MULTI-STAGE CODE GENERATOR AND DECODER FOR COMMUNICATION SYSTEMS - A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols. | 12-18-2008 |
20090144601 | FEC-BASED RELIABILITY CONTROL PROTOCOLS - In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender. If an indication of failure to recover the first data block is received at the sender, sending further encoding units for the first data block from the sender to the receiver. In some embodiments, the predetermined test is a comparison of the probability against the threshold probability and the predetermined test is met when the probability is greater than the threshold probability. | 06-04-2009 |
20090210547 | SCHEDULING OF MULTIPLE FILES FOR SERVING ON A SERVER - Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates. | 08-20-2009 |
20130114439 | AUTOMATIC FRAMING SELECTION - Network traffic is monitored and an optimal framing heuristic is automatically determined and applied. Framing heuristics specify different rules for framing network traffic. While a framing heuristic is applied to the network traffic, alternative framing heuristics are speculatively evaluated for the network traffic. The results of these evaluations are used to rank the framing heuristics. The framing heuristic with the best rank is selected for framing subsequent network traffic. Each client/server traffic flow may have a separate framing heuristic. The framing heuristics may be deterministic based on byte count and/or time or based on traffic characteristics that indicate a plausible point for framing to occur. The choice of available framing heuristics may be determined partly by manual configuration, which specifies which framing heuristics are available, and partly by automatic processes, which determine the best framing heuristic to apply to the current network traffic from the set of available framing heuristics. | 05-09-2013 |
20140237090 | SERVER MAINTENANCE SYSTEM - A method includes: determining a maintenance update for a data service tier based on a service condition of a data service of a target host server; selecting a spare host server to perform the maintenance update; performing the maintenance update of the data service tier to the spare host server; activating the data service on the spare host server; and redirecting client request traffic to the spare host server. | 08-21-2014 |
Patent application number | Description | Published |
20140032563 | Indexing Based on Object Type - In one embodiment, a method includes maintaining data stores for objects of a social-networking system, each data store being configured to store objects of a particular one of multiple object types indexed by a search index; receiving an object; identifying an object type of the received object; storing the received object in at least one data store being configured to store objects of the identified object type; and updating the search index of the at least one data store based on the received object. | 01-30-2014 |
20140181091 | Extract Operator - In one embodiment, a method includes receiving a search query requesting first search results of a first object type. The search query includes an inner query requesting second search results of a second object type. The method includes accessing an inverted index of a data store corresponding to the second object type; retrieving the second search results requested by the inner query using the inverted index of the data store corresponding to the second object type; accessing a forward index of the data store corresponding to the second object type; retrieving the first search results requested by the search query using the second search results and the forward index of the data store corresponding to the second object type. | 06-26-2014 |
20140280041 | Short-Term Hashes - In one embodiment, a server receives a search query; the server determines search terms based on the received search query, each search term including a prefix and a suffix; for each of the search term, the server generates a first binary number based on the each search term's prefix and suffix, and accesses and retrieves search results of the each search term from data stores by hashing the first binary number; the server also aggregates search results of the respective search terms. | 09-18-2014 |
20140351203 | Database Sharding with Update Layer - In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The search term is associated with a number of content objects exceeding a pre-determined threshold number. The content objects associated with the search term are indexed on a list of one or more index servers. The list includes identifier information corresponding to the content objects. The method also includes modifying the list of one or more of the index servers in response to the update. | 11-27-2014 |
20140351204 | Database Sharding with Incorporated Updates - In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The content objects associated with the search term are indexed on a list of one or more index servers or a term server. The list of the term server include identifier information of one or more content object types. The list of the index servers include identifier information of a single content object type. The method also includes determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. | 11-27-2014 |
20150088901 | Extract Operator - In one embodiment, a method includes receiving, from a user, a search query requesting objects of a first object type. The search query includes an inner query requesting objects of a second object type. The method includes identifying objects of the second object type requested by the inner query using an inverted index of a data store corresponding to the second object type; identifying objects of the first object type requested by the search query using the identified objects of the second object type and a forward index of the data store corresponding to the second object type; and sending search results to the user responsive to the search query, each search result corresponding to an identified object of the first object type. | 03-26-2015 |