Showing papers by "Facebook published in 2003"

Degrees of separation for handling communications

Abstract: A sender's degrees of separation from a recipient may be used to aid in spam filtering or to otherwise handle a communication. The “degrees of separation” represent a metric used to quantify whether/how the recipient is linked to the sender through intermediary people or other entities. For example, a recipient may know a first user (first degree of separation) and the first user may know a second user (second degree of separation) who knows the sender of an e-mail. In this case, the sender is separated from the recipient by two degrees of separation (by two other contacts). A level of “trust” or “legitimacy” about a sender's communication can be inferred by looking at whether the sender is linked to an intended recipient. Typically, user contact lists (e.g., address book, buddy list, and/or white list) are evaluated to determine the number of degrees (or hops) are required to link or relate two users.

Facilitating communications between computer users across a network

Abstract: A stand-alone icon (i.e., an icon that is not part of an application interface) is provided to facilitate communications across a network between users of at least one communications program. The icon represents a contact or a set of contacts. Status information regarding the contact or set of contacts is received and displayed using the icon or in response to an operation performed on the icon. The icon additionally may provide an interface for performing actions related to the contact or set of contacts. The actions may generally include, for example, retrieving profile information about the contact, setting an alert to indicate that the contact's network/login status (e.g., login, logout, or idle) has changed, or performing communications with the contact.

Identifying and using identities deemed to be known to a user

Abstract: The people a user is presumed to know or be associated with may be determined using a number of techniques. This information about people that the user knows is used in relation to the user's communications. For example access to a user's online presence may be restricted based on the known people such that access to presence is provided only to those people that the user knows.

Facilitating instant messaging outside of user-defined buddy group in a wireless and non-wireless environment

Abstract: A method, system and computer program product for instant message communication in a wireless and non-wireless environment. The invented system includes an apparatus that facilitates conversation with individuals not included in the user's buddy group, non-buddies (183). The system includes at least one additional routing code (4561) reserved for conversing with non-buddies. The first time during a user session that the system receives a message originating from or destined for a non-buddy, before routing the message, the non-buddy's personal identifier is associated with one of the reserved routing codes (4561). The mobile user can then reply to the message using the same automated «reply» function available for replies to buddies. The nonbuddy routing code assignment is only for the duration of a user session. When the mobile user signs off from the system, the routing code becomes available for reassignment.

Dynamic identification of other users to an online user

Abstract: Informing a user of a large scale network dynamically of other network users includes determining dynamically an online context of the user. Other users presently within the online context of the user are identified and trait information is stored that is related essentially only to the user or to the other users in a users store associated with the online context. The user is informed dynamically of the other users based on the stored trait information, such as, for example, an age or other demographic identifier, or information indicative of an expertise, interest, preference, user type and/or other quality of the user or of the other individual.

Method of interfacing on a computer network by visual representation of users, method of interacting and computer network

Abstract: A method of interfacing used on a network having a central computer system and a plurality of remote computer system is provided. Each remote computer system includes a video display. The method includes the steps of creating a first visual representation of a first user on the visual display of the first computer system and a second visual representation of a second user on the visual display of the second computer system. The second visual representation is then displayed on the visual display of the first computer system and the first visual representation is displayed on the video display of the second computer system. Applied to video games, the method creates a first visual representation of a first player on a first remote computer system, identifies an interest and a skill level of the first player for at least one video game, indicates predetermined personal characteristics of the first player, saves the visual representation, interest, skill levels and personal characteristics of the first player, accesses the central computer system from the first remote computer system over telephone lines, selects a second player who has accessed the central computer system from a second remote computer system, and invites the second player to play a selected video game. The step of inviting allows the second player to access the visual representation, interest, skill levels and personal characteristics of the first player. The method of interacting is used on a network having a central computer system and a plurality of remote computer systems. Each remote computer system is operated by a user and has access to at least one predetermined application program. The method allows an application program to be employed by at least two primary users and then allows a different user to watch the action of the predetermined application program as it is employed by the primary users. The computer network includes a central computer system, a plurality of remote computer systems connected to the central computer system over telephone lines, means for creating visual representations of users on the visual displays of the remote computer systems, means for sending the visual representation of a user from one remote computer system to a predetermined number of other remote computer systems, and means for running an application program between users of different remote computer systems.

