| Patent application number | Description | Published |
|---|
| 20080307173 | Efficient Encoding for Detecting Load Dependency on Store with Misalignment - In one embodiment, an apparatus comprises a queue comprising a plurality of entries and a control unit coupled to the queue. The control unit is configured to allocate a first queue entry to a store memory operation, and is configured to write a first even offset, a first even mask, a first odd offset, and a first odd mask corresponding to the store memory operation to the first entry. A group of contiguous memory locations are logically divided into alternately-addressed even and odd byte ranges. A given store memory operation writes at most one even byte range and one adjacent odd byte range. The first even offset identifies a first even byte range that is potentially written by the store memory operation, and the first odd offset identifies a first odd byte range that is potentially written by the store memory operation. The first even mask identifies bytes within the first even byte range that are written by the store memory operation, and wherein the first odd mask identifies bytes within the first odd byte range that are written by the store memory operation. | 12-11-2008 |
| 20100169619 | Efficient Encoding for Detecting Load Dependency on Store with Misalignment - In one embodiment, an apparatus comprises a queue comprising a plurality of entries and a control unit coupled to the queue. The control unit is configured to allocate a first queue entry to a store memory operation, and is configured to write a first even offset, a first even mask, a first odd offset, and a first odd mask corresponding to the store memory operation to the first entry. A group of contiguous memory locations are logically divided into alternately-addressed even and odd byte ranges. A given store memory operation writes at most one even byte range and one adjacent odd byte range. The first even offset identifies a first even byte range that is potentially written by the store memory operation, and the first odd offset identifies a first odd byte range that is potentially written by the store memory operation. The first even mask identifies bytes within the first even byte range that are written by the store memory operation, and wherein the first odd mask identifies bytes within the first odd byte range that are written by the store memory operation. | 07-01-2010 |
| Patent application number | Description | Published |
|---|
| 20100027543 | LAYER TWO MAC FLUSHING/RE-ROUTING - A method may include receiving a packet including a destination address, identifying a destination address entry based on the destination address, the destination address entry including an address identifier, comparing the address identifier to an event identifier, determining whether an event occurred based on the comparison, and forwarding the packet on an alternate path if it is determined that the event occurred. | 02-04-2010 |
| 20100165995 | ROUTING FRAMES IN A COMPUTER NETWORK USING BRIDGE IDENTIFIERS - Methods, apparatus, and products for routing frames in a network using bridge identifiers, wherein the network includes a plurality of bridge nodes. At least one of the bridge nodes operates as an ingress bridge node through which frames are received into the network. At least one of the bridge nodes operates as an egress bridge node through which frames are transmitted out of the network. One of the bridge nodes receives, from the ingress bridge node, a frame for transmission to a destination node. The destination node connects to the network through the egress bridge node. The frame includes an ingress bridge identifier and an egress bridge identifier. The bridge that received the frame then routes the frame to the egress bridge node through which the destination node connects to the network in dependence upon the ingress bridge identifier and the egress bridge identifier included in the frame. | 07-01-2010 |
| 20100226381 | ROUTING FRAMES IN A TRILL NETWORK USING SERVICE VLAN IDENTIFIERS - Methods, apparatus, and products are disclosed for routing frames in a TRILL network using service VLAN identifiers by: receiving a frame from an ingress bridge node for transmission through the TRILL network to a destination node that connects to the TRILL network through an egress node, the received frame including a customer VLAN identifier, a service VLAN identifier uniquely assigned to the ingress bridge node, and a destination node address for the destination node, the received frame not having mac-in-mac encapsulation; adding, in dependence upon the service VLAN identifier and the destination node address, a TRILL header conforming to the TRILL protocol, the TRILL header including an ingress bridge nickname and an egress bridge nickname; and routing, to the egress bridge node through which the destination node connects to the network, the frame in dependence upon the ingress bridge nickname and the egress bridge nickname. | 09-09-2010 |
| 20100309912 | FORWARDING FRAMES IN A COMPUTER NETWORK USING SHORTEST PATH BRIDGING - Methods, apparatus, and products are disclosed for forwarding frames in a computer network using shortest path bridging (‘SPB’). The network includes multiple bridges, and each edge bridge is assigned a unique service virtual local area network (‘VLAN’) identifier. One of the bridges receives a frame for transmission to a destination node. The received frame includes a service VLAN identifier for the ingress bridge through which the frame entered the network and a customer VLAN identifier. The one bridge identifies an SPB forwarding tree in dependence upon the service VLAN identifier. The SPB forwarding tree specifies a shortest route in the network from the ingress bridge through the one bridge to the other bridges in the network. The one bridge then forwards the received frame to the egress bridge without MAC-in-MAC encapsulation in dependence upon the SPB forwarding tree and the customer VLAN identifier. | 12-09-2010 |
| 20110019678 | ROUTING FRAMES IN A SHORTEST PATH COMPUTER NETWORK FOR A MULTI-HOMED LEGACY BRIDGE NODE - Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname. | 01-27-2011 |
| Patent application number | Description | Published |
|---|
| 20080306969 | METHOD AND SYSTEM FOR IMPROVING APPLICATIONS BASED ON LOCATION INFORMATION OF OBJECTS - Disclosed is a system for improving applications based on location information of objects. The system includes a receiver module configured to receive the location information of the objects from at least one location database in a communication network. The objects are associated with corresponding location-aware devices. Each location-aware device of the location-aware devices includes the location information of at least one object of the objects. Further, a processing module included in the system is configured to generate at least one of behavioral and trending information of the objects and vehicular traffic information based on the location information of the objects. Furthermore, a transmitter module included in the system is configured to transmit at least one of the behavioral and trending information of the objects and the vehicular traffic information to at least one information database through the communication network. A method and a computer program product are also disclosed. | 12-11-2008 |
| 20100004997 | METHODS AND APPARATUS FOR GENERATING USER PROFILE BASED ON PERIODIC LOCATION FIXES - Implementations relate to systems and methods for generating a user profile based on periodic location fixes. A cellular telephone or other mobile device captures location information via GPS or other capability. A location history can be generated from accumulated location fixes. The location history is then analyzed to detect the user's travel and dwell patterns. That information can be combined with business classification (e.g., SIC, etc.) or Point of Interest (POI) databases to identify a user's likely home, work, or other locations based on dwell-times, time of day, and other parameters. The user's age and gender can potentially be inferred based on types of locations visited, such as school locations. The user profile can be correlated with market segmentation databases to generate a marketing rating, such as a Nielsen or Claritas rating. Advertising, media, or other content can then be tailored to the user's individual location and demographic profiles. | 01-07-2010 |
| 20100076968 | METHOD AND APPARATUS FOR AGGREGATING AND PRESENTING DATA ASSOCIATED WITH GEOGRAPHIC LOCATIONS - Implementations relate to systems and methods for aggregating and presenting data related to geographic locations. Geotag data related to geographic locations and associated features or attributes can be collected to build a regional profile characterizing a set of locations within the region. Geotag data related to the constituent locations, such as user ratings or popularity ranks for restaurants, shops, parks, or other features, sites, or attractions, can be combined to generate a profile of characteristics of locations in the region. The platform can generate recommendations of locations to transmit to the user of a mobile device, based for instance on the location of the device in the region as reported by GPS or other location service and the regional profile. Geotag data can include audio data analyzed using region-specific terms, and user recommendations can be presented via dynamic menus based on regional profiles, user preferences or other criteria. | 03-25-2010 |
| 20110034178 | SYSTEMS AND METHODS FOR GENERATING A LOCATION OF A MOBILE DEVICE USING CELL SECTOR INFORMATION - Systems and methods for generating a location of a mobile device using cell sector data are provided. A mobile device is in service connection with a base station, which has a corresponding service area. Upon entering the service area of another base station, the mobile device enters service connection with the second base station in a handoff event. The mobile device and/or the base station determines the location of each of the base stations, and estimates the approximate location of the mobile device based on the locations of the base stations. In one or more implementations, the estimated position can comprise a midpoint of a line joining the two base stations. The systems and methods can be implemented with a random location generator to improve accuracy. The approximate location of the mobile device can be inputted into a GPS-enabled device to reduce times to first fix. | 02-10-2011 |
| Patent application number | Description | Published |
|---|
| 20100111066 | SYSTEM AND METHOD FOR VARIABLE BEACON TIMING WITH WIRELESS DEVICES - Systems and methods for supporting variable beacon timing for a first wireless device and a second wireless device are provided. An exemplary system may include a number of wireless devices configured to wirelessly communicate with one another. The system includes a beacon-transmitting wireless device and a listening wireless device. The beacon-transmitting wireless device is configured to transmit, during a first operating mode, wireless beacons separated in time by relatively long time intervals. The beacon-transmitting device is also configured to transmit, during a second operating mode, wireless beacons separated in time by relatively short time intervals. The listening wireless device is configured to listen, during the first operating mode, for wireless beacons transmitted by the beacon-transmitting wireless device, and is configured to listen, during the second operating mode, for wireless beacons transmitted by the beacon-transmitting wireless device. The system may have more than two different operating modes, which may be desirable if the number of wireless devices in the system exceeds two. | 05-06-2010 |
| 20100201196 | METHOD AND APPARATUS FOR PREDICTING END OF BATTERY LIFE - A powering subassembly for a portable electronic device includes a main battery, a converter, a backup battery, and a controller. The main battery provides a main voltage and the backup battery can provide a backup voltage. The converter receives the main voltage and increases the main voltage to at least one operating voltage. The controller receives the operating voltage from the converter, monitors the voltage of the main battery, and compares the monitored main battery voltage to a main battery low voltage threshold. The controller transmits a disconnect signal to decouple the main battery from the converter if the monitored voltage from the main battery is less than the main battery low voltage threshold. The controller transmits a connection signal to couple the backup battery to the converter if the monitored voltage is less than the main battery low voltage threshold. The backup battery provides the power for a predetermined minimum amount of time. | 08-12-2010 |
| 20110110281 | BROADCAST DATA TRANSMISSION AND DATA PACKET REPEATING TECHNIQUES FOR A WIRELESS MEDICAL DEVICE NETWORK - A fluid infusion system as described herein includes a number of local “body network” devices, such as an infusion pump, a handheld monitor or controller, a physiological sensor, and a bedside or hospital monitor. The body network devices can be configured to support communication of status data, physiological information, alerts, control signals, and other information between one another. In addition, the body network devices can be configured to support networked communication of status data, physiological information, alerts, control signals, and other information between the body network devices and “external” devices, systems, or communication networks. The networked medical devices are configured to support a variety of wireless data communication protocols for efficient communication of data within the medical device network. In addition, the wireless medical devices may be configured to support a number of dynamically adjustable wireless data communication modes to react to current operating conditions, application-specific data content, or other criteria. | 05-12-2011 |
| 20110152970 | LOCATION-BASED RANKING AND SWITCHING OF WIRELESS CHANNELS IN A BODY AREA NETWORK OF MEDICAL DEVICES - Operating techniques and methodologies for a body area network of medical devices are provided. One technique relates to an intelligent channel hopping scheme that detects loss of wireless synchronization on an initial wireless channel, thereafter obtains a measure of quality for the initial wireless channel, and then selects a new wireless channel when the obtained measure of quality fails to satisfy a threshold criteria. Another operating technique dynamically adapts an ordered list of available wireless channels in accordance with a quality measure of the available wireless channels. Thus, when quality degradation associated with a first wireless channel is detected, the ordered list can be updated to indicate a lower preference for the first wireless channel and to indicate a higher preference for a second wireless channel that does not suffer from quality degradation. Another channel hopping or switching technique selects wireless channels in a manner that is influenced by the current geographic position of the medical device. | 06-23-2011 |
| Patent application number | Description | Published |
|---|
| 20100165995 | ROUTING FRAMES IN A COMPUTER NETWORK USING BRIDGE IDENTIFIERS - Methods, apparatus, and products for routing frames in a network using bridge identifiers, wherein the network includes a plurality of bridge nodes. At least one of the bridge nodes operates as an ingress bridge node through which frames are received into the network. At least one of the bridge nodes operates as an egress bridge node through which frames are transmitted out of the network. One of the bridge nodes receives, from the ingress bridge node, a frame for transmission to a destination node. The destination node connects to the network through the egress bridge node. The frame includes an ingress bridge identifier and an egress bridge identifier. The bridge that received the frame then routes the frame to the egress bridge node through which the destination node connects to the network in dependence upon the ingress bridge identifier and the egress bridge identifier included in the frame. | 07-01-2010 |
| 20100226381 | ROUTING FRAMES IN A TRILL NETWORK USING SERVICE VLAN IDENTIFIERS - Methods, apparatus, and products are disclosed for routing frames in a TRILL network using service VLAN identifiers by: receiving a frame from an ingress bridge node for transmission through the TRILL network to a destination node that connects to the TRILL network through an egress node, the received frame including a customer VLAN identifier, a service VLAN identifier uniquely assigned to the ingress bridge node, and a destination node address for the destination node, the received frame not having mac-in-mac encapsulation; adding, in dependence upon the service VLAN identifier and the destination node address, a TRILL header conforming to the TRILL protocol, the TRILL header including an ingress bridge nickname and an egress bridge nickname; and routing, to the egress bridge node through which the destination node connects to the network, the frame in dependence upon the ingress bridge nickname and the egress bridge nickname. | 09-09-2010 |
| 20100309912 | FORWARDING FRAMES IN A COMPUTER NETWORK USING SHORTEST PATH BRIDGING - Methods, apparatus, and products are disclosed for forwarding frames in a computer network using shortest path bridging (‘SPB’). The network includes multiple bridges, and each edge bridge is assigned a unique service virtual local area network (‘VLAN’) identifier. One of the bridges receives a frame for transmission to a destination node. The received frame includes a service VLAN identifier for the ingress bridge through which the frame entered the network and a customer VLAN identifier. The one bridge identifies an SPB forwarding tree in dependence upon the service VLAN identifier. The SPB forwarding tree specifies a shortest route in the network from the ingress bridge through the one bridge to the other bridges in the network. The one bridge then forwards the received frame to the egress bridge without MAC-in-MAC encapsulation in dependence upon the SPB forwarding tree and the customer VLAN identifier. | 12-09-2010 |
| 20110019678 | ROUTING FRAMES IN A SHORTEST PATH COMPUTER NETWORK FOR A MULTI-HOMED LEGACY BRIDGE NODE - Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname. | 01-27-2011 |
| Patent application number | Description | Published |
|---|
| 20100054152 | ERSPAN dynamic session negotiation - A method and network device to generate a remote traffic monitoring session using an automated technique to configure the source and destination devices of the monitoring system is disclosed. The method includes discovering a Layer 3 (L3) source device and an L3 destination device and automatically configuring the devices. The L3 source device passes target traffic that will be monitored via the L3 destination device in a remote traffic monitoring session. The method verifies configurations of the L3 source device and the L3 destination device, and determines remote monitoring capabilities common to the L3 source device and the L3 destination device. The method negotiates relevant parameters for the remote traffic monitoring session and establishes the remote traffic monitoring session between the L3 source device and the L3 destination device. | 03-04-2010 |
| 20100220730 | EFFICIENT PRUNING OF VIRTUAL SERVICES IN BRIDGED COMPUTER NETWORKS - In one embodiment, a bridge in a computer network may execute a spanning tree protocol (STP) for network topology and a registration protocol for traffic control of virtual connections (e.g., EVCs) at the bridge. For any gateway ports of the bridge inter-connected with a provider network, the bridge may generate “fake” received registration protocol join messages for a particular virtual connection at the gateway port. The bridge may then either i) propagate the join messages, in response to the gateway port being in a forwarding state according to the STP, on other forwarding ports of the bridge, or ii) in response to the gateway port not being in a forwarding state, block propagation of the join messages to other ports of the bridge. | 09-02-2010 |
| 20100220737 | MULTIPLE SPANNING TREE EXTENSIONS FOR TRUNK PORTS CARRYING MORE THAN 4K VIRTUAL SERVICES - In one embodiment, bridges in a computer network maintain a per-port mapping table for each of its ports, where each mapping table maps, for each virtual connection (of more than 4K) at a respective port, i) frame encapsulation fields that uniquely identify a particular virtual connection at the respective port to ii) a particular multiple spanning tree (MST) instance. The bridges may then compute a checksum of a particular mapping table for a particular port, and share the checksum with a corresponding port interconnected with the particular port (e.g., of another bridge). Upon determining that the mapping tables at the corresponding ports match in response to the checksums matching, frames may then be forwarded between the ports based on the particular mapping table. | 09-02-2010 |
| Patent application number | Description | Published |
|---|
| 20090109837 | Scalable Connectivity Fault Management In A Bridged/Virtual Private Lan Service Environment - A method and apparatus that proxies connectivity check messages and sends fault state changes messages across an MPLS/VPLS network is described. A network element proxies connectivity check messages for remote maintenance endpoints based on a local database. The network element updates the database based on received fault state change message that identify a fault state change of a remote maintenance endpoint. The network element detects fault state changes of local maintenance endpoints and sends a fault state change message to other network elements that proxy connectivity check message for the local maintenance endpoints. | 04-30-2009 |
| 20090109861 | Scalable Connectivity Fault Management In A Bridged/Virtual Private Lan Service Environment - A method and apparatus that proxies connectivity check messages and sends fault state changes messages across an MPLS/VPLS network is described. A network element proxies connectivity check messages for remote maintenance endpoints based on a local database. The network element updates the database based on received fault state change message that identify a fault state change of a remote maintenance endpoint. The network element detects fault state changes of local maintenance endpoints and sends a fault state change message to other network elements that proxy connectivity check message for the local maintenance endpoints. | 04-30-2009 |
| 20090113070 | ENHANCE FAULT TRACING IN MULTI-TIERED ETHERNET/MPLS NETWORK - Techniques for providing connectivity fault management (CFM) for a multi-tiered network are described herein. In one embodiment, a link trace message (LTM) is received at a provider edge (PE) router and originated from a first Ethernet node and destined to a second Ethernet node, where the PE router interfaces an Ethernet and a multi-protocol label switching (MPLS) network. In response, the PE router initiates an MPLS trace session, including generating an MPLS trace message based on the LTM message to one or more MPLS nodes along a path between the first and second Ethernet nodes within the MPLS network. Subsequently, in response to one or more MPLS trace reply messages from the MPLS nodes of the MPLS network, the PE router generates a first link trace reply (LTR) message and sends the first LTR message to the first Ethernet node over the Ethernet. Other methods and apparatuses are also described. | 04-30-2009 |
| 20090279431 | Load Balancing Pseudowire Encapsulated IPTV Channels Over Aggregated Links - A method for load balancing IPTV channels is described. In one embodiment of the invention, a first Provider Edge (PE) network element of a label switched network, coupled with a second PE network element over multiple member links of an aggregate link, receives IPTV packets. For each IPTV packet received, the first PE network determines layer 3 information of the IPTV packet, and generates one or more channel load balancing keys based on the layer 3 information. The PE network element generates a hash value from the channel load balancing keys and determines which one of multiple member links to transmit the IPTV packet on based on the hash value, and transmits the IPTV packet to the second PE network element on the determined member link. Other methods and apparatuses are also described. | 11-12-2009 |
| 20100061252 | Reducing CC Message Transmission in a Provider Network - A method and apparatus for reducing the number of CC messages transmitted in a provider network. In one embodiment of the invention, a first service provider network element receives CC messages from a first customer network at a first periodicity rate. The first service provider network element stores the received CC messages and reduces the first periodicity rate to create a second periodicity rate that is smaller than the first periodicity rate. The first service provider network element transmits CC messages to a second service provider network element through the provider network at the second periodicity rate. Other methods and apparatus are also described. | 03-11-2010 |
| 20100165832 | HVPLS Hub Connectivity Failure Recovery With Dynamic Spoke Pseudowires - Techniques for recovering from hierarchical virtual private LAN service (HVPLS) hub connectivity failure with a dynamic spoke pseudowire. According to one embodiment of the invention, a provider edge (PE) network element in the HVPLS hub monitors for a failure of HVPLS hub connectivity failure and reuses an HVPLS spoke connectivity failure recovery mechanism in an MTU by fabricating failure of one or more spoke facing connectivity elements coupling the MTU with the PE network element causing the MTU to transition to a secondary PE network element in the HVPLS hub. In addition, the PE network element establishes a dynamic spoke pseudowire for each virtual instance affected with the MTU to restore HVPLS hub connectivity for that PE network element. | 07-01-2010 |
| Patent application number | Description | Published |
|---|
| 20080208984 | User interface for transitioning between chat and email - Instant messaging, also known as chat, is integrated with electronic mail in a user interface that provides for conversion of messages between electronic mail (email) and instant messaging. A user interface is provided for allowing a user who is composing an email message to convert the message to a chat message. The chat message will include any content that was present in the electronic mail message, and the user can continue to compose the chat message, and then send it to a chat address determined automatically from the email address of the original email message. Notifications are provided that indicate when chat users have logged on to or logged off from the chat service. These notifications assist a user composing a message to select the most appropriate communication method based upon the current online presence of the intended recipient. A user interface for converting messages in the opposite direction, from chat to email, is also provided. | 08-28-2008 |
| 20080222256 | Autocomplete for intergrating diverse methods of electronic communication - Instant messaging, also known as chat, is integrated with electronic mail in a user interface that provides for automatic completion of recipient names or addresses, such as email addresses or chat addresses, as a user types characters of the name or address when addressing a message. The automatic completion feature displays a list of matches, which are names or addresses in, for example, the user's online contact list, that match the characters the user types. The matches list may contain names or addresses for multiple different communication methods. The user may then select one of the names or addresses to compose a message to be sent to the selected name or address. A user interface is then provided for composing a message to be sent to the selected name or address using the communication protocol associated with the selected name or address. | 09-11-2008 |
| 20090083382 | REAL-TIME PRESENCE OF ONLINE CONTACTS - In accordance with embodiments of the present invention, a method for dynamically generating online contacts for an instant messaging (IM) environment in response to receiving login information from a user is provided. The method includes receiving at least one predetermined core IM contact associated with the user at a core IM server, and receiving a query for a presence status of at least one predetermined e-mail contact associated with the user from an e-mail application. A presence status is determined for the at least one predetermined core IM contact and the at least one predetermined e-mail contact. After returning the determined presence status of the at least one predetermined core IM contact for consolidating with the determined presence status of the at least one e-mail contact. An online presence contact list is generated using the determined presence status of the at least one IM contact and the at least one e-mail contact. | 03-26-2009 |
| Patent application number | Description | Published |
|---|
| 20090132725 | METHODS AND APPARATUS FOR FAST CHANNEL SWITCHING BETWEEN REAL TIME CONTENT ON A DEVICE - Methods and apparatus for fast channel switching between real time content on a device. In an aspect, a method includes receiving a channel selection indicator that identifies a channel comprising real time content to be rendered, determining whether the real time content can be rendered using an existing rendering pathway, and inputting the real time content into the existing rendering pathway if it is determined that the real time content can be rendered using the existing rendering pathway. An apparatus includes a user interface to receive a channel selection indicator that identifies a channel comprising real time content to be rendered, processing logic to determine whether the real time content can be rendered using an existing rendering pathway, and a rendering interface to input the real time content into the existing rendering pathway if it is determined that the real time content can be rendered using the existing pathway. | 05-21-2009 |
| 20090175294 | METHODS AND APPARATUS TO PROVIDE A VIRTUAL NETWORK INTERFACE - Methods and apparatus to provide a virtual network interface. In an aspect, a method includes receiving a request to access content on a Non-IP network, wherein the request comprises an IP address and a quality of service (QoS) profile associated with the content, mapping the IP address and the QoS profile into a Non-IP network content identifier, and obtaining the content from the Non-IP network based on the Non-IP network content identifier. In an aspect, an apparatus includes an application interface configured to receive a request to access content on a Non-IP network, wherein the request comprises an IP address and a QoS profile associated with the content, mapping logic configured to map the IP address and the QoS profile into a Non-IP network content identifier, and processing logic configured to obtain the content from the Non-IP network based on the Non-IP network content identifier. | 07-09-2009 |
| 20100191835 | METHOD AND APPARATUS FOR THE DISTRIBUTION OF CONFIGURATION DATA - Embodiments of methods and apparatuses for distributing configuration data to one or more mobile terminals. An embodiment of one method of the invention includes receiving from the host application a request from a client to transmit a configuration data value to a mobile terminal. The configuration data value can include a designation of a new precedence level for a mobile terminal corresponding to a new operating characteristic of the mobile terminal. The method can include the step of transmitting from the NMC a configuration data value including the new precedence level to the mobile terminal. The mobile terminal can include a mobile application defining a previous precedence level such that the mobile terminal loads the configuration data in response to the new precedence level different from the previous precedence level. | 07-29-2010 |
| Patent application number | Description | Published |
|---|
| 20090030781 | Creating and Displaying Universal Ad Over Multiple Different Platforms - A method and system are provided for creating and displaying a universal ad over multiple different platforms. In one example, the method includes creating a universal ad by generating a superset ad, identifying different parts of the superset ad as separate components, matching the separate components to their respective media, attaching tags to each separate component, and converting the superset ad to a universal ad. | 01-29-2009 |
| 20090248511 | ADVERTISEMENTS ON DEMAND - A method and system for providing advertisements on demand on a search results webpage includes receiving an ad preference for an advertisement through an user interface. The ad preference defines rendering option desired by an advertiser for the advertisement. A user preference for viewing an advertisement on the search results webpage is received through a user interface. An ad repository is searched to identify an advertisement that matches the ad preference with the user preference. The identified advertisement is rendered on the search results webpage along with search results in a format defined by the ad preference and user preference. The rendered advertisement allows optimal promotion of a product or service associated with the advertisement for an advertiser. | 10-01-2009 |
| 20090287515 | Monetization of Offline-Interface Events Operating on Ads Distributed Through Advertising Networks - Ads servers, clients, and networks serve and/or publish ads through online networks, then track offline-interface events that operate on the ads, and charge advertisers based on the offline-interface events. An enabling network includes an ads publishing module to request an ad from an ads serving module and publish the ad, a tracking module to track offline-interface events that operate on the published ad, and a billing module to charge an advertiser based on the offline-interface events. | 11-19-2009 |
| 20090313082 | Method and Apparatus for Collecting Information About Targeted Behavior on the Internet - A method and apparatus are provided for collecting information about targeted behavior on the Internet. In one example, the method includes sending an offer to participate in a tracking program to a user computer, receiving an acceptance of the offer to participate from the user computer, sending a software code device to the user computer, receiving targeted behavior information from the software code device located on the user computer, and sending payment for the targeted behavior information to the user computer. | 12-17-2009 |
| 20090327854 | Analysis of Database Performance Reports for Graphical Presentation of Summary Results - Computer implemented methods, programs and systems for displaying statistical data in a graphical user interface are provided. According to the method, baseline data is imported from a first report which corresponds to a trouble-free period. Similarly, critical data is imported from a second report corresponding to a trouble period. The imported data is compared and analyzed to create a results table, each cell in the results table corresponding to a timestamp and a statistical item. The cells in the results table contain a visual identifier according to the criticality of the comparison of the statistical items from the baseline data and the critical data. The results table is presented on a display to the user. | 12-31-2009 |
| 20100036764 | OPERATION OF INTERNET WEBSITES - A method and system for facilitating the operation of an Internet website is provided. The method employed by the system may include receiving, at an exchange, information about a publisher's website for which the publisher wishes to sell shares and communicating the information to an investor. The investor may then generate a purchase order for purchasing a number of shares in the publisher's website. A money amount may then be transferred from an account associated with the investor to an account associated with the publisher. At a later time, dividends may be paid to the investor or an investor may sell his shares in the website to a different investor. | 02-11-2010 |
| 20110040632 | MONITIZING PAGE VIEWS ON AN EXCHANGE USING FUTURES CONTRACTS - Techniques are described herein for monetizing page views on an exchange using futures contracts. For example, an estimated price (a.k.a. base price) and a future date (a.k.a. base date or occurrence date) may be declared with respect to a page view. The estimated price is the price at which the page view is to be offered for sale. The future date is the date on which the page view is scheduled to occur. A futures contract regarding the page view is offered for sale on an exchange, such as an ad exchange. The futures contract specifies an obligation to purchase the page view with respect to the future date for the estimated price. The futures contract may be offered for sale on a date that precedes the date on which the page view is to be offered for sale. | 02-17-2011 |
| Patent application number | Description | Published |
|---|
| 20090106196 | TRANSFERRING RECORDS BETWEEN TABLES USING A CHANGE TRANSACTION LOG - A method and apparatus for transferring records between database tables using a transaction log. In one embodiment of the method, a first application generates a transaction for deleting a record from a first table in a database. In response to the generation of the first transaction, a copy of the record is stored in an entry of a transaction log before the record is deleted from the first table. A second application generates an instruction for copying the record from the transaction log to a second table, and the record is copied from the entry to the second table. | 04-23-2009 |
| 20090106216 | PUSH-MODEL BASED INDEX UPDATING - A method and apparatus for push-model based index updating. In one embodiment of the method, a first transaction generated for modifying or inserting a first data object into a memory. A first message is generated in response to generating the first transaction, wherein the first message comprises information related to an identifier of the first data object, wherein the first message comprises information that indicates that the first data object was or will be modified or inserted into the memory, and wherein the first message comprises a copy of some or all of the data contents of the first data object; transmitting the first message to a computer system that implements a search engine. | 04-23-2009 |
| 20090106294 | METHOD AND APPARATUS FOR EMPLOYING A SEARCHABLE ABSTRACTION LAYER OVER ENTERPRISE-WIDE SEARCHABLE OBJECTS - A mechanism for dynamically configuring searchable fields of interest within an enterprise-wide search center is provided. Such functionality is provided through the creation and maintaining of an abstraction layer that represents the searchable fields of interest, which are gathered from the total available fields from enterprise-wide searchable objects. The abstraction layer is defined through the use of a field mappings file that relates searchable fields of interest in searchable objects with fields within a search index accessible to the search center. The field mappings file can provide the defined relationships between searchable object fields and search index fields at runtime of a user session, thus avoiding a rigid configuration at the time of search center initialization. Through such runtime modification of the abstraction layer, costly downtime due to revision of a configuration of the search center can be avoided and a dynamic flexibility in the presentation of the fields in the searchable objects can be provided without a need for modification of the searchable objects themselves. | 04-23-2009 |
| 20090106324 | PUSH-MODEL BASED INDEX DELETION - A method and apparatus for push-model based index deletion. In one embodiment of the method, a first transaction is generated for deleting a first data object from memory. A first message is generated in response to generating the first transaction, wherein the first message comprises information related to an identifier of the first data object, and wherein the first message comprises information that indicates that the first data object was or will be deleted. The first message is then transmitted to a computer system that implements a search engine. | 04-23-2009 |
| 20090106325 | RESTORING RECORDS USING A CHANGE TRANSACTION LOG - In one embodiment of the method, a first transaction is generated for deleting a record from a table of a database. In response the record is deleted from the table. Further in response to the generation of the first transaction, a copy of data of the record is stored in an entry of a transaction log before the record is deleted from the table. An instruction is then generated, and in response the record is restored to the table after the record is deleted, wherein the record is restored in the table using the copy of the data in the transaction log entry. | 04-23-2009 |
| Patent application number | Description | Published |
|---|
| 20110012563 | FAST CHARGING OF BATTERY USING ADJUSTABLE VOLTAGE CONTROL - A battery cell charger for rapidly charging a lithium ion battery cell (or string of series-parallel connected cells) having a maximum battery cell voltage the battery cell charging system including: a circuit for charging the battery cell using an adjustable voltage charging-profile to apply a charging voltage and a charging current to the battery cell wherein the adjustable voltage charging-profile includes: a first charging stage with a constant first stage charging current and an increasing battery cell voltage with the first stage charging current provided until the first stage charging voltage is about equal to a first stage complete voltage less than the maximum battery cell voltage; one or more intermediate charging stages, each intermediate stage selected from the group consisting of one or more of an intermediate constant voltage stage that provides a decreasing charging current, an intermediate constant current stage that produces an increasing battery cell voltage, and combinations thereof; and a final charging stage with a constant final stage charging voltage about equal to an intermediate stage complete voltage and a decreasing final stage charging current with the final stage charging voltage provided until the final stage charging current reaches a desired charge complete level. | 01-20-2011 |
| 20110156641 | STATE OF CHARGE RANGE - A system and method for improving cycle lifetimes for a lithium-ion battery pack, particularly for adapting to a dynamic use profile for a user. A battery cell pack charging system, including a charger and a controller, for charging a lithium-ion battery cell pack, the battery cell pack charging system has a circuit for charging the battery cell pack using an adjustable charging system including an adjustable charge profile to charge the battery cell pack wherein the adjustable charge profile includes: an operational parameter identifying a next operation post-charge performance characteristic for the battery cell pack wherein a controller determines a next cycle plan for the battery cell pack that provides the performance characteristic while concurrently enhancing an attribute of the battery cell pack and wherein the attribute is measured over a plurality of applied cycles; and one or more charging stages to produce an energy ending point for the plan; wherein the adjustable charge plan is implemented by the charger in anticipation of a post-charging operation associated with the operational parameter. | 06-30-2011 |
| 20110156661 | FAST CHARGING WITH NEGATIVE RAMPED CURRENT PROFILE - A battery cell charging system, including a charger and a controller, for rapidly charging a lithium ion battery cell, the battery cell charging system having a circuit for charging the battery cell using an adjustable voltage charging-profile to apply a charging voltage and a charging current to the battery cell wherein the adjustable voltage charging-profile includes: a first charging stage with a constant first stage charging current and an increasing battery cell voltage with the first stage charging current provided until the first stage charging voltage is about equal to a first stage complete voltage less than a maximum battery cell voltage; an intermediate ramped charging stage, the intermediate ramped charging stage including both an increasing ramped voltage and a decreasing ramped iBat current for the battery cell for the voltage charging range of the first stage complete voltage to about the maximum battery cell voltage; and a final charging stage with a constant final stage charging voltage about equal to the maximum battery cell voltage and a decreasing final stage charging current with the final stage charging voltage provided until the final stage charging current reaches a desired charge complete level. | 06-30-2011 |
