Patent application number | Description | Published |
20090313536 | Dynamically Providing Relevant Browser Content - A requested content page is provided with additional relevant content that is dynamically generated. A page originally requested by a browser application is generated and examined to determine key words, address information, and other information for which relevant content may be retrieved. The other information may not be part of the original page content, but it can be the relation between the content page and other pages. The relevant content is determined based on the results of the content page examination. After retrieving the relevant content, the retrieved content is embedded into the requested content page and provided to the requesting user. The retrieved relevant content may be provided with the requested content page in a designated portion within the requested content page, near related content in the page, and/or displayed in response to user input as a pop-up window or in a preview pane. Relevant content can be determined, retrieved and embedded in a content page by a relevant content engine implemented as a server application, client application or browser application plug-in. | 12-17-2009 |
20090313558 | Semantic Image Collection Visualization - A service provides an image collection as a visual preview of content pages having a link in or otherwise related to a current page. A first content page is provided to a user and may have one or more links to additional content pages. Each of the related content pages may have one or more images. Selected images of the one or more content pages are provided in an image collection. The images may be positioned in rows, columns, or some other manner within the collection. The image collection is prepared dynamically from related content pages when the current page is loaded and does not require any software in the currently content page to be changed as the linked content pages change. | 12-17-2009 |
20100169331 | ONLINE RELEVANCE ENGINE - Information is automatically located which is relevant to source content that a user is viewing on a user interface without requiring the user to perform an additional search or navigate links of the source content. The source content can be, e.g., a web page or a document from a word processing or email application. The relevant information can include images, videos, web pages, maps or other location-based information, people-based information and special services which aggregate different types of information. Related content is located by analyzing textual content, user behavior and connectivity relative to the source. The related content is scored for similarity to the source. Content which is sufficiently similar but not too similar is selected. Similar related content is grouped to select representative results. The selected content is filtering in multiple stages based on attribute priorities to avoid unnecessary processing of content which is filtered out an early stage. | 07-01-2010 |
20100175019 | DATA EXPLORATION TOOL INCLUDING GUIDED NAVIGATION AND RECOMMENDED INSIGHTS - An ad hoc business data exploration tool is disclosed, which provides guided access to the vast amount of data within a multidimensional database. The tool provides guided access by suggesting insights which may be of particular interest to the user based on a scoring of the insights and user feedback on desirable/undesirable insights. The present system works in conjunction with custom algorithms, as well as a conventional multidimensional database. | 07-08-2010 |
20110173553 | RELEVANCE ORIENTED GRAPHICAL REPRESENTATION OF DISCUSSION MESSAGES - Messages to a focal user are organized by relevance of the message originators. A visual representation of the messages includes a focal user representation (textual or graphic) and multiple contact representations (textual or graphic). The contact representations are displayed at respective relevance distances from the focal user representation. Text regions present the contents of messages from the source contacts, e.g., using graphic novel-style word balloons. The contact representations can be positioned on screen in maps, radar format, or other configurations. Users can filter contacts according to relevance, and can filter messages by pertinence. | 07-14-2011 |
20110313994 | CONTENT PERSONALIZATION BASED ON USER INFORMATION - A particular method of content personalization based on user information includes receiving data representing an information retrieval task. The data is received at a server from a computing device associated with a user. The information retrieval task is executed to generate result information. Personalization information associated with the user that is relevant to the information retrieval task is retrieved. The personalization information associated with the user includes information associated with at least one of a genotype of the user and a phenotype of the user. The method includes modifying the result information based on the retrieved personalization information to generate personalized result information. The personalized result information is transmitted to the computing device associated with the user | 12-22-2011 |
20120158783 | LARGE-SCALE EVENT EVALUATION USING REALTIME PROCESSORS - Large-scale event processing systems are often designed to perform data mining operations by storing a large set of events in a massive database, applying complex queries to the records of the events, and generating reports and notifications. However, because such queries are performed on very large data sets, the processing of the queries often introduces a significant delay between the occurrence of the events and the reporting or notification thereof. Instead, a large-scale event processing system may be devised as a large state machine organized according to an evaluation plan, comprising a graph of event processors that, in realtime, evaluate each event in an event stream to update an internal state of the event processor, and to perform responses when response conditions are met. The continuous monitoring and evaluation of the stream of events may therefore enable the event processing system to provide realtime responses and notifications of complex queries. | 06-21-2012 |
20120166447 | FILTERING QUERIED DATA ON DATA STORES - A data set may be distributed over many data stores, and a query may be distributively evaluated by several data stores with the results combined to form a query result (e.g., utilizing a MapReduce framework). However, such architectures may violate security principles by performing sophisticated processing, including the execution of arbitrary code, on the same machines that store the data. Instead of processing queries, a data store may be configured only to receive requests specifying one or more filtering criteria, and to provide the data items satisfying the filtering criteria. A compute node may apply a query by generating a request including one o more filter criteria, providing the request to a data node, and applying the remainder of the query (including sophisticated processing, and potentially the execution of arbitrary code) to the data items provided by the data node, thereby improving the security and efficiency of query processing. | 06-28-2012 |
20120238285 | Wireless Identifiers for Proximity Applications - A proximity matching system may use broadcast wireless identifiers transmitted by users' devices to match users with other nearby users. The identifiers may be collected by a plurality of agents, then the identifiers may be matched with pre-defined profiles to generate physically proximate users by a remote service. The group of proximate users may be provided to various applications and consumed with summarized properties or individual properties, depending on the approved privacy settings as selected by the users. In some embodiments, the broadcast wireless identifiers may be personal area network identifiers, local area network identifiers, cellular network identifiers, or other broadcast identifier. In some embodiments, the agents may not establish a peer to peer or other connection with the broadcasting device. The agents may be fixed or mobile agents, and the proximity of users may be generated through links between nearby agents in a meshed fashion. | 09-20-2012 |
20130066819 | ADAPTIVE RECOMMENDATION SYSTEM - A recommendation system for optimizing content recommendation lists is disclosed. The system dynamically tracks a list interaction history of a user, which details that user's interactions with a plurality of different lists presenting different recommended items to that user. The system automatically correlates one or more list preferences with that user based on the list interaction history, and builds a recommendation list with a plurality of candidate items having different recommendation confidences. The recommendation list is built such that each candidate item with a higher recommendation confidence is prioritized over each candidate item with a lower recommendation confidence according to the one or more list preferences correlated to that user. | 03-14-2013 |
20130325898 | LARGE-SCALE EVENT EVALUATION USING REALTIME PROCESSORS - Large-scale event processing systems are often designed to perform data mining operations by storing a large set of events in a massive database, applying complex queries to the records of the events, and generating reports and notifications. However, because such queries are performed on very large data sets, the processing of the queries often introduces a significant delay between the occurrence of the events and the reporting or notification thereof. Instead, a large-scale event processing system may be devised as a large state machine organized according to an evaluation plan, comprising a graph of event processors that, in realtime, evaluate each event in an event stream to update an internal state of the event processor, and to perform responses when response conditions are met. The continuous monitoring and evaluation of the stream of events may therefore enable the event processing system to provide realtime responses and notifications to complex queries. | 12-05-2013 |
20140129500 | Efficient Modeling System - A technique for efficiently factoring a matrix in a recommendation system. Usage data for a large set of users relative to a set of items is provided in a usage matrix R. To reduce computational requirements, the usage matrix is sampled to provide a reduced matrix R′. R′ is factored into a user matrix U′ and an item matrix V. User vectors in U′ and V are initialized and then iteratively updated to arrive at an optimal solution. The reduced matrix can be factored using the computational resources of a single computing device, for instance. Subsequently, the full user matrix U is obtained by fixing V and analytically minimizing an error in UV=R+error. The computations of this analytic solution can be divided among a set of computing devices, such as by using a map and reduce technique. Each computing device solves the equation for different respective subset of users. | 05-08-2014 |
20150073932 | Strength Based Modeling For Recommendation System - Example apparatus and methods provide a recommendation to a user about a product they may wish to consider purchasing. One method produces a single indication concerning a relationship between a user and an item with which the user has interacted. The single indication identifies whether the user likes the item and the degree to which the user likes the item. The single indication is independent of user signals processed to compute the single indication. The single indication is produced by a signal deriver that is loosely coupled to a model of users and items. The model may be a matrix upon which matrix factorization can be performed. Although matrix factorization is performed, it is performed on vectors whose elements are independent of the signals processed by the signal deriver. Since users may have different preferences at different times, the degree to which the user likes the item may be manipulated. | 03-12-2015 |
Patent application number | Description | Published |
20100067908 | Enhanced Passive Optical Network (PON) Processor - A method for processing data flows of a plurality of passive optical network (PON) operating modes, the method is performed by an optical network unit (ONU). The method comprises processing upstream data flows of said plurality of PON operating modes; and processing downstream data flows of the plurality of PON operating modes. The plurality of PON operating modes include at least a Gigabit PON (GPON) mode, a broadband PON (BPON) mode, and an Ethernet PON (EPON). | 03-18-2010 |
20110318002 | PASSIVE OPTICAL NETWORK PROCESSOR WITH A PROGRAMMABLE DATA PATH - A passive optical network (PON) processor comprises a packet processor for processing packets belonging to a certain flow through a plurality of processing stages of a programmable data-path; a microprocessor-data for performing one or more user-defined functions in the programmable data-path on designated packets belonging to the certain flow, wherein packets of respective flows to be processed by the microprocessor-data are designated in a flow table; a microprocessor-control for managing connections handled by the PON processor; a data-path bus for connecting the packet processor and the microprocessor-data, wherein the designated packets are transferred between the packet processor and the microprocessor-data on the data-path bus; and a control-path bus for connecting the packet processor and the microprocessor-control. | 12-29-2011 |
20120307949 | Burst Mode Clock and Data Recovery Circuit and Method - Burst mode clock and data recovery (BCDR) circuit and method capable of fast data recovery of passive optical network (PON) traffic. An over-sampled data stream is generated from an input burst data signal and a phase interpolator generates sampling clock signals using a reference clock and phase information. A phase estimation unit (PEU) determines a phase error in the over-sampled data streams; and a phase retrieval unit sets the phase interpolator with the respective phase information of the input burst data signal prior to reception of the input burst data signal. | 12-06-2012 |
20130195457 | METHOD AND SYSTEM FOR PERFORMING DISTRIBUTED DEEP-PACKET INSPECTION - A method for deep-packet inspection of packets flowing through an end unit in a point-to-multipoint network. The method comprises classifying packet flows through the end unit using their flow-identification (ID) to determine which of the packet flows should be deep-packet inspected, wherein the packet flows include incoming packets received from a central unit and outgoing packets sent to the central unit of the point-to-multipoint network; duplicating packets determined to be deep-packet inspected; saving all duplicated packets in a memory; upon collection of a predefined number of duplicated packets belonging to a certain flow-ID, performing deep-packet processing based on at least one deep-packet inspection application; and saving the deep-packet processing results in the memory. | 08-01-2013 |
20130209104 | Passive Optical Network Processor with a Programmable Data Path - A method and apparatus embodying some aspects of a packet processing communication system. The packet processing communication apparatus comprises a packet processor and a microprocessor. The packet processor is configured to process packets belonging to a certain flow through a plurality of processing stages of a programmable data-path. The microprocessor is in communication with the packet processor and is configured to process a user-defined function in the programmable data-path on designated packets belonging to the certain flow. The packets of respective flows to be processed by the microprocessor are designated in a mapping. The designated packets processed by the microprocessor are returned to one of the processing stages of the packet processor for further processing. | 08-15-2013 |