Patent application number | Description | Published |
20100138492 | METHOD AND APPARATUS FOR MULTIMEDIA COLLABORATION USING A SOCIAL NETWORK SYSTEM - In one embodiment, the present invention is a method and apparatus for multimedia collaboration using a social network system. In one embodiment, a method for using a social network to establish a collaborative multimedia interaction includes receiving a request from a user to establish the collaborative multimedia interaction, where the user has established the social network, and notifying one or more members of the social network of the collaborative multimedia interaction using, in some embodiments, information about the members' current or last known digital presence and a customizable set of notification rules. | 06-03-2010 |
20100153579 | Flow Control of Events Based on Threshold, Grace Period, and Event Signature - A method for controlling sender events arriving at a recipient system is provided. An event transmitted from a sender is received at recipient system, and an event signature is determined. An elapse time between received event and a previous event is calculated. If elapse time is less than or equal to a critical time, it is determined if a counter is equal to or greater than a maximum value. If yes, event is rejected. If not, counter is incremented and the event is processed. If elapse time is greater than critical time, it is determined if elapse time is less than or equal to a grace period and if counter is greater than zero. If yes, counter is decremented and the event is processed. If not, counter is set to zero and event is processed. The critical time, maximum value, and increment/decrement factor are set based on the event signature. | 06-17-2010 |
20120066139 | Methods, Systems, and Processes for Identifying Affected and Related Individuals During a Crisis - A crisis management system may retrieve and analyze data from the social network system to identify, find, and/or locate individuals affected by a crisis. For example, when a crisis occurs, the crisis management system may retrieve data from a social network system regarding individuals that may be affected by the crisis. Crisis management system may then analyze the retrieved data to determine whether the individuals may have been located within the crisis area. Additionally, crisis management system may analyze the retrieved data to determine related individuals, such as co-workers, friends, family, relatives, or other individuals that may act as emergency contacts for the affected individuals. | 03-15-2012 |
20130282826 | METHOD AND APPARATUS FOR MULTIMEDIA COLLABORATION USING A SOCIAL NETWORK SYSTEM - In one embodiment, the present invention is a method and apparatus for multimedia collaboration using a social network system. In one embodiment, a method for using a social network to establish a collaborative multimedia interaction includes receiving a request from a user to establish the collaborative multimedia interaction, where the user has established the social network, and notifying one or more members of the social network of the collaborative multimedia interaction using, in some embodiments, information about the members' current or last known digital presence and a customizable set of notification rules. | 10-24-2013 |
Patent application number | Description | Published |
20100200651 | SYSTEM AND METHOD FOR PROCESSING CLOSED LOOP CARDS AND CODES - Disclosed herein are systems, methods, and computer-readable storage media for processing closed loop cards/codes. The method includes identifying a closed loop card/code having associated money in an account, receiving a confirmation of an amount of money in the closed loop card/code account, presenting an owner of the closed loop card/code with the amount of money in the closed loop card/code account and an offer to pay an offer amount for the closed loop card/code, receiving an indication that the owner accepts the offer, receiving the amount of money from the closed loop card/code account, and paying the owner the offer amount. Payment can be on an open loop card/code, cash, automated clearing house (ACH) to bank, check, merchant credit, or bill pay. The method can include generating a new closed loop card/code associated with the amount of money. The new closed loop card/code can be sold to another user. | 08-12-2010 |
20100200652 | SYSTEM AND METHOD FOR ACCEPTING CLOSED LOOP CARDS AND CODES AT A MERCHANT POINT OF SALE - Disclosed herein are systems, methods, and computer-readable storage media for redeeming a closed loop card/code funded with an amount of money. The system receives from a merchant point of sale an indication of use of a closed loop card/code not issued by the merchant and presented by a consumer, queries and receives a confirmation of an amount of money in an account associated with the closed loop card/code, presents the consumer with an offer to buy the closed loop card/code at a discount price, and upon accepting the offer, closes out the closed loop card/code and pays the discount price to the consumer. Paying the discount price can include applying the discount price to a purchase by the consumer at the merchant. The merchant can provide cash back to the consumer for excess value of the discount price over the consumer's purchase. Merchants can apply more than the discount price. | 08-12-2010 |
20100200653 | SYSTEM AND METHOD FOR CONVERTING CLOSED LOOP CARDS INTO GIFT CODES - Disclosed herein are systems, methods, and computer-readable storage media for generating a gift code. The system receives an indication from a first user identifying a closed loop card, receives a confirmation of an amount of money in an account associated with the closed loop card, offers to purchase the closed loop card at an amount less than the amount of money in the account associated with the closed loop card, and upon acceptance of the offer, deactivates the closed loop card. The system then offers to sell the amount of money at a discount rate to a second user, receives acceptance of the offer to sell the amount of money at the discount rate, and associates a gift code with the amount of money for use by the second user. Gift codes can have no expiration date. A multi-process secure gateway can confirm the amount of money. | 08-12-2010 |
20100200654 | SYSTEM AND METHOD FOR PROCESSING CLOSED LOOP CARDS AND CODES - Disclosed herein are systems, methods, and computer-readable storage media for processing closed loop cards/codes. The method includes identifying a closed loop card/code having associated money in an account, receiving a confirmation of an amount of money in the closed loop card/code account, presenting an owner of the closed loop card/code with the amount of money in the closed loop card/code account and an offer to pay an offer amount for the closed loop card/code, receiving an indication that the owner accepts the offer, receiving the amount of money from the closed loop card/code account, and paying the owner the offer amount. Payment can be on an open loop card/code, cash, automated clearing house (ACH) to bank, check, merchant credit, or bill pay. The method can include generating a new closed loop card/code associated with the amount of money. The new closed loop card/code can be sold to another user. | 08-12-2010 |
20100200655 | SYSTEM AND METHOD FOR CONVERTING CLOSED LOOP CARDS INTO GIFT CODES - Disclosed herein are systems, methods, and computer-readable storage media for generating a gift code. The system receives an indication from a first user identifying a closed loop card, receives a confirmation of an amount of money in an account associated with the closed loop card, offers to purchase the closed loop card at an amount less than the amount of money in the account associated with the closed loop card, and upon acceptance of the offer, deactivates the closed loop card. The system then offers to sell the amount of money at a discount rate to a second user, receives acceptance of the offer to sell the amount of money at the discount rate, and associates a gift code with the amount of money for use by the second user. Gift codes can have no expiration date. A multi-process secure gateway can confirm the amount of money. | 08-12-2010 |
20100205050 | SYSTEM AND METHOD FOR ACCEPTING CLOSED LOOP CARDS AND CODES AT A MERCHANT POINT OF SALE - Disclosed herein are systems, methods, and computer-readable storage media for redeeming a closed loop card/code funded with an amount of money. The system receives from a merchant point of sale an indication of use of a closed loop card/code not issued by the merchant and presented by a consumer, queries and receives a confirmation of an amount of money in an account associated with the closed loop card/code, presents the consumer with an offer to buy the closed loop card/code at a discount price, and upon accepting the offer, closes out the closed loop card/code and pays the discount price to the consumer. Paying the discount price can include applying the discount price to a purchase by the consumer at the merchant. The merchant can provide cash back to the consumer for excess value of the discount price over the consumer's purchase. Merchants can apply more than the discount price. | 08-12-2010 |
20110079644 | SYSTEM AND METHOD FOR MERCHANT INTERACTION WITH AND TRACKING OF THE SECONDARY GIFT CARD MARKETPLACE - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for tracking a secondary gift card marketplace. A system configured to practice the method collects data related to a secondary market, which includes a transaction associated with a gift card, the transaction not involving an issuer of the gift card, processes the collected data, and presents at least a portion of the processed collected data to a merchant in a user interface. Gift cards can include at least one of gift cards and gift codes. The collected data can further include a plurality of transactions associated with gift cards. In one aspect, each gift card transaction in the plurality of gift card transaction does not involve an original issuing merchant of a gift card. The collected data can further include at least one of pricing, demographic, geographic, and other information related to the gift card transactions. | 04-07-2011 |
20140372223 | SYSTEM AND METHOD FOR ACCEPTING CLOSED LOOP CARDS OR CODES AT A MERCHANT POINT OF SALE - Disclosed herein are systems, methods, and computer-readable storage media for redeeming a closed loop card/code funded with an amount of money. The system receives from a merchant point of sale an indication of use of a closed loop card/code not issued by the merchant and presented by a consumer, queries and receives a confirmation of an amount of money in an account associated with the closed loop card/code, presents the consumer with an offer to buy the closed loop card/code at a discount price, and upon accepting the offer, closes out the closed loop card/code and pays the discount price to the consumer. Paying the discount price can include applying the discount price to a purchase by the consumer at the merchant. The merchant can provide cash back to the consumer for excess value of the discount price over the consumer's purchase. Merchants can apply more than the discount price. | 12-18-2014 |
20140372314 | SYSTEM AND METHOD FOR PROCESSING CLOSED LOOP CARDS AT A MERCHANT POINT OF SALE - Disclosed herein are systems, methods, and computer-readable storage media for redeeming a closed loop card/code funded with an amount of money. The system receives, at a merchant, an indication from a consumer of a desire to sell a closed loop account not issued by the merchant and receives a confirmation, via a computing device, of an amount of money in the closed loop account. The system presents the consumer with an offer to buy the closed loop account and receives from the consumer an acceptance of the offer. The system processes the closed loop account to yield a processed closed loop account such as by transferring the account to one of the merchant and an entity and applies a benefit to the consumer based on the processed closed loop account. | 12-18-2014 |
Patent application number | Description | Published |
20080238588 | Programmable passive equalizer - Embodiments of a programmable passive equalizer are described herein. | 10-02-2008 |
20090245416 | INPUT/OUTPUT DRIVER SWING CONTROL AND SUPPLY NOISE REJECTION - In general, in one aspect, the disclosure describes an apparatus having an averager to receive differential output voltages of a transmitter and generate an average transmitter output voltage. A comparator is to compare the average transmitter output voltage to a reference voltage and generate a difference therebetween. An integrator is to integrate the difference between the average transmitter output voltage and the reference voltage over time. The integrated difference is fed back to the transmitter to bias the transmitter. | 10-01-2009 |
20100073892 | CIRCUIT BOARD INCLUDING STUBLESS SIGNAL PATHS AND METHOD OF MAKING SAME - A circuit board may include first and second sides, a plurality of circuit board layers between the sides, and a plurality of signal traces located in respective circuit board layers. The circuit board layers and the signal traces may extend from a first component connection region at the first side of the circuit board to a second component connection region at the first side of the circuit board. The signal traces may thus form stubless signal paths through the circuit board between the component connection regions. Of course, many alternatives, variations, and modifications are possible without departing from this embodiment. | 03-25-2010 |
20100098201 | I/O Link with configurable forwarded and derived clocks - An electronic communications receiver includes a derived clock signal circuit operable to receive a data signal and to derive a derived clock signal from the received data signal. A separate forwarded clock signal circuit is further operable to receive a forwarded clock signal, and a clock management circuit is operable to receive signals from the derived clock signal circuit and the forwarded clock signal circuit, and to output an output clock signal. | 04-22-2010 |
20100103826 | REDUNDANT ACKNOWLEDGMENT IN LOOPBACK ENTRY - Redundant acknowledgment between agents performing a loopback test over bidirectional communications bus is described. In one example, in a processor including a communications agent coupled to a bidirectional communications bus, the communications agent initiates loopback communications to a second agent, sends a packet including a redundant acknowledgment sequence to the second agent, receives the packet including the redundant acknowledgement sequence looped back from the second agent, determines whether the received redundant acknowledgment sequence is valid, sends a test sequence to the second agent, receives the test sequence looped back, and if the received redundant acknowledgment sequence is determined to be valid, then checks the received test sequence. | 04-29-2010 |
20100330927 | LINK POWER SAVINGS WITH STATE RETENTION - Methods and apparatus relating to link power savings with state retention are described. In one embodiment, one or more components of two agents coupled via a serial link are turned off during idle periods while retaining link state in each agent. Other embodiments are also disclosed. | 12-30-2010 |
20140156892 | METHOD, SYSTEM, AND APPARATUS FOR LINK LATENCY MANAGEMENT - A link latency management for a high-speed point-to-point network (pTp) is described The link latency management facilitates calculating latency of a serial interface by tracking a round trip delay of a header that contains latency information. Therefore, the link latency management facilitates testers, logic analyzers, or test devices to accurately measure link latency for a point-to-point architecture utilizing a serial interface. | 06-05-2014 |
20150074440 | LINK POWER SAVINGS WITH STATE RETENTION - Methods and apparatus relating to link power savings with state retention are described. In one embodiment, one or more components of two agents coupled via a serial link are turned off during idle periods while retaining link state in each agent. Other embodiments are also disclosed. | 03-12-2015 |
20150081921 | DYNAMICALLY MODULATING LINK WIDTH - Systems and methods of managing a link provide for receiving a remote width capability during a link initialization, the remote width capability corresponding to a remote port. A link between a local port and the remote port is operated at a plurality of link widths in accordance with the remote width capability. | 03-19-2015 |
Patent application number | Description | Published |
20090037393 | System and Method of Accessing a Document Efficiently Through Multi-Tier Web Caching - Upon receipt of a document request, a client assistant examines its cache for the document. If not successful, a server searches for the requested document in its cache. If the server copy is still not fresh or not found, the server seeks the document from its host. If the host cannot provide the copy, the server seeks it from a document repository. Certain documents are identified from the document repository as being fresh or stable. Information about each these identified documents is transmitted to the server which inserts entries into an index if the index does not already contain an entry for the document. If and when this particular document is requested, the document will not be present in the server, however the server will contain an entry directing the server to obtain the document from the document repository rather than the document's web host. | 02-05-2009 |
20100076954 | Representative Document Selection for Sets of Duplicate Dcouments in a Web Crawler System - Duplicate documents are detected in a web crawler system. Upon receiving a newly crawled document, a set of documents, if any, sharing the same content as the newly crawled document is identified. Information identifying the newly crawled document and the selected set of documents is merged into information identifying a new set of documents. Duplicate documents are included and excluded from the new set of documents based on a query independent metric for each such document. A single representative document for the new set of documents is identified in accordance with a set of predefined conditions. | 03-25-2010 |
20100122065 | System and Method for Large-Scale Data Processing Using an Application-Independent Framework - A large-scale data processing system and method for processing data in a distributed and parallel processing environment. The system includes an application-independent framework for processing data having a plurality of application-independent map modules and reduce modules. These application-independent modules use application-independent operators to automatically handle parallelization of computations across the distributed and parallel processing environment when performing user-specified data processing operations. The system also includes a plurality of user-specified, application-specific operators, for use with the application-independent framework to perform a user-specified data processing operation on a user-specified set of input files. The application-specific operators include: a map operator and a reduce operator. The map operator is applied by the application-independent map modules to input data in the user-specified set of input files to produce intermediate data values. The reduce operator is applied by the application-independent reduce modules to process the intermediate data values to produce final output data. | 05-13-2010 |
20110153577 | Query Processing System and Method for Use with Tokenspace Repository - A search engine server system receives from a client system a search query and identifies a set of documents in accordance with the search query. A content snippet corresponding to content in a respective document of the identified set of documents is generated, the content snippet associated with at least one query term of the one or more query terms in the search query. A response to the search query is returned to the client system, the response including information identifying at least the respective document and including the content snippet. Generating the content snippet includes performing a first decompression operation on first token identifiers, from a compressed document repository, to provide a set of second token identifiers, and performing a second decompression operation on the set of second token identifiers to recover uncompressed content comprising a portion of the respective document. | 06-23-2011 |
20110276561 | Representative Document Selection for Sets of Duplicate Documents in a Web Crawler System - Duplicate documents are detected in a web crawler system. Upon receiving a newly crawled document, a set of documents, if any, sharing the same content as the newly crawled document is identified. Information identifying the newly crawled document and the selected set of documents is merged into information identifying a new set of documents. Duplicate documents are included and excluded from the new set of documents based on a query independent metric for each such document. A single representative document for the new set of documents is identified in accordance with a set of predefined conditions. | 11-10-2011 |
20120023073 | Efficient Indexing of Documents with Similar Content - A set of documents may be stored and indexed as a compressed sequence of tokens. A set of documents are grouped into clusters. Sequences of tokens representing the clusters of documents are encoded to elide some repeating instances of tokens. A compressed sequence of tokens is generated from the compressed cluster sequences of tokens. Queries on the compressed sequence are performed by identifying cluster sequences within the compressed sequence that are likely to have documents that satisfy the query and then identifying, within these identified clusters, the documents that actually satisfies the query. | 01-26-2012 |
20120066576 | Anchor Tag Indexing in a Web Crawler System - Provided is a method and system for indexing documents in a collection of linked documents. A link log, including one or more pairings of source documents and target documents is accessed. A sorted anchor map, containing one or more target document to source document pairings, is generated. The pairings in the sorted anchor map are ordered based on target document identifiers. | 03-15-2012 |
20120215787 | System and Method for Analyzing Data Records - A method and system for analyzing data records includes allocating groups of records to respective processes of a first plurality of processes executing in parallel. In each respective process of the first plurality of processes, for each record in the group of records allocated to the respective process, a query is applied to the record so as to produce zero or more values. Zero or more emit operators are applied to each of the zero or more produced values so as to add corresponding information to an intermediate data structure. Information from a plurality of the intermediate data structures is aggregated to produce output data. | 08-23-2012 |
20120271852 | System and Method of Accessing a Document Efficiently Through Multi-Tier Web Caching - Upon receipt of a document request, a client assistant examines its cache for the document. If not successful, a server searches for the requested document in its cache. If the server copy is still not fresh or not found, the server seeks the document from its host. If the host cannot provide the copy, the server seeks it from a document repository. Certain documents are identified from the document repository as being fresh or stable. Information about each of these identified documents is transmitted to the server which inserts entries into an index if the index does not already contain an entry for the document. If and when this particular document is requested, the document will not be present in the server, however the server will contain an entry directing the server to obtain the document from the document repository rather than the document's web host. | 10-25-2012 |
20120303622 | Efficient Indexing of Documents with Similar Content - A computer system comprising one or more processors and memory groups a set of documents into a plurality of clusters. Each cluster includes one or more documents of the set of documents and a respective cluster of documents of the plurality of clusters includes respective cluster data corresponding to a plurality of documents including a first document and a second document. The computer system determines that the second document includes duplicate data that is duplicative of corresponding data in the first document, identifies a respective subset of the respective cluster data that excludes at least a subset of the duplicate data, and generates an index of the respective subset of the respective cluster data. | 11-29-2012 |
20130212076 | Generating Content Snippets Using a Tokenspace Repository - A search engine server system receives from a client system a search query and identifies a set of documents in accordance with the search query. A content snippet corresponding to content in a respective document of the identified set of documents is generated, the content snippet associated with at least one query term of the one or more query terms in the search query. A response to the search query is returned to the client system, the response including information identifying at least the respective document and including the content snippet. Generating the content snippet includes performing a first decompression operation on first token identifiers, from a compressed document repository, to provide a set of second token identifiers, and performing a second decompression operation on the set of second token identifiers to recover uncompressed content comprising a portion of the respective document. | 08-15-2013 |
20130297592 | Associating Application-Specific Methods with Tables Used for Data Storage - A method of accessing data includes storing a table that includes a plurality of tablets corresponding to distinct non-overlapping table portions. Respective pluralities of tablet access objects and application objects are stored in a plurality of servers. A distinct application object and distinct tablet are associated with each tablet access object. Each application object corresponds to a distinct instantiation of an application associated with the table. The tablet access objects and associated application objects are redistributed among the servers in accordance with a first load-balancing criterion. A first request directed to a respective tablet is received from a client. In response, the tablet access object associated with the respective tablet is used to perform a data access operation on the respective tablet, and the application object associated with the respective tablet is used to perform an additional computational operation to produce a result to be returned to the client. | 11-07-2013 |
20130332455 | PERMITTING USERS TO REMOVE DOCUMENTS - A system may present information regarding a document and provide an option for removing the document. The system may also receive selection of the option and remove the document when the option is selected. The system may aggregate information regarding documents that have been removed by a group of users and assign scores to a set of documents based on the aggregated information. | 12-12-2013 |
20130339295 | Organizing Data in a Distributed Storage System - A distributed storage system is provided. The distributed storage system includes multiple front-end servers and zones for managing data for clients. Data within the distributed storage system is associated with a plurality of accounts and divided into a plurality of groups, each group including a plurality of splits, each split being associated with a respective account, and each group having multiple tablets and each tablet managed by a respective tablet server of the distributed storage system. Data associated with different accounts may be replicated within the distributed storage system using different data replication policies. There is no limit to the amount of data for an account by adding new splits to the distributed storage system. In response to a client request for a particular account's data, a front-end server communicates such request to a particular zone that has the client-requested data and returns the client-requested data to the requesting client. | 12-19-2013 |
20130339301 | EFFICIENT SNAPSHOT READ OF A DATABASE IN A DISTRIBUTED STORAGE SYSTEM - A computer system issues a batch read operation to a tablet in a first replication group in a distributed database and obtains a most recent version of data items in the tablet that have a timestamp no great than a snapshot timestamp T. For each data item in the one tablet, the computer system determines whether the data item has a move-in timestamp less than or equal to the snapshot timestamp T, which is less than a move-out timestamp, and whether the data item has a creation timestamp less than the snapshot timestamp T, which is less than or equal to a deletion timestamp. If the determination is true, the computer system determines whether the move-out timestamp has an actual associated value and, if so, the computer system determines a second tablet in a second replication group in the database that includes the data item and issues the snapshot read operation to the second table in the second replication group to obtain a most-recent version of the data item that has a timestamp no greater than the snapshot timestamp T; otherwise, the computer system issues the snapshot read to the one tablet to obtain a most recent version of the data item that has a timestamp no greater than the snapshot timestamp T. | 12-19-2013 |
20130339318 | METHOD AND SYSTEM FOR DELETING OBSOLETE FILES FROM A FILE SYSTEM - A method for deleting obsolete files from a file system is provided. The method includes: receiving a request to delete a reference to a target file in a file system from a file reference data structure, wherein the file reference data structure includes target file names and reference file names; identifying a reference file name in the file reference data structure, wherein the reference file name includes a file name of the target file; deleting a reference file from the file system, wherein the reference file has the identified reference file name; checking whether the file system includes at least one reference file whose file name matches the file name of the target file; if there is no such reference file in the file system: deleting the target file from the file system; and deleting the file name of the target file from the file reference data structure. | 12-19-2013 |
20130346540 | Storing and Moving Data in a Distributed Storage System - A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying a storage group in a distributed storage system into which data is to be stored is presented. A data structure including information relating to storage groups in a distributed storage system is maintained, where a respective entry in the data structure for a respective storage group includes placement metrics for the respective storage group. A request to identify a storage group into which data is to be stored is received from a computer system. The data structure is used to determine an identifier for a storage group whose placement metrics satisfy a selection criterion. The identifier for the storage group whose placement metrics satisfy the selection criterion is returned to the computer system. | 12-26-2013 |
20140025810 | Collecting Processor Usage Statistics - In accordance with some implementations, a method of collecting statistics about processor usage is disclosed. The method is performed on a data storage server having one or more processors and memory storing one or more programs for execution by the one or more processors. The server system executes one or more processes, wherein each of the one or more first processes is associated with an entity from a group of one or more entities. The server system then receives an interrupt signal at a first predetermined interval. In response to receiving the interrupt signal and for each processor of the one or more processors, the server system interrupts the process currently being executed on the processor. The server system increments the counter associated with the interrupted process. The server system then resumes the interrupted process. | 01-23-2014 |
20140025899 | Efficiently Updating and Deleting Data in a Data Storage System - A method of storing data is disclosed. The method is performed on a data storage server having one or more processors and memory storing one or more programs for execution by the one or more processors. The data storage server receives a first and second data request, the requests including a first and second range of one or more keys and an associated first and second value respectively. The data storage server identifies one or more overlap points associated with the first range and the second range. For each of the overlap points, the data storage server then creates data items including ranges of keys, the ranges of each data item including one or more keys that are either: (a) the keys between a terminal key of the first or second range and the overlap point, or (b) the keys between two adjacent overlap points. | 01-23-2014 |
20140096138 | System and Method For Large-Scale Data Processing Using an Application-Independent Framework - A large-scale data processing system and method for processing data in a distributed and parallel processing environment is disclosed. The system comprises a set of interconnected computing systems, each having one or more processors and memory. The set of interconnected computing systems include: a set of application-independent map modules for reading portions of input files containing data, and for producing intermediate data values by applying at least one user-specified, application-specific map operation to the data; a set of intermediate data structures distributed among a plurality of the interconnected computing systems for storing the intermediate data values; and a set of application-independent reduce modules, distinct from the plurality of application-independent map modules, for producing final output data by applying at least one user-specified, application-specific reduce operation to the intermediate data values. | 04-03-2014 |
20140188454 | DETERMINING CORRESPONDING TERMS WRITTEN IN DIFFERENT FORMATS - Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results. | 07-03-2014 |
20150026170 | Representative Document Selection for a Set of Duplicate Documents - Systems and methods are provided for obtaining a plurality of documents. A respective document in the plurality of documents is associated with a score and each document in the plurality of documents is from a different data structure in a plurality of data structures. Each data structure in the plurality of data structures represents a different portion of a document address space. A first document in the plurality of documents is selected in accordance with the score associated with the first document. The first document has a fingerprint that indicates that the first document has substantially identical content to every other document in the plurality of documents. In accordance with the score, the first document is indexed thereby producing an indexed first document. With respect to the plurality of documents, the indexed first document is included in a document index as representative of each document in the plurality of documents. | 01-22-2015 |
Patent application number | Description | Published |
20090221250 | METHODS AND APPARATUS FOR HANDLING A SIGNALING MESSAGE THE RELATES TO TRANSMISSION RATE RESTRICTIONS - A method for handling a signaling message that specifies transmission rate restrictions may include operating in a first state. The method may also include receiving the signaling message from a network. The signaling message may include an activation time, the transmission rate restrictions and the control duration. The method may also include receiving a state transition trigger to operate in a second state. The method may also include determining the user equipment's behavior regarding the transmission rate restrictions upon receiving the state transition trigger. | 09-03-2009 |
20100080199 | OUT-OF-SYNCHRONIZATION HANDLING METHOD AND APPARATUS - A method for handling out-of-synchronization (SYNC) includes generating a plurality of combination sets of transport channels utilized by a communication device. The method also includes selecting, based on a window-based parameter, a highest-ranking combination set of transport channels out of the plurality of combination sets of transport channels. The highest-ranking combination set of transport channels excludes one or more out-of-SYNC transport channels. The method further comprises providing, to a window-based data processing unit, data packets from transport channels in the highest-ranking combination set of transport channels, without providing data packets from the one or more out-of-SYNC transport channels to the window-based data processing unit. Apparatus and machine-readable media for out-of-SYNC avoidance and/or detection are also provided. | 04-01-2010 |
20110243051 | Methods and Apparatus For Service Continuity In A Communication Network - Methods and apparatus for service continuity in a communication network. A method includes receiving a service in a first network coverage area, detecting entry into a second coverage area, acquiring control signaling information of the second coverage area in response to entering into the second coverage area, establishing traffic channels in the second coverage area while the service is received from the first coverage area, and switching to receive the service on the traffic channels in the second coverage area so that service disruption is minimized. Another method includes receiving a service in a first network coverage area, acquiring control signaling information associated with other coverage areas while in the first coverage area, detecting entry into a second coverage area, establishing traffic channels in the second coverage area, and switching to receive the service on the traffic channels in the second coverage area so that service disruption is minimized. | 10-06-2011 |
20120087239 | METHODS AND APPARATUS FOR HANDLING A SIGNALING MESSAGE THAT RELATES TO TRANSMISSION RATE RESTRICTIONS - A method for handling a signaling message that specifies transmission rate restrictions may include operating in a first state. The method may also include receiving the signaling message from a network. The signaling message may include an activation time, the transmission rate restrictions and the control duration. The method may also include receiving a state transition trigger to operate in a second state. The method may also include determining the user equipment's behavior regarding the transmission rate restrictions upon receiving the state transition trigger. | 04-12-2012 |
20120195249 | METHOD AND APPARATUS FOR SERVICE CAPABILITY MODIFICATION - A method includes determining, at a receiving station, a modified capability for maintaining reception of a service while supporting a broadcast service. The modified capability is a modification of a capability associated with the service. The method further includes communicating an indication of the modified capability to a transmitting station. | 08-02-2012 |
Patent application number | Description | Published |
20090325987 | QUINAZOLINEDIONE DERIVATIVES AS TRPA1 MODULATORS - The present invention provides Quinazolinedione derivatives as TRPA (Transient Receptor Potential subfamily A) modulators. In particular, compounds described herein are useful for treating or preventing diseases, conditions and/or disorders modulated by TRPA1 (Transient Receptor Potential subfamily A, member 1). Also provided herein are processes for preparing compounds described herein, intermediates used in their synthesis, pharmaceutical compositions thereof, and methods for treating or preventing diseases, conditions and/or disorders modulated by TRPA1. | 12-31-2009 |
20120010223 | ISOTHIAZOLO-PYRIMIDINEDIONE DERIVATIVES AS TRPAI MODULATORS - The present invention is related to novel isothiazolo[3,4-d]pyrimidinedione and isothiazolo[5,4-d]pyrimidinedione derivatives as TRPA (Transient Receptor Potential subfamily A) modulators. In particular, compounds described herein are useful for treating or preventing diseases, conditions and/or disorders modulated by TRPA1 (Transient Receptor Potential subfamily A, member 1). Also provided herein are processes for preparing compounds described herein, intermediates used in their synthesis, pharmaceutical compositions thereof, and methods for treating or preventing diseases, conditions and/or disorders modulated by TRPA1. | 01-12-2012 |
20120295924 | THIENOPYRIMIDINEDIONE DERIVATIVES AS TRPA1 MODULATORS - The present invention is related to novel thienopyrimidinedione derivatives as TRPA (Transient Receptor Potential subfamily A) modulators. In particular, compounds described herein are useful for treating or preventing diseases, conditions and/or disorders modulated by TRPA1 (Transient Receptor Potential subfamily A, member 1). Also provided herein are processes for preparing compounds described herein, intermediates used in their synthesis, pharmaceutical compositions thereof, and methods for treating or preventing diseases, conditions and/or disorders modulated by TRPA1. | 11-22-2012 |
20130289054 | THIENOPYRIMIDINEDIONE DERIVATIVES AS TRPA1 MODULATORS - The present invention is related to novel thienopyrimidinedione derivatives as TRPA (Transient Receptor Potential subfamily A) modulators. In particular, compounds described herein are useful for treating or preventing diseases, conditions and/or disorders modulated by TRPA1 (Transient Receptor Potential subfamily A, member 1). Also provided herein are processes for preparing compounds described herein, intermediates used in their synthesis, pharmaceutical compositions thereof, and methods for treating or preventing diseases, conditions and/or disorders modulated by TRPA1. | 10-31-2013 |
Patent application number | Description | Published |
20080304705 | SYSTEM AND METHOD FOR SIDE VISION DETECTION OF OBSTACLES FOR VEHICLES - This invention provides a system and method for object detection and collision avoidance for objects and vehicles located behind the cab or front section of an elongated, and possibly tandem, vehicle. Through the use of narrow-baseline stereo vision that can be vertically oriented relative to the ground/road surface, the system and method can employ relatively inexpensive cameras, in a stereo relationship, on a low-profile mounting, to perform reliable detection with good range discrimination. The field of detection is sufficiently behind and aside the rear area to assure an adequate safety zone in most instances. Moreover, this system and method allows all equipment to be maintained on the cab of a tandem vehicle, rather than the interchangeable, and more-prone-to-damage cargo section and/or trailer. One or more cameras can be mounted on, or within, the mirror on each side, on aerodynamic fairings or other exposed locations of the vehicle. Image signals received from each camera can be conditioned before they are matched and compared for disparities viewed above the ground surface, and according to predetermined disparity criteria. | 12-11-2008 |
20130028400 | SYSTEM AND METHOD FOR ELECTRONIC COMMUNICATION USING A VOICEOVER IN COMBINATION WITH USER INTERACTION EVENTS ON A SELECTED BACKGROUND - A Skqueak™ is an interactively created electronic memo/message that combines a voiceover with user-interaction elements on a selected background. The background could be images, sequence of images from a video, entire video, files such as documents or pre-canned templates. The user inter-action elements are sketch animations, text animations, symbols, shapes, emoticons, image transformation events (pan, zoom, rotation etc.). Skqueak™ also denotes the application that allows the creation of a Skqueak™. Skqueak™ also represents a web service available at www.skqueak.com that allows the creation, viewing, storing, sharing, searching, annotating, and manipulation of Skqueaks. | 01-31-2013 |
20130038694 | METHOD FOR MOVING OBJECT DETECTION USING AN IMAGE SENSOR AND STRUCTURED LIGHT - A method for detecting moving objects including people. Enhanced monitoring, safety and security is provided through the use of a monocular camera and a structured light source, by trajectory computation, velocity computation, or counting of people and other objects passing through a laser plane arranged perpendicular to the ground, and which can be setup anywhere near a portal, a hallway or other open area. Enhanced security is provided for portals such as revolving doors, mantraps, swing doors, sliding doors, etc., using the monocular camera and structured light source to detect and, optionally, prevent access violations such as “piggybacking” and “tailgating”. | 02-14-2013 |
20130142421 | Method for Fast, Robust, Multi-Dimensional Pattern Recognition - A method and system for probe-based pattern matching including an apparatus for synthetic training of a model of a pattern. The apparatus comprises a sensor for obtaining an image of the pattern and a processor for receiving the image of the pattern from the sensor and running a program. In the steps performed by the program a boundary of the pattern in the image is identified. A plurality of positive probes are placed at selected points along the boundary of the pattern and at least one straight segment of the boundary of the pattern is identified. The at least one straight segment of the boundary is extended to provide an imaginary straight segment and a plurality of negative probes are placed at selected points along the imaginary straight segment, where each negative probe has a negative weight. | 06-06-2013 |
Patent application number | Description | Published |
20110040697 | REASSIGNMENT AND RECONCILIATION FOR MULTI-DIMENSIONAL SALES TERRITORIES - Embodiments of the invention provide systems and methods for using multi-dimensional modeling techniques to handle gaps, overlaps, and reassignments of opportunities for sales territory management. Embodiments use multi-dimensional modeling to define territories in such a way that accounts for applicable territory criteria as sets with logical boundaries, rather than as a defined rule-based architecture (e.g., as dimensions in a territory hypercube). The multi-dimensional model is de-normalized to capture the multi-dimensional nature of the sales territory definitions while, for example, flattening hierarchical trees and minimizing or eliminating the need for ordinal processing of the data. In some embodiments, the de-normalized territory definitions are used to facilitate efficient and reliable gap and/or overlap processing (e.g., detection, reconciliation, etc.). In other embodiments, the de-normalized territory definitions are used to optimize identification of territory regions where reassignment of opportunities is appropriate and/or to reassign opportunities in those regions. | 02-17-2011 |
20110040698 | SANDBOXING AND WHAT-IF ANALYSIS FOR MULTI-DIMENSIONAL SALES TERRITORIES - Embodiments of the invention provide systems and methods for using multi-dimensional modeling techniques to handle territory proposals for sandboxing territory changes, for performing what-if analyses, etc. In some embodiments, a staging environment allows the creation of a proposed territory model (e.g., a proposed territory hypercube) based on a production territory model or some other baseline territory model version. The territory proposal is associated with a name, owner, activation trigger event, and the proposed territory model. The owner can modify the proposed territory definitions in the staging environment, and the modifications may be published to subordinates, audited for errors, etc. When the proposed territory model is as desired, the owner may request activation of the territory upon occurrence of the activation trigger event occurs. Activation may involve promotion of the proposed territory model (e.g., or the modifications) to the production environment, for example, including realignment, reconciliation, auditing, and/or any other processing. | 02-17-2011 |
Patent application number | Description | Published |
20090006526 | Autonomic control of a distributed computing system using finite state machines - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, one or more control nodes provide for the efficient and automated allocation and management of resources within the distributed computing system. In order to provide automated allocation and management of computing functions and resources, a control node uses a set of governors. This set of governors includes a set of service governors to govern services used in the distributed computing system. The set of governors also includes a set of resource governors that govern individual resources of the services in the distributed computing system. The service governors and the resource governors may be implemented using finite state machines. | 01-01-2009 |
20090006527 | Autonomic control of a distributed computing system using dynamically assembled resource chains - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, one or more control nodes provide for the efficient and automated allocation and management of resources within the distributed computing system. In order to provide automated allocation and management of computing functions and resources, a control node uses a set of governors. This set of governors includes a set of service governors to govern services used in the distributed computing system. The set of governors also includes a set of resource governors that govern individual resources of the services in the distributed computing system. The service governors and the resource governors may be implemented using finite state machines. | 01-01-2009 |
20090177727 | Evaluation of Current Capacity Levels of Resources in a Distributed Computing System - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, a control node automatically manages the system such that the system has sufficient capacity to satisfy an agreement to provide a given level of a service. In order to automatically manage the system, the control node evaluates the current capacity levels of resources in the system. The current capacity levels are indicative the capacity of resources to perform certain acts. The capacity of the resources to perform these acts may be indicative of whether the system is able to provide the given level of the service. Because capacities provided by the resources change as the resources start, the control node uses a predicted pending capacity function to evaluate whether resources that are currently starting will be sufficient to satisfy the level of the service when completely started. | 07-09-2009 |
20090177775 | Interdependent Capacity Levels of Resources in a Distributed Computing System - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, a control node automatically manages the system such that the system has sufficient capacity to satisfy an agreement to provide a given level of a service. In order to automatically manage the system, the control node evaluates the current capacity levels of resources in the system. The current capacity levels are indicative the capacity of resources to perform certain acts. The capacity of the resources to perform these acts may be indicative of whether the system is able to provide the given level of the service. Because resources may be deployed in chains, the capacities of resources to perform the certain acts may be defined to be dependent on the capacities of other resources to perform other acts. | 07-09-2009 |
20110145404 | Autonomic Control of a Distributed Computing System Using Finite State Machines - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, one or more control nodes provide for the efficient and automated allocation and management of resources within the distributed computing system. In order to provide automated allocation and management of computing functions and resources, a control node uses a set of governors. This set of governors includes a set of service governors to govern services used in the distributed computing system. The set of governors also includes a set of resource governors that govern individual resources of the services in the distributed computing system. The service governors and the resource governors may be implemented using finite state machines. | 06-16-2011 |
20120124213 | Evaluation Of Current Capacity Levels Of Resources In A Distributed Computing System - In general, this disclosure describes techniques of managing resources in a service-oriented distributed computing system. As described in this disclosure, a control node automatically manages the system such that the system has sufficient capacity to satisfy an agreement to provide a given level of a service. In order to automatically manage the system, the control node evaluates the current capacity levels of resources in the system. The current capacity levels are indicative the capacity of resources to perform certain acts. The capacity of the resources to perform these acts may be indicative of whether the system is able to provide the given level of the service. Because capacities provided by the resources change as the resources start, the control node uses a predicted pending capacity function to evaluate whether resources that are currently starting will be sufficient to satisfy the level of the service when completely started. | 05-17-2012 |
Patent application number | Description | Published |
20080207601 | Methods of and Compositions For the Prevention of Anxiety, Substance Abuse, and Dependence - Compositions for reducing dependency and addiction to substances of abuse are provided. Chloride channels such as the GABA | 08-28-2008 |
20080255097 | Methods for the Treatment of Substance Abuse and Dependence - The present invention relates to methods of and compositions for treating and relieving symptoms and disease associated with indications caused by a physiological drive to alleviate a sensation of anxiety. More specifically, the present invention relates to methods of and compositions for treating and relieving symptoms associated with substance abuse and withdrawal. The present invention relates to methods of and compositions for treating and relieving symptoms associated with addiction to antidepressants, opiates, nicotine or marijuana. In one method, a patient is treated with a composition that directly or indirectly modulates GABA | 10-16-2008 |
20080280885 | Methods for Treating Anxiety Related Disorders - The present invention relates to methods of and compositions for treating and relieving symptoms and disease associated with indications caused by a physiological drive to alleviate a sensation of anxiety. In one treatment method, methods of, and compositions for, modulating the expression of certain GABAA receptor subunits are used to treat anxiety-related disorders and depressive disorders associated with physiological tolerance to endogenous neurosteroids. | 11-13-2008 |
20090292680 | Systems and Methods for Syndicating Content To, And Mining Content From, Internet-Based Forums - The present invention is directed to a system for mediating an electronic communication between a forum and a non-member of the forum. The system includes a server having programmatic instructions where execution of the programmatic instructions by a processor a) generates data representative of a GUI, where the GUI prompts a user to input a query, b) receives data representative of the query, c) parses data representative of the query and uses the parsed data to create a forum interface call, d) transmits the forum interface call to remotely located servers, where at least some of the servers hosts at least one forum, e) in response to the transmission of forum interface calls, receives responses responsive to the query, and f) generates data representative of another GUI, which provides a user electronic access to the responses. | 11-26-2009 |
Patent application number | Description | Published |
20100267678 | FLUX-ENABLING COMPOSITIONS AND METHODS FOR DERMAL DELIVERY OF DRUGS - The present invention is drawn to adhesive solidifying formulations, methods of drug delivery, and solidified layers for dermal delivery of a drug. The formulation can include a drug, a solvent vehicle, and a solidifying agent. The solvent vehicle can include a volatile solvent system comprising at least one volatile solvent, and a non-volatile solvent system comprising at least one non-volatile solvent, wherein at least one non-volatile solvent is a flux-enabling non-volatile solvent(s) capable of facilitating the delivery of the drug at therapeutically effective rates over a sustained period of time. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 10-21-2010 |
20120294907 | TWO OR MORE SOLIDIFYING AGENT-CONTAINING COMPOSITIONS AND METHODS FOR DERMAL DELIVERY OF DRUGS - The present invention is drawn to adhesive solidifying formulations, methods of drug delivery, and solidified layers for dermal delivery of a drug. The formulation can include a drug, a solvent vehicle, and at least two solidifying agents. The solvent vehicle can include a volatile solvent system including at least one volatile solvent, and a non-volatile solvent system including at least one non-volatile solvent, wherein at least one non-volatile solvent is flux-enabling non-volatile solvent(s) capable of facilitating the delivery of the drug at therapeutically effective rates over a sustained period of time. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 11-22-2012 |
20120294926 | TWO OR MORE VOLATILE SOLVENT-CONTAINING COMPOSITIONS AND METHODS FOR DERMAL DELIVERY OF DRUGS - The present invention is drawn to adhesive formulations and methods of drug delivery. The formulation can include a drug, a solvent vehicle, and a solidifying agent. The solvent vehicle can include a volatile solvent system including at least two volatile solvents, and a non-volatile solvent system including at least one non-volatile solvent, wherein at least one non-volatile solvent is capable of facilitating the delivery of the drug at therapeutically effective rates over a sustained period of time. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 11-22-2012 |
20120301517 | TWO OR MORE NON-VOLATILE SOLVENT-CONTAINING COMPOSITIONS AND METHODS FOR DERMAL DELIVERY OF DRUGS - The present invention is drawn to adhesive formulations, methods of drug delivery, and solidified layers for dermal delivery of a drug. The formulation can include a drug, a solvent vehicle, and a solidifying agent. The solvent vehicle can have a volatile solvent system including at least one volatile solvent, and a non-volatile solvent system including at least two non-volatile solvents. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 11-29-2012 |
20130022564 | COMPOSITIONS AND METHODS FOR DERMALLY TREATING INFECTIONS - The present invention is drawn to solidifying adhesive formulations, methods of drug delivery, and solidified layers for dermal delivery of a drug for treating various skin infections, such as fungal, bacterial, and/or viral skin infections. The formulation can include anti-infective drug, solvent vehicle, and solidifying agent. The solvent vehicle can include a volatile solvent system including at least one volatile solvent, and a non-volatile solvent system including at least one non-volatile solvent. The non-volatile solvent system can facilitate the delivery of the drug at therapeutically effective rates for sustained periods of time. The non-volatile solvent system can also act to plasticize the solidifying agent. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 01-24-2013 |
20140314815 | ADHESIVE SOLID GEL-FORMING FORMULATIONS FOR DERMAL DRUG DELIVERY - The present invention is drawn to adhesive solid gel-forming formulations, methods of drug delivery, and solidified gel layers for dermal delivery of a drug. The formulation can include a drug, a solvent vehicle, and a gelling agent. The solvent vehicle can include a volatile solvent system having one or more volatile solvent, and a non-volatile solvent system having one or more non-volatile solvent, wherein at least one non-volatile solvent is flux-enabling non-volatile solvent(s) capable of facilitating the delivery of the drug at therapeutically effective rates over a sustained period of time. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified gel layer after at least a portion of the volatile solvent system is evaporated. The solidified gel layer is can be removed by peeling or washing. | 10-23-2014 |
20150025051 | FORMULATIONS FOR TREATING SKIN DISORDERS - The present invention is drawn to adhesive solidifying formulations for treating skin disorders, such as dermatitis or psoriasis. The formulation can include a drug, a solvent vehicle, and a solidifying agent. The solvent vehicle can include a volatile solvent system including at least one volatile solvent, and a non-volatile solvent system including at least one non-volatile solvent, wherein the non-volatile solvent system is capable of facilitating the delivery of the drug at therapeutically effective rates over a sustained period of time. The formulation can have a viscosity suitable for application to a skin surface prior to evaporation of the volatile solvents system. When applied to the skin, the formulation can form a solidified layer after at least a portion of the volatile solvent system is evaporated. | 01-22-2015 |
Patent application number | Description | Published |
20080320230 | Avoiding Livelock Using A Cache Manager in Multiple Core Processors - Livelocks are prevented in multiple core processors by verifying that a data access request is still valid before sending messages to processor cores that may cause other data access requests to fail. A cache coherency manager receives data access requests from multiple processor cores. Upon receiving a data access request that may cause a livelock, the cache coherency manager first sends an intervention message back to the requesting processor core to confirm that this data access request will succeed. If the requesting processor core determines that the data access request is still valid, it directs the cache coherency manager to proceed with the data access request. The cache coherency manager may then send intervention messages to other processor cores to complete the data access request. If the requesting processor core determines that the data access request is invalid, it directs the cache coherency manager to abandon the data access request. | 12-25-2008 |
20080320232 | Preventing Writeback Race in Multiple Core Processors - A processor prevents writeback race condition errors by maintaining responsibility for data until the writeback request is confirmed by an intervention message from a cache coherency manager. If a request for the same data arrives before the intervention message, the processor core unit provides the requested data and cancels the pending writeback request. The cache coherency data associated with cache lines indicates whether a request for data has been received prior to the intervention message associated with the writeback request. The cache coherency data of a cache line has a value of “modified” when the writeback request is initiated. When the intervention message associated with the writeback request is received, the cache lines's cache coherency data is examined. A change in the cache coherency data from the value of “modified” indicates that the request for data has been received prior to the intervention and the writeback request should be cancelled. | 12-25-2008 |
20100005247 | Method and Apparatus for Global Ordering to Insure Latency Independent Coherence - A method and apparatus is described for insuring coherency between memories in a multi-agent system where the agents are interconnected by one or more fabrics. A global arbiter is used to segment coherency into three phases: request; snoop; and response, and to apply global ordering to the requests. A bus interface having request, snoop, and response logic is provided for each agent. A bus interface having request, snoop and response logic is provided for the global arbiter, and a bus interface is provided to couple the global arbiter to each type of fabric it is responsible for. Global ordering and arbitration logic tags incoming requests from the multiple agents and insures that snoops are responded to according to the global order, without regard to latency differences in the fabrics. | 01-07-2010 |
20100115244 | MULTITHREADING MICROPROCESSOR WITH OPTIMIZED THREAD SCHEDULER FOR INCREASING PIPELINE UTILIZATION EFFICIENCY - A multithreading processor for concurrently executing multiple threads is provided. The processor includes an execution pipeline and a thread scheduler that dispatches instructions of the threads to the execution pipeline. The execution pipeline execution pipeline is configured for generating a thread context (TC) flush indicator associated with a thread context when one or more instructions of the thread context would stall in the execution pipeline. One or more instructions in the pipeline of the thread context associated with the thread context flush signal can be flushed or nullified. | 05-06-2010 |
20100283680 | SYSTEM AND METHOD FOR DYNAMIC VOLTAGE SCALING IN A GPS RECEIVER - Systems and methods are disclosed herein to dynamically vary supply voltages and clock frequencies, also known as dynamic voltage scaling (DVS), in GPS receivers to minimize receiver power consumption while meeting performance requirements. For the baseband circuitry performing satellite acquisition and tracking, supply voltages and clock frequencies to the baseband circuitry are dynamically adjusted as a function of signal processing requirements and operating conditions for reducing baseband power consumption. Similarly, the supply voltage and clock frequency to the processor running navigation software and event processing are dynamically adjusted as a function of navigation performance requirements and event occurrences to reduce processor power consumption. | 11-11-2010 |
20110055488 | HORIZONTALLY-SHARED CACHE VICTIMS IN MULTIPLE CORE PROCESSORS - A processor includes multiple processor core units, each including a processor core and a cache memory. Victim lines evicted from a first processor core unit's cache may be stored in another processor core unit's cache, rather than written back to system memory. If the victim line is later requested by the first processor core unit, the victim line is retrieved from the other processor core unit's cache. The processor has low latency data transfers between processor core units. The processor transfers victim lines directly between processor core units' caches or utilizes a victim cache to temporarily store victim lines while searching for their destinations. The processor evaluates cache priority rules to determine whether victim lines are discarded, written back to system memory, or stored in other processor core units' caches. Cache priority rules can be based on cache coherency data, load balancing schemes, and architectural characteristics of the processor. | 03-03-2011 |