Abstract: Various embodiments of systems and methods for decentralized image management are described herein. The method includes generating, distributing, and retrieving images on peer-to-peer network. Request for generating an image is received. One or more components/layers of a to-be-generated image is identified. A layer is stored as a file. Files corresponding to the layers are packaged as an image file representing the image. The packaged image file and/or files of respective layers are distributed across the network, e.g., across a plurality of available nodes upon receiving a distribution command/request. When a request for retrieving the image is received, the nodes storing the one or more layers of the image are identified. The layers are retrieved from the identified one or more nodes. Using the retrieved one or more layers, the image is recreated/generated.

Abstract: Methods and system are disclosed that compress a dataset and optimize the dataset for searching data. In one aspect, based on attributes associated with a unified dataset, the dataset including sensor node identifier data, sensor node timestamp data and sensor measurement data are determined. A suffix tree algorithm may be executed to determine data compression logic to compress the dataset including the sensor node identifier data and sensor node measurement data. A sensor node timestamp data compression model may be executed to compress the dataset associated with the sensor timestamp data. The compressed datasets including the sensor node identifier data, the sensor node timestamp data and the sensor measurement data may be stored in an in-memory data store.

Abstract: A topology manager implemented on a data partition of a distributed computing system can be notified that a destination computing node in the distributed computing system is not responding to a communication request. Upon determining that the destination computing node is dead and/or has a loss of communication with one or more, and optionally a majority of other computing nodes in a plurality of computing nodes of the distributed computing system, the topology manager can retire the destination computing node and cause a load balancing of replicas of data partitions in the distributed computing system to compensate for loss of the retired computing node.

Abstract: Described is a system, method, and computer-implemented apparatus for deploying and updating toolkits in hybrid cloud-local development platforms. In one embodiment, a cloud based software development environment is connected with a local development environment, enabling the cloud based software development environment (cloud environment) to inquire into the toolkit versions installed on the local machine. Once missing or incompatible versions of toolkits are identified, the cloud environment uses the connector module to instruct the local machine to download and install the appropriate toolkit version. The connector may use any types of bi-directional communication channels, such as a browser plugin, a web server hosted on the local machine, web services, or the like.

Abstract: A recurrent neural network (RNN) is trained to identify split positions in long content, wherein each split position is a position at which the theme of the long content changes. Each sentence in the long content is converted to a vector that corresponds to the meaning of the sentence. The sentence vectors are used as inputs to the RNN. The high-probability split points determined by the RNN may be combined with contextual cues to determine the actual split point to use. The split points are used to generate thematic segments of the long content. The multiple thematic segments may be presented to a user along with a topic label for each thematic segment. Each topic label may be generated based on the words contained in the corresponding thematic segment.

Abstract: Embodiments include an event services modeling framework. The event services modeling framework includes an event services modeling editor that provides a user interface and mechanism for users to model and customize event flow configurations within a system and/or network. The user interface can be used to connect events with actions that will take place in response to the events. The system components and/or modules that need to receive the information from the events can then react and respond appropriately. Users can modify event configurations based on their own particular needs. the event services editor can be used for generating one or more event services models. The event services models may include events, conditions (rules) for processing the events, activities to be perform during event processing, subscriber modules defined for performing the activities during event processing, and a specified time for processing the events in each modeled event flow.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a request to perform a set of data processing units on a set of data. The set of data processing units are deployed on a computing system. The program further retrieves the set of data. The program also instructs a background user interface (UI) page to perform the set of data processing units on the set of data. The program further provides results from performing the set of data processing units on the set of data.

Abstract: In one embodiment, the present disclosure pertains to software testing. In one embodiment, a plurality of builds are generated from a plurality of branches of software code, where the plurality of builds are executable versions of the plurality of branches. Software tests are applied to the plurality of builds based on associated test filters to produce test results. Different builds may have different associated test filters to control which of the plurality of software tests are applied to an associated build. In one embodiment, software tests that did not pass for a particular build are recorded in the associated test filter for the particular build based on an association between the software test that did not pass and a particular runtime feature under test.

Abstract: Comments are flexibly bound to keyfigures of an in-memory database, through reference to dimension dependency table(s). An in-memory database engine creates a comment bound to a first tuple via a first comment table. The first tuple comprises a first dimension (e.g., Product). A user then requests a second tuple comprising a second dimension (e.g., Product Group) related to the first dimension. In response, the in-memory database engine references a dimension dependency table to determine dimension dependency information. Based upon that information, the engine transforms the comment to also be bound to the second tuple via a second comment table. The second tuple is then returned to the user together with the comment, even though the second tuple may not explicitly share dimensions with the first tuple. Embodiments may leverage the processing power and data proximity of the in-memory database engine, to efficiently transform comments by executing aggregation (e.g., join) operations.

Abstract: Techniques are provided for controlling an order-picking, rack-transporting robot. More specifically, the robot is controlled to select a minimized number of movable racks storing ordered products identified in one or more orders for product deliveries, while still ensuring that all ordered products are included.

