Abstract: A real-time dialogue system that provides real-time transcription of the spoken text, with a sub-second delay by keeping track of word timings and word accuracy is provided. The system uses a grammar or a list of keywords to produce the transcripts by using a statistical language model. In addition, the system uses a deep neural network based I-vector system to constantly analyze the audio quality to assess and to identify additional metadata such as gender, language, accent, age, emotion and identity of an end user to enhance the response. The present invention provides a conversational dialogue system, to robustly identify certain specific user commands or intents, while otherwise allowing for a natural conversation, without switching between grammar based and natural language modes.

Abstract: Embodiments provide systems and methods for activating applications in a distributed asynchronous system based on detecting touches on a display. The system detects an input on a display. The input on the display may be, for example, from a human touch or a pointing device. An input state manager executes hit-testing on a visual tree to identify a selected view using the input on the display. The selected view is compared to an active view. A shell in the system is notified when the selected view does not match the active view. The input state manager is then notified if the selected view should be made a new active view. The system instructs an application activation service to activate an application associated with the selected view. An input state manager is notified when the application associated with the selected view has been made an active view.

Abstract: A system including a processor; and a memory having stored thereon computer program code that, when executed by the processor, controls the processor to: receive data indicative of a plurality of sequence diagrams; for each of the plurality of sequence diagrams, generate a corresponding architecture diagram by: identifying a plurality of participants within the sequence diagram, transforming each of the plurality of participants into a plurality of nodes, identifying a plurality of messages identifying at least one message participant, and transforming the identified plurality of messages by establishing a single edge between respective nodes of the plurality of nodes corresponding to message participants identified by one or more messages of the plurality of messages; and merge the corresponding architecture diagrams of each of the plurality of sequence diagrams to generate a master architecture diagram.

Abstract: According to at least one embodiment, a computer-implemented method for managing generic data is described. In one embodiment, a request may be received to customize the generic data. The generic data may be downloaded based at least in part on the request. The generic data may be customized for the computing device. The customized data may be installed on the computing device.

Abstract: In some examples, a second mobile device may receive, from a first mobile device, via a short-range radio connection with the first mobile device, at least a portion of application information for an application. For example, the application information may include saved application state information saved by the first mobile device. The second mobile device may install the application on the second mobile device, and the second mobile device may configure a state of the application on the second mobile device based on the saved application state information received from the first mobile device.

Abstract: Embodiments of the present invention provide a method and system for finding uninitialized variables outside the local scope. Initially, a source code of a program is received. The source code may include multiple functions. A checked scope is determined for at least one variable in the source code. The checked scope includes a local scope. Additionally, the local scope is accessed using at least one function call of the functions. Static analysis is run, covering the checked scope for the at least one variable in the source code. At least one inter-procedural dependency is identified to determine whether the at least one variable in the local scope is uninitialized. Responsive to determining that the at least one variable in the local scope is uninitialized the at least one variable is displayed to a user.

Abstract: An object of an in-memory object model created from markup language syntax is identified. The in-memory object model includes an element value that includes both a prefix part and a local value part. A determination is made that the element value, that includes both the prefix part and the local value part, does not have a corresponding data type definition within a schema specification used to define data types within the markup language syntax. A namespace resolver service is invoked using at least the prefix part of the element value. A valid namespace declaration of the prefix part is received from the namespace resolver service. The valid namespace declaration is associated with the prefix part as a namespace definition for the local value part of the element value.

Abstract: An object of an in-memory object model created from markup language syntax is identified. The in-memory object model includes an element value that includes both a prefix part and a local value part. A determination is made that the element value, that includes both the prefix part and the local value part, does not have a corresponding data type definition within a schema specification used to define data types within the markup language syntax. A namespace resolver service is invoked using at least the prefix part of the element value. A valid namespace declaration of the prefix part is received from the namespace resolver service. The valid namespace declaration is associated with the prefix part as a namespace definition for the local value part of the element value.

