Abstract: Aspects of the disclosure provide for a method for updating business information. A business at a business location and a reference image for the business at the business location may be selected for an update. From a number of more recent images, a comparison image may be selected based on a likelihood that the comparison image captures the business location. Text and visual features reference image may be compared with text and visual features of the comparison image to determine a text similarity score and a features similarity score. A confidence level indicating whether the business in the reference image is in the comparison image may then be determined using the text similarity score and the feature similarity score. According to the confidence level, the business information of the business may be updated.

Abstract: Aspects of the disclosure provide for a method for updating business information. A business at a business location and a reference image for the business at the business location may be selected for an update. From a number of more recent images, a comparison image may be selected based on a likelihood that the comparison image captures the business location. Text and visual features reference image may be compared with text and visual features of the comparison image to determine a text similarity score and a features similarity score. A confidence level indicating whether the business in the reference image is in the comparison image may then be determined using the text similarity score and the feature similarity score. According to the confidence level, the business information of the business may be updated.

Abstract: A CNF formula comprises at least one template clause representing a set of concrete clauses, each associated with a different temporal shift. The template clause is utilized by a SAT solver in determining satisfiability of the CNF formula. The template clause may be utilized to reduce amount of storage resources required for performing the satisfiability analysis. The template clause may in some cases increase feasibility of determining satisfiability. The template clause may in some cases reduce required time to determine satisfiability. The template clause may be utilized in incremental SAT solving to reuse deduced relations between literals that are applicable to additional cycles, such as invariants originating from a transition relation of a model.

Abstract: Aligned passages of text in different languages are displayed on an ebook reader. To provide a reference passage corresponding to a reading passage of an ebook, different-language instances of a same ebook are grouped together. The different-language instances of the ebook are created by human translation and include a reading-language instance and a reference-language instance. Corresponding passages in the different-language instances of the ebook are aligned and information describing a reference passage in the reference-language can be identified and sent in response to a request. The aligned passages of text in different languages may be used, for example, to assist users in comprehending the passage.

Abstract: According to an embodiment, a method, system and computer program product of providing a user with a transportation mode transition location is provided. The method begins with monitoring movement of a mobile device associated with the user using a first transportation mode. Based on monitoring of the movement of the mobile device associated with the user, determining that the user has made a transition from the first transportation mode to a second transportation mode. An estimated location of the transition location is stored. Finally, the estimated location of the transition is provided to the user.

Abstract: A method to solve a template SAT problem associated with a bounded model that is modeled checked, said method comprising: receiving the template SAT problem, the template SAT problem comprising a plurality of clauses including a template clause that represents a plurality of concrete clauses each associated with a different temporal shift, the template clause is associated with a literal; determining a value of the literal in a cycle based on the template clause and a temporal shift, said determining comprises: determining a concrete clause of the plurality of concrete clauses based on the template clause and the temporal shift; determining a new template clause based on at least two clauses; determining a deduced clause based on at least the value of the literal in the cycle; deducing a solution to the template SAT problem; and outputting the solution.

Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.

Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.

Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.

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: A proof of unsatisfiability associated with a bounded model may be extended to apply to another bounded model having a larger bound. In some exemplary embodiments, an unbounded model may be proved using one or more such extensions. A proof may be reordered in order to decrease its size and increase the productivity of systems that utilize it. The proof may be reorder by a natural temporal order of cycles.

Abstract: An UNSAT core may be reused during iterations of a bounded model checking process. When increasing the bound, signals corresponding to signals within the UNSAT core may be used to represent the functionality of the model during cycles between the original bound and the increased bound. In case, consecutive unsatisfiability is determined in respect to different bounds, the same UNSAT core may be reused instead of computing a new UNSAT core.

Abstract: A CNF formula comprises at least one template clause representing a set of concrete clauses, each associated with a different temporal shift. The template clause is utilized by a SAT solver in determining satisfiability of the CNF formula. The template clause may be utilized to reduce amount of storage resources required for performing the satisfiability analysis. The template clause may in some cases increase feasibility of determining satisfiability. The template clause may in some cases reduce required time to determine satisfiability. The template clause may be utilized in incremental SAT solving to reuse deduced relations between literals that are applicable to additional cycles, such as invariants originating from a transition relation of a model.

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 proof of unsatisfiability associated with a bounded model may be extended to apply to another bounded model having a larger bound. In some exemplary embodiments, an unbounded model may be proved using one or more such extensions. A proof may be reordered in order to decrease its size and increase the productivity of systems that utilize it. The proof may be reorder by a natural temporal order of cycles.

Abstract: A method for simplifying resolution proofs in DAG format where each leaf node represents a clause and each internal node represents a resolution between its children includes representing a SAT proof as a stripped proof, analyzing pivots to identify redundant resolutions, and constructing a simplified proof without the redundant resolutions.

Abstract: A method comprising representing an association between a first entity and a first environment as a first edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said first environment; and assigning a first weight value or type to the first edge based on an association level detected between the first entity and the first environment.

Abstract: A method for monitoring associations between a plurality of entities comprises representing a relationship between a first entity and a second entity as an edge that connects a first node to a second node, wherein the first node and the second node respectively represent said first entity and said second entity; and assigning a weight value to said edge based on an association level detected between the first entity and the second entity.

Abstract: A Voice User Interface is provided for interactively responding in a synthesized voice to a call from a human caller, a Text to Speech system by which text entered by an agent and interactive data are converted to synthesized speech, a morphing transformation library containing pre-computed voice transformation parameters unique to each agent affiliated with the VUI, and a switching system for transferring handling of the call between the VUI and the agent. The human agent's verbal interaction with the caller is performed in the agent's natural voice. Text transmitted by an agent to a caller and interactive data is in a synthesized voice created using the pre-computed transformation parameters corresponding to the agent's ID selected from the morphing transformation library. All speech presented to a caller is presented in approximately the same unique voice as initially presented when the call is established, thereby permitting an aurally seamless phone call, as perceived by the caller.

Abstract: A system for clustering Boolean functions for clock gating according to various exemplary embodiments can include a computer configured to identify 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; perform 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; assign to each gating domain a merit value according to a power consumption profile of the gating domain using a merit function; and partition the cluster into gating groups using the dendrogram to construct a directed acyclic graph to determine a partition which maximize the overall power saving.