Abstract: Implementations described herein relate to providing suggestions, via a display modality, for completing a spoken utterance for an automated assistant, in order to reduce a frequency and/or a length of time that the user will participate in a current and/or subsequent dialog session with the automated assistant. A user request can be compiled from content of an ongoing spoken utterance and content of any selected suggestion elements. When a currently compiled portion of the user request (from content of a selected suggestion(s) and an incomplete spoken utterance) is capable of being performed via the automated assistant, any actions corresponding to the currently compiled portion of the user request can be performed via the automated assistant. Furthermore, any further content resulting from performance of the actions, along with any discernible context, can be used for providing further suggestions.

Abstract: Implementations described herein relate to providing suggestions, via a display modality, for completing a spoken utterance for an automated assistant, in order to reduce a frequency and/or a length of time that the user will participate in a current and/or subsequent dialog session with the automated assistant. A user request can be compiled from content of an ongoing spoken utterance and content of any selected suggestion elements. When a currently compiled portion of the user request (from content of a selected suggestion(s) and an incomplete spoken utterance) is capable of being performed via the automated assistant, any actions corresponding to the currently compiled portion of the user request can be performed via the automated assistant. Furthermore, any further content resulting from performance of the actions, along with any discernible context, can be used for providing further suggestions.

Abstract: Implementations described herein relate to providing suggestions, via a display modality, for completing a spoken utterance for an automated assistant, in order to reduce a frequency and/or a length of time that the user will participate in a current and/or subsequent dialog session with the automated assistant. A user request can be compiled from content of an ongoing spoken utterance and content of any selected suggestion elements. When a currently compiled portion of the user request (from content of a selected suggestion(s) and an incomplete spoken utterance) is capable of being performed via the automated assistant, any actions corresponding to the currently compiled portion of the user request can be performed via the automated assistant. Furthermore, any further content resulting from performance of the actions, along with any discernible context, can be used for providing further suggestions.

Abstract: A mechanism for declarative service domain federation uses a declarative approach to both the visibility aspect and the management aspect of service domain federation. Instead of manually exporting services, that is, selecting individual services from source domains to be visible in the target domain, using the present system, a federation architect uses a federation console to specify federation intent. The federation intent may include federation rule, query-based service group, and quality-of-service (QoS) policy. Based on the declared federation intent, a planning engine resolves the individual services based on the group query, generates the service visibility configuration, and creates the necessary service proxies and/or mediation objects to satisfy the goal. At runtime, a service monitor collects the performance metrics of federated services and dynamically adjusts the mediation/proxy configurations to maintain the QoS objectives specified by the federation architect.

Abstract: A computer implemented method of dynamically analyzing a data flow of a dynamic language program to determine access rights to data items, comprising: 1) Executing a dynamic language program. 2) During the execution, each of a plurality of data items is stored in a data wrapper that further contains a metadata record indicative of one or more characteristics of a respective data item. 3) Receiving a request from a process of the dynamic language program to access one or more requested data items of the plurality of data items. 4) Determining whether the process is allowed to access the one or more requested data item according to an analysis of a classification of the process compared to the one or more characteristics indicated by the metadata record associated with each of the one or more requested data items. 5) Generating a response to the process according to the determination.

Abstract: A computer implemented method of dynamically analyzing a data flow of a dynamic language program to determine access rights to data items, comprising: 1) Executing a dynamic language program. 2) During the execution, each of a plurality of data items is stored in a data wrapper that further contains a metadata record indicative of one or more characteristics of a respective data item. 3) Receiving a request from a process of the dynamic language program to access one or more requested data items of the plurality of data items. 4) Determining whether the process is allowed to access the one or more requested data item according to an analysis of a classification of the process compared to the one or more characteristics indicated by the metadata record associated with each of the one or more requested data items. 5) Generating a response to the process according to the determination.

Abstract: A mechanism for declarative service domain federation uses a declarative approach to both the visibility aspect and the management aspect of service domain federation. Instead of manually exporting services, that is, selecting individual services from source domains to be visible in the target domain, using the present system, a federation architect uses a federation console to specify federation intent. The federation intent may include federation rule, query-based service group, and quality-of-service (QoS) policy. Based on the declared federation intent, a planning engine resolves the individual services based on the group query, generates the service visibility configuration, and creates the necessary service proxies and/or mediation objects to satisfy the goal. At runtime, a service monitor collects the performance metrics of federated services and dynamically adjusts the mediation/proxy configurations to maintain the QoS objectives specified by the federation architect.

Abstract: A mechanism for declarative service domain federation uses a declarative approach to both the visibility aspect and the management aspect of service domain federation. Instead of manually exporting services, that is, selecting individual services from source domains to be visible in the target domain, using the present system, a federation architect uses a federation console to specify federation intent. The federation intent may include federation rule, query-based service group, and quality-of-service (QoS) policy. Based on the declared federation intent, a planning engine resolves the individual services based on the group query, generates the service visibility configuration, and creates the necessary service proxies and/or mediation objects to satisfy the goal. At runtime, a service monitor collects the performance metrics of federated services and dynamically adjusts the mediation/proxy configurations to maintain the QoS objectives specified by the federation architect.

Abstract: Computerized methods for providing one or more memory values present in memory during execution of a procedure to be automatically available to an asynchronous callback executed later. The methods comprise receiving a code containing procedures, the procedures having input parameters to be executed as asynchronous callback procedures. The methods further comprise replacing the procedures in the code with wrapper procedures, where the wrapper procedures comprise instructions for storing one or more memory values, storing the asynchronous callbacks of the input parameters, replacing each of the input parameters with a wrapper callback, the wrapper callback comprising instruction for restoring the memory values and executing the asynchronous callbacks. The methods further comprise executing the original procedures.

