Abstract: A method and apparatus for digital rights management (DRM) with steps and means for receiving a registration request from one of a plurality of DRM agent devices requesting to register one of a plurality of user accounts and the one DRM agent device to one of a plurality of rights issuers, completing a registration process in the one rights issuer, including establishment of a relationship among the one user account, the one DRM agent device and the one rights issuer; and returning a registration completion response to the one DRM agent device. The invention provides support to the many-to-many relationships among DRM entities, such as DRM agent device, user account and rights issuer, so that the DRM system can be applied to more business modes.

Abstract: A system and method to build feature evolution models for existing applications (“apps”) in the market based on open app data repositories). A feature evolution model of an app depicts the app name, its historical versions (historical version labels, release timestamps of each version), rating values of each version, and structured features (e.g., umbrella features and low-level features) each version introduces, improves or deletes. There is further extracted from the app description and release logs the app name, historical version labels, release timestamps, use the rating info of the app to extract and assign rating values for each version of the app, and apply NLP techniques and source code analysis techniques to extract “structured features” of the app through analyzing the app description, the release logs, and corresponding source code revisions of the app. Upon the built feature evolution models, various feature insights may be easily extracted and generated.

Abstract: A method and apparatus for digital rights management (DRM) with steps and means for receiving a registration request from one of a plurality of DRM agent devices requesting to register one of a plurality of user accounts and the one DRM agent device to one of a plurality of rights issuers, completing a registration process in the one rights issuer, including establishment of a relationship among the one user account, the one DRM agent device and the one rights issuer; and returning a registration completion response to the one DRM agent device. The invention provides support to the many-to-many relationships among DRM entities, such as DRM agent device, user account and rights issuer, so that the DRM system can be applied to more business modes.

Abstract: A method for generating a tree map for tree map visualization includes obtaining node information of a plurality of nodes to be processed, the plurality of nodes to be processed being sub-nodes sharing a same parent node and the node information comprising at least sizes of the nodes; determining from the plurality of nodes a plurality of candidate nodes whose sizes are less than a threshold size; determining at least one super node including the plurality of candidate nodes based on the node information of the determined plurality of candidate nodes, a screen size, and the threshold size, such that when displaying in a zooming-in mode the super node on the screen, all candidate nodes in the super node are displayed at display sizes not less than the threshold size; and determining data required for displaying the tree map based on the determined super node.

Abstract: A method for generating a tree map for tree map visualization includes obtaining node information of a plurality of nodes to be processed, the plurality of nodes to be processed being sub-nodes sharing a same parent node and the node information comprising at least sizes of the nodes; determining from the plurality of nodes a plurality of candidate nodes whose sizes are less than a threshold size; determining at least one super node including the plurality of candidate nodes based on the node information of the determined plurality of candidate nodes, a screen size, and the threshold size, such that when displaying in a zooming-in mode the super node on the screen, all candidate nodes in the super node are displayed at display sizes not less than the threshold size; and determining data required for displaying the tree map based on the determined super node.

Abstract: Aspects of the present invention generally relate to a system, method, and computer program product for transforming APIs from legacy system-of-record to new system-of-engagement using complete API process logic. API candidates are generated from execution traces for transforming the API from the legacy system to a new system of record. An embodiment of the invention is first, add implementers into a legacy systems and collect the instrumenter output as execution traces. Second, rank the execution traces and find the most frequent execution traces. Third, consolidate the execution traces by merging common trace segments. The codes covered by the consolidated execution traces will be considered as candidate API components. Fourth, expand the merged execution traces and find related execution traces and check the connectivity between different nodes.

Abstract: Technical solutions to automate alert remediation are described. One aspect includes a method that includes receiving a plurality of alerts from an application monitoring system, the plurality of alerts associated with a plurality of remediation procedures respectively. The method also includes selecting a subset of alerts from the plurality of alerts. The method also includes identifying a subset of remediation procedures corresponding to the subset of alerts and analyzing compliance, with a service level agreement, of an execution of the entire subset of remediation procedures. In response to the execution of the entire subset of remediation procedures being non-compliant, the latest alert that was added, is removed from the subset of alerts, and a remediation procedure corresponding to the latest alert is removed from the subset of remediation procedures. The method includes executing the entire subset of remediation procedures.

Abstract: Technical solutions to automate alert remediation are described. One aspect includes a method that includes receiving a plurality of alerts from an application monitoring system, the plurality of alerts associated with a plurality of remediation procedures respectively. The method also includes selecting a subset of alerts from the plurality of alerts. The method also includes identifying a subset of remediation procedures corresponding to the subset of alerts and analyzing compliance, with a service level agreement, of an execution of the entire subset of remediation procedures. In response to the execution of the entire subset of remediation procedures being non-compliant, the latest alert that was added, is removed from the subset of alerts, and a remediation procedure corresponding to the latest alert is removed from the subset of remediation procedures. The method includes executing the entire subset of remediation procedures.

Abstract: Method and systems for tagging code include building a code structure based description unit association model (CDAM) that associates code units with respective description units and organizes the code units in a hierarchical structure. The CDAM is filtered to remove un-meaningful description units through cross-validation between code units. Feature tags are generated based on a weighted sum of term frequencies in the description units of the CDAM to associate features with respective code units.