Abstract: A system creates and monitors virtual threads within a node.js application. Callbacks executing within an event loop for a node.js system are identified and may be traced. The callbacks are associated with a context, and resources associated with execution flow during each context may be identified. Callback registrations, callback calls, and callback completion messages may each be detected and recorded. Each registration, call, and completion message is associated with a virtual thread or other transaction identifier. The timing information for each virtual thread and other resource usage for each context may then be identified, stitched together for distributed transactions and reported to a user to provide more detail for node.js application processing.

Abstract: Aspects describe multiple interface support that provides dynamic switching between new and old interface revisions. A first interface application is selected from a set of alternative interface applications for an industrial automation system. Support for each interface application included in the set of alternative interface applications is provided. A second interface application is downloaded and associated with the first interface application. The second interface application is enabled during runtime. If needed, the second interface application can be selectively disabled and an operation resumed with the first interface application.

Abstract: A compilation system generates one or more energy windows in a program to be executed on a data processors such that power/energy consumption of the data processor can be adjusted in which window, so as to minimize the overall power/energy consumption of the data processor during the execution of the program. The size(s) of the energy window(s) and/or power option(s) in each window can be determined according to one or more parameters of the data processor and/or one or more characteristics of the energy window(s).

Abstract: A storage system according to certain embodiments includes a client-side signature repository that includes information representative of a set of data blocks stored in primary storage. During restore operations, the system can use the client-side signature repository to identify data blocks located in primary storage. The system can also use the client-side signature repository to identify multiple locations within primary storage where instances of some of the data blocks to be restored are located. Accordingly, during a restore operation of one client computing device, the system can source a data block to be restored to the client computing device from another client computing device that is in primary storage.

Abstract: A system and methods for validating input data acquired through an interactive or non-interactive source. The system includes a common definition of input validation rules, and the capability of validating input without committing the input to the system.

Abstract: Methods and systems for simplifying object mapping for user interfaces are described. Client requests can be accepted from the client computers to access a resource of an application dialogue language (ADL). The client requests can be distributed across participating back ends. Each client request can be evaluated by the ADL before an ADL result is returned. If a governor does not detect a violation, expressions can be analyzed to determine whether any expression can be calculated locally by the ADL to produce the ADL result. The ADL result can be associated to a logical object in order to minimize a representational gap between each client request and a physical object. The logical object can be converted to the physical object, and the physical object can be mapped to the relational database. A response to each client request can be produced based on the mapping between the physical object and the relational database.

Abstract: Two or more variables in a source code are determined. One or more variable groupings for the two or more variables are determined. A potential error for a variable of the two or more variables is determined based on the determined variable groupings.

Abstract: Provided is a process of merging data from feeds from multiple sources of computing device network activity data having heterogenous device identifier namespaces and device identifier to device mappings that change over time, the process including: accessing three or more sources of network activity log data from three or more different sources of network activity data, wherein: for each of the sources of network activity log data, based the respective network activity log data, updating a multi-namespace mapping that maps the external-namespace device identifiers to internal-namespace device identifiers in an internal namespace of a system configured to profile mobile computing devices based on logged network activity data of the mobile computing devices, wherein: the namespace mapping comprises a plurality of external-namespace-specific mappings each mapping a respective type of device identifier in a respective external namespace used in the network activity log data to one or more internal-namespace devic

Abstract: Provided is a parallel processing device whereby a plurality of single processes is efficiently and simply parallel processed by a plurality of processors. The parallel processing device includes: a first processor which executes, upon data which is included in data sets, a first program which defines a single process which is executed with the data as an input thereof, and outputs a first result; and includes a second processor which executes, upon the inputted data, a second program which defines a unit process and outputs a second result. A selection unit selects, based on a prescribed index which denotes either performance or function of the first processor and the second processor, a first partial set and a second partial set from the data set. A first processor control unit inputs into the first processor first data which is included in the first partial set. A second processor control unit inputs into the second processor second data which is included in the second partial set.

Abstract: The present disclosure provides a method and an apparatus for detecting a code change. The method includes adding a tag to a function to be changed in a source code, and compiling the source code to acquire, according to the tag, position information and relocation information of the function to be changed in the compiled source code. In embodiments of the present disclosure, a tag is added to a function to be changed, a source code is compiled into a binary file, and position information and relocation information of the function to be changed in the binary file are acquired by using the tag, so that in subsequent operations, a hot patch file modifies, according to the position information and the relocation information, the function to be changed in software.