Abstract: Computerized methods for providing one or more memory values present in memory during execution of a procedure to be automatically available to an asynchronous callback executed later. The methods comprise receiving a code containing procedures, the procedures having input parameters to be executed as asynchronous callback procedures. The methods further comprise replacing the procedures in the code with wrapper procedures, where the wrapper procedures comprise instructions for storing one or more memory values, storing the asynchronous callbacks of the input parameters, replacing each of the input parameters with a wrapper callback, the wrapper callback comprising instruction for restoring the memory values and executing the asynchronous callbacks. The methods further comprise executing the original procedures.

Abstract: A method for controlling a flow rate of multiple data flows at a network node on a path of the data flows includes the following steps. A private restriction token bucket (RTB) and a private guarantee token bucket (GTB) for each of the data flows and a shared token bucket (STB) common to all of the data flows are provided. n tokens are obtained from the RTBi for the data flow i when a message belonging to the data flow i arrives at the node and needs n tokens. An attempt is made to obtain n tokens from the GTBi for the data flow i and/or the STB. The message is transmitted if n tokens are obtained from the GTBi and/or from the STB, otherwise transmission of the message is delayed until n tokens are available in the GTBi and/or in the STB.

Abstract: An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and relay a subset of the data that is not according to an expected value. The expected value may be determined based on a forecasting function computed based on past data. The expected value may be a spatial shape in an n-dimension space. A data not within the spatial shape may be considered not in accordance with the expected value. In some case, the spatial shape is defined by a centroid and a radius. The spatial shape may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of spatial shapes of each group over time.

Abstract: A method of managing traffic over a communication link between a transmitting node and a receiving node is provided herein. The method includes: determining momentary traffic shaping constraints; accumulating incoming messages at the transmitting node into a data queue, based on the momentary traffic shaping constraints; transmitting the messages from the data queue to the receiving node over the communication link based on the momentary traffic shaping constraints; estimating a desired amount of data that needs to be discarded from messages in the data queue, based on: (a) the size of the data queue and (b) the momentary traffic shaping constraints; sorting data in the data queue by an order of importance, based on analytic objects; discarding, based on the analytic objects, the desired amount of data from the messages in the queued data, such that the discarded data is ranked lowest by the order of importance.

Abstract: An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and aggregate the data according to groups of child nodes. The aggregation provides for a reduced version of the data. The reduction is performed based on groups determined by clustering. The reduced version of the data comprises data describing a group of measurements over time, such as a centroid in an n-dimension space, number of customers in the group, radius of the group and the like. The centroid may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of centroids of each group over time.

Abstract: A method for controlling a flow rate of multiple data flows at a network node on a path of the data flows includes the following steps. A private restriction token bucket (RTB) and a private guarantee token bucket (GTB) for each of the data flows and a shared token bucket (STB) common to all of the data flows are provided. n tokens are obtained from the RTBi for the data flow i when a message belonging to the data flow i arrives at the node and needs n tokens. An attempt is made to obtain n tokens from the GTBi for the data flow i and/or the STB. The message is transmitted if n tokens are obtained from the GTBi and/or from the STB, otherwise transmission of the message is delayed until n tokens are available in the GTBi and/or in the STB.

Abstract: A method of adaptive differential propagation of Simple Object Access Protocol (SOAP) messages is provided herein. The method includes the following stages: classifying incoming SOAP messages according to at least one of: structure, content, and context thereof; selecting a corresponding template out of a plurality of templates for each classified SOAP message such that the selected template minimized a specified diff function applied to the classified SOAP message and the selected template; applying the specified diff function to the SOAP message and the selected template to yield a respective delta; and encapsulating a template identifier with the respective delta, wherein the template identifier is uniquely associated with the selected template, to yield an outgoing SOAP message.

Abstract: A distributed method that combines both flow control and smart volume reduction means in a communication network is provided herein. The stages of the method are applied by each node in the network in a distributed way, which adapts to the evolving state of the system. The operations performed by each node in the network are adapted dynamically in a way that adjusts itself to the changes that occur in various parameters of the network. Such parameters include both local node state and also the state of different nodes in the distributed infrastructure. The state of the nodes is characterized by parameters such as transmission rates, available buffer space and the state of data in buffer. The stages are carried out in parallel by the nodes and ordered such that the equality of the data flowing in the network, in terms of delay and specified attributes, is maximized.

Abstract: A method for instrumenting a computer-based software application, the method including instrumenting instructions of a computer-based software application, the instructions being in a first computer instruction language, with a native handler referencing instructions in a second language, and creating the instructions referenced by the native handler in the second computer instruction language to carry out at least one task during the execution of the computer-based software application.

Abstract: A mechanism for declarative service domain federation uses a declarative approach to both the visibility aspect and the management aspect of service domain federation. Instead of manually exporting services, that is, selecting individual services from source domains to be visible in the target domain, using the present system, a federation architect uses a federation console to specify federation intent. The federation intent may include federation rule, query-based service group, and quality-of-service (QoS) policy. Based on the declared federation intent, a planning engine resolves the individual services based on the group query, generates the service visibility configuration, and creates the necessary service proxies and/or mediation objects to satisfy the goal. At runtime, a service monitor collects the performance metrics of federated services and dynamically adjusts the mediation/proxy configurations to maintain the QoS objectives specified by the federation architect.

Abstract: A method, system and computer program product for transmitting data entities, the method includes: receiving data entities to be transmitted over multiple channels; and preventing a transmission of data entities that are to be transmitted over congested channels while transmitting data entities that are to be are to be transmitted over non-congested channels.