Method and apparatus for hardware forwarding of LAN frames over ATM networks

Abstract: A multiported LAN switch comprised of legacy local area network ports and ATM ports. Each ATM port comprising a hardware forwarding engine for bridging LAN frames from the LAN ports to the ATM port. The hardware forwarding engine converts layer 2 protocols between the dissimilar ports expediently, without requiring intervention by a microprocessor. A substantial performance gain is attained compared to microprocessor controlled format converters. Both LAN emulation and virtual LANs are supported.

Method of distributing targeted internet advertisements

Abstract: A method of distributing Internet advertisements at the websites of a number of different publishers operating web sites. An advertising entity collects lists of user identifiers from each of several advertisers. In response to a user visiting one of the websites, the user identifier associated with the user is determined. It is determined if the user identifier is on one of the list. If the user identifier is on a list, an unembedded advertisement associated with the advertiser whose list contains the user's identifier is served to the user. The advertisement may be a pop-up, pop-under, or dynamic html advertisement, and if the user is not on the list, no such an ad may not be served.

Host-based intelligent results related to a character stream

Abstract: Information may be presented to a user by using a first application to receive a character stream of one or more noncompletion characters. The noncompletion characters indicate that additional characters may be received. The character stream is exchanged with a host that analyzes the character stream to generate results that are responsive to the user's predicted interest. Results are received and displayed so that the user may select one of the results to launch a code segment related to the selected result.

Inserting advertising content

Abstract: Content may be inserted at a duplicating device by inserting advertising content into a duplicated feed, and transmitting the duplicated feed to the terminal. The transmission of the duplicated feed is performed in response to a state of the terminal.

Providing supplemental contact information corresponding to a referenced individual

Abstract: Providing supplemental contact information for an individual referenced in an electronic message typically includes receiving an electronic message, examining the electronic message, detecting an identifier for a referenced individual contained in the electronic message, and making supplemental contact information for the referenced individual available to a recipient of the electronic message. The supplemental contact information may include information that is in addition to information contained in the electronic message. The supplemental contact information may include at least one of an e-mail address, a screen name, a telephone number, a facsimile number, and a mailing address, each of which is associated with the referenced individual.

System and method for electronic wallet conversion

Abstract: A system and method for electronic wallet conversion allows conversion of a basic electronic wallet to a more flexible wallet account, providing additional services and requiring additional authentication. The basic accountholder eventually requires the additional services provided by the more flexible wallet, typically editing rights and making purchases at sites requiring authentication beyond the basic level. To convert the account, the account holder is presented with a one-time challenge and response mechanism that requires the accountholder to summon information that only the account holder would know. If a successful match is made, the account is converted to the more flexible account for all time. The accountholder replaces the one-time challenge and response with a second-level password that grants the accountholder ongoing access to more sensitive wallet features, such as the ability to purchase at sites requiring a second-level password, and editing rights to the information stored in the wallet.

On-chip inter-network performance of optimization using configurable performance parameters

Abstract: A method and apparatus for on-chip inter-network performance optimization using configurable performance parameters have been described.

Method and apparatus for optimizing distributed multiplexed bus interconnects

Abstract: A method and apparatus for optimizing distributed multiplexed bus interconnects (Figure 2c).

Method and apparatus for providing security for a computer system

Abstract: A method and apparatus for providing security for a computer system, which includes generating a request for a file. The request is received at a dedicated security processor, where the dedicated security processor may access the file to validate the requested file. Upon determining that the requested file is valid, the dedicated security processor may provide the requested file to another processor.