Abstract: Embodiments of the present invention may evaluate a conflict risk between parallel projects. According to one embodiment of the present invention, a dependency risk between a first project and a second project is determined based on an artifact submission history of a historical project. Then an overlap risk between the first and second projects is determined based on time schedules of the first and second projects. Next, a conflict risk between the first and second projects is evaluated based on the dependency risk and the overlap risk. Further, embodiments of the present invention may optimize the time schedules of parallel projects thereby enabling parallelization of projects.

Abstract: Embodiments of the present invention may evaluate a conflict risk between parallel projects. According to one embodiment of the present invention, a dependency risk between a first project and a second project is determined based on an artifact submission history of a historical project. Then an overlap risk between the first and second projects is determined based on time schedules of the first and second projects. Next, a conflict risk between the first and second projects is evaluated based on the dependency risk and the overlap risk. Further, embodiments of the present invention may optimize the time schedules of parallel projects thereby enabling parallelization of projects.

Abstract: Integration of personalized traffic information is provided. Contextual information for a client device is collected. Based, at least in part, on the contextual information, traffic information is received. The traffic information is received from one or more broadcast stations to which the traffic information has been mapped based, at least in part, on classification of the traffic information. A communications device is caused to communicate the traffic information.

Abstract: A fine-grained behavior model matching based method and system for effective feature location in large legacy systems. A feature behavior analyzer extracts internal behaviors of a feature under requesting based on NLP techniques or writing rules of the feature specification and generates a feature behavior model. A method uses multiple information sources associated with each method under analyzing to generate an expressive behavior signature for each method. The method integrates control flow information of each method and the signature information of its callees, and generates a CFG-based behavior model. A feature location identifier identifies and ranks the feature-related code locations based on a similarity between the feature behavior and the code behavior models.

Abstract: Analyzing task associations may compute artifact associations for a plurality of artifacts based on historical task submission logs. From the computed artifact associations, shared artifacts that have artifact association with targeted artifacts that are associated with planned tasks, may be determined. Task association between the planned tasks may be identified based on the shared artifacts. Task associations may be analyzed to determine one or more of task assignment and task schedule for the planned tasks.

Abstract: A method for generating a tree map for tree map visualization includes obtaining node information of a plurality of nodes to be processed, the plurality of nodes to be processed being sub-nodes sharing a same parent node and the node information comprising at least sizes of the nodes; determining from the plurality of nodes a plurality of candidate nodes whose sizes are less than a threshold size; determining at least one super node including the plurality of candidate nodes based on the node information of the determined plurality of candidate nodes, a screen size, and the threshold size, such that when displaying in a zooming-in mode the super node on the screen, all candidate nodes in the super node are displayed at display sizes not less than the threshold size; and determining data required for displaying the tree map based on the determined super node.

Abstract: A fine-grained behavior model matching based method and system for effective feature location in large legacy systems. A feature behavior analyzer extracts internal behaviors of a feature under requesting based on NLP techniques or writing rules of the feature specification and generates a feature behavior model. A method uses multiple information sources associated with each method under analyzing to generate an expressive behavior signature for each method. The method integrates control flow information of each method and the signature information of its callees, and generates a CFG-based behavior model. A feature location identifier identifies and ranks the feature-related code locations based on a similarity between the feature behavior and the code behavior models.

Abstract: A method for generating a tree map for tree map visualization includes obtaining node information of a plurality of nodes to be processed, the plurality of nodes to be processed being sub-nodes sharing a same parent node and the node information comprising at least sizes of the nodes; determining from the plurality of nodes a plurality of candidate nodes whose sizes are less than a threshold size; determining at least one super node including the plurality of candidate nodes based on the node information of the determined plurality of candidate nodes, a screen size, and the threshold size, such that when displaying in a zooming-in mode the super node on the screen, all candidate nodes in the super node are displayed at display sizes not less than the threshold size; and determining data required for displaying the tree map based on the determined super node.

Abstract: A mechanism is provided for optimizing web page pre-loading. Source codes of a web page file are analyzed to generate a module dependency graph that describes load dependency relationships between respective modules in the web page file. A load flow graph that indicates load flows of respective modules in the web page file is generated based on the module dependency graph. The load flow graph and the module dependency graph are analyzed to determine pre-load sequences of respective modules in the web page file. A pre-load profile is then generated based on the determined pre-load sequences.

Abstract: A method and apparatus for digital rights management (DRM) with steps and means for receiving a registration request from one of a plurality of DRM agent devices requesting to register one of a plurality of user accounts and the one DRM agent device to one of a plurality of rights issuers, completing a registration process in the one rights issuer, including establishment of a relationship among the one user account, the one DRM agent device and the one rights issuer; and returning a registration completion response to the one DRM agent device. The invention provides support to the many-to-many relationships among DRM entities, such as DRM agent device, user account and rights issuer, so that the DRM system can be applied to more business modes.

Abstract: Analyzing task associations may compute artifact associations for a plurality of artifacts based on historical task submission logs. From the computed artifact associations, shared artifacts that have artifact association with targeted artifacts that are associated with planned tasks, may be determined. Task association between the planned tasks may be identified based on the shared artifacts. Task associations may be analyzed to determine one or more of task assignment and task schedule for the planned tasks.