Abstract: Artificial intelligence applications require use of training sets containing positive and negative examples. Negative examples are chosen using distributions of positive examples with respect to a dominant feature in feature space. Negative examples should share or approximately share, with the positive examples, values of a dominant feature in feature space. This type of training set is illustrated with respect to content recommenders, especially recommenders for television shows.

Abstract: A reconfiguration manager implemented on a computer or other data processing device controls the reconfiguration of software or other components of an electronic device such as a computer, personal digital assistant (PDA), set-top box, television, etc. The reconfiguration manager receives a reconfiguration request, e.g., a software upgrade request from the electronic device, and determines one or more device components that are required to implement the reconfiguration request. The reconfiguration manager also determines, e.g., from information in the request, identifiers of one or more additional components currently implemented in the electronic device. The reconfiguration manager then compares the needed and currently implemented components with previously-stored lists of known acceptable and unacceptable configurations for the electronic device.

Abstract: A modular optimizer, for use in determining a configuration of a production line with one or more component placement machines, is configured to handle precedence constraints. The precedence constraints may be of the form A B MT, which specifies that part A must be placed on a designated assembly board before part B if either part is to be placed by a machine type MT. A given set of precedence constraints includes at least a first class of constraints that apply to only one component placement machine type and a second class of constraints that apply to more than one component placement machine type. Assignment of constraints to the different classes is based on decisions of a part splitter module of the modular optimizer regarding which parts are assigned to which machine types. Each of the constraints in the first class of constraints associated with a given machine type are handled in a corresponding machine module of the modular optimizer.

Abstract: Real-time events are electronically recommended using a fuzzy-now function of time. Real-time experiencing apparatus can be automatically tuned to a particular real-time event using a surf ring related to recommendations or automatically without a user request.

Abstract: A television programming recommender is disclosed that selectively obtains feedback information from a user to update one or more profiles associated with the user. Previously obtained implicit and explicit preferences are utilized to selectively focus the collection of feedback information to further update and refine the implicit and explicit preferences. The present invention obtains feedback from a user in a manner that maximizes the value of the obtained information and improves the performance of the television programming recommender. The present invention automatically requests feedback from the user upon the occurrence of predefined criteria. The nature of the requested feedback, and the manner in which the obtained feedback is used to adjust a profile, can vary.

Abstract: A modular optimizer, for use in determining a configuration of a production line with one or more component placement machines, is configured to learn a foreign optimizer module associated with a component placement machine type foreign to the modular optimizer. The modular optimizer includes an adapting estimator which estimates an output value, such as a placement cycle time measure, for the foreign optimizer module. The estimated output value may be used in determining the configuration of the production line. In addition, the modular optimizer periodically calls the foreign optimizer module, and for a given one of the calls compares a resulting output value generated by the foreign optimizer module to the corresponding estimated output value generated by the adapting estimator.

Abstract: Enhanced content data is supplied in association with a media selection. The enhanced content data is customized responsive to a user profile. The uncustomized enhanced content is stored as a data structure having levels of nodes. Each node within a given level represents an alternative version of a shared enhanced content sub-topic. A processor chooses between nodes within the levels and assembles the chosen nodes to produce the customized enhanced content data.

Abstract: A security system incorporates a reasoning system and security rules and processes that are designed to be as unobtrusive as the situation permits. Two independent aspects of the system facilitate the enforcement of rules and processes in an unobtrusive manner. First, transponders that can be triggered and sensed from a distance are preferably used to identify both items and individuals. These remotely sensed identifiers are processed by the reasoning system to determine whether each identified item is authorized, or likely to be authorized, to be removed from, or brought into, a secured location by the identified individual. Second, the system continually modifies and optimizes its rules and processes based on assessments of security events. An initial set of rules is created for the security system that, generally, prohibit the removal of secured items from the secured location, except that certain individuals are authorized to remove specified items from the secured location.

Abstract: A security system incorporates a reasoning system and security rules and processes that are designed to be as unobtrusive as the situation permits. Two independent aspects of the system facilitate the enforcement of rules and processes in an unobtrusive manner. First, transponders that can be triggered and sensed from a distance are preferably used to identify both items and individuals. These remotely sensed identifiers are processed by the reasoning system to determine whether each identified item is authorized, or likely to be authorized, to be removed from, or brought into, a secured location by the identified individual. Second, the system continually modifies and optimizes its rules and processes based on assessments of security events. An initial set of rules is created for the security system that, generally, prohibit the removal of secured items from the secured location, except that certain individuals are authorized to remove specified items from the secured location.

