Abstract: The present disclosure relates to applying entity analytics to a natural language-based search engine. According to one embodiment, a search query having at least a first term is received. One or more second terms having a relationship to the first term is identified based on prior search queries. The relationship indicates that the first term has been observed with the second term in the prior search queries on at least a specified number of occasions over a specified duration. One or more predictive suggestions for completing the search query is generated. Each predictive suggestion includes at least the first term or an identified equivalent of the first term and at least one of the one or more second terms.

Abstract: The present disclosure relates to applying entity analytics to a natural language-based search engine. According to one embodiment, a search query having at least a first term is received. One or more second terms having a relationship to the first term is identified based on prior search queries. The relationship indicates that the first term has been observed with the second term in the prior search queries on at least a specified number of occasions over a specified duration. One or more predictive suggestions for completing the search query is generated. Each predictive suggestion includes at least the first term or an identified equivalent of the first term and at least one of the one or more second terms.

Abstract: A computer-implemented method of detecting memory that may be reclaimed from application data objects that are no longer in use. When at least a first virtual memory region is newly committed for heap block storage, a pre-leak detection scan of other virtual memory regions can be performed to identify at least one non-pointer data item in the other virtual memory regions, the non-pointer data item comprising data that corresponds to an address of a memory location within the first virtual memory region, but that is not a memory pointer. A leak detection scan can be performed to identify potential memory pointers, wherein the identified non-pointer data item is excluded from the identified potential memory pointers. A list of leaked heap blocks can be output. Each leaked heap block can exclusively comprise memory locations that do not have a corresponding potential memory pointer.

Abstract: Method, system, and computer program products, implementing and using techniques for processing data representing observations of entities. An anonymized key is generated. The anonymized key represents a spacetime region with which an entity is associated. The spacetime region represents a spatial region and a time interval. The entity is associated with the spacetime region based on spacetime coordinates for the entity.

Abstract: A method of analyzing a computer program under test (CPUT) using a system comprising a processor and a memory can include performing, by the processor, static analysis upon the CPUT and runtime analysis upon at least a portion of the CPUT. A static analysis result and a runtime analysis result can be stored within the memory. Portions of the CPUT analyzed by static analysis and not by runtime analysis can be determined as candidate portions of the CPUT. The candidate portions of the CPUT can be output.

Abstract: A first plurality of processors of a plurality of nodes receives an observation from a second plurality of processors of the plurality of nodes, wherein the observation includes data representing an observed entity. The second processors access a persistent data store based, at least in part, on the observation. The first processors determine one or more features of the observed entity. The second processors access the persistent data store based, at least in part, on the determined features of the observed entity. The first processors select a candidate entity based, at least in part, on the observed entity. The first processors determine a relationship between the candidate entity and the observed entity. The first processors determine a resolved entity by resolving, by the first plurality of processors, the observed entity. The second processors access the persistent data store based, at least in part, on the resolved entity.

Abstract: A method of analyzing a computer program under test (CPUT) using a system comprising a processor and a memory can include performing, by the processor, static analysis upon the CPUT and runtime analysis upon at least a portion of the CPUT. A static analysis result and a runtime analysis result can be stored within the memory. Portions of the CPUT analyzed by static analysis and not by runtime analysis can be determined as candidate portions of the CPUT. The candidate portions of the CPUT can be output.

Abstract: An embodiment of the present invention utilizes the abilities of an operating system to manage the window focus while debugging a graphical user interface program. In an example, a debugger program intercepts a breakpoint in the code of a graphical user interface computer program undergoing automated testing by a separate computer program. The debugger program instructs the operating system to save states of the window focus. Responsive to determining the breakpoint condition has ended, the debugger program instructs the operating system to restore saved states of the window that had focus prior to the breakpoint condition. Another embodiment of the present invention arranges similar window focus management where an operating system on its own is unable to save and restore states of the window that had focus prior to the breakpoint condition.