Abstract: A computing device executes analytic source code published to it. A revision definition includes source code in a first programming language compiled using a first compiler. When the source code compilation is successful, the source code is parsed to define code elements, an integration function is generated, the integration function is compiled with the source code using a second compiler in a second programming language to define an executable, an entry point address to the generated integration function is retrieved from the defined executable, an incremented revision number and the entry point address are stored in a created revision data structure, and the created revision data structure is stored in a created module context data structure. The integration function maps first input and output parameters of the source code in the second programming language to second input and output parameters of the source code in the first programming language.

Abstract: It is provided a method and system for supporting imperative graphic queries on a relational database, the method comprising: parsing an imperative graphic query into operations of execution plans; translating operations of execution plans which are supported by the relational database into common table expression queries; and executing the translated common table expression queries on the relational database.

Abstract: A method comprises selecting at least a first data set and a second data set on which to apply a query. The method also comprises causing generating of a first cursor based and a second cursor based on a first application of the query on the first data set and a second cursor based on a second application of the query on the second data set. A third cursor based on a combination of a result set returned by the first cursor and second cursor is then generated in response to the query.

Abstract: A solution is proposed for implementing staging in computer programs and code specialization at runtime. Even when values are not known at compile time, many of the values used as parameters for a code section or a function are constant, and are known prior to starting the computation of the algorithm. Embodiments of the claimed subject matter propagate these values just before execution in the same way a compiler would if they were compile time constant, resulting in improved control flow and significant simplification in the computation involved.

Abstract: The present disclosure relates to automatically generating execution sequences from workflow definitions.

Abstract: A method of optimizing software source code, where the source code is for execution as compiled bytecode using a just-in-time compiler. The source code is compiled to generate corresponding compiled bytecode. The bytecode is then executed using a just-in-time compiler. Run-time optimization actions performed by the just-in-time compiler during execution of the bytecode are determined, and analyzed to determine corresponding optimization data for the source code.

Abstract: A mobile device includes a memory and a processor. The memory is configured to store a plurality of commands; the processor is configured to receive the commands and execute the following steps: receiving a function call and datum of a mobile application; determining if the received function call is a call to an predetermined application programming interface; determining if the received datum is labeled datum; and processing the received function call with a predetermined monitoring procedure when the received function call is the call to the predetermined application programming interface and the received datum is the labeled datum.

Abstract: A computer-implemented method is disclosed which detects a change in a set of data sources of a DSS, such as addition of a new data source, removal of an existing data source, or a schema change of an existing data source in the set. A first set of DSS updates for pending ETL jobs of an ETL engine of the DSS are automatically determined based on the change in the set of data sources. The method automatically updates, without canceling, the pending ETL jobs of the ETL engine based on the first set of DSS updates. A second set of DSS updates for a semantic layer of a BI engine of the DSS are automatically determined based on the change in the set of data sources and based on the first set of DSS updates. The semantic layer is automatically updated based on the second set of DSS updates.

Abstract: An instrumentation analysis system processes data streams by executing instructions specified using a data stream language program. A user interface allows users to specify data stream language programs. The user interface presents widgets to the user to specify various components of a data stream language program including a filter expression, an analytical function representing an aggregation or transformation, and so on. The user interface allows users to specify an expression based on results of previously specified data stream language programs. The instrumentation analysis system processes the data stream language programs specified by the user to generate a set of result data streams and plots the result data streams, for example, on a screen of a client device.

Abstract: Embodiments of the present invention disclose methods, systems, and program products for dynamically managing RESTful endpoints. In one embodiment, an application server provides dynamic management of RESTful endpoint, including the ability to re-use the same resource information for multiple endpoints across multiple routers, allowing for applications aliases or sharing routing capability between applications. Yet other embodiments of the present invention can provide a high availability application server system and/or failover support for routers and resources, as well as the ability to remotely add new containers and resources to the application server.