Arrangement for testing semiconductor chips while incorporated on a semiconductor wafer

Abstract: An arrangement that will provide multiple communication paths for the simultaneously testing of a plurality of un-diced chips on a semiconductor wafer that will simultaneously permit each such communication path to service more than one chip while using a minimum number of tester contacts. These and other objects, features and advantages of the present invention are accomplished in a semiconductor wafer having thereon a number of kerf isolated integrated chips, each of said chips being coupled to at least two different ones of strategically placed administration circuits via two different stimulus buses; each chip being coupled to each administration circuit via selection control circuits laid down in the kerf area between the chips. It is this redundancy that significantly reduces the possibility of failure associated administration or selection control circuits. The stimulus busses can also be used to provide each chip with parallel serial scan data as well as power and other signals such as clock and enable and disable signals. Each chip control circuit provides the chip with power, bus clock, control, enable and response lines, can also connected to each chip via suitable lines in the kerfs.

Backup technique for recording devices employing different storage forms

Abstract: One aspect of the invention is a backup system that collectively performs the backup of data in a block form stored by a block recording device, and the back of data in a file form stored by a file recording device. According to the present invention, a backup system comprises: a first storage unit for storing first data using a first storage form; a second storage unit for storing second data using a second storage form; a backup storage unit for storing backup data for the first data and the second data; a storage form converter for converting into data for the second storage form the first data stored in the first storage form by the first storage unit; and a backup manager for copying into the backup storage unit the first data and the second data stored in the second storage form by the second storage unit.

Providing supplemental contact information corresponding to a referenced individual technical field

Abstract: Providing supplemental information for an individual referenced in an electronic message typically includes receiving an electronic message, examining the electronic message, detecting an identifier for a referenced individual contained in the electronic message, and making supplemental information for the referenced individual available to a recipient of the electronic message. The supplemental information may include information that is in addition to information contained in the electronic message. The supplemental information may include at least one of an e-mail address, a screen name, a telephone number, a facsimile number, and a mailing address, each of which is associated with the referenced individual.

Validating user experience type settings

Abstract: A home gateway accesses a host system that differentially routes messages over a communication network to a destination system. The selection of a communication pathway from multiple possible communication pathways through a communication network is based on a user experience type (e.g., gaming user experience, streaming user experience, or browsing user experience) that generally reflects network resource consumption preferences of the user of the access account for the home gateway. Examples of user experience types include a gaming user experience, a streaming user experience and a browsing user experience. The user experience type generally reflects the online experience desired by the user.

System and method for handling direct memory accesses

Abstract: Methods and systems for efficiently processing direct memory access requests coherently. An external agent requests data from the memory system of a computer system at a target address. A snoop cache determines if the target address is within an address range known to be safe for external access. If the snoop cache determines that the target address is safe, it signals the external agent to proceed with the direct memory access. If the snoop cache does not determine if the target address is safe, then the snoop cache forwards the request on to the processor. After the processor resolves any coherency problems between itself and the memory system, the processor signals the external agent to proceed with the direct memory access. The snoop cache can determine safe address ranges from such processor activity. The snoop cache invalidates its safe address ranges by observing traffic between the processor and the memory system.

Fast, Fair, and Efficient Flows in Networks

Abstract: We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in this situation: all flow-carrying paths have the same length; i.e., these solutions are fair, which is in general not true for optimal flows in networks with nonlinear latency functions. In addition, the maximum latency of the Nash equilibrium, which can be computed efficiently, is within a constant factor of that of an optimal solution. That is, the so-called price of anarchy is bounded. In contrast, we present a family of instances with multiple sources and a single sink for which the price of anarchy is unbounded, even in networks with linear latencies. Furthermore, we show that an s-t-flow that is optimal with respect to the average latency objective is near optimal for the maximum latency objective, and it is close to being fair. Conversely, the average latency of a flow minimizing the maximum latency is also within a constant factor of that of a flow minimizing the average latency.