Abstract: Embodiments of the present invention are directed at methods and systems for providing a partial personalization process that allows for more efficient and effective personalization of a application on a communication device. For example, personalization profiles associated with multiple versions of the application may be stored at a provisioning system and the provisioning system may determine the appropriate partial provisioning information to update the application for each migration notification. Partial personalization information that is to be updated for the updated version of the application may be generated and installed to enable new functionality and/or update the information contained within an updated application without requiring re-personalization of all personalized information.

Abstract: A mobile terminal and a preinstalled application management method for a mobile terminal, where storage space of the mobile terminal includes at least one directory, and an installation package of at least one preinstalled application is stored in the at least one directory. The method includes starting the mobile terminal; scanning the at least one directory; and installing the installation package of the at least one preinstalled application in the at least one directory to generate a preinstalled application having user-level permission. Using the method and the mobile terminal, a preinstalled application can be uninstalled.

Abstract: In one embodiment, a method includes continuously receiving time-series data for end-user transactions occurring on one or more monitored systems. The method further includes continuously processing and storing the time-series data in a plurality of virtual machines. In addition, the method includes, responsive to a determined time-series-data burst, spawning one or more temporary virtual machines. Moreover, the method includes, during the determined time-series-data burst, continuously processing and storing the time-series data in the plurality of virtual machines and in the one or more temporary virtual machines. The method also includes, responsive to a determined conclusion of the determined time-series-data burst, causing the one or more temporary virtual machines to transition to a passive state in which the one or more temporary virtual machines cease processing and storing new time-series data but make previously-stored time-series data available for access.

Abstract: An impact analysis-based task redoing method using an impact analysis calculation apparatus and a one-click resetting apparatus includes receiving an impact analysis request, where the impact analysis request includes a source procedure identifier, an impact start time, and an impact end time; obtaining a dependency list and a procedure information list of a source procedure according to the source procedure identifier; obtaining a period of the source procedure and a period of a target procedure according to the source procedure identifier and the target procedure identifier in the dependency list; obtaining, according to the period of the source procedure, the period of the target procedure, the impact start time, and the impact end time, a procedure instance list corresponding to each procedure identifier included in the procedure instance list; and sending the procedure instance list and the procedure information list.

Abstract: An integrated development environment displays a diagram that indicates relationships between code elements navigated by a user. The diagram provides a visualization of the navigation history of the user to allow the user to understand the code structure and flow of a program. A navigation history engine extracts the navigation history, generates the diagram, and displays the diagram adjacent to code displayed by a code editor.

Abstract: In one example of the disclosure, code lines for a software program are received, the code lines including a unit of code lines. Code entities within the unit are identified. Each code entity includes a line or consecutive lines of code implementing a distinct program requirement or defect fix for the program. Context changes are identified within the unit, each context change including an occurrence of a first code line set implementing an entity, adjacent to a second code line set implementing another entity, within a same code scope. A code complexity score is determined based upon counts of entities identified and context changes identified within the unit, and upon counts of code lines and entities within the program.

Abstract: Systems and methods are provided for allowing end users to intuitively databind functional components to backend services through visual affordances. Each UI component can advertise which sections of the UI can be independently databound to individual properties coming from data of backend services. When the user wishes to databind a UI component, the sections of the UI that can be databound now transforms to show relevant text describing the function of that particular section. The user can be presented with a databinding interface that consistent of all the possible pieces of data that the user can bind to as well as visual slots that map to the slots in the visual preview. To databind a component, a user can drag and drop the particular piece of data from the available list, and drop that into the slot they want that data to apply to.

Abstract: A method to quantify compliance of a software snippet having a plurality of code lines includes generating an OpsHash fingerprint of the software snippet, dividing the software snippet OpsHash fingerprint into a first group containing one or more OpsHash fingerprint based on context code lines, and a second group containing one or more OpsHash fingerprint based on operation-on-context code lines, applying a probably approximate matching algorithm to the first group, generating context cardinality sets from the OpsHash fingerprints of the first group, quantifying a match between each of the context cardinality sets and at least one of a governing definition and a rule/technique definition, ranking the OpsHash fingerprints of the first group based on the quantifying match, and incorporating software snippets having an OpsHash fingerprint ranking above a predetermined threshold into a software application. A system to implement the method and a non-transitory computer-readable medium are also disclosed.

Abstract: Recording a replay-able trace of execution of an executable entity using cache data includes executing one or more threads of the executable entity concurrently across one or more processing units of the one or more processors. During execution of the one or more threads, a separate replay-able trace is recorded for each thread independently. Recording includes, for each thread, recording initial processor register state for the thread. Recording also includes, for each thread, and upon detecting a processor data cache miss, recording at least one line of cache data imported into the processor data cache. Recording also includes recording the occurrence of at least one event by recording its side effects.

Abstract: Recording a replay-able trace of execution of an executable entity using cache data includes executing one or more threads of the executable entity concurrently across one or more processing units of the one or more processors. During execution of the one or more threads, a separate replay-able trace is recorded for each thread independently. Recording includes, for each thread, recording initial processor register state for the thread. Recording also includes, for each thread, and upon detecting a processor data cache miss, recording at least one line of cache data imported into the processor data cache.

