Abstract: A system for tracing transactions includes a system mapping engine configured to generate a multi-tier control point map based on source code and transaction data of one or more source systems; and a tracing engine configured to trace transactions across the one or more source systems based on the multi-tier control point map. The multi-tier control point map provides end-to-end transaction traceability.

Abstract: In accordance with an embodiment, described herein is a system and method for supporting patching in a multi-tenant application server environment. The system can associate one or more partitions with a tenant, for use by that tenant, wherein a partition is a runtime and administrative subdivision or slice of a domain. A patching process can take advantage of high-availability features provided by an application server clustering environment, to apply patches in a controlled, rolling restart, which maintains a domain's ability to operate without interruption, or with zero downtime. The process can be used to automate complex or long running tasks, including preserving an unpatched or prior version of an application server, application, or other software component for possible rollback, or providing automatic reversion in the event of an unrecoverable error.

Abstract: A system and method is disclosed for the combined analysis of transaction execution monitoring data and a topology model created from infrastructure monitoring data of computing systems involved in the execution of the monitored transactions. Monitored communication activities of transactions are analyzed to identify intermediate processing nodes between sender and receiver side and to enrich transaction monitoring data with data describing those intermediate processing nodes. The topology model may also be improved by the combined analysis, as functionality and services provided by elements of the topology model may be derived by the involvement of those elements in the execution of monitored transactions. The result of the combined analysis is used by an automated anomaly detection and causality estimation system. The combined analysis may also reveal entities of a monitored environment that are used by transaction executions but which are not monitored.

Abstract: Persistent storage may contain metadata actions and integration actions related to a remote service, wherein the remote service includes a remote service application programming interface (API) that provides access to structured data, and a metadata API that provides access to a schema of the structured data. Processors may be configured to: (i) generate and provide, for metadata action design graphical user interfaces (GUIs), options for specification of a metadata action, where the metadata action defines a metadata query to the metadata API, rules for parsing the schema, and a normalized format for the structured data; (ii) generate and provide, for integration action design GUIs, options for specification of an integration action, where the integration action defines a structured data query to the remote service API and an indication that the metadata action is to be used to represent a result of the structured data query in the normalized format.

Abstract: Techniques are provided for allocating shared computing resources using source code feature extraction and cluster-based training of machine learning models. An exemplary method comprises: obtaining a source code corpus with source code segments for execution in a shared computing environment; extracting discriminative features from the source code segments in the source code corpus; obtaining a trained machine learning model, wherein the trained machine learning model is trained using samples of source code segments from clusters derived from clustering the source code corpus based on (i) a term frequency metric, and/or (ii) observed values of execution metrics; and generating, using the trained machine learning model, a prediction of an allocation of resources of the shared computing environment needed to satisfy service level agreement requirements for source code to be executed in the shared computing environment.

Abstract: Example embodiments facilitate prioritizing the recycling of computing resources, e.g., server-side computing systems and accompanying resources (e.g., non-volatile memory, accompanying firmware, data, etc.) leased by customers in a cloud-based computing environment, whereby computing resources (e.g., non-volatile memory) to be forensically analyzed/inspected, sanitized, and/or updated are prioritized for recycling based on estimates of when the computing resources are most likely to require recycling, e.g., via background sanitizing and updating. Computing resources that are likely to be recycled first are given priority over computing resources that are more likely to be recycled later. By prioritizing the recycling of computing resources according to embodiments discussed herein, other cloud-based computing resources that are used to implement computing resource recycling can be efficiently allocated and preserved.

Abstract: An application program updating method, apparatus, system, medium and device. The application program updating method provides a method of debugging a to-be-updated program logic through a development mode of a hot-update supporting client to obtain an updated program logic, then issuing the updated program logic to a back-end, and acquiring update data from the back end through a product mode of the hot-update supporting client. This allows a front-end developer to write and update simply and quickly without an assistance of any back-end developers.

Abstract: Groups of architecturally connected files may incur and accumulate high maintenance costs as architectural debts. To quantify such debts, architectural debt, which is a term used herein, may be identified, quantified, measured, and modeled. A history coupling probability matrix for this purpose may search for architecture debts through the lens of 4 patterns of prototypical architectural flaws shown to correlate with reduced software quality. Further, a new architecture maintainability metric—Decoupling Level (DL)—measures how well the software can be decoupled into small and independently replaceable modules. The DL metric opens the possibility of quantitatively comparing maintainability between different projects, as well as monitoring architecture decay throughout software evolution.

Abstract: Systems and methods for creating a new entry in a hierarchical state data structure with object entries is disclosed. The method includes allocating a shared memory buffer for a new entry in a shared memory. A request to create the new entry for a child object in a hierarchical state data structure in the shared memory is received. The new entry is to span at least one shared memory buffer uniquely identifiable in a location of the shared memory. The child object is a logical representation of a state of a system. In response to a request for an allocation of a shared memory buffer within a region of the shared memory for the new entry, a location identifier corresponding to a location of a parent entry holding a parent object to the child object in the hierarchical state data structure of an allocated region is received. The child object is created in the shared memory buffer for the new entry, and the new entry is available for concurrent access by one or more readers of the shared memory.

Abstract: A method is provided for creating a directed graph. The method obtains an execution trace having a sequence of invocations of table transformations. Each invocation is classified as a call-with-object invocation or call-with-column invocation. The call-with-object invocation indicates that an invoked function has object IDs as at least one of input and output information. The call-with-column invocation indicates that the invoked function has column names as the at least one of input and output information. The method processes the trace to build the graph. Each node indicates an object or a column and each edge indicates data flow. The method performs, in response to all invocations being processed, an automated graph reduction process by eliminating given nodes indicating a respective object such that that every two nodes that connect with each other, via a respective one of the given nodes as an intermediate node, can keep the connection therebetween.

