Abstract: An extended ontology may be generated from an ontology such that one or more classes of the extended ontology is associated with a marker and input data may be received. Further, based on the extended ontology and the marker, a subgraph representation of the input data may be generated, where the subgraph representation omits a piece of information included in a first graph representation of the input data, and the subgraph representation includes a plurality of acyclic subgraphs. The acyclic subgraphs may be stored in one or more databases and an acyclic subgraph of the plurality of acyclic subgraphs may be provided as an input to an executable program, where the application of rules associated with the extended ontology by the executable program causes a cyclic graph to be generated from the acyclic subgraph such that the cyclic graph comprises a piece of information omitted from the acyclic subgraph.

Abstract: Graph-based computation includes accepting specification information for the graph-based computation, the specification information including a plurality of graph elements, and providing a visual representation of the specification information to a user. A visual representation of one or more groups of the graph elements is determined based on the accepted specification information, including determining a spatial extend of a spatial region for at least a first group of the one or more groups, wherein the spatial extent of the spatial region is determined based at least in part on a spatial extent of each graph element of a subset of graph elements including one or more graph elements in the first group and at least one graph element out of the first group. A visual representation of spatial regions for the one or more groups is presented in conjunction with the visual information of the specification information.

Abstract: Deployment of a modified service affects the functioning of other services that make use of the service. To address the problems that deployment of modified executable code can cause in other services, a dependency lock is placed on candidate code to prevent deployment until tests on the client services are successfully completed. Developers of client services that rely on a supplier service are enabled to place a dependency lock on the service. As a result, deployment of the supplier service is only allowed when tests of the client services complete successfully. The administrator of the service being deployed may control which other users are able to add dependency locks without giving those users other permissions such as the ability to modify the source code of the service, the ability to deploy the service, and the like.

Abstract: A method of loading project data comprising identifying project files with a project ID. The method includes determining a secondary project file is referenced in a primary project file. The method includes loading the project ID of the secondary and primary project files into a reference table. The primary project file project ID and the secondary project file project ID referenced in the respective primary project file are associated with one another in the reference table. The method includes receiving a query for the primary project files referencing a queried secondary project file. The method includes determining the project IDs of the primary project files in the reference associated with the project ID of the queried secondary project file. The method includes providing a results table including the primary project file project IDs associated with the queried secondary project file project ID in the reference table.

Abstract: A method for updating software components of a network subscriber of a network, in which a program code of the network subscriber has at least two manufacturer-specific blocks, and each of these manufacturer-specific blocks has at least one software component. Each manufacturer-specific block has a respective associated block field, the at least one software component of each manufacturer-specific block has a respective associated component field, and at least one of the block fields and/or at least one of the component fields stores a respective address of a source responsible for an update. An address of the source responsible for the update of the at least one software component is selected for the at least one software component of each manufacturer-specific block on the basis of the component field associated with this at least one software component and the block field associated with this respective manufacturer-specific block.

Abstract: Machines, systems and methods for deploying virtual machines (VMs), the method comprises maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicating arrival of the VM request to one or more hosts subscribing to the first message queue.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a data model definition defined using a human-readable syntax. The program further generates a machine-readable representation of the data model definition. Based on the data model definition, the program also generates a set of interfaces from the machine-readable representation of the data model definition. Each interface in the set of interfaces includes code specified in a programming language. The program further provides the set of interfaces to an integrated development environment (IDE) application for design-time implementation of the set of interfaces.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a data model definition defined using a human-readable syntax. The data model definition includes a set of annotated entity definitions. The program further generates a machine-readable representation of the data model definition. Based on the data model definition, the program also generates, for each annotated entity definition in the set of annotated entity definitions, an interface and an implementation class from the machine-readable representation of the data model definition. The program further provides the set of interfaces and the set of implementation classes to an integrated development environment (IDE) application for design-time implementation of the set of interfaces and the set of implementation classes.

Abstract: The boundary search test support device includes: a storage device that holds a plurality of input vectors; and an arithmetic device that executes a test by sequentially inputting the input vectors to a program generated by a neural network and acquiring output vectors which are test results, respectively generates, in a coordinate system which takes each of a predetermined plurality of elements among elements constituting the output vectors as a coordinate axis, a straight line in which the plurality of elements has a same value and a hyperplane in which a sum of values of the plurality of elements is taken as a predetermined value, and arranges a most antagonistic point and boundary vectors whose values of the elements rank higher than or equal to a predetermined ranking among the output vectors in the coordinate system, and outputs the coordinate system together with input vectors corresponding to the boundary vectors.

Abstract: A software quality determination apparatus includes: a bug detection rate calculator configured to calculate, for each test viewpoint, which is a viewpoint when a system is tested, a detection rate of a bug generated in a test of the test viewpoint; and a bug convergence determination unit configured to determine, for the each test viewpoint, the bug convergence of the test viewpoint depending on whether the calculated detection rate of the test viewpoint is equal to or smaller than a reference value, which serves as a reference of the detection rate of the test viewpoint after a test execution amount of the test viewpoint has reached an execution reference amount, which serves as a reference of the execution amount of the test viewpoint.

