Abstract: A request is received from a deployer associated with an application to create an instance broker service instance. A request is received from the deployer to bind the instance broker service instance to the application. Instance broker credentials associated with the instance broker service instance are received and provided to the application. The application uses the instance broker credentials to access the instance broker service instance and determines whether to create a new service instance using the instance broker service instance.

Abstract: A system receives a request from an in-browser application for an authorization code, creates a session that re-directs the in-browser application to an authorization server, and receives the authorization code from the authorization server by way of the in-browser application. The system requests an access token from the authorization server and receives the access token from the authorization server. The system then receives a request from the in-browser application for a resource, uses the access token to request the resource from a third-party resource server, and returns the resource to the in-browser application.

Abstract: A horizontal toolbar presents a hierarchical path terminating at a currently-selected element, beginning at a root element, and including intermediate elements from a hierarchically-related subset of elements having parent-child relationships. A tree representation, provided simultaneously with the horizontal toolbar, includes nodes matching the elements included in the hierarchical path. The tree representation uses branches connecting adjacent parent-child nodes to indicate parent-child relationships and highlights a current node-of-interest in relation to other displayed nodes and matching the currently-selected element in the horizontal toolbar.

Abstract: Embodiments provide a checklist function integrated with a process flow model. The process checklist utilizes a semi-automated visual approach to cover processes specific to a user and/or enterprise. A model of the process is generated and stored, for example utilizing an input template in XML format and according to the Business Process Model and Notation (BPMN) standard. Next, instances corresponding to runs of the mapped processes are created. Various internal documents can be linked together within a process instance, thereby allowing enterprises to define different relationships between documents independent of product-wide implementation and database complexity. In some embodiments the process models may be accessed interactively in a What-You-See-Is-What-You-Get manner, without being machine executed. This allows for relatively loose process definition/modelling, fostering interpretation reliant upon user intuition.

Abstract: Described herein is a framework for collecting event related tweets. In accordance with one aspect of the framework, an initial set of keywords is constructed from a reference source. Tweets are collected from a messaging stream using the initial set of keywords for a first time window. The collected tweets are filtered to generate a candidate keywords set. The selected tweets of the candidate keywords set are grouped into a plurality of clusters. The clusters are classified into event related and non-event related clusters. The initial set of keywords is updated to obtain a new set of keywords.

Abstract: Methods and apparatus, including computer program products, are provided for optimizing information presentation. In one aspect, there is provided method, which may include receiving, by a monitoring engine, one or more messages sent from one or more runtime instances of a system being monitored by the monitoring engine; storing, by the monitoring engine, the received one or more messages; prioritizing, by the monitoring engine, the one or more runtime instances for presentation at a user interface view by determining, based on the received one or more messages, a rating for each of a plurality of categories associated with the one or more runtime instances; selecting, based on the prioritizing, information indicative of the state of the prioritized one or more runtime instances; generating a user interface view including the selected information; and displaying the generated user interface view. Related methods, systems, and articles of manufacture are also disclosed.

Abstract: A price calculator may receive a pricing request for at least one item, the at least one item priced in accordance with a pricing schema including a plurality of price components. The price calculator may include a parallel price calculator configured to retrieve a parallel calculation flow handling procedure corresponding to the at least one item and designating at least two price subcomponents common to the price components. The price calculator may then calculate the at least two price subcomponents for the price components in parallel, using the parallel calculation flow handling procedure.

Abstract: In one embodiment, the present disclosure pertains to dynamic display layout of electronic content. In one embodiment, content is displayed across a range of display sizes, where within certain ranges of display sizes, the content is scaled up or down in size, and across breakpoints the content is repositioned to optimize the presentation of the electronic content to a user. In one embodiment, widgets are associated with elements of a grid. The widgets define regions where content is displayed. The grid elements may be part of a page, where the width of different displays sets the page width, the size of the grid elements, and the size of the widgets and related content in the display.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program generates a plurality of background user interface (UI) pages. The program further receives a request for a layout page comprising a set of locations for presenting a set of visualizations. The program also instructs the plurality of background UI pages to process a subset of the set of visualizations. The program further presents the processed subset of the set of visualizations in the corresponding locations of the layout page.

