Abstract: A management method manages a plurality of devices provided in a structure, a server includes storage storing operation information related to a plurality of devices and time information of a time at which it is expected that no one is present. The method specifies, for each device, operation times at which an operation is performed, operation information, specifying in-structure-absence times when it is expected that no one is present, both in accordance with the time information. For each device, time differences for the specified operation times are calculated. For each device, a performed certain operation is a behavior pattern correlated to a behavior when the person continues being present when a ratio of a frequency of the calculated time differences regarding the corresponding device, which is lower than a particular value, is equal to or lower than an other value.

Abstract: A method may include deploying a plurality of container pods to a plurality of container nodes in a container environment. Each of the plurality of container pods may include one or more services. Each of the plurality of container nodes may include one or more container pods. The plurality of container pods may be deployed to the plurality of container nodes based on initial characterizations of usage factors for each of the plurality of container pods. The method may also include monitoring actual usage factors for each of the plurality of container pods after deployment to the plurality of container nodes; identifying one or more container pods in the plurality of container pods that deviate from their initial characterizations of usage factors; and redistributing the one or more container pods throughout the plurality of container nodes based on the actual usage factors.

Abstract: Aspects of the disclosure are directed to providing access to the contents of a computing platform definition. A computing platform definition includes entries indicating devices and executables to deploy to a computing platform. An orchestration engine is communicatively connected to a computing platform that implements the computing platform definition. An interface includes callable units that provide access to the computing platform definition which may be invoked by the orchestration engine during execution of a stage of an orchestration pipeline performed with respect to the computing platform. The interface receives from the orchestration engine a request indicating one of the callable units. In response to the request, the interface retrieves the portion of the computing platform definition that is associated with the callable unit indicated and provides that portion of the computing platform definition to the orchestration engine for use during execution of the stage of the orchestration pipeline.

Abstract: A workflow development system is described herein that includes a graphical user interface (GUI) that is configured to selectively and dynamically allocate relatively more of a display area to a particular one of a plurality of different, simultaneously-displayed workflow step representations than is allocated to the other workflow step representation(s) to facilitate user interaction the particular workflow step representation. Such allocation may be carried out in response to user interaction with the particular workflow step representation or in response to a determination that a user is otherwise focused on the particular workflow step representation. In embodiments, the workflow step representations represent different workflow steps in a series of workflow steps. In further embodiments, the workflow step representations represent different workflow steps that may be performed depending upon the evaluation of a condition.

Abstract: A patch generator for generating a patch that expresses a series of updates to a source image that will transform the source image into a target image. The patch generator compares sections of the target image, in turn, with respective versions of the source image. The patch generator generates the series of updates for the patch in dependence on the comparisons between the sections of the target image and the respective versions of the source image. Comparing each section of the target image with versions of the source image that are expected to be stored by the device during the process of implementing the patch allows the possibility that the device could change the source image in its memory while it implements the patch.

Abstract: A non-transitory computer readable-medium storing a compiler to cause a computer to perform processing for compiling sequence programs including a declaration of a global variable and generating an execution program to be executed by a PLC. When there is a change in a memory address in the PLC assigned to the global variable between before and after edit of a declaration of the global variable, the compiler gives an execution code to synchronize a first value stored at a memory address assigned to an unedited global variable with a second value stored at a memory address assigned to an edited global variable to an execution program corresponding to the sequence program that references the edited global variable.

Abstract: A data parallel pipeline may specify multiple parallel data objects that contain multiple elements and multiple parallel operations that operate on the parallel data objects. Based on the data parallel pipeline, a dataflow graph of deferred parallel data objects and deferred parallel operations corresponding to the data parallel pipeline may be generated and one or more graph transformations may be applied to the dataflow graph to generate a revised dataflow graph that includes one or more of the deferred parallel data objects and deferred, combined parallel data operations. The deferred, combined parallel operations may be executed to produce materialized parallel data objects corresponding to the deferred parallel data objects.

Abstract: A method and device for generating a stream of data that is representative of at least an algorithm (44) of a software as a medical device. To reach that aim, the method comprises designing (41) the at least an algorithm using first programming language items of a determined domain-specific language (DSL), which is obtained using a determined language workbench (LWB) environment. The method further comprises simulating (42) an executing of the at least an algorithm with a simulation environment obtained using second programming language items of the determined DSL, the simulating being implemented in the determined LWB environment; testing (43) the at least an algorithm with at least a test function written with third programming language items of the DSL, the testing being implemented in the determined LWB environment; and generating (440) the stream of data.

Abstract: A method including (i) displaying a first prompt by a terminal machine by running a terminal application, the terminal application comprising first computer-executable instructions and first code that conduct the terminal machine's portion of a dialogue sequence between the terminal machine and a service provider machine, the first code comprising information to be translated, (ii) receiving entry of first data at the first prompt, (iii) communicating information associated with the first data to a provider application at the service provider machine, the provider application comprising second computer-executable instructions and second code that conduct the service provider machine's portion of the dialogue sequence, wherein the second code comprises information to be translated, and (iv) receiving third code that replaces or supplements at least a portion of the first code to produce first updated code, the first updated code adapting the terminal application to conduct a modified dialogue sequence with the

Abstract: Approaches presented herein enable optimization of a cache of compiled XML Path Language (XPath) expressions by removing variability from XPath expressions. More specifically, XPath expressions are identified that are the same but for one or more hardcoded values. These hardcoded values are identified and replaced in an identified XPath expression with an identifier to form a cache optimized XPath expression that lacks the hardcoded value variability of the identified XPath expressions. This cache optimized XPath expression is inserted into a definition of a cache optimized function. The optimized XPath expression receives values as arguments of the cache optimized Xpath function and passes the received values to the variable identifier in the cache optimized XPath expression. The identified XPath expressions can then be rewritten as calls to the cache optimized function. Therefore, only the cache optimized XPath expression, instead of several of the identified XPath expressions, is stored in the cache.

