Abstract: Methods and apparatus are provided for the dynamic placement, management and monitoring of Internet advertising. A provider of Internet content distributes the Internet content by embedding an advertisement placeholder in the Internet content; and provides the Internet content to an aggregator web site. The aggregator web site presents the Internet content to at least one end user with at least one advertisement in the advertisement placeholder. The advertisement placeholder is processed by a third party agent to automatically share revenue from the at least one advertisement with the provider of the Internet content and a provider of the aggregator web site. The advertisement placeholder can optionally be embedded in the Internet content using one or more templates. The third party agent also evaluates the content and at least one policy of multiple parties to identify at least one advertisement to present in the advertisement placeholder.

Abstract: A system and method for provisioning virtual machines in a virtualized environment includes determining a relationship between capacity need and performance for virtual machines (VMs) stored in memory storage media. Aggregate capacity needs for a plurality of VMs consolidated on a same physical server are estimated. VM combinations that yield capacity gains when provisioned jointly are identified such that when peaks and troughs are unaligned in capacity needs for a set of VMs, the set of VMs is provisioned together.

Abstract: In one embodiment, the present invention is a method for reward-based learning of improved systems management policies. One embodiment of the inventive method involves obtaining a decision-making entity and a reward mechanism. The decision-making entity manages a plurality of application environments supported by a data processing system, where each application environment operates on data input to the data processing system. The reward mechanism generates numerical measures of value responsive to actions performed in states of the application environments. The decision-making entity and the reward mechanism are applied to the application environments, and results achieved through this application are processed in accordance with reward-based learning to derive a policy. The reward mechanism and the policy are then applied to the application environments, and the results of this application are processed in accordance with reward-based learning to derive a new policy.

Abstract: A system and method for testing a self configuring computer which includes a computer system. Sensors electrically communicating with respective electrical connectors in the computer system. The sensors detecting when the electrical connector has a change of status from a previous start up. The sensor indicating a state change when the connector has a change of status. The computer system electrically communicating with the sensor for detecting the sensor state. The computer system initiating a power up and a self test of the connector and a new device connected to the connector using the program upon start up of the computer system when a change in the state of the sensor indicates a change in the status of the connector. The computer system by-passing a power up and self test of the connector when there is no change in the state of the sensor.

Abstract: A method for use in a system in which computational entities are distributed across physical computing resources to place the entities on the resources includes estimating actual resource demand for each entity on each resource based on application resource usage data collected from a data source external from the entity, computing a best allocation of the resources to the entities from the estimated actual resource demand for each entity and distributing the resources to the entities in accordance with the computed best allocation.

Abstract: A method for detecting undesirable emails combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff. The method further includes identifying the given input email as an undesirable email if the combined spam score indicates that the input e-mail is undesirable.

Abstract: A method for detecting undesirable emails combines input from two or more spam classifiers to provide improved classification effectiveness and robustness. The method includes obtaining a score from each of a plurality of constituent spam classifiers by applying them to a given input email. The method further includes obtaining a combined spam score from a combined spam classifier that takes as input the plurality of constituent spam classifier scores, the combined spam classifier being computed automatically in accordance with a specified false-positive vs. false-negative tradeoff. The method further includes identifying the given input email as an undesirable email if the combined spam score indicates that the input e-mail is undesirable.

Abstract: A system and method for providing real-time, dynamic switching between first and second service providers each capable of providing a service for users over a communications network. The method includes steps of: establishing switching criterion for deciding when to switch service provision between the first service provider and second service provider; maintaining state information associated with a user's use of the service provided by a first service provider; switching between the first and second service provided over the communications network based on satisfaction of the switching criterion; and, migrating any state information maintained up to the time of switching to the second service. Preferably, the dynamic switching occurs in a manner substantially transparent to the user.

Abstract: A system, method and computer program product for managing power consumption in a system comprising at least two computing devices. The at least two computing devices are organized as part of active computing device group or a ready computing device group, the ready computing devices configured into various modes of readiness including a standby mode, a hibernating mode, and a power-off mode. A control device receives obtained sensed parameters indicative of the processing load at the group of active computing devices and determines a “Readiness” index value representing a state of system readiness which is a function of a transition time parameter representing a time for moving one or more computing devices from the second group of ready computing devices to the first group of active devices in response to a service level violation.

Abstract: In one embodiment, the present invention is a method for reward-based learning of improved systems management policies. One embodiment of the inventive method involves supplying a first policy and a reward mechanism. The first policy maps states of at least one component of a data processing system to selected management actions, while the reward mechanism generates numerical measures of value responsive to particular actions (e.g., management actions) performed in particular states of the component(s). The first policy and the reward mechanism are applied to the component(s), and results achieved through this application (e.g., observations of corresponding states, actions and rewards) are processed in accordance with reward-based learning to derive a second policy having improved performance relative to the first policy in at least one state of the component(s).

Abstract: A system, method and computer program product for managing power consumption in a system comprising at least two computing devices. The at least two computing devices are organized as part of active computing device group or a ready computing device group, the ready computing devices configured into various modes of readiness including a standby mode, a hibernating mode, and a power-off mode. A control device receives obtained sensed parameters indicative of the processing load at the group of active computing devices and determines a “Readiness” index value representing a state of system readiness which is a function of a transition time parameter representing a time for moving one or more computing devices from the second group of ready computing devices to the first group of active devices in response to a service level violation.