Abstract: A technology for multi-objective optimization is provided. In accordance with one aspect, historical data and real-time data of a network of interest are provided in an integrated database. User input containing a problem to be solved and user preference for solving the problem is received. An optimization function is identified for generating at least one solution to the problem. The optimization function is identified based on the user preference. In response to identifying a single objective optimization function, the optimization function is initiated from a single objective optimization function library. In response to identifying a multi-objective optimization function, the optimization function is initiated from a multi-objective optimization function library. The optimization function retrieves the historical and real-time data based on the user preference for solving the problem. A result comprising at least one solution to the problem is provided.

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

Abstract: A modeling system for universal specification of user interfaces. The system provides a means for defining user interfaces, including highly complex and dynamic user interfaces, in a manner that is independent of any implementation context. The modeling system leads from a user-friendly visual representation of the user interface, through progressively detailed specifications of structural and behavioral aspects of the user interface parts, until a rigorous definition of the user interface in all its contexts of use is achieved. Using the information captured in the model, tools that automatically generate the fully working user interface code can be built.

Abstract: A framework for performing aggregation methods on hierarchical data objects is described herein. A data aggregation request is received, the request including a tree of nodes to aggregate, an aggregation method, and a filter criteria. A configuration table is used to identify previously generated aggregation hierarchies that correspond to the received request, and a mapping of attributes of the received nodes to attributes of the previously generated aggregation hierarchies. For each node in the tree of nodes, when a corresponding node in the previously generated aggregation hierarchy is identified, attribute values from the corresponding node are used to create a node in a target aggregation hierarchy. When a corresponding node does not exist, but corresponding child nodes do exist in the previously generated aggregation hierarchy, the aggregation method is applied to the corresponding child nodes and the result is used to create a node in the target aggregation hierarchy.

Abstract: Methods, systems, and computer-readable storage media for receiving a vocabulary that includes text data that is provided as at least a portion of raw data, the raw data being provided in a computer-readable file, providing word embeddings based on the vocabulary, the word embeddings including word vectors for words included in the vocabulary, clustering word embeddings to provide a plurality of clusters, each cluster representing an aspect inferred from the vocabulary, determining a respective association score between each word in the vocabulary and a respective aspect, and providing a word ranking for each aspect based on the respective association scores.

Abstract: A system includes determination, based on a plurality of rows of a table, where each of the plurality of rows associated with a respective row_id represents a respective a node of a hierarchy, row_id pairs of each parent node-child node pair of the hierarchy, execution, based on the row_id pairs, of a depth-first traversal of the hierarchy to sequentially add each row_id of the plurality of rows to a hierarchy index and receive a NODE value associated with the added row_id, and, for each of the plurality of rows, update of a row based on the NODE value associated with the row_id of the row.

Abstract: A system includes receiving a start of a path gesture and determining, via a processor, a decision point along the path gesture. At the decision point, a first command associated with a first dimension is displayed. In addition, at the decision point, a second command associated with a second dimension is displayed.

Abstract: In one embodiment, the present disclosure pertains to data import and reconciliation. In one embodiment, a location field is compared against alternative geo-descriptors to link the location fields to areaIDs and geospatial shapes. A similarity search is performed against unmatched location fields. In one example embodiment, a table is generated with unique location IDs, areaIDs, and metadata describing the results of the comparison.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a query for data from a client device. The program further generates a key based on the query for the data. The program also selects a cache service instance in a plurality of cache service instances. The program further sends the cache service instance the key and a request for a cached version of the data. The program also receives the cached version of the data from the cache service instance. The program further processes the query based on the cached version of the data. The program also sends a result set for the query to the client device.

Abstract: The present disclosure involves systems, software, and computer implemented methods for providing high speed communication between a sending system and a receiving system. One computer-implemented method includes determining, by a computer, that data is available for serialization using a pointer transfer; getting a data block of the data from a memory; getting metadata corresponding to the data block; writing an original address of the data block to a transport layer; writing the data block to the transport layer; determining that the data corresponding to the data block contains pointers; and adding a referenced data block to one or more data blocks to be transferred to a receiving system.

Abstract: In an example, a request is received from a runtime platform to run an instance of a software function. In response, instance code and instance data corresponding to the instance are loaded from a persistent storage, the instance code and instance data being stored together in the persistent storage. It is determined whether there is an indication that the instance code should be executed in a debug mode. In response to a determination that the instance code should be executed in the debug mode, source code is generated for the instance, based on the instance code, in a debug folder in the persistent storage; a runtime cache for the instance is invalidated; the source code for the instance is compiled into an executable file, the compiling including adding one or more breakpoints to the executable file; and the executable file is sent to the runtime platform for execution.