Abstract: A method uses a computer-controlled algorithm that enables production of high-quality layouts and charge maps or set-ups for arbitrary printed circuit boards for electronic component placement machines alone or as one of many in a production line. A class of algorithms known as genetic algorithms employing an initial population of chromosomes are used. Each chromosome represents a set of parameters that control how a layout and charge maps are generated. Problem descriptors, based on one time code are generated. An adaptive searcher searches parameters and generates trial solutions as chromosomes and a heuristic layout generator interprets these chromosomes to generate the layout and charge maps using the problem descriptors.

Abstract: An apparatus uses a computer-controlled algorithm that enables production of high-quality layouts and charge maps or set-ups for arbitrary printed circuit boards for electronic component placement machines alone or as one of many in a production line. A class of algorithms known as genetic algorithms employing an initial population of chromosomes are used. Each chromosome represents a set of parameters that control how a layout and charge maps are generated. Problem descriptors, based on one time code are generated. An adaptive searcher searches parameters and generates trial solutions as chromosomes and a heuristic layout generator interprets these chromosomes to generate the layout and charge maps using the problem descriptors.

Abstract: The step size parameters of a component placement machine are represented as genes in a component placement chromosome, and evolutionary algorithm techniques are applied to evolve offspring that have step size parameters that provide an improved component placement throughput estimate. The offspring that have these preferential step size parameters are used to generate additional offspring that provide further improvement in the component placement throughput estimate. After a number of generations, the step size parameters of the offspring that provides the best component placement throughput are used to program the component placement machine to achieve this improved throughput.

Abstract: A code compaction based on macro substitutions is presented wherein the choice of possible macro substitutions is guided by an evolutionary algorithm process. In a preferred embodiment, a random population of sets of macro substitutions are generated and a compaction effectiveness is evaluated for each set. This random population is partitioned into pairs of “parents”, and each pair of parents produce a pair of “offspring”. The effectiveness of the compaction provided by each of the offspring is evaluated, and a “survival of the fittest” algorithm is applied to identify the individuals that have the best compaction effectiveness. These preferred individuals are partitioned into pairs of parents who produce pairs of offspring, and the most compaction-effective individuals are selected to be parents for the next generation. This process continues until subsequent generations show insignificant improvement, and the best individual is selected as the solution.

Abstract: A user interface is provided that allows for the control of the movement of multiple objects by the identification of a target location associated with each of the multiple objects. The identification of the target location is via a coordinate pointer associated with an input device, and the association of the target location to a particular object is via the closure of a switch on an input device that is associated with the particular object. After identifying an associated target location, the object is moved toward the target location without further input from the user. In a preferred embodiment, the movement of the object toward the target location is dependent upon rules of motion and rules of engagement with other objects or obstacles, thereby facilitating a realistic rendering of the object's path toward the target. The rules of motion and engagement may be specific to each type of object being moved, and also subject to the interactions of multiple objects and obstacles.

Abstract: A method uses a computer-controlled algorithm that enables production of high-quality layouts and charge maps or set-ups for arbitrary printed circuit boards for electronic component placement machines alone or as one of many in a production line. A class of algorithms known as genetic algorithms employing an initial population of chromosomes are used. Each chromosome represents a set of parameters that control how a layout and charge maps are generated. Problem descriptors, based on one time code are generated. An adaptive searcher searches parameters and generates trial solutions as chromosomes and a heuristic layout generator interprets these chromosomes to generate the layout and charge maps using the problem descriptors.

Abstract: An apparatus uses a computer-controlled algorithm that enables production of high-quality layouts and charge maps or, set-ups for arbitrary printed circuit boards for electronic component placement machines alone or as one of many in a production line. A class of algorithms known as genetic algorithms employing an initial population of chromosomes are used. Each chromosome represents a set of parameters that control how a layout and charge maps are generated. Problem descriptors, based on one time code are generated. An adaptive searcher searches parameters and generates trial solutions as chromosomes and a heuristic layout generator interprets these chromosomes to generate the layout and charge maps using the problem descriptors.