Abstract: Disclosed aspects include receiving a stream of tuples to be processed by a plurality of processing elements operating on a set of compute nodes. A determination is made to retrieve an application bundle from a second compute node. The determination is made by a first compute node based on a set of application bundle data. The application bundle is installed on the first compute node by the first compute node. Using the application bundle on the first compute node, the stream of tuples is processed. In embodiments, the application bundle is retrieved by the first compute node in response to determining to retrieve the application bundle from the second compute node.

Abstract: Disclosed aspects include receiving a stream of tuples to be processed by a plurality of processing elements operating on a set of compute nodes. A determination is made to retrieve an application bundle from a second compute node. The determination is made by a first compute node based on a set of application bundle data. The application bundle is installed on the first compute node by the first compute node. Using the application bundle on the first compute node, the stream of tuples is processed. In embodiments, the application bundle is retrieved by the first compute node in response to determining to retrieve the application bundle from the second compute node.

Abstract: Techniques for automated bug detection. A set of inputs are collected and a snapshotting feature is used to apply each input to a test application. Outputs from the test application are gathered and compared to determine whether the outputs are associated with bugs. Comparison can be done with one or more of many different techniques that quantify difference between outputs associated with test inputs and outputs associated with a “happy path input.” Outputs can be grouped together based on these quantifications and the groups can be used to identify outputs most likely to be associated with bugs. The output groups may also be used to group associated inputs to the set of inputs to be used for testing in the future. When a bug is identified, a report could be automatically generated that includes a scoring value as well as recorded output information and could be presented to a user.

Abstract: A method and an apparatus for updating an application are provided. An electronic device activates an automatic update of an installed application, designates the application as one group of one or more groups distinguished according to an update period. The electronic device controls to update the application after a time point of an update period corresponding to the designated group.

Abstract: The present disclosure discloses methods to update portals (100) comprising a first portlet (105) and plural second portlets (110). The method comprises the reception by the first portlet (105) of a first update instruction (160) and the transmission by the first portlet (105) of a second update instruction (165) to each of the plural second portlets (110), the sent second update instruction (165) being the same for each second portlet (110). Then, the method comprises the reception by each of the plural second portlets (110) of the second update instruction (165), and, for each second portlet (110), the processing of the second update instruction (165) according to a predetermined update configuration (135.3, 135.4, 135.5) of the respective second portlet (110), to accept or reject an update of this second portlet (110), according to the second update instruction (165), depending on the predetermined update configuration (135.3, 135.4, 135.5).

Abstract: Technologies are provided for non-monotonic eventual convergence for desired state configuration. One class of problem in DSC is that, in some situations, DSC cannot move forward toward a desired state without first moving further from the desired state. For example, an executable file providing a service that needs to be replaced with a newer version, but that is currently executing (i.e., in the desired state of “operating”), cannot be replaced with the newer version without first being stopped. But stopping the service moves in the wrong direction relative to the desired state, which is to have the service operating. This moving away from the desired state so as to be able to move closer to the desired state is a problem for conventional DSC systems that results in failures. The solution to this problem is herein referred to as “non-monotonic eventual convergence” or “NMEC”.

Abstract: In an approach for testing a software application on a target system, a computer provides a test framework being executed on a test framework system, the system being coupled with the target system via network and receives a test scenario by the test framework, the scenario including information regarding a software application to be tested, the target system on which said software application should be executed and regarding one or multiple protocols supported by the target system. The computer interprets information included in said scenario by said test framework and deriving properties associated with at least one software application to be generated based on said information interpretation. The computer then generates an executable software application in a programming language, said application being adapted to the target system by using said derived software application properties. The computer triggers execution of said application thereby obtaining test results, and evaluates said results.

Abstract: An application name modification method, said method comprising: selecting a target application and, by means of a preset application inlet, modifying the application name of the selected target application; obtaining original information regarding the selected target application, and linking together and storing the obtained original information regarding said target application and the modified new application name. Additionally disclosed are an application name modification device and a computer-readable storage medium.

Abstract: A computing system comprises, in one example, a display system configured to generate user interface displays, a first application configured to define an entity in the computing system, an interface component configured to control a second application to generate a notebook component corresponding to the entity, and an association component configured to generate and store an association between the entity and the notebook component. The first application is configured to control the display system to generate a first application user interface display that displays data for the entity in the first application and includes a user input mechanism corresponding to the notebook component in the second application based on the association.

Abstract: A computer implemented method of refactoring software code to optimize execution performance by consolidating shared resources accesses, comprising: receiving target code containing code entries accessing shared resource(s); automatically creating a dependency record for each shared resource. The dependency record describes dependencies among the code entries accessing shared data items in the shared resource(s); identifying, based on the dependency record, a resource access point for each shared resource(s), wherein the resource access point is located in an execution path of the target code to precede code entries which use the shared data item(s) and follows code entries which define the shared data item(s); automatically refactoring the target code to group together code entries which use the shared data item(s), wherein the group is placed following the resource access point to consolidate shared resource accesses of the code entries to the shared resource(s); and outputting the refactored target code.