Abstract: Systems, methods, and devices for creating test and testing a plurality of touchscreen devices are described. The methods comprise creating a test script by recording the touch events performed on a touchscreen device by a technician. The method of recording touch events for later use as a test script is faster and requires less programming knowledge, compared to manually writing a test script. This is beneficial if a new test script is needed quickly because a technician can perform a desired touch sequence on a device recording the sequence and then distribute the recorded sequence to be played on a plurality of devices to be tested. The recorded sequence may include a plurality of sequential touch events. Additionally, the recorded sequence may include conditional statements used to determining the timing of simulating one of the touch events in the sequence.

Abstract: After first application software is installed, second application software is installed, and a shortcut for accepting a user operation on the application software is created.

Abstract: A method for incremental upgrade is provided. The method is used in a device and includes: receiving an incremental update package corresponding to an application, wherein the incremental update package at least includes an incremental and differential file and the size of a target-version file; obtaining idle resource of a memory in the device and a current-version file corresponding to the application; comparing the idle resource of the memory with a maximum upgrade resource requirement to choose an upgrade process for upgrading the application, wherein the maximum upgrade resource requirement is a capacity sum of the size of the current-version file, the size of the incremental and differential file, and the size of the target-version file; and restoring the target-version file according to the upgrade process, and installing the target-version file.

Abstract: Systems, methods, and computer-readable media are provided for a multi-tenant collaborative learning environment, where information from all tenants in a multi-tenant system is collected and used to provide individual tenants with code fixes and/or optimization recommendations based on the collected information. Other embodiments may be described and/or claimed.

Abstract: Embodiments described herein provide for a multi-process model to support compiling applications for multiple platforms. In one embodiment, applications designed for execution on a mobile platform can be ported to and/or compiled for execution on a desktop/laptop platform without requiring modification of the core program code of the mobile application. The mobile application is executed using a multi-process (e.g., two or more process) model in which the core mobile application program generates content that is displayed by a host process. The host process enables automatic translation of program calls to generate mobile user interface elements into program calls that generate user interface elements of the host platform. The translation can be performed using a multi-process (e.g., two or more process) model in which the core application program generates content that is displayed by a host process.

Abstract: Fine-grained parallelism within isolated object graphs is used to provide safe concurrent operations within the isolated object graphs. One example provides an abstraction labeled IsolatedObjectGraph that encapsulates at least one object graph, but often two or more object graphs, rooted by an instance of a type member. By encapsulating the object graph, no references from outside of the object graph are allowed to objects inside of the object graph. Also, the encapsulated object graph does not contain references to objects outside of the graphs. The isolated object graphs provide for safe data parallel operations, including safe data parallel mutations such as foreach loops. In an example, the ability to isolate the object graph is provided through type permissions.

Abstract: A method that includes obtaining, by an application executing on a computing system, a list of properties defining at least one property. The executing application writes an uncompiled class definition implementing a compiled interface and writes one or more properties of the compiled interface into the uncompiled class definition. The executing application writes the at least one property and at least one serialization attribute into the uncompiled class definition. The executing application causes the uncompiled class definition to be compiled, loads the compiled class definition, and creates an object by instantiating the compiled class definition. The object is serializable. The executing application may reflect on the compiled interface to obtain the one or more properties. Each of the one or more properties is strongly typed.

Abstract: An information handling system a processor receiving an open-standard format file describing code instructions of a Swagger custom API, the processor parsing the file to identify a first Swagger parameter object whose location is defined by a first Swagger path object, a memory for storing a first Swagger operation object and for storing a customized software integration application enabling electronic data exchange comprising a plurality of connector code sets, each of the connector code sets being associated with an integration modeling element selected to generate a customized integration flow model of the specific integration process, wherein the integration modeling element selected is a custom connector integration element associated with a custom connector code sets including the first Swagger operation object acting on the first Swagger parameter object, and the processor transmitting an executable run-time engine and the custom connector code set for execution at an execution location.

Abstract: In an SRCU environment, per-processor data structures each maintain a list of SRCU callbacks enqueued by SRCU updaters. An SRCU management data structure maintains a current-grace-period counter that tracks a current SRCU grace period, and a future-grace-period counter that tracks a farthest-in-the-future SRCU grace period needed by the SRCU callbacks enqueued by the SRCU updaters. A combining tree is used to mediate a plurality of grace-period-start requests concurrently vying for an opportunity to update the future-grace-period record on behalf of SRCU callbacks. The current-grace-period counter is prevented from wrapping during some or all of the grace-period-start request processing. In an embodiment, the counter wrapping is prevented by performing some or all of the grace-period start-request processing within an SRCU read-side critical section.

Abstract: A computer-implemented method for debugging an executable control flow graph that specifies control flow among a plurality of functional modules, with the control flow being represented as transitions among the plurality of functional modules, the computer-implemented method including: specifying a position in the executable control flow graph at which execution of the executable control flow graph is to be interrupted; wherein the specified position represents a transition to a given functional module, a transition to a state in which contents of the given functional module are executed or a transition from the given functional module; starting execution of the executable control flow graph in an execution environment; and at a point of execution representing the specified position, interrupting execution of the executable control flow graph; and providing data representing one or more attributes of the execution environment in which the given functional module is being executed.