Abstract: A method including receiving on a server a request from a first provider to retrieve a configuration for a lookup order. The method also can include determining the configuration for the lookup order using the server based at least in part on whether the call to the first provider by the application is through the direct dependency relationship or through the transitive dependency relationship. The method further can include providing the configuration for the lookup order to the first provider. The method additionally can include receiving first information at the application that is based at least in part on the configuration for the lookup order. The method further can include providing second information for at least a portion of a web page that is based at least in part on the first information. Other embodiments are provided.

Abstract: A method and an apparatus that instructs a compiler server to build or otherwise obtain a compiled code corresponding to a compilation request received from an application are described. The compiler server may be configured to compile source codes for a plurality of independent applications, each running in a separate process, using a plurality of independent compilers, each running in a separate compiler process. A search may be performed in a cache for a compiled code that satisfies a compilation request received from an application. A reply message including the compiled code can be provided for the application, wherein the compiled code is compiled in direct response to the request, or is obtained from the cache if the search identities in the cache the compiled code that satisfies the compilation request.

Abstract: Embodiments of the present invention disclose methods, systems, and program products for dynamically managing RESTful endpoints. In one embodiment, an application server provides dynamic management of RESTful endpoint, including the ability to re-use the same resource information for multiple endpoints across multiple routers, allowing for applications aliases or sharing routing capability between applications. Yet other embodiments of the present invention can provide a high availability application server system and/or failover support for routers and resources, as well as the ability to remotely add new containers and resources to the application server.

Abstract: A method, system and program product for providing virtual configuration management for applications running in a virtual environment. A method is described that includes: receiving a request for application configuration information from a virtual machine for an application; retrieving a versioned configuration image for the application, wherein the versioned configuration image comprises formatted configuration information captured from a previously configured application; creating a configuration runtime instance from the versioned configuration image; and attaching the configuration runtime image to the virtual machine for the application.

Abstract: Various embodiments provide an interface between a Web browser's layout engine and a scripting engine. The interface enables objects from the layout engine to be recognized by a memory manager in the scripting engine and interact in a streamlined, efficient manner. In accordance with one or more embodiments, the interface allows browser layout engine objects to be created as objects that are native to the scripting engine. Alternately or additionally, in some embodiments, the native objects are further configured to proxy functionality between the layout engine and the scripting engine.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using a snapshot manifest when storing files in a data store. One of the methods includes computing first static analysis results for a current snapshot; requesting, from a data storage system, a manifest that includes a plurality of unique identifiers that each identify a corresponding second object of second static analysis results for a previous snapshot; determining, for each first object of the first static analysis results, a unique identifier for the first object; determining, for each first object of the first static analysis results, whether the unique identifier for the first object occurs in the manifest; generating a batch of first objects having unique identifiers that do not occur in the manifest; and providing, to the data storage system, the batch of first objects having unique identifiers that do not occur in the manifest.

Abstract: Various embodiments provide an interface between a Web browser's layout engine and a scripting engine. The interface enables objects from the layout engine to be recognized by a memory manager in the scripting engine and interact in a streamlined, efficient manner. In accordance with one or more embodiments, the interface allows browser layout engine objects to be created as objects that are native to the scripting engine. Alternately or additionally, in some embodiments, the native objects are further configured to proxy functionality between the layout engine and the scripting engine.

Abstract: A method for editing source code includes receiving a modification to the source code made by a user, determining whether the modification would change the semantics of the source code, and handling the modification depending on the result of the determining.

Abstract: Metadata-driven dynamic specialization may include applying a type erasure operation to a set of instruction in a generic class or to a method declaration that includes typed variables using an encoded form of an instruction or an argument to an instruction. The instruction may operate on values of the reference types and the argument may be a signature that indicates the reference types. The encoded form may be annotated to include metadata indicating which type variables have been erased and which reference types are the erasures of type variables. Additionally, the metadata may indicate that the instruction operates on values of, and that the argument indicates reference types that are erasures of, the type variables of the class (or method) declaration. Moreover, the encoded form of the instruction or argument may be used directly without specialization or transformation.

Abstract: A system and method are disclosed for intelligent grouping and presentation of search results. In embodiments, the present technology groups results into relevant categories, and presents the categorized results on a single screen or small set of screens. The most relevant results for each category may be displayed in graphical tiles that a user may select to view more details on the search results. Alternatively, a user may select, or pivot on, a category heading to get more results for a given category.

