Abstract: A method improving a customers experience in a queue located in a three-dimensional virtual environment is provided. The method includes the creation of computer controlled pseudo avatars that are added and removed from queues to create the perception that the queues are moving. A conversational avatar is further provided to engage the customer avatars in conversation.

Abstract: A system for evaluating a view, including a first mapper for encoding an image of a view according to a first parameter to create a first map having multiple defined areas, a second mapper for encoding the image according to a second parameter to create a second map having multiple defined areas, an overlap mapper for combining the maps to create an overlap map, a tabulator for measuring areas in the overlap map corresponding to overlapping defined areas, creating a set of measurements of the image, and an analyzer for analyzing the set of measurements of the image and a learning set of measurement groups with associated values to compute an estimated value associated with the image where the estimated value relates to the set of measurements of the image in the same manner that each value in the learning set relates to its associated measurement group.

Abstract: The present embodiment keeps track of a set of resolution required for generating each one of the clauses added by the simplification Method. This information is used by the method that generates the unsat core in order to extract the original clauses that generated the simplified clauses. This work integrates resolution based CNF simplification technique inside the SAT-based abstraction refinement scheme in a unique way that overcomes the difficulties.

Abstract: A computer-implemented method for verification of a target system includes defining a formula describing the target system, the formula including clauses, which include variables and which express constraints on states of the target system. The formula is processed so as to derive, using the clauses, a proof relating to a property of the target system. After deriving the proof, a variable that has a constant value is identified in the proof. The number of the variables in the proof is reduced using the identified variable, thereby producing a tightened expression, which is applied in making a determination of whether the target system satisfies the formula.

Abstract: A method to cluster Boolean functions for clock gating according to various exemplary embodiments can include identifying at least two small gating groups within a clock tree representative of an electrical network and at least two gating functions of the at least two small gating groups, wherein the at least two gating functions are Boolean functions; performing hierarchical clustering on the at least two gating functions using a similarity measure that describes a distance between the at least two gating functions such that the clustering forms a merge function of a cluster generated and displayed in a form of a dendrogram; assigning to each gating domain a merit value according to a power consumption profile of the gating domain using a merit function; and partitioning the cluster into gating groups using the dendrogram to construct a directed acyclic graph to determine a partition which maximize the overall power saving.

Abstract: The present embodiment keeps track of a set of resolution required for generating each one of the clauses added by the simplification method. This information is used by the method that generates the unsat core in order to extract the original clauses that generated the simplified clauses. This work integrates resolution based CNF simplification technique inside the SAT-based abstraction refinement scheme in a unique way that overcomes the difficulties.