Abstract: A bespoke protective sports equipment to be worn by a player engaged in a sporting activity is provided. The bespoke sports equipment system includes methods for acquiring, storing and processing a player's unique data, namely the anatomical features of the body part against which the bespoke equipment is worn. The systems also includes methods of using the player's unique data to manufacture the bespoke protective equipment with a custom formed internal padding assembly that substantially corresponds to the player's unique data. The system and method allows for the design and manufacture of bespoke protective sports equipment that is purposely designed and manufactured to match the anatomical specifications of the player's body part.

Abstract: According to an aspect of an embodiment, operations may include retrieving a set of repair patterns and a second set of violations of software programs. The operations may further include selecting an unfixed violation from the retrieved second set of violations and a repair pattern from the set of repair patterns. The operations may further include executing a first set of operations for refinement of repair patterns. The first set of operations may include applying the selected repair pattern on the selected unfixed violation, removing the applied repair pattern from the set of repair patterns based on the determination that a repair result corresponds to a violation. The first set of operations may further include reselecting next repair pattern as the selected repair pattern. The operations may further include obtaining a refined set of repair patterns by iteratively executing the first set of operations for the set of repair patterns.

Abstract: A computer-implemented method for migrating a monolithic legacy software system to a well-defined modular target software architecture includes selecting a method, based on predefined patterns, for transforming the software legacy software system; creating an abstract syntax tree from the legacy software system's source code; from the abstract syntax tree, determining a flow of the source code and any coding violations and coding smells in the legacy software system's source code; using the flow and the coding violations, identifying architecture issues in the legacy software system; scheduling tasks for transforming the legacy software system into the target software architecture; automatically generating new source code according to the target software architecture; and automatically and autonomously refactoring the new source code.

Abstract: A system is described inkling a cache memory and a hardware processor. The hardware processor to determine that at least one of additional data storage capacity and additional processing capacity are needed based on data processing requests of a plurality of computerized query sources to be executed by an execution platform comprising a plurality of nodes, where the data processing requests are directed to database data stored on a plurality of shared storage devices collectively storing the database data. The hardware processor further to increase, in response to the determining, an amount of the data cached by the execution platform by adding one or more nodes to the plurality of nodes.

Abstract: A method may include initiating a static analysis of code including a first function, detecting, in the first function and by the static analysis, an indirect call to a second function whose identity is unknown until the code is executed, detecting, in the code, a conditional block including a first instruction sequence and a second instruction sequence, determining, by the static analysis, that the first instruction sequence sets a value that identifies the second function, and adding the value to a called function list for the code.

Abstract: A method for automatically updating source code in a first source code branch using a pull request is disclosed. The method includes: displaying a pull request user interface associated with the first source code branch, the pull request user interface comprising a code change suggestion including an original line of source code to be changed and a new line of source code to replace the original line of source code; receiving user input to accept the code change suggestion; propagating the source code change to the first source code branch such that an original line of source code in the first source code branch is replaced with the new line of source code; and upon successfully propagating the source code change to the first source code branch, updating the pull request user interface to indicate that the code change suggestion is applied and the pull request is modified.

Abstract: System, methods, and other embodiments described herein relate to determining performance overhead for instrumentation within a program. In one embodiment, a method includes, in response to compiling the program from source code into machine code, analyzing the program to generate overhead scores associated with segments of instrumentation within separate functions of the program. The instrumentation is combined with the source code to provide functionality in addition to a base functionality of the program. The method includes selectively modifying the segments in the source code for the separate functions according to whether the overhead scores for respective ones of the segments satisfies an instrumentation threshold associated with respective ones of the separate functions.

Abstract: Querying resource lifetime using a trace of program execution. An embodiment includes identifying a query expression targeted at least a portion of the trace of program execution. The query expression specifies at least (i) a data object representing a plurality of events identified in the trace, each event associated with one or more attributes relating to resource lifetime, and (ii) one or more conditions matching the one attributes relating to resource lifetime. In response to receiving the query expression, the query expression is processed based at least on an analysis of an identified subset of the trace. Based on processing the query expression, a result data set that includes or identifies at least one of the plurality of events that meets the one or more conditions is presented.

Abstract: The disclosure relates to a method, terminal and storage medium for starting software. A method for starting software carried out in an electronic apparatus includes: configuration information, which is information for configuring a starting acceleration mode adopted for starting target software, is acquired; a starting acceleration level of the target software is determined according to the configuration information; at least one of a number of prefetching operations and number of files prefetched in each prefetching operation corresponding to the determined starting acceleration level is acquired; starting files of the target software are opened and data in the target software is prefetched into a memory in each prefetching operation according to the at least one of the determined number of prefetching operations and number of files prefetched in each prefetching operation; and the target software is started according to the data prefetched into the memory.

Abstract: The computer system executes environment classification of classifying a plurality of subsystems, each being a physical or virtual computer system, into one or more environment groups being one or more groups. The computer system stores classification result data which is data representing a relationship between the environment group and the subsystems belonging to the environment group. The computer system selects, from the classification result data, the environment group to which the subsystem having undergone a problem belongs. The computer system generates a reproduction subsystem which is a virtual subsystem virtually reproducing the subsystem for each of the subsystems belonging to the selected classification result group. The computer system applies the countermeasure to at least one reproduction subsystem for the purpose of verifying the countermeasure for the problem.