Fuchs, CA
Axel Fuchs, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20080288954 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR SHARING INFORMATION IN A DISTRIBUTED FRAMEWORK - A system, method and computer program product are provided for sharing information in a distributed system. After information is received, it is stored on a bulletin board. In use, the information is shared, in real-time, among a plurality of heterogeneous processes. | 11-20-2008 |
20120266184 | SYSTEM, METHOD METHOD AND COMPUTER PROGRAM PRODUCT FOR SHARING INFORMATION IN A DISTRIBUTED FRAMEWORK - A system, method and computer program product are provided for sharing information in a distributed system. After information is received, it is stored on a bulletin board. In use, the information is shared, in real-time, among a plurality of heterogeneous processes. | 10-18-2012 |
20140096144 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR SHARING INFORMATION IN A DISTRIBUTED FRAMEWORK - A system, method and computer program product are provided for sharing information in a distributed system. After information is received, it is stored on a bulletin board. In use, the information is shared, in real-time, among a plurality of heterogeneous processes. | 04-03-2014 |
Bill A. Fuchs, Alamo, CA US
Patent application number | Description | Published |
---|---|---|
20080300913 | DoMo1 VIrtual Major DoMo - DoMo I is a suite of interactive Business Intelligence tools for the hospitality industry. DoMo I is a virtual Major Domo, by collecting and analyzing a customer's personal preferences using the proprietary PRIME© (Prospect Resource Information Management Environment). DoMo I can accurately predict a customer's individualized requirements in advance and prepare, select and schedule inventory and services to meet and exceed the customer's varied needs. | 12-04-2008 |
Brian Fuchs, Thousand Oaks, CA US
Patent application number | Description | Published |
---|---|---|
20110261705 | Mapping Traffic Classes to Flow Control Groups - An apparatus, method, and storage medium for testing a network. A traffic generator may generate and transmit test traffic including a plurality of packet streams associated with a plurality of flow control groups. A traffic receiver may receive flow control packets from the network. Flow control logic may generate traffic class state data indicating a paused/not paused state for each of a plurality of traffic classes in accordance with the received flow control packets. A conversion table may map the traffic class state data into flow control data indicating a paused/not paused state for each of the plurality of flow control groups. The traffic generator may be configured to stop transmission of all packet streams associated with paused flow control groups in accordance with the flow control data. | 10-27-2011 |
20120176920 | Tracking Packet Sequence Numbers - Methods, traffic receivers, and computer readable storage media for testing network connections are disclosed. A traffic receiver coupled to a network under test may receive a packet. A packet group identification number (PGID and a sequence number (SN) may be extracted from the received packet. Data associated with the PGID may be retrieved from a memory, the data including a next expected sequence number (NESN), a start of run (SOR), a number of in-order packets (NIO) and a number of duplicate packets (NDP). When SN is equal to NESN, NESN and NIO may be incremented. When SN is less than NESN and SN is greater than or equal to SOR, NDP may be incremented. When SN is greater than NESN, SOR may be set to SN, NESN may be set to SN plus one, and NIO maybe incremented. Updated data may be stored in the memory. | 07-12-2012 |
Detlef Fuchs, Fair Oaks, CA US
Patent application number | Description | Published |
---|---|---|
20110038704 | Sub-field enhanced global alignment - Sub-field enhanced global alignment (SEGA) methods for aligning reconstituted wafers in a lithography process are disclosed. The SEGA methods provide the ability to accommodate chip placement errors for chips supported by a reconstituted wafer when performing a lithographic process having an overlay requirement. The SEGA methods include measuring chip locations to determine sub-fields of the reconstituted wafer over which enhanced global alignment (EGA) can be performed on the chips therein to within the overlay requirement. The SEGA methods further included individually performing EGA over the respective sub-fields. The SEGA methods take advantage of the benefits of both EGA and site-by-site alignment and are particularly applicable to wafer-level packing lithographic processes such as fan-out wafer-level packaging. | 02-17-2011 |
Gil Fuchs, Menlo Park, CA US
Patent application number | Description | Published |
---|---|---|
20080235631 | SYSTEM FOR ASSOCIATING MAP ITEM IMAGES AND TEXT INFORMATION - A system and method for manipulating digital map information, that allows the operator to view or modify map object or item attributes from either a graphical window or a text window. In one embodiment, when the user selects a map item within the graphical window ( | 09-25-2008 |
20080244459 | Method for associating map item images and text information - A system and method for manipulating digital map information, that allows the operator to view or modify map object or item attributes from either a graphical window or a text window. In one embodiment, when the user selects a map item within the graphical window ( | 10-02-2008 |
Matthew Fuchs, Los Gatos, CA US
Patent application number | Description | Published |
---|---|---|
20090292985 | SYSTEM AND METHOD FOR SCHEMA EVOLUTION IN AN E-COMMERCE NETWORK - A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs. | 11-26-2009 |
20100199172 | XML streaming transformer (XST) - The present invention includes devices and methods to specify a document transformation. A template specifies a transformation that is applied to a document in a streaming mode, without building a full object tree in memory representing the document. | 08-05-2010 |
20120317121 | METHODS AND SYSTEMS FOR USING DISTRIBUTED MEMORY AND SET OPERATIONS TO PROCESS SOCIAL NETWORKS - Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed. | 12-13-2012 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 12-13-2012 |
20130007595 | SYSTEM AND METHOD FOR SCHEMA EVOLUTION IN AN E-COMMERCE NETWORK - A method and computer system are described for conducting commercial transactions. An enhanced type of XML schema may be used which supports integrity constraints and polymorphism. Schemas are identified by the use of Uniform Resource Names. XML processors residing on transaction servers or trading partner servers parse document instances by retrieving the URNs corresponding to the schemas used to interpret the document. The URNs are converted to location-dependent URIs in order to locate the schemas. URNs are resolved to location-dependent URIs by use of the LDAP protocol. URNs may be converted to LDAP URLs which are used to search LDAP compliant directories. The directories serve as registries for the URI values corresponding to the URNs. | 01-03-2013 |
20130238545 | SYSTEM AND METHOD FOR FAST EVALUATION OF STANDING QUERIES IN CONJUNCTIVE NORMAL FORM - Methods and systems are provided for evaluating standing queries against updated contact entries configured as a stream of facts. The method includes resolving the standing queries into an array of rules, each rule having a first and a second condition; sorting t one of the facts into a first property and a second property; comparing the first property of the fact to the first condition of each rule in the array of rules to produce a first subset of matching rules; comparing the second property of the fact to the second condition of each rule in the first subset of rules to produce a second subset of matching rules; and reporting at least one of the second subset of rules to an author of the matching rule. The method further includes populating a first hash with indicia of the first subset, and populating a second hash with the second subset. | 09-12-2013 |
20140020120 | SYSTEM AND METHOD FOR ACCESS CONTROL FOR DATA OF HETEROGENEOUS ORIGIN - Systems and methods are provided for controlling access to data of heterogeneous origin. A system creates combined access rights from access rights and other access rights for combined data that includes data and other data. The system receives a request to access data that is part of the combined data. The system determines whether to provide access to at least part of the data based on access rights that are part of the combined access rights. The system provides access to at least part of the data in response to a determination to provide access to at least part of the data based on the access rights that are part of the combined access rights. | 01-16-2014 |
20140025369 | SYSTEM AND METHOD FOR PHRASE MATCHING WITH ARBITRARY TEXT - A system and method for matching phrases having arbitrary text. A first data structure stores a list of common phrases having multiple words. Each unique word is indexed in a hash table and mapped to one or more values that describe attributes of using the word in one or more of the common phrases. Using the hash table and the list of common phrases, a temporary array is defined to keep track of possible matches between words in an input string and the list of common phrases. | 01-23-2014 |
20140025683 | METHODS AND APPARATUS FOR MANAGING COMMUNITY-UPDATEABLE DATA - A method of managing crowdsourced data includes storing contact information regarding a plurality of contacts within a community-updateable repository accessible by a plurality of users, receiving a plurality of discrepancy reports associated with a selected contact of the plurality of contacts, extracting fact data regarding the selected contact from the plurality of discrepancy reports, determining an action to be taken based on the fact data and a fact model applied to the fact data, and performing the action to modify the community-updateable repository. | 01-23-2014 |
20140081978 | FACILITATING DISTRIBUTED DATA PROCESSING FOR DYNAMIC AND EFFICIENT GENERATION OF SEARCH RESULTS IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating distributed data processing for dynamic and efficient generation of search results in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes receiving, at a data processing platform, extracted data occurrences from a database coupled to a server computing device, where each data occurrence may be assigned a classification according to a category. The method may further include mapping values to the data occurrences based on classifications of the data occurrences, mapping prefixes to the data occurrences based on identifying names of the data occurrences, and generating search data based on the mapped values and mapped prefixes, where the search data may represent autosuggestions. | 03-20-2014 |
20140289187 | SYSTEM AND METHOD FOR EVALUATING CLAIMS TO UPDATE A RECORD FROM CONFLICTING DATA SOURCES - A system and method for evaluating claims from sources to update database records. A trust score is developed for each source. If a source submits a claim, the trust score for that source and the value of the claim are evaluated against prior conflicting claims. If the current claim is deemed the most likely, then it is adopted as provisional “truth”. If not, the current claim is rejected. | 09-25-2014 |
20140304054 | SYSTEM AND METHOD FOR HANDLING GAMIFICATION FRAUD - Some embodiments of the present invention include determining if updates performed by a second user include a systematic change such as a reversal of an update previously performed by a first user within a time window. The reversal is associated with a record of data used by a gamification application executing in a computer system. A time delay is introduced between the update performed by the second user and rewarding the second user if the update performed by the second user includes the reversal within the time window. An update history of the first user and the second user is evaluated to identify pattern of reversals associated with similar records within the time window. The second user is prevented from being rewarded based on identifying that there are patterns of reversals from the update history occurring within the time window. | 10-09-2014 |
20140304245 | ATOMIC TRANSACTIONS IN A NOSQL DATABASE - Systems and methods are provided for atomic transactions in a NoSQL database. A system writes a pending transaction identifier to write claim data for a first data item in a NoSQL database in response to a determination that the write claim data for the first data item includes a first previous transaction identifier included in last commit data for the first data item. The system writes the pending transaction identifier and a pending commit identifier to the last commit data for the first data item. The system writes a first value associated with a pending transaction to the first data item. The system aborts the pending transaction in response to a determination that the write claim data for the first data item does not include the first previous transaction identifier included in the last commit data for the first data item. | 10-09-2014 |
20140304279 | SYSTEMS AND METHODS FOR OF IDENTIFYING ANOMALOUS DATA IN LARGE STRUCTURED DATA SETS AND QUERYING THE DATA SETS - The technology disclosed relates to automatic generation of tuples from a record set for outlier analysis. Applying this new technology, user need not specify which 1-tuples to combine into n-tuples. The tuples are generated from structured records organized into features (that also could be fields, objects or attributes.) Tuples are generated from combinations of feature values in the records. Thresholding is applied to manage the number of tuples generated. The technology disclosed further relates to indexing and searching high dimensional tuple spaces in a computer-implemented system. | 10-09-2014 |
20150026565 | XML STREAMING TRANSFORMER (XST) - The present invention includes devices and methods to specify a document transformation. A template specifies a transformation that is applied to a document in a streaming mode, without building a full object tree in memory representing the document. | 01-22-2015 |
20150106390 | PROCESSING USER-SUBMITTED UPDATES BASED ON USER RELIABILITY SCORES - Processing user-submitted updates based on user reliability scores is described. A system calculates an update score, for an update submitted by a user, based on a similarity of a field value provided by the update to corresponding field values in identified records. The system calculates a user score based on update scores, including the update score, calculated for corresponding updates submitted by the user. The system processes the update based on the user score. | 04-16-2015 |
20150269595 | CONTACT RECOMMENDATIONS BASED ON PURCHASE HISTORY - Contact recommendations based on purchase history are described. A system creates a directed graph of nodes in which at least some of the nodes are connected by directed arcs, wherein a directed arc from a first node to a second node represents a conditional probability that previous users who purchased a first contact also purchased a second contact. The system identifies a set of contacts purchased by a current user. The system estimates a prospective purchase probability based on a historical probability that previous users purchased a specific contact and a related probability that previous users who purchased the specific contact also purchased a contact in the set of contacts, for each candidate contact. The system outputs a recommendation for the current user to purchase a recommended candidate contact based on a corresponding prospective purchase probability. | 09-24-2015 |
20150269647 | BULK CONTACT RECOMMENDATIONS BASED ON ATTRIBUTE PURCHASE HISTORY - A system creates a graph of nodes connected by arcs, and identifies a first compound attribute associated with contacts purchased by a current user. The first compound attribute includes a first attribute associated with a first value and a second attribute associated with a second value. The system identifies a directed arc from a first node to a second node. The directed arc is associated with a probability that previous users who purchased a first contact associated with the first compound attribute also purchased a second contact associated with a second compound attribute. The second compound attribute includes the first attribute, associated with a third value which matches the first value, and the second attribute, associated with a fourth value, which lacks a match with the second value. The system outputs a recommendation for the current user to purchase contacts associated with the second compound attribute if the probability exceeds a threshold. | 09-24-2015 |
20150347926 | Fast Naive Bayesian Framework with Active-Feature Ordering - The technology described uses a Naïve Bayes Classifier with Active-Feature Ordering to identify contributors to a contact database who are likely to be able to update an arbitrary contact. The technology disclosed further relates to identifying the n most likely records with a number of features, with each feature having a specific finite number of different possible values. The disclosed technology also describes using a Naïve Bayes Classifier with Active-Feature Ordering for diagnostic screening, to evaluate a patient's symptoms against a compendium of diseases to choose the diseases with the greatest posterior likelihood given the vector of observed symptoms of the patient. The disclosed technology additionally describes using a Naïve Bayes Classifier with Active-Feature Ordering for crowd sourcing tasks, using a sample data set that includes thousands of workers, to identify a worker, who is experienced, to complete a featured task. | 12-03-2015 |
20160085789 | ERROR CHECKING DATABASE RECORDS - An error checking technique for database records. A record is selected and its entities are compared with the entities of other records stored in the database to determine a likelihood that the labels associated with the entities of the selected record are correct. The likelihood for each entity of the selected record being correctly labeled can be determined by comparing the number of times that the entity appears in the database records with that label to the number of times that the entity appears in the database records with any other label. If the likelihood does not exceed a threshold, then an error is likely, and action can be taken to correct the record. | 03-24-2016 |
20160125347 | USER SCORES BASED ON BULK RECORD UPDATES - User scores based on bulk record updates is described. A system receives record updates submitted by a user. The system subtracts a penalty debit from a user score, which corresponds to the user, for each record which corresponds to at least one of the record updates and which is removed from purchasing availability. The system adds a full credit to the user score for each record which corresponds to at least one of the record updates and which is purchased. The system adds a partial credit to the user score for each record which corresponds to at least one of the record updates and which is yet to be purchased and which is yet to be removed from purchasing availability, wherein the partial credit is a positive value that is less than the full credit. The system enables the user to access records, based on the user score. | 05-05-2016 |
20160125442 | USER SCORES BASED ON BULK RECORD UPDATES - User scores based on bulk record updates is described. A system receives record updates submitted by a user. The system subtracts a penalty debit from a user score, which corresponds to the user, for each record which corresponds to at least one of the record updates and which is removed from purchasing availability. The system adds a full credit to the user score for each record which corresponds to at least one of the record updates and which is purchased. The system adds a partial credit to the user score for each record which corresponds to at least one of the record updates and which is yet to be purchased and which is yet to be removed from purchasing availability, wherein the partial credit is a positive value that is less than the full credit. The system enables the user to access records, based on the user score. | 05-05-2016 |
Matthew Fuchs, Los Gators, CA US
Patent application number | Description | Published |
---|---|---|
20150347911 | SYSTEM AND METHOD FOR FAST EVALUATION OF STANDING QUERIES IN CONJUNCTIVE NORMAL FORM - Methods and systems are provided for evaluating standing queries against updated contact entries configured as a stream of facts. The method includes resolving the standing queries into an array of rules, each rule having a first and a second condition; sorting one of the facts into a first property and a second property; comparing the first property of the fact to the first condition of each rule in the array of rules to produce a first subset of matching rules; comparing the second property of the fact to the second condition of each rule in the first subset of rules to produce a second subset of matching rules; and reporting at least one of the second subset of rules to an author of the matching rule. The method further includes populating a first hash with indicia of the first subset, and populating a second hash with the second subset. | 12-03-2015 |
Matthew D. Fuchs, Los Gatos, CA US
Patent application number | Description | Published |
---|---|---|
20160063389 | SYSTEMS AND METHODS FOR PARTITIONING SETS OF FEATURES FOR A BAYESIAN CLASSIFIER - The technology disclosed relates to methods for partitioning sets of features for a Bayesian classifier, finding a data partition that makes the classification process faster and more accurate, while discovering and taking into account feature dependence among sets of features in the data set. It relates to computing class entropy scores for a class label across all tuples that share the feature-subset and arranging the tuples in order of non-decreasing entropy scores for the class label, and constructing a data partition that offers the highest improvement in predictive accuracy for the data set. Also disclosed is a method for partitioning a complete set of records of features in a batch computation, computing increasing predictive power; and also relates to starting with singleton partitions, and using an iterative process to construct a data partition that offers the highest improvement in predictive accuracy for the data set. | 03-03-2016 |
Matthew Daniel Fuchs, Los Gatos, CA US
Patent application number | Description | Published |
---|---|---|
20100100814 | REGISTRY FOR TRADING PARTNERS USING DOCUMENTS FOR COMMERCE IN TRADING PARTNER NETWORKS - A market making node in a network routes machine readable documents to connect businesses with customers, suppliers and trading partners. The self defining electronic documents, such as XML based documents, can be easily understood amongst the partners. Definitions of these electronic business documents, called business interface definitions, are posted on the Internet, or otherwise communicated to members of the network. The business interface definitions tell potential trading partners the services the company offers and the documents to use when communicating with such services. Thus, a typical business interface definition allows a customer to place an order by submitting a purchase order or a supplier checks availability by downloading an inventory status report. Also, the registration at a market maker node of a specification of the input and output documents, coupled with interpretation information in a common business library, enables participants in a trading partner network to execute the transaction in a way which closely parallels the way in which paper based businesses operate. | 04-22-2010 |
20130159845 | REGISTRY FOR TRADING PARTNERS USING DOCUMENTS FOR COMMERCE IN TRADING PARTNER NETWORKS - A market making node in a network routes machine readable documents to connect businesses with customers, suppliers and trading partners. The self defining electronic documents, such as XML based documents, can be easily understood amongst the partners. Definitions of these electronic business documents, called business interface definitions, are posted on the Internet, or otherwise communicated to members of the network. The business interface definitions tell potential trading partners the services the company offers and the documents to use when communicating with such services. Thus, a typical business interface definition allows a customer to place an order by submitting a purchase order or a supplier checks availability by downloading an inventory status report. Also, the registration at a market maker node of a specification of the input and output documents, coupled with interpretation information in a common business library, enables participants in a trading partner network to execute the transaction in a way which closely parallels the way in which paper based businesses operate. | 06-20-2013 |
Matthew Fuchs Fuchs, Los Gatos, CA US
Patent application number | Description | Published |
---|---|---|
20160140355 | USER TRUST SCORES BASED ON REGISTRATION FEATURES - User trust scores based on registration features is described. A system identifies registration features associated with a user registered to interact with a database. The system calculates a registration trust score for the user based on a comparison of multiple registration features associated with the user to corresponding registration features associated with previous users who are restricted from interacting with the database and/or corresponding registration features associated with previous users who are enabled to interact with the database. The system restricts the user from interacting with the database if the registration trust score is above a registration threshold. | 05-19-2016 |
Robert Fuchs, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20130136023 | FACILITATING NOISE ESTIMATION IN WIRELESS COMMUNICATION - Providing for noise estimation in wireless communication, and particularly for access request signals transmitted by a user equipment (UE), is described herein. By way of example, a wireless signal receiver can employ unused signal dimensions of a wireless network for noise estimation. In addition, the unused signal dimensions can be selected for time-frequency resources that are associated with a particular wireless channel, in order to obtain a noise estimate for that channel. By employing unused signal dimensions, a noise measurement is likely to include no other signal transmissions, and provide an accurate estimate of noise on that channel. According to various aspects of the subject disclosure, one or more Chu sequences employed for signal transmissions, root sequences thereof, or one or more cyclic shifts of a root sequence can be employed for the unused signal dimension. | 05-30-2013 |
Robert J. Fuchs, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20110188466 | FACILITATING NOISE ESTIMATION IN WIRELESS COMMUNICATION - Providing for noise estimation in wireless communication, and particularly for access request signals transmitted by a user equipment (UE), is described herein. By way of example, a wireless signal receiver can employ unused signal dimensions of a wireless network for noise estimation. In addition, the unused signal dimensions can be selected for time-frequency resources that are associated with a particular wireless channel, in order to obtain a noise estimate for that channel. By employing unused signal dimensions, a noise measurement is likely to include no other signal transmissions, and provide an accurate estimate of noise on that channel. According to various aspects of the subject disclosure, one or more Chu sequences employed for signal transmissions, root sequences thereof, or one or more cyclic shifts of a root sequence can be employed for the unused signal dimension. | 08-04-2011 |
20110249548 | EFFICIENT ZADOFF-CHU SEQUENCE GENERATION - Efficient apparatus and method for Zadoff-Chu (“Chu”) sequence generation avoids additional processing and hardware complexity of conventional quadratic generating formula followed by Discrete Fourier Transform (DFT) with a reference signal generator that produces both a Zadoff-Chu sequence and its DFT. In the wireless communication system (e.g., Long Term Evolution (LTE) system), Chu sequences are extensively used, especially in the uplink (UL). Because of the single carrier operating mode, transmitting a Chu sequence in principle involves a succession of generating that sequence, performing a DFT operation and then an IFFT operation. Assuming that the sequence length is N, the initial sequence generation requires 2N multiplications and the DFT requires more than N log 2(N) multiplications. Given the frequent processing of Chu sequences, this would represent a complexity burden. The invention makes it possible to perform the sequence generation and DFT steps without any multiplication operation, except for possibly calculating certain initial parameters. | 10-13-2011 |
Robert Jason Fuchs, San Diego, CA US
Patent application number | Description | Published |
---|---|---|
20110268230 | OPTIMIZING A RECEIVER FOR MULTIPLE ANTENNA CONFIGURATIONS - A method for optimizing a multiple input multiple output (MIMO) receiver for multiple antenna configurations is disclosed. A noise covariance is determined based on a noise estimate of a wireless signal. A Cholesky decomposition matrix is determined based on the noise covariance. A whitening matrix is determined based on the Cholesky decomposition matrix. The wireless signal is whitened using the whitening matrix. | 11-03-2011 |
20110276747 | SOFTWARE MANAGEMENT WITH HARDWARE TRAVERSAL OF FRAGMENTED LLR MEMORY - Certain aspects of the present disclosure relate to a method and apparatus for processing wireless communications. According to certain aspects, a linked list of chunks of memory used to store logarithmic likelihood ratio (LLR) values for a transport block is generated. Each chunk holds LLR values for a code block of the transport block. The linked list is then provided to a hardware circuit for traversal. According to certain aspects, the hardware circuit may be an application specific integrated circuit (ASIC) processor or field programmable gate array (FPGA) configured to traverse the linked list of chunks of memory used to store LLR values. | 11-10-2011 |
20110280200 | HARDWARE IMPLEMENTATION OF UPLINK RECEIVER WITH MATCHED THROUGHPUT - Certain aspects of the present disclosure provide an apparatus and techniques for efficiently processing uplink communications. A telecommunications receiver processor architecture is provided that may be utilized with a LTE eNodeB base station wherein the data path throughput is optimally matched for a Physical Uplink Shared Channel (PUSCH) receiver. According to certain aspects, the receiver may be configured to perform operations on OFDMs symbols in an interleaved order. Additionally, the receiver may instantiate multiple IDFT engines to process multiple OFDM symbols in parallel. | 11-17-2011 |
20110280295 | RECURSIVE IMPLEMENTATION FOR CALCULATION OF WHITENING MATRIX - Certain aspects of the present disclosure relate to techniques for recursive implementation of whitening matrix calculation based on functional reuse as a part of wireless receiver in a Long Term Evolution (LTE) wireless system. | 11-17-2011 |
Roman Fuchs, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20120221563 | Social Weight of Social Media Content - Systems and methods for social weighting of content items from a plurality of content sources, such as the Internet, are described. Disclosed implementations include, but are not limited to, receiving a search request from a user, retrieving content items related to the search request to obtain a number of results, weighting the results according to at least one social factor, and providing the weighted results in response to the request. | 08-30-2012 |
Sebastien Fuchs, Los Angeles, CA US
Patent application number | Description | Published |
---|---|---|
20110104175 | METHODS OF TREATMENT FOR PULMONARY FIBROSIS - The invention relates to compositions and methods for treating fibrosing lung diseases, reducing pulmonary cytokine production in animals, treating bleomycin induced lung disease and treating cancer. Specifically, the present subject matter incorporates inactivation of the N-terminal site of an angiotensin-converting enzyme and/or administration of AcSDKP. | 05-05-2011 |
20130295062 | METHODS AND COMPOSITIONS FOR TREATMENT OF ALZHEIMER'S DISEASE - The present invention relates to methods and compositions for use in the treatment of neurological disorders, such as Alzheimer's disease and dementia. In one embodiment, the present invention provides a method of treatment of Alzheimer's disease in an individual by administering a composition overexpressing ACE to the individual. In another embodiment, the method of treatment comprises administering a composition comprising a therapeutically effective dosage of ACE. | 11-07-2013 |
Zohar Fuchs, Danville, CA US
Patent application number | Description | Published |
---|---|---|
20150230123 | SESSION ASSIGNMENT AND BALANCING - A server device may determine session information that identifies a quantity of sessions established between each of one or more serving gateways (SGWs) and a packet data network (PDN) gateway (PGW); and direct a mobility management entity (MME) to assign additional sessions between the one or more SGWs and the PGW based on the session information. | 08-13-2015 |