Abstract: A computer-implemented method of performing runtime analysis on and control of a multithreaded computer program. One embodiment of the present invention can include identifying threads of a computer program to be analyzed. With a supervisor thread, execution of the identified threads can be controlled and execution of the identified threads can be monitored to determine a status of the identified threads. An indicator corresponding to the determined status of the threads can be output.

Abstract: Method, system, and computer program products, implementing and using techniques for processing data representing observations of entities. An anonymized key is generated. The anonymized key represents a spacetime region with which an entity is associated. The spacetime region represents a spatial region and a time interval. The entity is associated with the spacetime region based on spacetime coordinates for the entity.

Abstract: Method, system, and computer program products, implementing and using techniques for processing data representing observations of entities. An anonymized key is generated. The anonymized key represents a spacetime region with which an entity is associated. The spacetime region represents a spatial region and a time interval. The entity is associated with the spacetime region based on spacetime coordinates for the entity.

Abstract: Systems and methods of enhancing computing performance may provide for detecting a request to acquire a lock associated with a shared resource in a multi-threaded execution environment. A determination may be made as to whether to grant the request based on a context-based lock condition. In one example, the context-based lock condition includes a lock redundancy component and an execution context component.

Abstract: Methods for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for determining a relationship score between a first entity and a second entity. A first computer-readable representation of a first spatial region containing the first entity is generated. A second computer-readable representation of a second spatial region containing the second entity is generated. The first computer-readable representation and the second computer-readable representation are compared at decreasing resolutions until a matching condition is reached. A relationship score is assigned to one or more of the first entity and the second entity based on the resolution at which the matching condition is reached.

Abstract: Methods for processing motion paths for physical entities. For each physical entity among several physical entities, several representations are received of positions of the physical entity. In response to detecting that a number of physical entities among the physical entities traverse a similar motion path, a path record is generated, which represents the motion path traversed by the number of physical entities.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for detecting astronomical objects. An image frame is received, which includes representations of one or more astronomical objects. The received image frame is divided into several swaths. One or more swaths are selected, which include full or partial representations of one or more astronomical objects. Each of the one or more swaths and each astronomical object represented within the one or more swaths can be designated by a base-limit pair. The base-limit pairs for the selected one or more swaths are compared with base-limit pairs for one or more corresponding swaths using a difference algorithm. A list of differences in the base-limit pairs is created.

Abstract: An embodiment of the present invention utilizes the abilities of an operating system to manage the window focus while debugging a graphical user interface program. In an example, a debugger program intercepts a breakpoint in the code of a graphical user interface computer program undergoing automated testing by a separate computer program. The debugger program instructs the operating system to save states of the window focus. Responsive to determining the breakpoint condition has ended, the debugger program instructs the operating system to restore saved states of the window that had focus prior to the breakpoint condition. Another embodiment of the present invention arranges similar window focus management where an operating system on its own is unable to save and restore states of the window that had focus prior to the breakpoint condition.

Abstract: A computer-implemented method of performing runtime analysis on and control of a multithreaded computer program. One embodiment of the present invention can include identifying threads of a computer program to be analyzed. With a supervisor thread, execution of the identified threads can be controlled and execution of the identified threads can be monitored to determine a status of the identified threads. An indicator corresponding to the determined status of the threads can be output.

Abstract: Systems and methods of enhancing computing performance may provide for detecting a request to acquire a lock associated with a shared resource in a multi-threaded execution environment. A determination may be made as to whether to grant the request based on a context-based lock condition. In one example, the context-based lock condition includes a lock redundancy component and an execution context component.

Abstract: Systems and methods of enhancing computing performance may provide for detecting a request to acquire a lock associated with a shared resource in a multi-threaded execution environment. A determination may be made as to whether to grant the request based on a context-based lock condition. In one example, the context-based lock condition includes a lock redundancy component and an execution context component.