Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Chung, WA
Ben Chung, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100070877 | SEAMLESS CONVERSION OF ORDINARY EMAIL DATA INTO CALENDAR DATA - The claimed subject matter is directed to the conversion of ordinary email data into calendar data. Specifically, the claimed subject matter provides a method and system of an electronic communication message system that performs the creation of calendar events in a personal calendar application from electronic communication text. One embodiment of the claimed subject matter is implemented as a method for creating an electronic calendar event from a selected portion of text from electronic communication message. An electronic communication message is displayed to a user. A user selected portion of the text comprising the electronic communication message is received as input. A scheduling composition dialog is actuated based on the user selected portion, and a calendar event is created in a personal calendar application for the selected portion of the electronic communication message. | 03-18-2010 |
Charlie Chung, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090320109 | SIGNED EPHEMERAL EMAIL ADDRESSES - Architecture for generating a temporary account (e.g., an email address) with a user-supplied friendly name and a secret used to the sign the temporary account. For example, when a user wishes to create a temporary email address to use with an online organization, a friendly name is provided and the system generates a temporary email address including the friendly name. A signing component signs the temporary email address with a secret. One or more of these secrets can be provisioned prior to the user's creation of a friendly name, which eliminates propagation delay. During use, only incoming email messages having the temporary email address signed with the secret are validated. When the user revokes the temporary email address, the secret is revoked and the revocation is propagated to network gateways, rejecting any email sent to that address. | 12-24-2009 |
Charlie R. Chung, Tacoma, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100318613 | SOCIAL GRAPHING FOR DATA HANDLING AND DELIVERY - Architecture that enables data handling according to types of social relationships. A social graph is used to categorize the types of the social relationships of the tagged messaging users. The social graph can include social relationship categories for friends, family, coworkers, and blocked individuals of the recipient, for example. The social graph can also include metadata related to the tagged users. The metadata defines the social relationship of the tagged users to the recipient. Delivery of messages to the recipient from the tagged messaging users is managed based on the social graph. Delivery management can include blocking messages, allowing the messages through, or delivering the messages with high or low priority, for example. Email messages can be delivered to respective email locations based on the social graph. User information can be imported and/or mined from external sources to augment the social graph. | 12-16-2010 |
Eunkyung Chung, Kirkland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090077115 | MEDIA PLAN MANAGING - Apparatus, system and methods for a media plan managing interface are disclosed. A data hierarchy for a media plan is defined. The multilevel data hierarchy includes different levels for orders and placements. An input form is provided to receive modifications to the values in the different levels of the hierarchy. Any modifications of data are compared against the permitted inputs provided through a conditional input field. If the modifications are permitted inputs, then they are accepted and conditional input fields are set up for any subsequent data input. The data hierarchy is stored as a media plan. | 03-19-2009 |
Hakjae Robert Chung, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100153482 | Cloud-Based Automation of Resources - In an example embodiment, workflow based procedures are authored, tested and converted to a collection of resource automation scripts with orchestration rules. The scripts and rules are uploaded to a cloud-based provisioning service. The cloud-based provisioning service follows the orchestration rules to coordinate with a provisioning agent installed on a VM host, storage area network (SAN) or other network device to execute a sequence of scripts to provision or tear down resources. | 06-17-2010 |
Jae-Hyun Chung, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090111117 | DEVICE AND METHOD FOR DETECTING COMPLEX FORMATION - The present invention provides devices and methods for measuring electrically detectable bulk properties of liquid samples. Representative electrically detectable bulk properties measurable by the devices and methods of the invention include resistivity (conductivity) and dielectric constant (permittivity). The electrically detectable bulk properties are determined by comparing the experimental electrical output of the devices with mathematically simulated models of the experimental devices. | 04-30-2009 |
| 20090301883 | METHOD AND SYSTEM FOR CONCENTRATING PARTICLES FROM A SOLUTION - Methods and systems are provided for concentrating particles (e.g., bacteria, viruses, cells, and nucleic acids) suspended in a liquid. Electric-field-induced forces urge the particles towards a first electrode immersed in the liquid. When the particles are in close proximity to (e.g., in contact with) the first electrode, the electrode is withdrawn from the liquid and capillary forces formed between the withdrawing electrode and the surface of the liquid immobilize the particles on the electrode. Upon withdrawal of the electrode from the liquid, the portion of the electrode previously immersed in the liquid has particles immobilized on its surface. | 12-10-2009 |
| 20110151190 | SHADOW EDGE LITHOGRAPHY FOR NANOSCALE PATTERNING AND MANUFACTURING - An advanced high-resolution and high-throughput shadow edge ( | 06-23-2011 |
Jaewoong Chung, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100205408 | Speculative Region: Hardware Support for Selective Transactional Memory Access Annotation Using Instruction Prefix - A computer system and method is disclosed for executing selectively annotated transactional regions. The system is configured to determine whether an instruction within a plurality of instructions in a transactional region includes a given prefix. The prefix indicates that one or more memory operations performed by the processor to complete the instruction are to be executed as part of an atomic transaction. The atomic transaction can include one or more other memory operations performed by the processor to complete one or more others of the plurality of instructions in the transactional region. | 08-12-2010 |
| 20110040906 | Multi-level Buffering of Transactional Data - An apparatus, method, and system for implementing a hardware transactional memory (HTM) system with multiple levels of transactional buffers. The apparatus comprises a data cache configured to buffer data in a shared (by a plurality of processing cores) memory accessed by speculative memory access operations and to retain the data during at least a portion of an attempt to execute the atomic memory transaction. The apparatus also comprises an overflow detection circuit configured to detect an overflow condition upon determining that the data cache has insufficient capacity to buffer a portion of data accessed as part of the atomic memory transaction, as well as a buffering circuit configured to respond to the detection of the overflow condition by preventing the portion of data from being buffered in the data cache and buffering the portion of data in a secondary buffer separate from the data cache. | 02-17-2011 |
| 20110040913 | USER-LEVEL INTERRUPT MECHANISM FOR MULTI-CORE ARCHITECTURES - A method includes accepting for a first processor core of a plurality of processor cores in a multi-core system, a user-level interrupt indicated by a user-level interrupt message when an interrupt domain of an application thread executing on the first processor core and a recipient identifier of the application thread executing on the first processor core match corresponding fields in the user-level interrupt message. | 02-17-2011 |
| 20110040914 | MECHANISM FOR RECORDING UNDELIVERABLE USER-LEVEL INTERRUPTS - A method includes recording a user-level interrupt as undeliverable in a mailbox at least partially based on an interrupt domain identifier and an interrupt recipient identifier included in a user-level interrupt message associated with the user-level interrupt. The recording is at least partially based on an indication that the user-level interrupt is undeliverable to a recipient application thread executing on a processor core of a plurality of processor cores in a multi-core system. | 02-17-2011 |
| 20110040915 | FLEXIBLE NOTIFICATION MECHANISM FOR USER-LEVEL INTERRUPTS - A method includes delivering a user-level interrupt message indicative of a user-level interrupt to one or more recipients according to a user-level interrupt delivery configuration selected from a plurality of user-level interrupt delivery configurations. The one or more recipients correspond to one or more application threads executing on one or more processor cores of a plurality of processor cores in a multi-core system. A method includes generating an indicator of a user-level interrupt being undeliverable to one or more intended recipients of a user-level interrupt message according to a failed delivery notification mode configuration. The user-level interrupt may be issued by an application thread executing on a first processor core of a plurality of processor cores in a multi-core system. | 02-17-2011 |
| 20110208921 | INVERTED DEFAULT SEMANTICS FOR IN-SPECULATIVE-REGION MEMORY ACCESSES - A method for accessing memory by a first processor of a plurality of processors in a multi-processor system includes, responsive to a memory access instruction within a speculative region of a program, accessing contents of a memory location using a transactional memory access to the memory access instruction unless the memory access instruction indicates a non-transactional memory access. The method may include accessing contents of the memory location using a non-transactional memory access by the first processor according to the memory access instruction responsive to the instruction not being in the speculative region of the program. The method may include updating contents of the memory location responsive to the speculative region of the program executing successfully and the memory access instruction not being annotated to be a non-transactional memory access. | 08-25-2011 |
| 20110209151 | AUTOMATIC SUSPEND AND RESUME IN HARDWARE TRANSACTIONAL MEMORY - An apparatus and method is disclosed for a computer processor configured to access a memory shared by a plurality of processing cores and to execute a plurality of memory access operations in a transactional mode as a single atomic transaction and to suspend the transactional mode in response to determining an implicit suspend condition, such as a program control transfer. As part of executing the transaction, the processor marks data accessed by the speculative memory access operations as being speculative data. In response to determining a suspend condition (including by detecting a control transfer in an executing thread) the processor suspends the transactional mode of execution, which includes setting a suspend flag and suspending marking speculative data. If the processor later detects a resumption condition (e.g., a return control transfer corresponding to a return from the control transfer), the processor is configured to resume the marking of speculative data. | 08-25-2011 |
| 20110276972 | MEMORY-CONTROLLER-PARALLELISM-AWARE SCHEDULING FOR MULTIPLE MEMORY CONTROLLERS - Some embodiments of a processing system implement a memory-controller-parallelism-aware scheduling technique. In at least one embodiment of the invention, a method of operating a processing system includes scheduling a memory request requested by a thread of a plurality of threads executing on at least one processor according to thread priority information associated with the plurality of threads. The thread priority information is based on a maximum of a plurality of local memory bandwidth usage indicators for each thread of the plurality of threads. Each of the plurality of local memory bandwidth usage indicators for each thread corresponds to a respective memory controller of a plurality of memory controllers. | 11-10-2011 |
| 20110276973 | METHOD AND APPARATUS FOR SCHEDULING FOR MULTIPLE MEMORY CONTROLLERS - In at least one embodiment, a method includes locally scheduling a memory request requested by a thread of a plurality of threads executing on at least one processor. The memory request is locally scheduled according to a quality-of-service priority of the thread. The quality-of-service priority of the thread is based on a quality of service indicator for the thread and system-wide memory bandwidth usage information for the thread. In at least one embodiment, the method includes determining the system-wide memory bandwidth usage information for the thread based on local memory bandwidth usage information associated with the thread periodically collected from a plurality of memory controllers during a timeframe. In at least one embodiment, the method includes at each mini-timeframe of the timeframe accumulating the system-wide memory bandwidth usage information for the thread and updating the quality-of-service priority based on the accumulated system-wide memory bandwidth usage information for the thread. | 11-10-2011 |
| 20110276974 | SCHEDULING FOR MULTIPLE MEMORY CONTROLLERS - Some embodiments of a multi processor system implement a virtual-time-based quality-of-service scheduling technique. In at least one embodiment of the invention, a method includes scheduling a memory request to a memory from a memory request queue in response to expiration of a virtual finish time of the memory request. The virtual finish time is based on a share of system memory bandwidth associated with the memory request. The method includes scheduling the memory request to the memory from the memory request queue before the expiration of the virtual finish time of the memory request if a virtual finish time of each other memory request in the memory request queue has not expired and based on at least one other scheduling rule. | 11-10-2011 |
| 20110302586 | MULTITHREAD APPLICATION-AWARE MEMORY SCHEDULING SCHEME FOR MULTI-CORE PROCESSORS - A device may include a memory controller that identifies a multithread application, and adjusts a memory scheduling scheme for the multithread application based on the identification of the multithread application. | 12-08-2011 |
| 20110307689 | PROCESSOR SUPPORT FOR HARDWARE TRANSACTIONAL MEMORY - A processing core of a plurality of processing cores is configured to execute a speculative region of code as a single atomic memory transaction with respect one or more others of the plurality of processing cores. In response to determining an abort condition for an issued one of the plurality of program instructions and in response to determining that the issued program instruction is not part of a mispredicted execution path, the processing core is configured to abort an attempt to execute the speculative region of code. | 12-15-2011 |
| 20120036512 | ENHANCED SHORTEST-JOB-FIRST MEMORY REQUEST SCHEDULING - In at least one embodiment of the invention, a method includes scheduling a memory request associated with a thread executing on a processing system. The scheduling is based on a job length of the thread and a priority step function of job length. The thread is one of a plurality of threads executing on the processing system. In at least one embodiment of the method, the priority step function is a function of ┌x/2n┐ for x<=m and P(x)=m/2 | 02-09-2012 |
Kenneth Chung, Bellevue, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110029141 | Method for integrating individual load forecasts into a composite load forecast to present a comprehensive synchronized and harmonized load forecast - A method is provided for merging different load forecasts for power grid centers. Area load forecasts are accepted from load forecast engines. A relational database saves load forecast engine data. A comprehensive operating plan integrates individual load forecasts into a composite load forecast to present a comprehensive, synchronized and harmonized load forecast. | 02-03-2011 |
| 20110035071 | System tools for integrating individual load forecasts into a composite load forecast to present a comprehensive synchronized and harmonized load forecast - A system tool merges different load forecasts for power grid centers. A plurality of load forecast engines are coupled to a load forecast interface and a relational data base that saves load forecast engine data as an input through the load forecast interface. A comprehensive operating plan is coupled to the load forecast engines and the relational database. The comprehensive operating plan is configured to integrate individual load forecasts into a composite load forecast to present a comprehensive, synchronized and harmonized load forecast. A program interface provides access to the composite load forecasting schedule. | 02-10-2011 |
Richard Chung, Bothell, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090210454 | FILE SYSTEM WATCHER IN THE PRESENCE OF DIFFERENT FILE SYSTEMS - The claimed subject matter is directed to a file system watcher in the presence of different file systems to allow synchronization of replicated files distributed among different file systems without compromising the features of each file system. To synchronize the distributed replications, a platform independent synchronization manager creates a file system watcher for each file system associated with a replication of the file. The file system watcher monitors each object for events affecting the object or the object's constituent files, such as creation, deletion, change and rename. Notifications are sent to the synchronization manager, which consolidates the modifications and updates a locally stored replication, if necessary. The synchronization manager then sends a notification of an update to all other synchronization managers for all replications of the distributed file or folder. Synchronization is complete when the nonconforming synchronization managers acquire a replication of the locally stored replication and update their respective objects to conform therewith. | 08-20-2009 |
Richard Y. Chung, Bothell, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090248693 | MANAGING DATA TRANSFER BETWEEN ENDPOINTS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A file fetcher manager provides commonly-utilized management and resource allocation for multiple file fetchers that each implement a different type of mechanism or protocol for transferring data files between peer endpoints in meshes associated with a cloud-computing service. Each file fetcher is configured with both client-side and server-side components to retrieve and serve out data files. The file fetcher manager encapsulates the file fetchers to provide an abstract interface to callers while hiding the underlying details of the file fetchers. The file fetcher manager is arranged for managing simultaneous operations of the multiple file fetchers to route requests from the callers to the appropriate file fetchers, and for scheduling work items for the file fetchers so that data transfers efficiently utilize available resources while keeping the entire transfer process coherent and organized. | 10-01-2009 |
| 20090300169 | SYNCHRONIZATION THROTTLING BASED ON USER ACTIVITY - Synchronization of data across multiple endpoints in a mesh network that supports a data sharing service is throttled responsively to user activity in the network by monitoring the activity using a component in a mesh operating environment (“MOE”) runtime that is instantiated on each endpoint. The monitoring may include the collection of data that can be used to infer user activity, as well as data that explicitly indicates activity. State information is maintained so that data can be synchronized across the endpoints even when a user goes offline from the service. When the user logs on to the service, makes changes to a shared file, or the endpoint device starts up upon connection to a mesh network, throttling is performed by prioritizing work items associated with synchronization operations so that resources on the endpoint are not excessively consumed which could reduce the quality of the user experience. | 12-03-2009 |
| 20110295929 | Optimistic Concurrency Utilizing Distributed Constraint Enforcement - Optimistic concurrency is effectuated to manage constraints in a synchronization environment at multiple computing device endpoints in a consistent fashion without utilizing concentrated centralized constraint logic. Implemented data synchronization constraints that identify false violation scenarios may be automatically resolved without user intervention by using an etag system directed by a master component to assist computing device endpoints to maintain data synchronization among them. Data entries defining each file hierarchy component to be synched are generated and shared with the master component and each computing device endpoint in a synchronization environment. Individual computing device endpoints can use the data entries generated locally with those generated by other computing device endpoints to locally resolve identified false violation scenarios. | 12-01-2011 |
Richard Yiu-Sai Chung, Bothell, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20080317068 | SERVER-ASSISTED AND PEER-TO-PEER SYNCHRONIZATION - Systems and methods for synchronizing data between endpoints using elements of centralized and decentralized synchronization systems and communication topologies are disclosed. Such systems and methods may in some cases synchronize some subset of data with a centralized endpoint while another subset of data is synchronized in a decentralized fashion directly with other endpoints. Such systems and methods may include a variety of cooperative functionality to assist in the synchronization of data between endpoints. | 12-25-2008 |
| 20080320055 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 12-25-2008 |
| 20100082534 | Method and System of Managing Conflicts for a Set of Synchronized Folders - Generally, the described system and process enables resolution of conflicts in a synchronized folder. Within the described mesh operating environment, each of the devices may be configured to do the same processing so that the file system view of the synchronized folder looks the same on all devices (pending local capabilities). Updates that cannot be immediately realized to the local store due to conflicts may be deferred for later attempts when, for example, additional updates at the system level or local level are made to resolve or eliminate the conflict for the update item. Generally, further changes may be propagated by a user in addressing a particular conflict that the user is notified about (e.g., via a selected winner that the user disagrees with). Alternatively, the conflict may resolve itself when a further update occurs that overrides or renders moot the previous update (e.g., a deleted item having a modified enclosure, where the enclosure had a previous concurrency conflict). | 04-01-2010 |
| 20110035355 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 02-10-2011 |
| 20110173157 | Bi-Directional Data Modification With Synchronization - Systems and methods for synchronizing data between endpoints, including the modification of data on an endpoint without necessarily modifying data that is communicated between endpoints are disclosed. In such systems and methods the representation of data on an endpoint may be modified so that constraints on that particular endpoint are enforced, without requiring a similar or the same modification to the data when it is synchronized to other endpoints. | 07-14-2011 |
Samuel Chung, Kirkland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100299170 | Stages, Phases in a Project Workflow - A method is presented for creating a life cycle workflow for a project on a server computer. One or more workflow phases are created on the server computer. Each workflow phase corresponds to a plurality of workflow stages for the project. One or more workflow stages are created on the server computer. Each workflow stage corresponds to a specific sequence of workflow activities. One or more project detail pages are created on the server computer. Each project detail page is a web page that is made visible during the workflow stage. When a workflow stage is created, a workflow phase is selected to be associated with the workflow stage and one or more project detail pages are selected for the workflow stage. | 11-25-2010 |
Samuel Y. Chung, Kirkland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100306007 | ENTERPRISE PROJECT TYPES - A selection of an enterprise project type is received from a plurality of enterprise project types. The enterprise project type may include a plurality of pages. Each page may include a plurality of input fields for collecting values of properties. A project page from the enterprise project type is displayed. The project page may include a create project interface element. When a selection of the create project interface element is received, an instance of the enterprise project type is generated. The instance of the enterprise project type represents an entity, such as a project plan, an application plan, or a product plan. The pages are displayed. The values of properties are collected through the pages. The entity is generated by transforming the values of properties into the entity. | 12-02-2010 |
Wing-Hei Wilkins Chung, Bothell, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20120060103 | SYSTEMS AND METHODS TO SUPPORT REAL-TIME INTEGRATED MOBILE COMMUNICATION FOR SOCIAL APPLICATIONS - The invention provides for systems and methods for displaying integrated communication regions on a mobile device. The integrated communication regions can be persistent across screens within an application and across multiple applications. The persistent integrated communication regions can display announcements, messages, and broadcasts on a plurality of devices. The persistent nature of the communication regions can increase the impressions of the announcement, message, or broadcast. | 03-08-2012 |
Wonzoo Chung, Kent, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20080232454 | DECISION FEEDBACK EQUALIZATION WITH FRACTIONALLY-SPACED FEEDBACK DATA - A decision feedback equalizer (DFE) architecture uses feedback samples that are over-sampled with respect to the symbol rate. On-baud feedback samples are quantized with a slicer, while off-baud samples are linear, IIR samples. Both forward and feedback filters are fractionally-spaced, but adapted only at the baud instances. | 09-25-2008 |
| 20100061488 | JOINT, ADAPTIVE CONTROL OF EQUALIZATION, SYNCHRONIZATION, AND GAIN IN A DIGITAL COMMUNICATIONS RECEIVER - Various aspects and embodiments of the present invention derive statistics of received signal quality and use these statistics to jointly control operation of timing recovery, carrier recovery, automatic gain control, and equalization functions. | 03-11-2010 |
Wook Chung, Kirkland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110258039 | EVALUATING PREFERENCES OF USERS ENGAGING WITH ADVERTISEMENTS - Embodiments of the present invention relate to systems, methods, and computer-storage media for providing a method of evaluating preferences of particular users with respect to engaging with advertisements. In one embodiment, advertisements are delivered to users based on user engagement with advertisements. In particular, a request is received from an advertiser to present an advertisement to a set of users meeting a threshold user engagement level. After evaluating user engagement levels of the set of users, a subset of the set of users meeting the threshold user engagement level is determined. The advertisement is then presented to the subset of users. | 10-20-2011 |
| 20110270686 | ONLINE PLATFORM FOR WEB ADVERTISEMENT PARTNERSHIPS - Embodiments of the present invention relate creating online advertising co-campaigns between multiple web advertisers. Users affiliated with different entities looking to advertise online can easily submit requests to form the co-campaigns. The partner advertisers the users request to form co-campaigns with can then be messaged and asked whether the partner advertisers will agree to the online advertising partnership. A co-campaign will be created and managed if the partner advertisers agree to take part in the co-campaign. Co-campaigns are possible for online one-to-one, many-to-one, and many-to-many advertising partnerships online. | 11-03-2011 |
| 20110288928 | ONLINE PLATFORM FOR WEB ADVERTISEMENT COMPETITION - Embodiments discussed herein relate to creating and managing competitive campaigns for advertisement spaces on a web page. Competitive campaigns may take several forms, including boosting bids for advertisements to try an match the competitor's advertisement bids in an online auction, dynamically replacing the entity's advertisement being shown, or out-and-out refusing to show an advertisement whenever the competitor's advertisement is also shown. | 11-24-2011 |
| 20110313846 | INCLUDING PERSONALIZED CONTENT IN AN ADVERTISEMENT | 12-22-2011 |
Wook Jin Chung, Kirkland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100185687 | SELECTING ADVERTISEMENTS - An advertisement management system, a computer-implemented method, and computer readable media to select advertisements are provided. The advertisement management system includes a keyword component, a targeting component, and a merging component. The keyword component generates a lists of advertisements based on keywords provided by the advertisers. The targeting component, executing in parallel with the keyword component, generates another list of advertisements based on targeting data provided by the advertisers. The merging component combines the list of advertisements generated by the keyword component and targeting component based on relevance to user search terms received by the advertisement management system or revenue that the advertisement is able to generate for the advertiser, publisher, or advertisement management system. | 07-22-2010 |
Wook Jin Chung, Krikland, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100241498 | DYNAMIC ADVERTISING PLATFORM - Computer-readable media and computer systems for managing an ad campaign based on foreseeable, but not necessarily certain future events. An advertiser can configure a campaign trigger definition corresponding to an advertising campaign such that upon occurrence of a trigger event defined therein, an operation is performed corresponding to the campaign. A crawler references the campaign trigger definition and identifies information sources from which to retrieve information about a specified trigger event. Upon retrieving event information, an analysis module determines whether the information indicates an occurrence of the trigger event. Incident to identifying an occurrence of a trigger event, an ad campaign can be initiated or modified. | 09-23-2010 |
Yuan-Chou Chung, Sammamish, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100265183 | STATE CHANGES FOR AN ADAPTIVE DEVICE - Various embodiments of systems and method to implement a state change for an adaptive device are provided. In one example, a method is disclosed that includes receiving a system state input indicating a change in a system state of a computing device, changing adaptive device data in response to the system state input to form changed adaptive device data, the adaptive device data and the changed adaptive device data each including one or more of image data and adaptive device mapping data, and adjusting an adaptive device display state using the changed adaptive device data, wherein adjusting the adaptive device display state includes one or more of displaying the image data on the keyboard display and adjusting an adaptive device mapping state according to the adaptive device mapping data. | 10-21-2010 |