Abstract: Provided is a process for producing a copolymer of diallyldialkylammonium salt and a maleic acid which copolymer is free of residual monomers and polymerization initiator and hence stably exhibits excellent performances in various uses, and the process comprises polymerizing a monomer mixture comprising diallyldialkylammonium salt and maleic acid in the presence of persulfate as a radical polymerization initiator in water or a polar solvent, and completion of the polymerization-reaction, decomposing the radical polymerization initiator to produce a copolymer comprising diallyldialkylammonium salt constituent unit and a maleic acid constituent unit.

Abstract: Polymers useful as catalysts in non-enzymatic saccharification processes are provided. Provided are also methods for hydrolyzing cellulosic materials into monosaccharides and/or oligosaccharides using these polymeric acid catalysts.

Abstract: A polymer compound derivative, obtained by modifying part of the hydroxy or amino groups of a polymer compound having the hydroxy or amino groups with molecules of a compound represented by the following general formula (I): A-X—Si(Y)nR3-n (I), where A represents a reactive group which reacts with a hydroxy or amino group, X represents an alkylene group which has 1 to 18 carbon atoms and which may have a branch, or an arylene group which may have a substituent, Y represents a reactive group which reacts with a silanol group to form a siloxane bond, R represents an alkyl group which has 1 to 18 carbon atoms and which may have a branch, or an aryl group which may have a substituent, and n represents an integer of 1 to 3.

Abstract: Systems and methods for processing message subscriptions using pre-compiled code-blocks for expression evaluation. In one embodiment, a system is configured find a set of unique clauses in a set of expressions representing message subscriptions, express the expressions as Boolean functions of the unique clauses, and compile the Boolean functions into a set of assembly instructions for efficient expression evaluation. In another embodiment, a system is configured to receive a message, generate a set of True/False assignments to a set of clauses in a set of expressions, and evaluate the expressions using an efficient compiled expression evaluation code-block.

Abstract: A generalized on-line solution for achieving transparent binary optimization using pre-existing profiling facilities and virtual memory remapping of text regions. An optimization environment is initialized which comprises a debugger program, a profiling facility, and an optimizer. A running target program is attached to the debugger program, wherein the debugger program monitors process execution of the target program. Responsive to monitoring the running target program, profile data of the running target program is collected using the profiling facility. The profile data is provided to the optimizer, wherein the optimizer analyzes the profile data and existing code of the running target program. Responsive to a determination to optimize the existing code based on the profile data, optimized code is generated for the running target program. The optimized code is provided to the debugger program, wherein the debugger program inserts the optimized code into a virtual address space of the running target program.

Abstract: A first tree-structured data is generated based on a sequence diagram indicating a specification of a new source code to be generated. A second tree-structured data matching with the first tree-structured data is retrieved from a storing unit that stores at least an existing source code and tree-structured data corresponding to the existing source code. A source code corresponding to the second tree-structured data is acquired from the storing unit.

Abstract: A solution (300) for tracking computer software development (for example, based on UML diagrams) is proposed. In the solution of the invention, a completion coefficient is associated (312) with each activity concerning the development process (to indicate the effort required to complete it). The activities are organized into a tree (starting from a root node for the whole development process). In operation, a user tunes (333-336) a progress index for each micro-activity represented by a leaf node of the tree (to indicate its actual progress). The progress index of each macro-activity represented by a non-leaf node of the tree is instead calculated (357-360) by aggregating the progress indexes of its depending activities weighted according to the respective completion coefficients (with a recursive process down to the micro-activities). In this way, the progress of the development process can be tracked with an incremental approach at different levels of detail.

Abstract: A method of managing program versions by acquiring information about a program supplied via a network, comparing the program of a latest version with the program of a currently used version, and deciding whether or not to perform or prompt an update of the program includes determining whether or not to perform or prompt the update of the program in response to importance of modifications to be made from the program of the currently used version to the program of the latest version.

Abstract: Transaction code written by the programmer may be translated, replaced or transformed into a code that is configured to implement transactions according to any of various techniques. A compiler may replace programmer written transaction code into code allowing multiple compatible transaction implementation techniques to be used in the same program, and at the same time. A programmer may write transaction code once using familiar coding styles, but the transaction to be effected according to one of a number of compatible alternative implementation techniques. The compiler may enable the implementation of multiple, alternative transactional memory schemes. The particular technique implemented for each transaction may not be decided until runtime. At runtime, any of the various implemented techniques may be used to effect the transaction and if a first technique fails or is inappropriate for a particular transaction, one or more other techniques may be attempted.