Abstract: A system, method, and computer-readable medium, including receiving a user-supplied expression for which a definition is sought; generating, in response to reception of the user-supplied expression, at least one suggested definition specifying a meaning for the user-supplied expression, the at least one suggested definition being generated based on, at least in part, a knowledge base of metadata associated with a data set; presenting the at least one suggested definition, as at least one keyword, to a user; receiving, in response to the presentation, an indication of one user-selected keyword from the at least one suggested definition; defining the user-selected keyword by at least one value; and persisting the defined user-selected keyword with the at least one value in the knowledge base for the data set.

Abstract: A method comprises receiving by a control system a sequence of symbols, translating the received sequence of symbols into a batch of commands parsable by an electronic controller of the electromechanical medical device, sending the batch of commands from the control system to the electromechanical device, and causing by the electronic controller the electromechanical medical device to execute the batch of commands on the electromechanical medical device.

Abstract: A set of condition monitoring sensors may provide signals indicative of current conditions local at a user device (e.g., a smartphone). An alert recommendation platform may automatically analyze the signals and decision logic to generate an alert recommendation and output an alert signal. Responsive to the alert signal, a notification platform may automatically determine a set of potential support communication devices (e.g., other smartphones) based at least in part on a location associated with the user device and locations of the potential support communication devices. The notification platform may then arrange for at least some of the potential support communication devices to receive a support request message (e.g., nearby smartphones may receive notifications requesting support).

Abstract: Various embodiments of systems and methods to provide a knowledge driven solution inference are described herein. In one aspect, unstructured data is retrieved from one or more information sources. Data segments corresponding to a plurality of categories are identified in the extracted unstructured data by natural language processing. Further, the data segments are grouped into a plurality of data clusters based on scores between the data segments. The structured knowledge base is generated by linking the associated plurality of data clusters. The knowledge driven solution inference is provided based on the generated knowledge base.

Abstract: Structured exploration of available data provides insight allowing early detection/analysis of emerging issues. An in-memory database engine applies specialized information sources and filter criteria to an original data set to successively produce various exploration levels. Evidence relating to a particular exploration level (e.g., resulting data subset, metadata indicating chains of information sources/filter criteria) are stored at the user's instruction within an evidence package of the in-memory database. Information sources may be licensed from third parties, and may be present in the in-memory database. To improve computer performance, embodiments may delete results of previous exploration levels outside of the evidence package. Evidence from the evidence package may be displayed to afford insight into relationships between data subsets and an emerging issue. One structured exploration references a source of geographic information (e.g.

Abstract: Embodiments of the present disclosure pertain to reducing memory usage in software applications. In one embodiment, the present disclosure includes a computer implemented method comprising constructing a dynamic HTML component in a document object model by executing first source code of a scripting language, generating a static HTML component clone of the dynamic HTML component by executing second source code of the scripting language, replacing the dynamic HTML component with the static HTML component in the document object model by executing third source code of the scripting language, decoupling the dynamic HTML component by executing fourth source code of the scripting language, and deleting the dynamic HTML component from memory using a garbage collection process in a scripting engine.

Abstract: Embodiments of the present disclosure pertain to network based machine learning generated simulations. In one embodiment, the present disclosure includes a computer implemented method comprising sending first code comprising a programmable calculator from a server system to a client system across a network. A data request is sent to a database, the data request configured to retrieve data from the database comprising a plurality of fields and a target field. The retrieved data is processed using a machine learning algorithm to produce a weight for each field of the plurality of fields and a scoring data structure. The fields and the scoring data structure are sent to the client system across the network. A user selects values for the plurality of fields and the programmable calculator is configured based on the scoring data structure to generate a simulated value for the target field based on the user selected values.

Abstract: Representative implementations provide devices and techniques for automatically generating a skeleton of at least a portion of a web service application. The skeleton comprises a framework that may be modified as needed for a desired use, such as for a relational database backed application, for example. In one aspect, the framework includes a versatile model to support different validation methods and varied customization. Filter support allows a user to perform actions on and/or define rules for inputs. In another aspect, the skeleton is automatically activated in an in-memory database repository.

Abstract: A query is received by a database server from a remote application server that is associated with a calculation scenario that defines a data flow model including one or more calculation nodes including stacked multiproviders. Subsequently, the database server instantiates the calculation scenario and afterwards optimizes the calculation scenario. As part of the optimization, the calculation scenario is optimized by merging the two multiproviders. Thereafter, the operations defined by the calculation nodes of the optimized calculation scenario can be executed to result in a responsive data set. Next, the data set is provided to the application server by the database server.

Abstract: A query is parsed and positions of symbols of the query are determined. A parse tree including the positions of the symbols is generated based on the parsed query. The parse tree is sent to a DBMS optimizer. The parse tree is transformed into an optimizer tree. The optimizer tree includes the positions of the symbols of the query. Based on the optimizer tree, a query execution plan is generated for the execution of the query. The positions of the symbols of the query is copied from the optimizer tree into the query execution plan. The query execution plan is sent to a query execution engine. The query is executed in accordance with the query execution plan. When a runtime error is detected, an exception message associated with the runtime error is displayed. The error message includes an error code and the positions of the symbols of the query.