Patent application number | Description | Published |
20140036287 | SEMANTIC PRINTING OPTIONS - The embodiments provide a print server including a cloud print service. The print server includes an application manager configured to receive a print request for content to be printed, over a network, from a user of an application associated with a device, and provide, over the network, a print dialog to the user. The print dialog is configured to identify at least one available printer associated with the cloud print service. The print server also includes an options translator configured to determine at least one printing option associated with the at least one available printer, and translate a native printer display format of the at least one printing option to a common protocol display format associated with the cloud print service. The options translator is configured to provide the common protocol display format for inclusion in the print dialog. | 02-06-2014 |
20140053078 | SHARING CONTENT WITH NEARBY DEVICES - Various aspects of the subject technology relate to systems, methods, and machine-readable media for sharing content with a nearby device. A system is configured receive, from a sending device, a request to share content, wherein the request comprises location information associated with a location of the sending device and content characteristics, determine, based on the location information and the content characteristics, that one or more receiving devices are within a proximity threshold of the location of the sending device and are capable of loading content associated with the content characteristics, receive, from the sending device, a selection of a receiving device from the one or more receiving devices and content to be shared, and provide the content to be shared to the selected receiving device. | 02-20-2014 |
20140368859 | VIRTUAL PRINT QUEUE FOR ROVING PRINTING IN A CLOUD-BASED PRINT SERVICE - An application manager may receive, from an application utilized at a device at a first location, a print job, the print job identifying a virtual print queue and application content to be printed, the application manager being further configured to store the print job in association with the virtual print queue. A print job router may receive, after the storing, a print initiation identifying a printer at a second location, the print initiation identifying the print job, including print properties thereof, and originating from the second location. A format converter may generate, from the application content and using the print properties, a printable file in a format printable by the identified printer, for sending to the identified printer by the print job router. | 12-18-2014 |
20140368865 | ROVING PRINTING IN A CLOUD-BASED PRINT SERVICE USING A MOBILE DEVICE - An application manager may receive, from an application utilized at a device at a first location, a print job, the print job identifying a virtual print queue and application content to be printed, the application manager being further configured to store the print job in association with the virtual print queue. A print job router may receive, after the storing and from a mobile device at a second location, a print initiation identifying a printer at the second location and the print job, the print job router being further configured to send the application content to the identified printer, based on the print initiation. | 12-18-2014 |
20150199161 | REMOTE PRINTING MANAGEMENT FOR CLOUD PRINTING - A print server may include an application manager configured to receive a print job from a user and associate the print job with a printer. The print server may include a presence manager configured to provide a presence code for the print job and the printer, and to receive the presence code from the user in conjunction with a physical presence of the user at the printer, and a print job router configured to release the print job for printing by the printer, based on the receipt of the presence code. | 07-16-2015 |
Patent application number | Description | Published |
20100318539 | LABELING DATA SAMPLES USING OBJECTIVE QUESTIONS - Described is a technology for obtaining labeled sample data. Labeling guidelines are converted into binary yes/no questions regarding data samples. The questions and data samples are provided to judges who then answer the questions for each sample. The answers are input to a label assignment algorithm that associates a label with each sample based upon the answers. If the guidelines are modified and previous answers to the binary questions are maintained, at least some of the previous answers may be used in re-labeling the samples in view of the modification. | 12-16-2010 |
20110066650 | QUERY CLASSIFICATION USING IMPLICIT LABELS - Described is a technology for automatically generating labeled training data for training a classifier based upon implicit information associated with the data. For example, whether a query has commercial intent can be classified based upon whether the query was submitted at a commercial website's search portal, as logged in a toolbar log. Positive candidate query-related data is extracted from the toolbar log based upon the associated implicit information. A click log is processed to obtain negative query-related data. The labeled training data is automatically generated by separating at least some of the positive candidate query data from the remaining positive candidate query data based upon the negative query data. The labeled training data may be used to train a classifier, such as to classify an online search query as having a certain type of intent or not. | 03-17-2011 |
20110289026 | Matching Offers to Known Products - A method and apparatus for electronically matching an electronic offer to structured data for a product offering is disclosed. The structure data is reviewed and a dictionary of terms for each attribute from the structure data is created. Attributes in unstructured text may be determined. Each pair of the attributes (name and value) from the unstructured data and the structured data are obtained, the attribute pairs of the structured data and the unstructured data and compared and a similarity level is calculated for the matching the attribute pairs. The structured data pair that has the highest similarity score to the unstructured data pair is selected and returned. | 11-24-2011 |
20120163707 | MATCHING TEXT TO IMAGES - Text in web pages or other text documents may be classified based on the images or other objects within the webpage. A system for identifying and classifying text related to an object may identify one or more web pages containing the image or similar images, determine topics from the text of the document, and develop a set of training phrases for a classifier. The classifier may be trained and then used to analyze the text in the documents. The training set may include both positive examples and negative examples of text taken from the set of documents. A positive example may include captions or other elements directly associated with the object, while negative examples may include text taken from the documents, but from a large distance from the object. In some cases, the system may iterate on the classification process to refine the results. | 06-28-2012 |
20120314941 | ACCURATE TEXT CLASSIFICATION THROUGH SELECTIVE USE OF IMAGE DATA - Product images are used in conjunction with textual descriptions to improve classifications of product offerings. By combining cues from both text and image descriptions associated with products, implementations enhance both the precision and recall of product description classifications within the context of web-based commerce search. Several implementations are directed to improving those areas where text-only approaches are most unreliable. For example, several implementations use image signals to complement text classifiers and improve overall product classification in situations where brief textual product descriptions use vocabulary that overlaps with multiple diverse categories. Other implementations are directed to using text and images “training sets” to improve automated classifiers including text-only classifiers. Certain implementations are also directed to learning a number of three-way image classifiers focused only on “confusing categories” of the text signals to improve upon those specific areas where text-only classification is weakest. | 12-13-2012 |
20130073592 | MATCHING OFFERS TO KNOWN PRODUCTS - A method and apparatus for electronically matching an electronic offer to structured data for a product offering is disclosed. The structure data is reviewed and a dictionary of terms for each attribute from the structure data is created. Attributes in unstructured text may be determined. Each pair of the attributes (name and value) from the unstructured data and the structured data are obtained, the attribute pairs of the structured data and the unstructured data and compared and a similarity level is calculated for the matching the attribute pairs. The structured data pair that has the highest similarity score to the unstructured data pair is selected and returned. | 03-21-2013 |
20130144854 | MODELING ACTIONS FOR ENTITY-CENTRIC SEARCH - In one embodiment, a web service engine server | 06-06-2013 |
20130204608 | IMAGE ANNOTATIONS ON WEB PAGES - An image in a web page may be annotated after deriving information about an image when the image may be displayed on multiple web pages. The web pages that show the image may be analyzed in light of each other to determine metadata about the image, then various additional content may be added to the image. The additional content may be hyperlinks to other webpages. The additional content may be displayed as annotations on top of the images and in other manners. Many embodiments may perform searching, analysis, and classification of images prior to the web page being served. | 08-08-2013 |
20130275441 | COMPOSING TEXT AND STRUCTURED DATABASES - A framework is provided for composing texts about objects with structured information about these objects, and thus disclosed are methodologies for linking information from at least two data sources—one comprising a plurality of documents comprising text pertaining to at least one object, and one comprising a plurality of structured records comprising at least one characteristic of the at least one object, each characteristic comprising one property name and an associated property value corresponding to the property name for the at least one object—by determining one or more instance-based traits for each object in both data sources and associating at least one record with at least one document that refers to each object, each trait comprising one or more characteristics that identifiably distinguish each object from all other objects. | 10-17-2013 |
20130315480 | MATCHING TEXT TO IMAGES - Text in web pages or other text documents may be classified based on the images or other objects within the webpage. A system for identifying and classifying text related to an object may identify one or more web pages containing the image or similar images, determine topics from the text of the document, and develop a set of training phrases for a classifier. The classifier may be trained and then used to analyze the text in the documents. The training set may include both positive examples and negative examples of text taken from the set of documents. A positive example may include captions or other elements directly associated with the object, while negative examples may include text taken from the documents, but from a large distance from the object. In some cases, the system may iterate on the classification process to refine the results. | 11-28-2013 |
20140258303 | REFORMULATING QUERY TERMS IN STRUCTURED SEARCH - Search history data such as browse trails are collected over time. The browse trails, including associated queries and domains, are processed to identify free tokens of the queries that are also modifiers. Attribute value pairs of a structured data source that correspond to the modifiers are determined based on the search history data and a frequency of the attribute value pairs in the structured data source. When a subsequent query is received, modifiers in the query are identified and replaced with the determined combinations of attribute value pairs that correspond to the modifiers in a structured query that is generated from the received query. The structured query is used to identify items and/or services in the structured data source that are responsive to the received query. | 09-11-2014 |
20140270497 | ACCURATE TEXT CLASSIFICATION THROUGH SELECTIVE USE OF IMAGE DATA - Product images are used in conjunction with textual descriptions to improve classifications of product offerings. By combining cues from both text and image descriptions associated with products, implementations enhance both the precision and recall of product description classifications within the context of web-based commerce search. Several implementations are directed to improving those areas where text-only approaches are most unreliable. For example, several implementations use image signals to complement text classifiers and improve overall product classification in situations where brief textual product descriptions use vocabulary that overlaps with multiple diverse categories. Other implementations are directed to using text and images “training sets” to improve automated classifiers including text-only classifiers. Certain implementations are also directed to learning a number of three-way image classifiers focused only on “confusing categories” of the text signals to improve upon those specific areas where text-only classification is weakest. | 09-18-2014 |
20150046781 | BROWSING IMAGES VIA MINED HYPERLINKED TEXT SNIPPETS - Images stored in an information repository are prepared for browsing. For each image in the repository, text in the repository is mined to extract snippets of text about the image which are semantically relevant to the image, and for each of these snippets of text, keyterms are detected in the snippet of text which represent either concepts that are related to the image or entities that are related to the image, and the snippet of text and keyterms are associated with the image. Each keyterm that is associated with each image in the repository is hyperlinked to each other image in the repository that has this keyterm associated therewith. A graphical user interface allows a user to browse the images in the repository by using their associated snippets of text and hyperlinked keyterms. | 02-12-2015 |
20160070692 | DETERMINING SEGMENTS FOR DOCUMENTS - A document is received for segmentation. The document includes multiple atomic textual units in a sequence. These units may correspond to sentences, phrases, paragraphs, concept phrases, chapters, etc. A distance function is selected that determines a distance between one set of atomic textual units and another set of atomic textual units. The distance between the sets is large for sets that are dissimilar, and small for sets that are similar. The distance function is applied to the atomic textual units to separate each of the atomic textual units into multiple segments, while maintaining the sequence of the atomic textual units. | 03-10-2016 |
20160070782 | ASSOCIATING CONTENT ITEMS WITH DOCUMENT SECTIONS - A document such as a book or textbook includes multiple sections such as chapters. Concept phrases are determined for each of the sections based on the text of each section. A set of content items such as videos is received, and each content item is associated with one or more queries that were submitted by users who were provided the content item in a set of search results. These queries are processed to determine concept phrases that are associated with the content items. The content items and their associated concept phrases are compared with the concept phrases associated with the sections to determine, for some or all of the content items, a minimum subset of the sections whose associated concept phrases cover most of the concept phrases that are associated with the content item. The content items are inserted or linked with the sections in their corresponding minimum subsets. | 03-10-2016 |
Patent application number | Description | Published |
20120083302 | METHOD AND APPARATUS FOR FAST OTHER SECTOR INTERFERENCE (OSI) ADJUSTMENT - Systems and methods that facilitate management of interference and communication resources are provided. A differential approach is devised in which other-sector interference (OSI) and communication resources are managed by adjusting an offset (delta) value associated with the resources in response to receiving an indication of other-sector interference. An OSI indication can be issued based on a short and a long time scale, and effective interference metrics over time-frequency resources. The adjusted delta value is communicated to a serving access point, which reassigns communication resources in order to mitigate other-sector interference. | 04-05-2012 |
20120252523 | SERVING SECTOR INTERFERENCE BROADCAST AND CORRESPONDING RL TRAFFIC POWER CONTROL - Systems and methodologies are described that facilitate broadcasting an interference level and adjusting transmit power corresponding to a reverse link in accordance with the interference level. An interference indication can be broadcasted on a broadcast channel in a wireless communication system. In response to the broadcast, mobile devices can adjust transmit power on the reverse link based upon considerations of the interference level. Further, mobile devices can evaluate an initial set point of a transmit power level during periods of inactivity. | 10-04-2012 |
20130237262 | METHOD AND APPARATUS FOR ADJUSTMENTS FOR DELTA-BASED POWER CONTROL IN WIRELESS COMMUNICATION SYSTEMS - Systems and methodologies are described that provide techniques for performing adjustments for delta-based power control and interference management in a wireless communication system. A terminal can utilize one or more delta-based power control techniques described herein upon engaging in a reverse link transmission after a predetermined period of silence or after receiving indications of interference from neighboring access points. A delta value can be computed through open-loop projection, based on which transmission resources such as bandwidth and/or transmit power can be increased or decreased to manage interference caused by the terminal. A delta value, other feedback from the terminal, and/or indications of interference caused by the terminal can also be communicated as feedback to a serving access point to allow the access point to assign transmission resources for the terminal. | 09-12-2013 |
20140241337 | METHOD AND APPARATUS FOR GENERATION OF BALANCED WEIGHT PREAMBLE SEQUENCES - Various aspects of an approach for generating a large number of balanced weight sequences such as balanced Hamming weight preamble sequences are described herein. The approach provides for the generation of balanced weigh sequences that need to satisfy requirements such as minimal cross-correlation with delayed versions of itself and other sequences in the allowed set. The approach includes creating a set of symbol groups that include balanced properties from which a sequence may be generated by selecting therefrom. | 08-28-2014 |
20140269666 | METHOD AND APPARATUS FOR EFFICIENT SIGNALING OF COMMUNICATION MODE AND DELIMITER INFORMATION - Various aspects for efficient preamble selection and configuration based on wireless communication parameters to provide a reduction of preamble overhead by generating and transmitting packet preambles based on a data rate that is to be used for communication between wireless devices are disclosed herein. In one aspect of the disclosed approach, a preamble sequence is selected from a set of preamble sequences, wherein each preamble sequence is associated with at least one communication mode and the selected preamble sequence is configured to signal a respective communication mode. A preamble structure is generated based on the selected preamble sequences and then transmitted to a receiver. A period of silence may be associated with the communication mode to be communicated, and the transmitter may be configured to not transmit the preamble structure before the period of silence expires. | 09-18-2014 |
20140269667 | METHOD AND APPARATUS FOR DYNAMIC CONFIGURATION OF PACKET PREAMBLES FOR SYNCHRONIZATION-BASED TRANSMISSIONS - Various aspects of the disclosed approach described herein allows a reduction of preamble overhead by tailoring transmitted packet preambles based on an expected level of clock-related offset between a transmitter and a receiver for a pair of communicating nodes. An estimate may be maintained at the transmitter of maximum time and frequency offsets between the transmitter and the receiver. The estimate may then be utilized to create a customized preamble sequence for generating the packet preamble. The estimate may also be utilized to select a particular modulation technique for the packet preamble. | 09-18-2014 |
20140301298 | METHODS AND APPARATUS FOR TRANSMISSION RESTRICTION AND EFFICIENT SIGNALING - Certain aspects of the present disclosure relate to methods and apparatus for transmission restriction and efficient signaling. A base station (BS) may determine information regarding a restricted set of system parameters used for transmission from at least one of the serving BS or one or more potentially interfering BSs and signal the information to a user equipment (UE). According to certain aspects, a UE may receive the signaling of information regarding the restricted set of system parameters used for transmission from at least one of the serving BS or the one or more potentially interfering BSs and use the information to cancel interference by transmissions from the one or more potentially interfering BSs or serving BS. | 10-09-2014 |
20150180622 | MIXED NUMEROLOGY OFDM DESIGN - Methods, systems, and devices are described for hierarchical communications and low latency support within a wireless communications system. An eNB and/or a UE may be configured to operate within the wireless communications system which is at least partially defined through a first layer with first layer transmissions having a first subframe type and a second layer with second layer transmissions having a second subframe type. The first subframe type may have a first round trip time (RTT) between transmission and acknowledgment of receipt of the transmission, and the second layer may have a second RTT that is less than the first RTT. Subframes of the first subframe type may be multiplexed with subframes of the second subframe type, such as through time division multiplexing. In some examples symbols of different duration may be multiplexed such that they different symbol durations coexist. | 06-25-2015 |
20150222304 | INTERFERENCE MANAGEMENT INFORMATION SIGNALING - Certain aspects of the present disclosure relate to techniques and apparatus for signaling interference management information, such as network assisted interference cancelation (NAIC) information as downlink control information (DCI). According to certain aspects, a method is provided for wireless communications by an interfering or potentially interfering base station. The method generally includes generating information for use by a user equipment (UE) in performing interference mitigation when processing a signal from a serving base station and transmitting the information to the UE. The method may further include generating an indication of how the interfering or potentially interfering base station transmits the information and how one or more cells transmit information for use by the UE in performing interference mitigation when processing a signal from the serving base station and transmitting the indication to the UE. | 08-06-2015 |
20150282191 | CSI REPORT WITH DIFFERENT RECEIVER CAPABILITIES - Reported CSI may not reflect non-cancelable CRS interference received from an interfering cell, such as when the CSI is computed when CRS interference is not received. To address the issue, a user equipment (UE) may determine an interference cancelation/suppression efficiency (CSE) associated with canceling/suppressing interference from interfering cells. In addition, based on the determined CSE, a UE may compute CSI such that the CSI reflects the true cancelation efficiency of the UE with respect to interfering cell signals. When computing the CSI based on the determined CSE, the UE may report that the CSI is worse than it is to reflect the UE's true cancelation efficiency with respect to the interfering cell signals. | 10-01-2015 |
20160037420 | SIGNALING VIRTUAL CELL ID SETS - An efficient signaling of virtual cell identifier (ID) sets by base stations is disclosed. A serving base station identifies a set of virtual cell IDs of transmission points from a coordinated multipoint (CoMP) cluster in which a served user equipment (UE) is located along with neighboring transmission points of neighboring CoMP clusters. The serving base station groups the virtual cell IDs available for use in transmission into subsets of virtual cell IDs either according to the primary cell IDs associated with each virtual cell ID or according to the channel state information (CSI) resources associated with each primary cell ID and then transmits each of the subsets of virtual cell IDs to the UE. | 02-04-2016 |
20160065341 | REFERENCE SIGNAL TRANSMISSION AND AVERAGING FOR WIRELESS COMMUNICATIONS - Techniques are provided for combining different types of reference signals. A wireless communications network may be configured to allow a user equipment (UE) to combine multiple demodulation reference signals (DM-RSs) to support demodulation of a physical downlink shared channel (PDSCH), and/or other downlink transmissions, transmitted from a base station to the UE. The base station may provide explicit signaling that reference signals transmitted in two or more transmission time intervals may be combined, or a determination that reference signals transmitted in two or more transmission time intervals may be combined may be made implicitly based on system configuration and previous transmissions. Based on the explicit signaling and/or implicit determination, a UE may combine reference signals included in each of two or more reference signals for use in demodulation of downlink transmissions. | 03-03-2016 |
20160099794 | UE ASSISTED INTERFERENCE LEARNING - In an unlicensed band, different types of interference may be experienced by user equipments (UEs), and a serving evolved Node B (eNB) may not be aware of the interference types affecting a UE. Therefore, aspects presented herein provide UE assisted interference learning, in which the UE detects an interfering signal and reports information such as the interference level and properties of the interfering signal to a serving eNB. Another aspects presented herein provide for an eNB which receives, from one or more UEs, information indicating properties of each of at least one interfering signals experienced by the UEs, such as interference types affecting the UEs. The eNB further uses the information received from the UE, including the wireless technology type to determine the properties of its downlink transmission and the length of the contention window leading up to its downlink transmission. | 04-07-2016 |
20160112168 | TECHNIQUES FOR CONVEYING IDENTIFICATION INFORMATION IN A PREAMBLE TRANSMISSION - Techniques are described for conveying identification information in a preamble transmission. A transmission burst may be generated for transmission over a wireless medium. The transmission burst may include the preamble and a body portion. The preamble may include identification information associated with at least one of a transmitting device or a category of data bring transmitted. The transmission burst may then be transmitted over the wireless medium. | 04-21-2016 |
20160119920 | DYNAMIC UPLINK/DOWNLINK FRAME STRUCTURE FOR ENHANCED COMPONENT CARRIERS - Various aspects described herein relate to communicating using dynamic uplink and downlink transmission time interval (TTI) switching in a wireless network. A notification can be received from a network entity of switching a configurable TTI from downlink communications to uplink communications. The configurable TTI can be one of a plurality of TTIs in a frame structure that allows dynamic switching of configurable TTIs between downlink and uplink communications within a frame. Additionally, uplink communications can be transmitted to the network entity during the configurable TTI based at least in part on the notification. | 04-28-2016 |
20160119948 | FLEXIBLE MULTIPLEXING AND FEEDBACK FOR VARIABLE TRANSMISSION TIME INTERVALS - Methods, systems, and devices for wireless communication are described. A base station may employ a multiplexing configuration based on latency and efficiency considerations. The base station may transmit a resource grant, a signal indicating the length of a downlink (DL) transmission time interval (TTI), and a signal indicating the length of a subsequent uplink (UL) TTI to one or more user equipment (UEs). The base station may dynamically select a new multiplexing configuration by, for example, setting the length of an UL TTI to zero or assigning multiple UEs resources in the same DL TTI. Latency may also be reduced by employing block feedback, such as block hybrid automatic repeat request (HARQ) feedback. A UE may determine and transmit HARQ feedback for each transport block (TB) of a set of TBs, which may be based on a time duration of a downlink TTI. | 04-28-2016 |
20160135214 | UPLINK CONTROL RESOURCE ALLOCATION FOR DYNAMIC TIME-DIVISION DUPLEX SYSTEMS - Methods and apparatuses for managing uplink scheduling for one or more user equipment served by a network entity in a wireless communications system are presented. For instance, an example method is presented that includes generating, by the network entity, an uplink bandwidth allocation map, the uplink bandwidth allocation map defining an uplink bandwidth allocation for at least one of the one or more user equipment for at least one of a plurality of uplink transmission window lengths. In addition, the example method includes transmitting the uplink bandwidth allocation map to at least one of the one or more user equipment. | 05-12-2016 |
20160143043 | TECHNIQUES FOR HANDLING BURSTY INTERFERENCE IN A SHARED RADIO FREQUENCY SPECTRUM BAND - Techniques are described for wireless communication. A first method includes determining, at a user equipment (UE), that the UE is exposed to a bursty interference in a shared radio frequency spectrum band, and modifying, based at least in part on the bursty interference, a feedback message reporting by the UE to a base station. A second method includes determining, at a base station, that a UE is exposed to a bursty interference in a shared radio frequency spectrum band, and modifying, based at least in part on the bursty interference, one or more of: a link adaptation for the UE or a transmission schedule for the UE. | 05-19-2016 |
Patent application number | Description | Published |
20080306819 | SYSTEM AND METHOD FOR SHAPING RELEVANCE SCORES FOR POSITION AUCTIONS - The present invention is directed towards systems and methods for ranking and providing advertisements in a position auction. The method of the present invention comprises receiving a search query and selecting at least one keyword based upon the search query. A list containing at least one keyword based upon the search query is returned and a list comprising at least one bid corresponding to the returned list of keywords is retrieved. A priority score corresponding to each bid is computed and used to rank the list of bids. Advertisements are then provided corresponding to a plurality of the highest ranking bids. | 12-11-2008 |
20110040616 | SPONSORED SEARCH BID ADJUSTMENT BASED ON PREDICTED CONVERSION RATES - Methods and systems are provided for adjusting an advertiser bid, in a sponsored search auction, in connection with one or more advertisements to be served in connection with keyword queries, the bid being associated with one or more keyword phrases. The bid is adjusted based on a predicted conversion rate associated with an advertisement served in connection with a match between a keyword query and the one or more keyword phrases. A bid may be decreased for a match with a lower predicted conversion rate than a comparison predicted conversion rate such as a normalized average predicted conversion rate. | 02-17-2011 |
20120030011 | Systems and Methods for Estimating a Conversion Rate for a Digital Advertisement Based on Dwell Times Associated with the Digital Advertisement - The present disclosure is directed to systems and methods for estimating a conversion rate associated with a digital ad. Generally, an ad provider and/or an ad campaign management system detects an action of a user associated with a digital ad. The ad provider and/or ad campaign management system detects a subsequent action of the user after detecting the action of the user associated with the digital ad and determines an amount of time between the action of the user associated with the digital ad and the subsequent action of the user. The ad provider and/or ad campaign management system then estimates a conversion rate associated with the digital ad based on the determined amount of time. In some implementations, a model is utilized to estimate a conversion rate associated with a digital ad based on dwell times even when the ad provider and/or ad campaign management system has little or no conversion data associated with the digital ad. | 02-02-2012 |
20120084147 | METHOD AND SYSTEM FOR DETERMINING SEARCH SUGGESTIONS - Disclosed is a method and system for generating search suggestions in response to receiving a search query originating from a user computing device. A server computer obtains a plurality of advanced match terms not exactly matching the search query but related to the search query, the advanced match terms previously bid on by advertisers in a bidding process. The server computer obtains advertisements associated with the advanced match terms, where each advertisement is associated with an advertiser who has won the bidding process for one of the advanced match terms. The server computer then transmits, in response to the receiving of the search query, the advanced match terms to the user computing device for display as search suggestions. | 04-05-2012 |
20120265588 | SYSTEM AND METHOD FOR RECOMMENDING NEW CONNECTIONS IN AN ADVERTISING EXCHANGE - A method, system and computer readable medium for recommending new connections in an advertising exchange. The method identifies participants that share some similarity (e.g. a pre-existing advertising relationship), and on the basis of the features and extent of a similarity, and then suggests or recommends other relationships that can also be shared. The method commences by enumerating a set of producer participants and by enumerating a set of consumer participants where at least two of the members of the set of consumer participants has an ad relationship to at least one of the producer participants. Then, on the basis of a selected feature quantity the extent of the similarity is calculated. When it is found that one consumer is similar to a second consumer (by virtue of at least one shared ad relationship), then the system recommends to the participants one or more additional ad relationships that can be established. | 10-18-2012 |
20140164136 | BROAD MATCHING ALGORITHM FOR DISPLAY ADVERTISEMENTS - A method of matching advertisements to users is disclosed. A plurality of attributes of a population of users is identified. A selection is received of an attribute of the plurality of attributes to which a target value is to be broadly matched. A correspondence of an advertisement to a user is determined based on a broad matching of the target value to the attribute. The advertisement is matched to the user based at least in part on the determining of the correspondence. | 06-12-2014 |
20150039406 | INDEPENDENT TARGETED SPONSORED CONTENT MANAGEMENT SYSTEM AND METHOD - A system may include a database configured with individual partitions, one of the partitions corresponding to a sponsored content campaign of a social network. The system may further include multiple servers each communicatively coupled to the database, and each configured to implement a campaign having a campaign termination criterion. Each of the servers may include a processor configured to track sponsored content event data received from a user device based on the campaign and transmit the event data to the database and terminate the campaign based on a comparison of the event data as received from a partition of the database corresponding to the campaign and an estimation of event data not received from the database. The database may be configured to store the event data as received from the servers in the partition corresponding to the campaign upon receipt of the event data. | 02-05-2015 |
20150046278 | SYSTEM AND METHOD FOR POSITIONING SPONSORED CONTENT IN A SOCIAL NETWORK INTERFACE - A system and method optionally includes or utilizes a processor may receive a request for social network content for display in a position of a plurality of sponsored content positions in a newsfeed of a social network interface, each of the plurality of sponsored content positions having a position criterion, at least two of the plurality of sponsored content positions having a different position criterion and identify a sponsored content item of a plurality of sponsored content items stored on a database based, at least in part, on a characteristic of the sponsored content item meeting the position criterion and a bid associated with the sponsored content item. A transmitter may transmit the sponsored content item from the processor to a server for display on a user interface. | 02-12-2015 |
20150046515 | SYSTEM AND METHOD FOR POSITIONING SPONSORED CONTENT IN A SOCIAL NETWORK INTERFACE - A system and method may optional include or utilize a processor configured to receive a request for social network content for display in a sponsored content position in a newsfeed of a social network interface, the position having a position criterion, identify a sponsored content item of multiple sponsored content items stored on a database based, at least in part, on a characteristic of the sponsored content item meeting the position criterion, a bid associated with the sponsored content item, and a scaling factor, wherein each of the sponsored content items correspond to one of multiple item types and at least two of the sponsored content items are of a different item type. The scaling factor for each of the sponsored content items is based on the item type of the corresponding one of the sponsored content items. | 02-12-2015 |
20150066654 | TECHNIQUES FOR FACILITATING CONTENT RETARGETING - Techniques for facilitating retargeting of content are described. According to various embodiments, a user specification of a first set of content items and a second set of content items may be received. Moreover, a user specification of flow logic information may be received. The flow logic information may specify a user trigger action, and an instruction that a second content item in the second set is only to be displayed to a particular user after it is determined that the particular user has performed the user trigger action on the first content item. Thereafter, it may be determined that the particular user has performed the user trigger action on the first content item, and the second content item may be displayed to the particular user, based on the flow logic information. | 03-05-2015 |
20150067048 | TECHNIQUES FOR SUGGESTING CONTENT TO PROMOTE VIA A FEED - Techniques for suggesting content to promote via a stream are described. According to various embodiments, social activity information associated with a plurality of candidate content items posted on an online social network service may be accessed. The social activity information may describe social activity signals associated with each of the candidate content items. A specific content item may then be identified from among the plurality of candidate content items, based on the social activity signals associated with the specific content item. Thereafter an organization may be prompted to promote the specific content item on the online social network service. | 03-05-2015 |
20150095154 | PROVIDING SPONSORED SOCIAL NETWORK CONTENT - A device, system, memory device, and method may variously include or utilize a processor and an electronic storage. The electronic storage is configured to store social network content items, the content items including at least one sponsored content item and at least one unsponsored content item. The processor is configured to receive a request for a social network content item for display in a newsfeed of a social network interface, the newsfeed including positions, at least one of the positions being a sponsored content position, identify a content item for display in the newsfeed based, at least in part, on the request, determine a sponsored content status of the content item as identified, and cause the content item to be displayed in the sponsored content position of the newsfeed based, at least in part, on the sponsored content status being indicative of the content item being a sponsored content item. | 04-02-2015 |
20150186110 | VOICE INTERFACE TO A SOCIAL NETWORKING SERVICE - A machine may be configured to generate and provide, for example, a voice-user interface to a social networking service. The voice-user interface may enable a member of the social networking service to access member profile information for other members of the social networking service. Using the voice-user interface, a first member of the social networking service can speak a natural language command or request to receive an aural response that includes information regarding a second member of the social networking service. In this manner, the first member can request and receive specific member profile information of a second member. In another aspect, the first member can record audio notes to be assigned to his or her own member profile or assigned to a member profile of the second member. The first member may subsequently use the voice-user interface to have such audio notes played back when desired. | 07-02-2015 |
20160092890 | MULTIDIMENSIONAL MONITORING AND ALERTING OF BUSINESS METRICS - Techniques for multidimensional monitoring and alerting of business metrics of an online system are described. According to various embodiments, a user specification of a business metric associated with operations of an online social networking system, and multiple dimensional values that are included in the business metric, are received. A revenue-impacting event corresponding to a change in a specific one of the dimensional values is then detected. Thereafter, it is determined that the revenue-impacting event is caused by a release of a particular online service associated with the online social networking system. A notification specifying the revenue-impacting event, and indicating that the revenue-impacting event was caused by the release of the particular online service, is then displayed. | 03-31-2016 |
Patent application number | Description | Published |
20120328616 | HUMAN ANTIGEN BINDING PROTEINS THAT BIND TO A COMPLEX COMPRISING BETA-KLOTHO AND AN FGF RECEPTOR - The present invention provides compositions and methods relating to or derived from antigen binding proteins capable of inducing B-Klotho, and or FGF21-like mediated signaling. | 12-27-2012 |
20140024111 | HOST CELL FOR MAKING ANTIBODY FC-HETERODIMERIC MOLECULES USING ELECTROSTATIC STEERING EFFECTS - The invention relates to methods of making Fc-heterodimeric proteins or polypeptides. The invention also relates to the Fc-heterodimeric proteins or polypeptides themselves, including the individual polypeptide components that comprise the heterodimer Nucleic acids encoding such polypeptides, expression vectors, and host cells. Moreover, the invention relates to pharmaceutical compositions comprising one of more Fc-heterodimeric proteins or polypeptides. | 01-23-2014 |
20140038285 | METHOD OF CORRELATED MUTATIONAL ANALYSIS TO IMPROVE THERAPEUTIC ANTIBODIES - A method of improving antibody manufacturability or developability through a computational approach. | 02-06-2014 |
20140112926 | Fc VARIANTS - Disclosed are Fc-containing proteins comprising a binding region and a variant Fc region that can elicit one or more immune effector function and/or bind to an Fc receptor more effectively than a similar Fc-containing protein comprising a wild type Fc region. Also disclosed are nucleic acids encoding such Fc-containing proteins, methods for making such proteins, and methods of treatment utilizing such proteins. | 04-24-2014 |
20140161828 | BCMA ANTIGEN BINDING PROTEINS - The present invention relates to BCMA (B-Cell Maturation Antigen) antigen binding proteins, such as antibodies, polynucleotide sequences encoding said antigen binding proteins, and compositions and methods for diagnosing and treating diseases. The present invention also relates to BCMA antibody drug conjugates. | 06-12-2014 |
20140286898 | INTERLEUKIN-2 MUTEINS FOR THE EXPANSION OF T-REGULATORY CELLS - Provided herein are IL-2 muteins and IL-2 mutein Fc-fusion molecules that preferentially expand and activate T regulatory cells and are amenable to large scale production. Also provided herein are variant human IgG1 Fc molecules lacking or with highly reduced effector function and high stability despite lacking glycosylation at N297. Also, provided herein are linker peptides that are glycosylated when expressed in mammalian cells. | 09-25-2014 |
20140302036 | PROTEINS SPECIFIC FOR BAFF AND B7RP1 - Described herein are bispecific proteins specific for BAFF and B7RP1, nucleic acids encoding such proteins, methods of making such proteins, and uses for such proteins. | 10-09-2014 |
20140343252 | INTERLEUKIN-2 MUTEINS FOR THE EXPANSION OF T-REGULATORY CELLS - Provided herein are IL-2 muteins and IL-2 mutein Fc-fusion molecules that preferentially expand and activate T regulatory cells and are amenable to large scale production. Also provided herein are variant human IgG1 Fc molecules lacking or with highly reduced effector function and high stability despite lacking glycosylation at N297. Also, provided herein are linker peptides that are glycosylated when expressed in mammalian cells. | 11-20-2014 |
20140378665 | GROWTH DIFFERENTIATION FACTOR 15 (GDF-15) POLYPEPTIDES - GDF15 polypeptides, constructs comprising GDF15, and mutants thereof are provided. In various embodiments the GDF15 polypeptides, constructs comprising GDF15, and mutants thereof, can be of use in the treatment or ameliorating a metabolic disorder. In various embodiments the metabolic disease or disorder is type 2 diabetes, obesity, dyslipidemia, elevated glucose levels, elevated insulin levels and diabetic nephropathy. | 12-25-2014 |
20150344583 | BCMA ANTIGEN BINDING PROTEINS - The present invention relates to BCMA (B-Cell Maturation Antigen) antigen binding proteins, such as antibodies, polynucleotide sequences encoding said antigen binding proteins, and compositions and methods for diagnosing and treating diseases. The present invention also relates to BCMA antibody drug conjugates and uses thereof. | 12-03-2015 |
20160024225 | PROTEINS SPECIFIC FOR BAFF AND B7RP1 AND USES THEREOF - Described herein are bispecific proteins specific for BAFF and B7RP1, nucleic acids encoding such proteins, methods of making such proteins, and uses for such proteins. | 01-28-2016 |
Patent application number | Description | Published |
20160041868 | Data Rebuild on Feedback from a Queue in a Non-Volatile Solid-State Storage - A storage cluster is provided. The storage cluster includes a plurality of storage nodes, each of the plurality of storage nodes having nonvolatile solid-state memory and a plurality of operations queues coupled to the solid-state memory. The plurality of storage nodes is configured to distribute the user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can access the user data with a failure of two of the plurality of storage nodes. Each of the plurality of storage nodes is configured to determine whether a read of 1 or more bits in the solid-state memory via a first path is within a latency budget. The plurality of storage nodes is configured to perform a read of user data or metadata via a second path, responsive to a determination that the read of the bit via the first path is not within the latency budget. | 02-11-2016 |
20160041869 | Masking Defective Bits in a Storage Array - A method of failure mapping is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a chassis that couples the storage nodes as a storage cluster. Each of the plurality of storage nodes has a non-volatile solid-state storage with flash memory or other types of non-volatile memory and the user data is accessible via the erasure coding from a remainder of the plurality of storage nodes in event of two of the plurality of storage nodes being unreachable. The method includes determining that a non-volatile memory block in the memory has a defect and generating a mask that indicates the non-volatile memory block and the defect. The method includes reading from the non-volatile memory block with application of the mask, wherein the reading and the application of the mask are performed by the non-volatile solid-state storage. | 02-11-2016 |
20160041870 | Adjustable Error Correction Based on Memory Health in a Storage Unit - A method for adjustable error correction in a storage cluster is provided. The method includes determining health of a non-volatile memory of a non-volatile solid-state storage unit of each of a plurality of storage nodes in a storage cluster on a basis of per flash package, per flash die, per flash plane, per flash block, or per flash page. The determining is performed by the storage cluster. The plurality of storage nodes is housed within a chassis that couples the storage nodes as the storage cluster. The method includes adjusting erasure coding across the plurality of storage nodes based on the health of the non-volatile memory and distributing user data throughout the plurality of storage nodes through the erasure coding. The user data is accessible via the erasure coding from a remainder of the plurality of storage nodes if any of the plurality of storage nodes are unreachable. | 02-11-2016 |
20160041873 | DIE-LEVEL MONITORING IN A STORAGE CLUSTER - In some embodiments, a method for die-level monitoring is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a chassis that couples the storage nodes. Each of the storage nodes has a non-volatile solid-state storage with non-volatile memory and the user data is accessible via the erasure coding from a remainder of the storage nodes in event of two of the storage nodes being unreachable. The method includes producing diagnostic information that diagnoses the non-volatile memory on a basis of per package, per die, per plane, per block, or per page, the producing performed by each of the plurality of storage nodes. The method includes writing the diagnostic information to a memory in the storage cluster. | 02-11-2016 |
20160041878 | Failure Mapping in a Storage Array - A storage cluster is provided. The storage cluster includes a plurality of storage nodes within a chassis. The plurality of storage nodes has flash memory for storage of user data and is configured to distribute the user data and metadata throughout the plurality of storage nodes such that the storage nodes can access the user data with a failure of two of the plurality of storage nodes. Each of the storage nodes is configured to generate at least one address translation table that maps around defects in the flash memory on one of a per flash package basis, per flash die basis, per flash plane basis, per flash block basis, per flash page basis, or per physical address basis. Each of the plurality of storage nodes is configured to apply the at least one address translation table to write and read accesses of the user data. | 02-11-2016 |
20160041887 | Error Recovery in a Storage Cluster - A plurality of storage nodes within a single chassis is provided. The plurality of storage nodes is configured to communicate together as a storage cluster. The plurality of storage nodes has a non-volatile solid-state storage for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes, with erasure coding of the user data. The plurality of storage nodes is configured to recover from failure of two of the plurality of storage nodes by applying the erasure coding to the user data from a remainder of the plurality of storage nodes. The plurality of storage nodes is configured to detect an error and engage in an error recovery via one of a processor of one of the plurality of storage nodes, a processor of the non-volatile solid state storage, or the flash memory. | 02-11-2016 |
Patent application number | Description | Published |
20130013862 | EFFICIENT HANDLING OF MISALIGNED LOADS AND STORES - A system and method for efficiently handling misaligned memory accesses within a processor. A processor comprises a load-store unit (LSU) with a banked data cache (d-cache) and a banked store queue. The processor generates a first address corresponding to a memory access instruction identifying a first cache line. The processor determines the memory access is misaligned which crosses over a cache line boundary. The processor generates a second address identifying a second cache line logically adjacent to the first cache line. If the instruction is a load instruction, the LSU simultaneously accesses the d-cache and store queue with the first and the second addresses. If there are two hits, the data from the two cache lines are simultaneously read out. If the access is a store instruction, the LSU separates associated write data into two subsets and simultaneously stores these subsets in separate cache lines in separate banks of the store queue. | 01-10-2013 |
20130107655 | Lookahead Scheme for Prioritized Reads | 05-02-2013 |
20130254485 | COORDINATED PREFETCHING IN HIERARCHICALLY CACHED PROCESSORS - Processors and methods for coordinating prefetch units at multiple cache levels. A single, unified training mechanism is utilized for training on streams generated by a processor core. Prefetch requests are sent from the core to lower level caches, and a packet is sent with each prefetch request. The packet identifies the stream ID of the prefetch request and includes relevant training information for the particular stream ID. The lower level caches generate prefetch requests based on the received training information. | 09-26-2013 |
20140149632 | PREFETCHING ACROSS PAGE BOUNDARIES IN HIERARCHICALLY CACHED PROCESSORS - Processors and methods for preventing lower level prefetch units from stalling at page boundaries. An upper level prefetch unit closest to the processor core issues a preemptive request for a translation of the next page in a given prefetch stream. The upper level prefetch unit sends the translation to the lower level prefetch units prior to the lower level prefetch units reaching the end of the current page for the given prefetch stream. When the lower level prefetch units reach the boundary of the current page, instead of stopping, these prefetch units can continue to prefetch by jumping to the next physical page number provided in the translation. | 05-29-2014 |
20140215190 | COMPLETING LOAD AND STORE INSTRUCTIONS IN A WEAKLY-ORDERED MEMORY MODEL - Techniques are disclosed relating to completion of load and store instructions in a weakly-ordered memory model. In one embodiment, a processor includes a load queue and a store queue and is configured to associate queue information with a load instruction in an instruction stream. In this embodiment, the queue information indicates a location of the load instruction in the load queue and one or more locations in the store queue that are associated with one or more store instructions that are older than the load instruction. The processor may determine, using the queue information, that the load instruction does not conflict with a store instruction in the store queue that is older than the load instruction. The processor may remove the load instruction from the load queue while the store instruction remains in the store queue. The queue information may include a wrap value for the load queue. | 07-31-2014 |
20150026404 | Least Recently Used Mechanism for Cache Line Eviction from a Cache Memory - A mechanism for evicting a cache line from a cache memory includes first selecting for eviction a least recently used cache line of a group of invalid cache lines. If all cache lines are valid, selecting for eviction a least recently used cache line of a group of cache lines in which no cache line of the group of cache lines is also stored within a higher level cache memory such as the L1 cache, for example. Lastly, if all cache lines are valid and there are no non-inclusive cache lines, selecting for eviction the least recently used cache line stored in the cache memory. | 01-22-2015 |
20150026413 | Access Map-Pattern Match Based Prefetch Unit for a Processor - In an embodiment, a processor may implement an access map-pattern match (AMPM)-based prefetcher in which patterns may include wild cards for some cache blocks. The wild card may match any access for the corresponding cache block (e.g. no access, demand access, prefetch, successful prefetch, etc.). Furthermore, patterns with irregular strides and/or irregular access patterns may be included in the matching patterns and may be detected for prefetch generation. In an embodiment, the AMPM prefetcher may implement a chained access map for large streaming prefetches. If a stream is detected, the AMPM prefetcher may allocate a pair of map entries for the stream and may reuse the pair for subsequent access map regions within the stream. In some embodiments, a quality factor may be associated with each access map and may control the rate of prefetch generation. | 01-22-2015 |
20150149721 | SELECTIVE VICTIMIZATION IN A MULTI-LEVEL CACHE HIERARCHY - Systems, methods, and apparatuses for implementing selective victimization to reduce power and utilized bandwidth in a multi-level cache hierarchy. Each set of an upper-level cache includes a counter that keeps track of the number of times the set was accessed. These counters are periodically decremented by another counter that tracks the total number of accesses to the cache. If a given set counter is below a certain threshold value, clean victims are dropped from this given set instead of being sent to a lower-level cache. Also, a separate counter is used to track the total number of outstanding requests for the cache as a proxy for bus-bandwidth in order to gauge the total amount of traffic in the system. The cache will implement selective victimization whenever there is a large amount of traffic in the system. | 05-28-2015 |
20150149722 | DELAYING CACHE DATA ARRAY UPDATES - Systems, methods, and apparatuses for reducing writes to the data array of a cache. A cache hierarchy includes one or more L1 caches and a L2 cache inclusive of the L2 cache(s). When a request from the L1 cache misses in the L2 cache, the L2 cache sends a fill request to memory. When the fill data returns from memory, the L2 cache delays writing the fill data to its data array. Instead, this cache line is written to the L1 cache and a clean-evict bit corresponding to the cache line is set in the L1 cache. When the L1 cache evicts this cache line, the L1 cache will write back the cache line to the L2 cache even if the cache line has not been modified. | 05-28-2015 |
20150161033 | Lookahead Scheme for Prioritized Reads - A circular queue implementing a scheme for prioritized reads is disclosed. In one embodiment, a circular queue (or buffer) includes a number of storage locations each configured to store a data value. A multiplexer tree is coupled between the storage locations and a read port. A priority circuit is configured to generate and provide selection signals to each multiplexer of the multiplexer tree, based on a priority scheme. Based on the states of the selection signals, one of the storage locations is coupled to the read port via the multiplexers of the multiplexer tree. | 06-11-2015 |
20150309939 | SELECTIVE CACHE WAY-GROUP POWER DOWN - A method and apparatus for selectively powering down a portion of a cache memory includes determining a power down condition dependent upon a number of accesses to the cache memory. In response to the detection of the power down condition, selecting a group of cache ways included in the cache memory dependent upon a number of cache lines in each cache way that are also included in another cache memory. The method further includes locking and flushing the selected group of cache ways, and then activating a low power mode for the selected group of cache ways. | 10-29-2015 |
20150309944 | METHODS FOR CACHE LINE EVICTION - A method and apparatus for evicting cache lines from a cache memory includes receiving a request from one of a plurality of processors. The cache memory is configured to store a plurality of cache lines, and a given cache line includes an identifier indicating a processor that performed a most recent access of the given cache line. The method further includes selecting a cache line for eviction from a group of least recently used cache lines, where each cache line of the group of least recently used cache lines occupy a priority position less that a predetermined value, and then evicting the selected cache line. | 10-29-2015 |
20160055099 | Least Recently Used Mechanism for Cache Line Eviction from a Cache Memory - A mechanism for evicting a cache line from a cache memory includes first selecting for eviction a least recently used cache line of a group of invalid cache lines. If all cache lines are valid, selecting for eviction a least recently used cache line of a group of cache lines in which no cache line of the group of cache lines is also stored within a higher level cache memory such as the L1 cache, for example. Lastly, if all cache lines are valid and there are no non-inclusive cache lines, selecting for eviction the least recently used cache line stored in the cache memory. | 02-25-2016 |
Patent application number | Description | Published |
20090222313 | APPARATUS AND METHOD FOR PREDICTING CUSTOMER BEHAVIOR - A predictive model generator that enhances customer experience, reduces the cost of servicing a customer, and prevents customer attrition by predicting the appropriate interaction channel through analysis of different types of data and filtering of irrelevant data. The model includes a customer interaction data engine for transforming data into a proper format for storage, data warehouse for receiving data from a variety of sources, and a predictive engine for analyzing the data and building models. | 09-03-2009 |
20100138282 | MINING INTERACTIONS TO MANAGE CUSTOMER EXPERIENCE THROUGHOUT A CUSTOMER SERVICE LIFECYCLE - A customer experience is improved through data mining and text mining technologies and that derive insights about a customer by analyzing interactions between the customer and a customer service agent. One or more numerical measurements of customer satisfaction are derived and recommended actions are provided to an agent to enhance the customer experience throughout a customer service lifecycle. | 06-03-2010 |
20100191658 | Predictive Engine for Interactive Voice Response System - A customer service issue prediction engine uses one or more models of issue probability. A method of multi-phase customer issue prediction includes a modeling phase, an application phase, and a learning phase. A telephonic interactive voice response (IVR) system predicts customer issues. | 07-29-2010 |
20100262549 | SYSTEM AND METHOD FOR CUSTOMER REQUESTS AND CONTACT MANAGEMENT - A method and a web-based system is provided that enables a customer service center of a company to provide its customers with a choice of different modes for establishing contact with customer service representatives. The different modes of contact are displayed on a single web page. The modes of contact include, but are not limited to call, chat, e-mail and Internet talk. Further, the system provides information regarding the estimated wait time and the less busy time for the modes of contact. In addition, the system and method provide means for conducting a search in a knowledge database for automated responses to queries from customers. The system and method enables the customer to provide feedback for each interaction with the customer service center through the web page. Further, the system and method enable the storage of all interaction between each customer and the customer service center. | 10-14-2010 |
20110158398 | METHOD AND APPARATUS FOR OPTIMIZING CUSTOMER SERVICE ACROSS MULTIPLE CHANNELS - A method and apparatus for a computer-implemented technique for maximizing customer satisfaction and first call resolution, including converting telephone calls into online chats, while minimizing cost is provided. Techniques for incorporating analytics as applied to customer data into particular strategies for call deflection, targeting particular individuals to increase chat acceptance rate, and computing a customer's wait time are also provided. | 06-30-2011 |
20120023419 | SLIDER AND HISTORY FIELD FOR SMART CHAT SESSIONS - A context sensitive slider content area provides a slide out mechanism that is automatically actuated when additional information is needed during a chat session between an agent and a visitor, e.g. where a pre-chat and/or exit form is to be completed. The context sensitive slide out content area also provides problem resolution information to the visitor to help in solving problems, e.g. the top five problems; and also provides a self-service step-by-step wizard. A history section is provided with which the visitor can track back all previous steps carried out within the smart client. A history bar provides an iconic representation of all previous activities. A technique is also disclosed for executing various actions, such as form filling or requests for additional services, in a chat session. | 01-26-2012 |
20120130771 | Chat Categorization and Agent Performance Modeling - Chat categorization uses semi-supervised clustering to provide Voice of the Customer (VOC) analytics over unstructured data via an historical understanding of topic categories discussed to derive an automated methodology of topic categorization for new data; application of semi-supervised clustering (SSC) for VOC analytics; generation of seed data for SSC; and a voting algorithm for use in the absence of domain knowledge/manual tagged data. Customer service interactions are mined and quality of these interactions is measured by “Customer's Vote” which, in turn, is determined by the customer's experience during the interaction and the quality of customer issue resolution. Key features of the interaction that drive a positive experience and resolution are automatically learned via machine learning driven algorithms based on historical data. This, in turn, is used to coach/teach the system/service representative on future interactions. | 05-24-2012 |
20120185544 | Method and Apparatus for Analyzing and Applying Data Related to Customer Interactions with Social Media - Embodiments of the invention provide techniques that quantize community interactions with social media to understand and influence consumer experiences. | 07-19-2012 |
20120233258 | METHOD AND APPARATUS FOR ANALYZING AND APPLYING DATA RELATED TO CUSTOMER INTERACTIONS WITH SOCIAL MEDIA - Embodiments of the invention provide techniques that quantize community interactions with social media to understand and influence consumer experiences. | 09-13-2012 |
20130080362 | CUSTOMER JOURNEY PREDICTION AND RESOLUTION - Customer journey prediction and resolution is accomplished via a predictive model in which each user is mapped onto all available user journey information corresponding to a specific business. The predictive model is analyzed to understand the characteristics, preferences, and lowest effort resolution for the user related to the services that are subscribed to by the user. The predictive model is analyzed to predict the service or collection of services for each user. Embodiments interact with, provide and receive information from, and react to and/or deliver action to the customer across channels and across services. All customer and system behavior, data, and action is tracked and coordinated and leveraged for continuous feedback and performance improvement. | 03-28-2013 |
20130129076 | INTERACTION MANAGEMENT - A company/organization is enabled to optimize sessions from an agent's perspective across multiple channels. Actions may be performed, such as monitoring the journey of a user across a self service application, raising alerts to the agent based on the journey, selecting an appropriate agent to whom a session may be routed, raising alerts for a supervisor, enabling the supervisor to track sessions and intervene if required, enable the agent to run commands from an interaction window, push links to launch applications to supplement the primary interaction through appropriate mechanisms, show appropriate responses to the agent on analyzing the session, and providing shortcut keys for the agent to allow the agent to insert appropriate responses into a chat session. Analysis is provided for the sessions, data is extracted from the sessions, and appropriate forms are populated with the data from the session and with agent information. | 05-23-2013 |
20130211880 | CHAT CATEGORIZATION AND AGENT PERFORMANCE MODELING - Chat categorization uses semi-supervised clustering to provide Voice of the Customer (VOC) analytics over unstructured data via an historical understanding of topic categories discussed to derive an automated methodology of topic categorization for new data; application of semi-supervised clustering (SSC) for VOC analytics; generation of seed data for SSC; and a voting algorithm for use in the absence of domain knowledge/manual tagged data. Customer service interactions are mined and quality of these interactions is measured by “Customer's Vote” which, in turn, is determined by the customer's experience during the interaction and the quality of customer issue resolution. Key features of the interaction that drive a positive experience and resolution are automatically learned via machine learning driven algorithms based on historical data. This, in turn, is used to coach/teach the system/service representative on future interactions. | 08-15-2013 |
20130282430 | METHOD AND APPARATUS FOR AN INTUITIVE CUSTOMER EXPERIENCE - Improvement of customer experiences during online commerce is accomplished by providing unique experiences to customers as a result of anticipating customer needs, simplifying customer engagement based on predicted customer intent, and updating system knowledge about customers with information gathered from new customer interactions. In this way, the customer experience is improved. | 10-24-2013 |
20130304578 | METHOD AND APPARATUS FOR ENHANCED IN-STORE RETAIL EXPERIENCE USING LOCATION AWARENESS - Embodiments of the invention provide a nexus between a user's presence within or proximate to a brick and mortar store outside of an explicit user transaction within the store, that is based solely upon the user's presence within the store, and not on any affirmative actions taken by the user by maintaining location awareness of the user and by communicating this awareness in real time, as the user moves from location to location, to brick and mortar stores at or near to the user's location. In this way, embodiments of the invention link the user's virtual presence, for example via the Internet, and all of the user-related information that is available for data mining, for example using big data techniques, to the user's physical presence at a physical location to create an enhanced user experience within the physical location in real time. | 11-14-2013 |
20140019886 | METHOD AND APPARATUS FOR OPTIMIZING CUSTOMER SERVICE ACROSS MULTIPLE CHANNELS - A method and apparatus for a computer-implemented technique for maximizing customer satisfaction and first call resolution, including converting telephone calls into online chats, while minimizing cost is provided. Techniques for incorporating analytics as applied to customer data into particular strategies for call deflection, targeting particular individuals to increase chat acceptance rate, and computing a customer's wait time are also provided. | 01-16-2014 |
20140067649 | METHOD AND APPARATUS FOR PROACTIVE NOTIFICATIONS BASED ON THE LOCATION OF A USER - The location of a user is obtained and, based on the location of the user and services available to, or requested by the user, a notification handler sends appropriate notifications to the user. | 03-06-2014 |
20140143017 | PROACTIVE SURVEYS BASED ON CUSTOMER INFORMATION - A context-aware computing system for delivering surveys to a customer. The choice of which survey to send to a customer may be tailored based on a click path (route), customer history, and customer interests. A customer browsing a Web page initiates the survey decision process. A control module selects a survey to send to a customer based on the criteria above and customer intent. Customer responses are then harvested from the Web-based survey. | 05-22-2014 |
20140156383 | AD-WORDS OPTIMIZATION BASED ON PERFORMANCE ACROSS MULTIPLE CHANNELS - In online advertising, ad delivery optimization is derived from ad-words searches. A user performs a keyword search for a product or service. User interactions across multiple channels, e.g. phone, text, email, and so on, and multiple browsers that are used while conducting a search are analyzed to predict user intent. Based on the intent prediction, advertisements that are determined to be the most relevant are displayed along with the search results. The user then clicks through the ads to the websites that are most relevant to his search, for example to make purchases of goods and services. | 06-05-2014 |
20140207518 | Method and Apparatus for Building a User Profile, for Personalization Using Interaction Data, and for Generating, Identifying, and Capturing User Data Across Interactions Using Unique User Identification - A user profile is creates, and personalization is provided, by compiling interaction data. The interaction data is compiled to generate a value index or score from a user model. Parameterized data is used to build tools which help decide an engagement strategy and modes of engagement with a user. Several facets relating to the user, such as user behavior, user interests, products bought, intent, chat language, and so on, are compiled to create a user profile based personalization technique. In another embodiment, a unique ID is provided that can be mapped across multiple channels for use by the user to contact various organizations across multiple channels, and thus upgrade the user's experience. | 07-24-2014 |
20140219437 | Interaction Management - A company/organization is enabled to optimize sessions from an agent's perspective across multiple channels. Actions may be performed, such as monitoring the journey of a user across a self service application, raising alerts to the agent based on the journey, selecting an appropriate agent to whom a session may be routed, raising alerts for a supervisor, enabling the supervisor to track sessions and intervene if required, enable the agent to run commands from an interaction window, push links to launch applications to supplement the primary interaction through appropriate mechanisms, show appropriate responses to the agent on analyzing the session, and providing shortcut keys for the agent to allow the agent to insert appropriate responses into a chat session. Analysis is provided for the sessions, data is extracted from the sessions, and appropriate forms are populated with the data from the session and with agent information. | 08-07-2014 |
20150081597 | Customer Journey Prediction and Resolution - Customer journey prediction and resolution is accomplished via a predictive model in which each user is mapped onto all available user journey information corresponding to a specific business. The predictive model is analyzed to understand the characteristics, preferences, and lowest effort resolution for the user related to the services that are subscribed to by the user. The predictive model is analyzed to predict the service or collection of services for each user. Embodiments interact with, provide and receive information from, and react to and/or deliver action to the customer across channels and across services. All customer and system behavior, data, and action is tracked and coordinated and leveraged for continuous feedback and performance improvement. | 03-19-2015 |
20150161617 | SLIDER AND HISTORY FIELD FOR SMART CHAT SESSIONS - A context sensitive slider content area provides a slide out mechanism that is automatically actuated when additional information is needed during a chat session between an agent and a visitor, e.g. where a pre-chat and/or exit form is to be completed. The context sensitive slide out content area also provides problem resolution information to the visitor to help in solving problems, e.g. the top five problems; and also provides a self-service step-by-step wizard. A history section is provided with which the visitor can track back all previous steps carried out within the smart client. A history bar provides an iconic representation of all previous activities. A technique is also disclosed for executing various actions, such as form filling or requests for additional services, in a chat session. | 06-11-2015 |
20150178371 | SYSTEMS AND METHODS FOR FACILITATING DIALOGUE MINING - The disclosure is related to mining of text to derive information from the text that is useful for a variety of purposes. The text mining process can be implemented in a service oriented industry such as a call center, where a customer and an agent engage in a dialog, e.g., to discuss product/service related issues. The messages in dialogues between the customers and the agents are tagged with features that describe an aspect of the conversation. The text mining process can mine various dialogues and identify a set of features and messages based on prediction algorithms. The identified set of features and messages can be used to infer an intent of a particular customer for contacting the agent, and to generate a recommendation based on the determined intent. | 06-25-2015 |
20160071126 | Customer Journey Prediction and Resolution - Customer journey prediction and resolution is accomplished via a predictive model in which each user is mapped onto all available user journey information corresponding to a specific business. The predictive model is analyzed to understand the characteristics, preferences, and lowest effort resolution for the user related to the services that are subscribed to by the user. The predictive model is analyzed to predict the service or collection of services for each user. Embodiments interact with, provide and receive information from, and react to and/or deliver action to the customer across channels and across services. All customer and system behavior, data, and action is tracked and coordinated and leveraged for continuous feedback and performance improvement. | 03-10-2016 |
Patent application number | Description | Published |
20100061335 | Method and System for the Reduction of Scanning Time While Roaming - Described are systems, methods, and devices used for reducing scanning time while communicating between wireless mobile computing devices within a wireless communications network. The method includes the following step(s): receiving communication data from one or more APs within a network, the communication data being specific to each of the one or more APs and transmitting the communication data to an MU within the network. The MU is associated with a first AP and the MU associates with a second AP based on the communication data as the MU roams to the second AP. The method further includes the steps of: associating, by an MU, with a first AP within a network, receiving communication data from the first AP, the communication data including information specific to each of one or more further APs, and associating with one of the further APs based on the communication data. | 03-11-2010 |
20140105061 | Method and System to Configure Network Devices - A method includes determining, for a particular time period, a scheduled location for a device based on a schedule corresponding to a user of the device. The method further includes configuring a set of network devices, that have a signal coverage area which includes the scheduled location, such that a first subset of the network devices is configured for connecting with the first client device during the particular time period and a second subset of network devices is configured for not connecting with the first client device during the particular time period. | 04-17-2014 |
20140269370 | Dynamic Beamforming Configuration Based on Network Conditions - A method includes steering client devices to access points that potentially increase capacity of communications using beamformed transmissions. In particular, this includes determining the best access points for beamforming to a particular client or a group of clients in the network for an improved throughput performance in the deployment or a subset of access points. | 09-18-2014 |
20140274112 | METHOD AND SYSTEM FOR DETERMINING A LOCATION OF WIRELESS DEVICE - A system for (a) determining a first direction from a first device toward a second device based on a first set of WiFi® wireless signals received by at least one antenna of the first device from the second device, (b) determining a second direction from a third device toward the second device based on a second set of WiFi® wireless signals received by at least one antenna of the third device from the second device, and (c) based at least on a first location of the first device, the first direction from the first device toward the second device, a second location of the third device, and the second direction from the third device toward the second device: determining a third location of the second device. | 09-18-2014 |
20150120910 | METHOD FOR DYNAMIC LOAD BALANCING IN CAMPUS DEPLOYMENTS - A method is described for dynamically assigning tasks to entities of different types within a network system based on preferences to perform the tasks on particular entities and/or network/device conditions. This ability to dynamically assign processing of tasks between disparate devices in a network system provides a more efficient network configuration and utilization of resources while not compromising throughput, overall network security, and/or network flexibility. | 04-30-2015 |
20150222562 | SYSTEM AND METHOD FOR EFFICIENT FRAME AGGREGATION - The present disclosure discloses a method and network device for efficient frame aggregation. Specifically, a network device queues a first set of packets until one of the first set of aggregation limits is detected. The network device then transmits the first set of packets, and receives feedback information. Then, the network device modifies the first set of aggregation limits to obtain a second set of aggregation limits based on the feedback information. The network device queues a second set of packets until one of the second set of aggregation limits is detected, and then transmits the second set of packets. Also, the network device determines whether a received packet has a particular characteristic. If so, the network device transmits the first set of packets before at least one of the first set of aggregation limits is detected. | 08-06-2015 |
20150312835 | DISTRIBUTED RADIO MANAGEMENT - The present disclosure discloses a distributed radio management system that is capable of dynamically tuning a radio antenna to a particular radio frequency channel and/or radio frequency band. The disclosed network device includes a transceiver, an antenna, and a component on a wireless signal path between the transceiver and the antenna. The component includes functionality to dynamically switch between processing signals corresponding to a first radio frequency band and processing signals corresponding to a second radio frequency band. Moreover, the component also may include functionality to dynamically switch between processing signals and refraining from processing wireless signals that are received by the component. | 10-29-2015 |
20160029356 | DYNAMIC USER-CONFIGURABLE INFORMATION ELEMENT - According to one embodiment of the invention, a system for providing a dynamic user-customizable beacon information element (IE) is described. One embodiment of the system comprises an access point comprising a hardware processor wherein the system is configured to perform operations comprising: periodically transmitting, by an access point, a first beacon frame comprising a plurality of IEs, based on user input, configuring at least one IE of the plurality of IEs in the first beacon frame, modifying the at least one IE in the first beacon frame based at least on the user input to obtain a second beacon frame comprising a modified IE based on the user input and periodically transmitting, by the access point, the second beacon frame comprising the modified IE. | 01-28-2016 |