Abstract: A system extends functionality of Java architecture for XML (extensible markup language) binding, (JAXB). Represents non-generic elements of a markup language (for example, XML) document in an object oriented programming language (for example, Java). The elements are represented as objects in the programming language. Objects are changed in the programming language representation and the original markup language document is then updated with updated objects translated back as updated elements of the document. The entire document infoset is preserved.

Abstract: The present disclosure relates generally to the field of automatic conversion of sequential array-based programs to parallel MapReduce programs. In various examples, automatic conversion of sequential array-based programs to parallel MapReduce programs may be implemented in the form of systems, methods and/or algorithms.

Abstract: The present disclosure relates generally to the field of automatic conversion of sequential array-based programs to parallel MapReduce programs. In various examples, automatic conversion of sequential array-based programs to parallel MapReduce programs may be implemented in the form of systems, methods and/or algorithms.

Abstract: The insertion and processing of programming language code (e.g., C#) in SQL statements, and the dynamic compiling of the code to detect errors prior to statement execution. The SQL statement with arbitrary programming language code can then be executed concurrently as a query on a computer cluster. External libraries can be imported and the associated functionality leveraged from within a SQL statement. The programming language compiler performs checking at build time, rather than retuning an error during the statement execution against the cluster, a potentially costly proposition in both computing time and human resources.

Abstract: Embodiments provide systems and methods for activating applications in a distributed asynchronous system based on detecting touches on a display.

Abstract: A comparison system includes a memory including a first compiled version and a second compiled version of a target application, at least one processor, and a comparison engine, executing on the at least one processor. The comparison engine is configured to identify a method in the first compiled version, locate the method in the second compiled version, compare the method in the first compiled version to the method in the second compiled version, and providing an indication that the method is an altered method from the first compiled version to the second compiled version of the target application.

Abstract: A GUI screen may include text fields, and a first resource file includes text strings for the text fields. A text mapping file may be generated to include a module for each text string, with each module including a text string from the resource file and a text string identification. A first screenshot of the GUI screen may include an original first text string from s first module and an original second text string from a second module. Responsive to receiving user input of a new first text string, the first module may be updated with the new first text string, and a second screenshot of the GUI screen may be provided including the new first text string from first module and the original second text string from the second module. A second resource file may then be provided including the new first text string.

Abstract: A legacy application may be executed as a Web Service by receiving from a client application a request comprising application input data that includes target legacy program identifying information and a template identifier, loading the specified template, translating the input data into a data format compatible with the application, executing the application and translating the output data for transmission to the client application. The template corresponds to the legacy application and comprises metadata describing the application flow and the required input data and output data for the application.

Abstract: Systems, methods and computer program products are described herein for testing a system that is designed to optimize the execution of code within an application or other computer program based on profile data collected during the execution of such code. The embodiments described herein utilize what is referred to as a “profile data mutator” to mutate or modify the profile data between the point when it is collected and the point when it is used to apply an optimization. By mutating the profile data at this point, testing of a system for optimized code execution can be significantly more thorough. Furthermore, such profile data mutation leads to a more scalable and efficient testing technique for profile-guided systems for optimized code execution.

Abstract: Disclosed is a method of generating a structure comprising at least one virtual machine, the method comprising: obfuscating a first virtual machine source code, thereby yielding a first obfuscated virtual machine (OVM) source code; associating a processor identifier with the first OVM source code, thereby yielding a processor-specific first OVM source code; compiling the processor-specific first OVM source code, thereby yielding a processor-specific first OVM. Furthermore, a structure generated by said method is disclosed.

Abstract: A compiler for compiling a server application is disclosed wherein the server is configured to automatically generate an API (Application Programming Interface) for use is a client device. The API allows communication between the client device and the compiled server application.

Abstract: In one embodiment, a virtual storage system 200 may represent a file data set differently based on the activity being performed. The virtual storage system 200 may execute a runtime activity on a runtime format file 214 representing a file data set 212 on a virtual execution layer 220. The virtual storage system 200 may execute an interchange activity on an interchange format file 230 representing the file data set 232.