Abstract: An apparatus, system and method for automatically making operation selling decisions are provided. The apparatus, system and method make use of selling policy rules established by human operators associated with a firm to guide the making of decisions to sell products and/or services. The actual decisions to sell are made automatically by the system without requiring human intervention. The decisions to sell are made by negotiating terms of sale with a customer using history information, exogenous preference information, information obtained from third parties, and the like. An initial offer of sale is provided to a customer who may then elect to modify the terms of sale of the product or service. If the customer elects to modify the terms of sale of the product or service, a negotiation engine of the present invention may automatically provide counteroffers to offers made by the customer until acceptable terms of sale are agreed upon.

Abstract: A digital data processing system is provided with an information extracting portion or step for extracting information from each message processed by an entity of the system, where the extracted information permits that message or a similar message to be recognized. The system further includes a storage portion or step of storing the extracted information in a database of extracted information. The database has the extracted information for each message stored in an entry associated with the message. The invention further provides a comparison portion or step for comparing each message received or originated by the entity against the database entries stored in the storage segment and, if an entry is found to be sufficiently similar to the received message, for preventing the received message from triggering the generation and forwarding of a new message, thereby avoiding the creation of a network chain reaction or a maelstrom.

Abstract: An apparatus, system and method for automatically making operation purchasing decisions are provided. The apparatus, system and method make use of purchasing policy rules established by human operators associated with a firm to guide the making of decisions to purchase products and/or services. The actual decisions to purchase are made automatically by the system without requiring human intervention. The decisions to purchase are made by evaluating the possible vendors to identify a set of vendors from which the product or service may be obtained. From this set of vendors, one or more vendors are selected from which to purchase the desired product or service. The selection of these one or more vendors may be based on the established rules, information obtained about each vendor, and the results of negotiation with the vendors. Because the actual decisions are performed automatically without human intervention, the decisions may be made much more quickly than would have been done by a human being.

Abstract: An apparatus, system and method for automatically making operation selling decisions are provided. The apparatus, system and method make use of selling policy rules established by human operators associated with a firm to guide the making of decisions to sell products and/or services. The actual decisions to sell are made automatically by the system without requiring human intervention. The decisions to sell are made by negotiating terms of sale with a customer using history information, exogenous preference information, information obtained from third parties, and the like. An initial offer of sale is provided to a customer who may then elect to modify the terms of sale of the product or service. If the customer elects to modify the terms of sale of the product or service, a negotiation engine of the present invention may automatically provide counteroffers to offers made by the customer until acceptable terms of sale are agreed upon.

Abstract: Automatic electronic bidding for goods or services. In one embodiment, the history of bids or asks is examined to determine which have resulted in trades within a prescribed span of time. This information plus, possibly, some additional auxiliary information is used to estimate, for one or more candidate prices within a prescribed range, the likelihood for a bid or ask at that price to result in a trade; an optimal price is selected using this set of bid/ask prices and trade probabilities plus additional information about privately held information about reservation prices, etc. to compute an optimal bid/ask price or modify an existing bid/ask; and the auctioneer is sent a message conveying the chosen new or modified optimal bid/ask price.

Abstract: A method for detecting document-infecting computer viruses in a computer system having a plurality of documents, comprises the steps of maintaining a database of information associated with program objects associated with one or more of the documents, comparing one or more of the documents on the system with corresponding database entries in the database to detect certain document changes, and using a set of criteria to determine whether or not the detected document changes are likely to have been caused by viral activity.

Abstract: A method for restoring a computer program infected with a computer virus to its non-viral condition. The method uses certain information about an uninfected host program recorded prior to infection without relying upon pre-existing knowledge of the computer virus. The method includes: recording a checksum of the uninfected original program, the length of the program, and information pertaining to bytes located near the beginning and end of the original program; and, subsequent to any modification of the original program that is deemed suspicious, generating one or more trial reconstructions based on the recorded information and information contained in the modified file; comparing a checksum of each generated trial reconstruction with the checksum of the original program stored in the database; and outputting a trial reconstruction as the original uninfected program if its checksum matches that of the original program.

Abstract: Information pertaining to the verification of the identity of, and reversal of, a transformation of computer data is derived automatically based on a set of samples. The most important class of transformations is computer viruses. The process extracts this information for a large, fairly general class of viruses. Samples consisting of host programs infected with the virus and sample pairs consisting of an infected host and the corresponding original, uninfected host are obtained. A description of how the virus attaches to the host program, including locations within uninfected host of components of both the original host and the virus is generated. Viral code is matched across samples to obtain a description of "invariant" regions of the virus. Host bytes embedded within the virus are located. A description of the original host locations permits ant-virus software on a user's machine to restore the bulk of a program that has been infected.

Abstract: A method, and apparatus for accomplishing the method, to extract and/or evaluate a signature of a computer virus or other undesirable software entity. The method includes a first step of inputting to a digital data processor at least one portion of a undesirable software entity, the at least one portion including a sequence of bytes of the undesirable software entity that is likely to remain substantially invariant from one instance of that entity to another instance, and it is from this portion or portions that candidate computer virus signatures are drawn. A second step constructs a list of unique n-grams from the sequence of bytes, each of the unique n-grams being comprised of from one to a specified maximum number of sequential bytes of the sequence of bytes. A third step estimates, for each of the unique n-grams, a probability of an occurrence of a unique n-gram within sequences of bytes obtained from a corpus of computer programs that are typically executed upon the digital data processor.