Abstract: A method and system for an application to load one or more files from a device (e.g., local disc of the device) rather than from a location outside of the device (e.g., a server) via a service worker. The service worker can communicate with one or more main JavaScript threads (e.g., clients) via one or more corresponding service worker bridges that communicates with one or more corresponding main JavaScript thread bridges that communication with the main JavaScript threads. The main JavaScript threads can communicate with the local disc of the device (e.g., native) to retrieve the one or more files and transmit them to the service worker such that the service worker can provide the one or more files to the application. In this manner, service workers can provide service with data stored in a memory of a computer device of a computer.

Abstract: A computer-implemented method (and corresponding system) is provided that enables or facilitates the execution of a portion of source code, written in a high-level language (HLL), on a blockchain platform. The method and system can include a blockchain compiler, arranged to convert a portion of high-level source code into a form that can be used with a blockchain platform. This may be the Bitcoin blockchain or an alternative. The method can include: receiving the portion of source code as input; and generating an output script comprising a plurality of op codes. The op codes are a subset of op codes that are native to a functionally-restricted, blockchain scripting language. The outputted script is arranged and/or generated such that, when executed, the script provides, at least in part, the functionality specified in the source code.

Abstract: The current document is directed to methods and systems that employ distributed-computer-system metrics collected by one or more distributed-computer-system metrics-collection services, call traces collected by one or more call-trace services, and attribute values for distributed-computer-system components to identify attribute dimensions related to anomalous behavior of distributed-computer-system components. In a described implementation, nodes correspond to particular types of system components and node instances are individual components of the component type corresponding to a node. Node instances are associated with attribute values and node are associated with attribute-value spaces defined by attribute dimensions. A set of call traces is partitioned, by clustering.

Abstract: A computer system includes an operating system, a memory coupled to the operating system, and a processor (e.g., an anti-debug processor) coupled to the operating system. The operating system receives, from a debug process, a request to create an essential debug object for attachment to a target process. The anti-debug processor scans a kernel memory of the operating system for the essential debug object and verifies a presence of the essential debug object in the kernel memory, and scans the kernel memory to identify a process that has stored in the kernel memory the essential debug object. The anti-debug processor then halts the debug process, without using an internal interface or function of the operating system, thereby preventing the debug process from attaching to the target process.

Abstract: A mechanism is provided for implementing a model update mechanism to update new models in real time while avoiding data loss and system downtime. Responsive to receiving a request to update a scorer model currently being executed by an existing worker thread in the data processing system, the model update mechanism initializing a new worker thread. The model update mechanism loads an updated scorer model into the new worker thread and initializes a state transfer from the existing worker thread to the new worker thread. The model update mechanism executes the updated scorer model such that the updated scorer model scores the input data. The model update mechanism then outputs a prediction based on the updated scorer model processing of the input data.

Abstract: A method and device for controlling an application, a storage medium, and an electronic device are provided. The method includes the following. For each of sampling time points in a historical period: an operation parameter of the electronic device corresponding to the sampling time point is obtained, where the operation parameter includes a foreground application, remaining electric quantity, screen-on duration, a charging connection state, and a network connection state; an attenuation parameter corresponding to the operation parameter is determined according to the sampling time point; at least one training sample is generated according to the sampling time point and the operation parameter. A predetermined Bayesian model is trained according to training samples generated and attenuation parameters determined. At least one background application of the electronic device is controlled according to the trained Bayesian model.

Abstract: A method, a system, and an article are provided for enabling communication between disparate computer languages. An example computer-implemented method includes: providing on a computing device (i) a first environment supporting a first computer language and (ii) a second environment supporting a second computer language different from the first computer language; providing an instance of an instantiated class definition as an object; accessing the object from both the first environment and the second environment; and deleting the object once a reference count indicates that the object is no longer being accessed by the first environment and the second environment.

Abstract: A combination programming environment using spreadsheets is described that supports stack based sequential program execution using spreadsheet cells supporting recursion, reentrancy, conditional blocks, loops and block based dependency execution using a virtual machine. This is achieved by partitioning cells in any sheet into named blocks and unnamed blocks that are executed using conditions. Named blocks can be arranged in a call sequence with a caller cell setting up a call to a callee named block using the name of callee block in caller cell formula.

Abstract: The current document is directed to methods and systems that carry out live migration of multi-node applications in distributed-computing systems, including cloud-computing applications in cloud-computing facilities. The disclosed methods and systems employ an installer/agent and a data-transformation component to install new versions of a multi-node application within a distributed computing system and to then warm start each application-provided service within the newly installed new-version application nodes. Following a data sync operation, each warm-started application service is brought online to service subsequently received service requests as older-version corresponding services of current application nodes complete request services and terminate, providing live migration from an older version multi-node application to a new-version multi-node application without service-provision interruption.

Abstract: Systems, apparatuses and methods may provide for technology that determines that a control loop is to be executed for an unspecified number of iterations and automatically forces the control loop to be executed for a fixed number of iterations in addition to the unspecified number of iterations, where execution of the control loop for the fixed number of iterations is conducted in parallel. In one example, the technology also removes one or more dataflow tokens associated with the execution of the control loop for the fixed number of iterations.