Abstract: A method for testing software includes the steps of creating a software program using a software development program executing on a first computer; the first computer generating a source code file from the software program for testing; receiving the source code file by a second computer, the second computer executing a test generation program that is independent of the software development program; and executing the test generation program to generate a test file from the source code file.

Abstract: An information management and tracking system manages and tracks artifact data relating to the development of a process, the artifact data including data relating to development experiment parameters, results and products. The system includes a data management component and a process design environment for retaining data relating to the process design. A development tracking environment retains data relating to the process development, including the artifacts. A back annotation environment receives process data and provides it to the development tracking environment. The data management component is arranged to control the process design environment, development tracking environment and back annotation environment such that, in use, the data received and stored therein can be accessed in a linked manner such that, in use, a user can obtain data from each environment and view links there between.

Abstract: A method, program, and information processing apparatus for detecting an inconsistency in an application program before the application program is implemented. The described is detecting a consistency or inconsistency in the design of screen transition of an application program, by generating a control flow graph for the application program, calculating from the control flow graph the solution of dataflow problem which occurs in the application program, detecting an inconsistency in the application program on the basis of the calculated solution, and displaying information concerning a detected inconsistency.

Abstract: A design-time architecture that allows for flexible creation of application programs is disclosed. A composer core generates displays of application components and application interfaces that define patterns of functions and interactions between interfaces. A pattern base kit tool may provide common logic for the application components. A repository stores the application components and interfaces during run-time.

Abstract: Computer implemented method, system and computer usable program code for sharing resources among a plurality of containers in a data processing system. A computer implemented method includes creating a shared container for at least one resource to be shared. Then the at least one resource to be shared is moved from an original container of the at least one resource to the shared container, and a link is created between the original container and the at least one resource to be shared in the shared resource container. A link can also be created between a subject resource container and a shared resource in the shared resource container to enable the subject resource container to access and use the shared resource. A shared resource can also be removed from the shared resource container and returned to an original resource container when sharing of the resource is no longer desired.

Abstract: A method for creating an application comprises receiving input specifying a plurality of elements of a software application, said elements including interactions between a user and said software application, generating a dialog that includes a listing of said user interactions from said plurality of elements and is adapted to receive user input to edit one or more of said user interactions, and generating said software application based at least partly upon said received input and said user input to edit.

Abstract: System, method and computer program product for checking a software entity, the method includes: providing a direct acyclic graph representative of possible execution paths of the software entity; wherein multiple successor nodes that succeed a certain parent node are associated with different execution probabilities; randomly selecting a successor node out of the multiple successor nodes in response the execution probabilities; and checking the software entity in response to the selection.

Abstract: User input regarding a target system on which a software application is to be deployed is received. A benchmark system from plural candidate benchmark systems is matched to the target system. An estimated performance of the software application on the target system or an estimated utilization of resources of the target system by the software application is computed based on information relating to the matched benchmark system.

Abstract: In an active system, an actor is able to effect action in a subject system. The actor and the subject system exist in an environment which can impact the subject system. Neither the actor nor the subject system has any control over the environment. The actor includes a model and a processor. The processor is guided by the model. The processor is arranged to effect action in the subject system. The subject system is known by the model. This allows the actor to be guided in its action on the subject system by the model of the subject system. Events can occur in the subject system either through the actions of the actor, as guided by the model, or through actions of other actors, or through a change in state of the subject system itself (e.g. the progression of a chemical reaction) or its environment (e.g. the passage of time). The actor keeps the model updated with its own actions.

Abstract: Techniques for delayed loading and instantiation of resources in a resource dictionary are provided. These techniques can be used to delay or defer the loading of values (or “value records”) into the resource dictionary until the values are actually needed or requested by an application.

Abstract: A hierarchical modular software development tool provides a graphical user interface to allow development of hierarchical module software components. The software development tool allows graphical creation of a software component processing hierarchy and then generates a software component using this specified processing hierarchy. The packages developed using this tool are able to include event modules that allow sub-branches of the software component processing hierarchy to be executed without requiring processing of modules of the software component hierarchy that precede the event nodes. Further nodes that are able to be included in the processing hierarchy include action nodes, that contain operational software, and conditional nodes that allow condition testing and conditional execution of processing branches.