Abstract: A graphics processing method and apparatus described herein is capable of converting graphics processing of a window system into a vector-based application program interface (API) format usable in the GPU and performing the converted graphics processing in the GPU. For example, the vector-based API may be based on an OpenVG standard or an EGL standard.

Abstract: An apparatus for processing digital audio-visual data including a module class manager configured to evaluate code to determine an interpretative language in which the code is written, wherein the interpretative language is selected from a plurality of interpretative languages, and an interpreter specific to the interpretative language, wherein the interpreter is configured to interpret and execute the code.

Abstract: A system and method for improving the efficiency of an object-level instruction stream in a computer processor. Translation logic for generating translated instructions from an object-level instruction stream in a RISC-architected computer processor, and an execution unit which executes the translated instructions, are integrated into the processor. The translation logic combines the functions of a plurality of the object-level instructions into a single translated instruction which can be dispatched to a single execution unit as compared with the untranslated instructions, which would otherwise be serially dispatched to separate execution units. Processor throughput is thereby increased since the number of instructions which can be dispatched per cycle is extended.

Abstract: A method, apparatus, and computer instructions for a configurable JAVASERVER pages processing framework to process JAVASERVER pages (JSP). A JSP document or page is translated into a document object model (DOM) object that encapsulates elements of the JSP. The syntax of the JSP is validated by a JSP translator with built-in classes and errors are returned if necessary. A JSP visitor configuration file, which defines user configured classes and sequence of execution, is used by the JSP translator to invoke methods of user-defined classes in the order specified by the user to process or visit elements of the DOM object. Result of user-defined class processing may be passed from one class to another within the set.

Abstract: An apparatus and a method for creating a control code for a home network appliance according to resolution of a control device which can automatically create a control code for a home network appliance according to the resolution of the control device and can perform a testing of the device even in the case in which the home network appliance is not bound.

Abstract: A method for sending data to a sight impaired user, the method comprising, receiving data from a data resource, determining whether the data is compatible with a Symbian API, transcoding the data into a first format compatible with the Symbian API, determining whether the data is compatible with a TALKS filter, transcoding the data into a second format compatible with the TALKS filter, determining whether the data is usable by a sight impaired user, transcoding the data into a third format usable by a sight impaired user responsive to determining that the data is not usable by a sight impaired user, converting a data type definition associated with the data into a format compatible with a user profile, sending the received data to a user mobile device, wherein the mobile device is operative to convert the data into an audible output.

Abstract: A computer implemented tool is provided for assisting in the mapping of a computer program to an asymmetric multiprocessing apparatus 2 incorporating an asymmetric memory hierarchy formed of a plurality of memories 12, 14. An at least partial architectural description 22, 40 is provided as an input variable to the tool and used to infer missing annotations within a source computer program 24, such as which functions are to be executed by which execution mechanisms 4, 6, 8 and which variables are to be stored within which memories 12, 14. The tool also adds mapping support commands, such as cache flush commands, cache invalidate commands, DMA move commands and the like as necessary to support the mapping of the computer program to the asymmetric multiprocessing apparatus 2.

Abstract: Embodiments of the present invention provide a system that facilitates converting a template written in a templating language into a function written in a host language, wherein the function produces a string (or a capability that encapsulates a string) in the templated language. During operation, the system receives a template in the templating language at a translator. The system then compiles the template with the translator to create a function in the host language. Next, the system merges the function in the host language with a subset of code written in the host language. Note that in some embodiments of the present invention, the subset of code written in the host language was originally embedded in the templating language, while in other embodiments the subset of code written in the host language is received from an external file.

Abstract: A system and method for transforming data from a first format to a second format. A pre-existing set of software instructions may be used to transform the data from the first format to the second format. A user may document a set of format parameters for the first format of data, which can be used to determine which portion of the pre-existing software instructions are used to transform the data from the first format to the second format.

Abstract: An RPM subsystem can be installed on a system that has its own native packaging subsystem. The RPM subsystem is initially delivered as a package wrapped in the non-RPM format of the native packaging system and installed. When an RPM package is installed, the RPM subsystem is also configured to create a stub entry in the native packaging, non-RPM system. The stub entry may contain the normal package information, such as name, version, description, as well as a list of files contained in a package. The stub may also contain uninstallation logic, which serves as a “callback” into the RPM subsystem during package removal and causes the RPM subsystem to remove the package when invoked. Removal of a RPM package via RPM tools also causes the removal of the stub entry.

Abstract: A method, computer program product, and data processing system for substituting a candidate instruction in application code being loaded during load time. Responsive to identifying the candidate instruction, a determination is made whether a hardware facility of the data processing system is present to execute the candidate instruction. If the hardware facility is absent from the data processing system, the candidate instruction is substituted with a second set of instructions.

Abstract: A model is provided for transforming a program with a priori given class hierarchy that is induced by inheritance. An inheritance remover is configured to remove inheritance from a given program to produce an analysis-friendly program which does not include virtual-function pointer tables and runtime libraries associated with inheritance-related operations. The analysis-friendly program preserves the semantics of the given program with respect to a given class hierarchy. A clarifier is configured to identify implicit expressions and function calls and transform the given program into at least one intermediate program having explicit expressions and function calls.

Abstract: In one embodiment, a method for supporting multivariable functions of an application includes receiving user input pertaining to two or more variables associated with a multivariable function of the application, and then causing code for the function to be automatically generated to update the variables based on the user input.

Abstract: A mechanism is disclosed for implementing fast synchronization of simple synchronized methods in a virtual machine. The mechanism provides for determining, during runtime, whether a set of instructions can be fully executed in lieu of invoking a synchronized method, which requires locking of a particular object. The set of instructions provides equivalent functionality to the synchronized method but with less locking overhead. In response to a determination that the set of instructions can be fully executed, the set of instructions is fully executed to achieve equivalent functionality to the synchronized method in lieu of invoking the synchronized method. In response to a determination that the set of instructions cannot be fully executed, the synchronized method is invoked. With this mechanism, simple synchronized methods can be executed with less locking overhead.

Abstract: Systems and methods for compiling high-level primitive programs are used to generate primitive program micro-code for execution by a primitive processor. A compiler is configured to produce micro-code for a specific target primitive processor based on the target primitive processor's capabilities. The compiler supports features of the high-level primitive program by providing conversions for different applications programming interface conventions, determining output primitive types, initializing attribute arrays based on primitive input profile modifiers, and determining vertex set lengths from specified primitive input types.

Abstract: A system and method for language-neutral runtime user interface automation by: providing an automation script for automating use of the user interface in an application; intercepting a call from the automation script to a function simulating a user action on the application; retrieving a translated text string associated with the function call; and calling the function simulating the user action with the translated text string. This provides the advantages of not attaching any extra burden on the script developer and requiring little extra from the user (other than providing a native-language reference file).

Abstract: Which target functions in a target binary have target function basic blocks that match the source function basic blocks in a source function in a source binary is determined. For the target functions having matching target function basic blocks, a target function control flow graph is determined that has the greatest control flow matching strength to a source function control flow graph, wherein a node in the source function control graph represents a source function basic block, wherein a node in a target function control graph represents a target function basic block in a corresponding target function.

Abstract: A computer implemented method, computer program product, and data processing system for reducing the number of inner classes in a compiled computer program written in an object-oriented programming language. An outer class of the compiled computer program is received, wherein the outer class contains an inner class, wherein the outer class comprises instructions to create an instance of an inner class. The instance is to be used as one of a callback, a listener command, a set of instructions by which an object instance of the inner class transfers information to the corresponding containing instance of the outer class, and combinations thereof. A transformation of the outer class is performed by moving methods of the inner class, as well as their contained instructions, into the outer class. The behavior of the compiled computer program remains unchanged.

Abstract: A method for rendering software resistant to reverse engineering. Replace at least one first constant (mathematical expression, etc.) in a computational expression with a second mixed mathematical and bitwise-Boolean expression, the first constant being simpler than the second expression and the second expression being based on the value or the variables found in the first constant (or expression).

Abstract: Provided is a method of pre-processing a conditional region. By analyzing and designating code lines according to the present invention, when a conditional region included in a pre-processing region of an arbitrary file is compiled, the compiling can be efficiently performed, and when the arbitrary file is executed, an execution result can be derived in a short time.

Abstract: An execution environment in a computer system supports a declarative programming model where user code is written with a query syntax in a native programming language to express inherent parallelism in terms of data flow. The execution environment translates queries in the user code into a runtime agnostic representation and dynamically selects an execution runtime for executing the runtime agnostic representation.

Abstract: An execution environment in a computer system allows user code to be executed using multiple execution runtimes. The execution environment translates the user code into a runtime agnostic representation, selects an execution runtime for executing the runtime agnostic representation, and invokes a scheduler for the selected execution runtime. The scheduler dispatches tasks from the runtime agnostic representation for execution by the computer system using concurrency mechanisms in the selected execution runtime.

Abstract: An execution environment in a computer system provides dynamic data and compute resources elasticity for user code to improve execution efficiency. The execution environment translates the user code into a runtime agnostic representation with a set of tasks. For each task, the execution environment determines a level of concurrency for executing the task based on the size of the set of input data for the task, the amount of compute resources available at the time of invocation of the task, and any context-sensitive heuristics provided by the user code.

Abstract: Runtime execution of one or more tasks defined in a workflow process language. The method may include obtaining a description of the task from a process ontology (PO). The PO may define a hierarchical taxonomy of executable tasks, where each task refers to at least one frame of a hierarchical frame taxonomy of the PO. The method may further include identifying at least one parameter as described in the frame description to which the task refers, resolving the value of the at least one parameter, and executing the most specific applicable version of the task contained in the task taxonomy of the process ontology.

Abstract: A system and method for generation of efficient calls from compiled byte code within a virtual machine (VM) or Java Virtual Machine (JVM) environment. Current techniques used to interface dynamically compiled byte code with native libraries using stubs are unsatisfactory due to non-optimal performance and the large amount of manual work needed to maintain the stub generation code. An embodiment of the present invention addresses this by providing a system and a method for automatic stub generation based on a small set of parameters stored in a ParamInfo structure. In accordance with an embodiment, the system comprises a computer with native libraries; a virtual machine for executing a software application; a memory space for the compiled byte code; and a compiler with a calling convention adaptor that integrates native calls into the high level analysis step of the compilation of byte codes, so that the overhead for the native call is reduced.

Abstract: A reflective process algebra called the ?-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.

Abstract: Program language support is provided to facilitate reactive programming. Code can be provided that initiates conversion between a first-class pattern and a second-class pattern, wherein the patterns operate with respect to push-based data. Support is also provided for producing and consuming push-based data in accordance with an iterator pattern, for example.

Abstract: One or more selected portions of computer-executable instructions stored on non-transient storage media of a computer system are modified according to a method. In various embodiments, the method includes any one or combination of: (1) applying, with a processor of the computer system, a data transformation to one or more value representations in the computer-executable instructions to create one or more transformed code segments, the data transformation comprising at least one of a nonlinear transformation and a function composition transformation; (2) generating, with a processor of the computer system, transformed computer-executable instructions based on the transformed code segments; and (3) storing the one or more transformed code segments with corresponding computer-executable instructions on the non-transient storage media.

Abstract: Systems and/or methods are provided relating to an extensible framework. The extensible framework provides constructs with which device developers can model devices within the framework to enable a host application utilizing the framework to interact with the devices. New devices can be supported by the framework without disrupting existing devices or the host application.

Abstract: A system and method for evaluating interfaces includes computing a reference script for a task from a reference interface design and translating the reference script into one or more target action scripts based on a target design. The one or more target action scripts on the target design are executed to produce target metrics. The target metrics are compared to determine whether the target action script successfully translates the reference script.

Abstract: A computer-implemented method of generating output computer code, for an application executable via a server running application logic in communication with a client running a presentation layer for the application, from input computer code of a synchronous application in which logic and presentation layers run locally on a single computer. The output code runs asynchronously.

Abstract: A runtime system implemented in accordance with the present invention provides an application platform for parallel-processing computer systems. Such a runtime system enables users to leverage the computational power of parallel-processing computer systems to accelerate/optimize numeric and array-intensive computations in their application programs. This enables greatly increased performance of high-performance computing (HPC) applications.

Abstract: Methods and apparatuses enable on-demand instruction emulation via user-level exception handling. A non-supported instruction triggers an exception during runtime of a program. In response to the exception, a user-level or application-level exception handler is launched, instead of a kernel-level handler. Then the exception handler can execute at the application layer instead of the kernel level. The handler identifies the instruction and emulates the instruction, where emulation of the instruction is supported by the handler. Emulating the instructions enables the program to continue execution. Repeated instruction emulation is amortized via dynamic binary translation of hot code.

Abstract: A method, apparatus, and computer program instructions for automatically performing test builds of natural language translated files for a software product. When a translated file is received from a translator, a test build of the translated file is executed in a translation test build environment, wherein the translation test build environment is separate from the main software product build environment. A determination is made as to whether the test build of the translated file is successful. If the test build is successful, the translated file is submitted to the main software product build environment. If the test build is unsuccessful, a log file containing error information is sent to the translator to allow the translator to fix compile errors identified in the translated file and resubmit the translated file to the translation test build environment.

Abstract: A compiler utility assigns memory locations to alias-free variables within a computer program. The compiler utility allocates memory keys for the alias-free variables, such that access to the memory locations of the alias-free variables is granted to blocks of code that have knowledge of the memory keys. In response to a command by the user, the compiler generates code to detect violations of alias assumptions during execution of the computer program. During the compiling process, the compiler adds the generated code for detecting violations of alias assumptions to the compiled computer program.

Abstract: The method, an apparatus, and/or a system of cross-platform architecture for replicating profiling scheme in a computer system are disclosed. In one embodiment, a method for forming profiling information of one computer platform in another computer platform includes generating instrumented code by a code instrumenter using a target platform code. The method further includes generating the profile information that the source platform profiling tools can decipher and utilize using the instrumented code, and generating a profile report by analyzing the generated profile information using the source platform profiling tools in a dynamic binary translator that can be used by the dynamic binary translator (DBT) to generate target platform code. In addition, the method may include translating source platform object code into the target platform code using the DBT.

Abstract: A runtime system implemented in accordance with the present invention provides an application platform for parallel-processing computer systems. Such a runtime system enables users to leverage the computational power of parallel-processing computer systems to accelerate/optimize numeric and array-intensive computations in their application programs. This enables greatly increased performance of high-performance computing (HPC) applications.

Abstract: A method and system to automatically translate a definition of a choreography workflow process to an executable process are provided. The method includes processing a collaboration element from the definition, mapping the collaboration element to an executable element based on a knowledge database system that contains the collaboration element and the corresponding executable element and mapping the collaboration element to the executable element statically if the corresponding executable element is unavailable in the knowledge database system.

Abstract: Methods, systems, and apparatus, including medium-encoded computer program products, for software installation and icon management support. In one aspect, a method includes obtaining a cross-platform package of information stored in a platform independent format, the cross-platform package information including a cross-platform icon and one or more descriptors for the cross-platform icon; translating the cross-platform icon to a predefined icon format for a specific operating system (OS) on a computer; and providing the translated icon in the predefined icon format for display by the OS on the computer.

Abstract: A runtime system implemented in accordance with the present invention provides an application platform for parallel-processing computer systems. Such a runtime system enables users to leverage the computational power of parallel-processing computer systems to accelerate/optimize numeric and array-intensive computations in their application programs. This enables greatly increased performance of high-performance computing (HPC) applications.

Abstract: In emulation of a target system on a host system one or more blocks of target system code may be translated with the host system to produce one or more corresponding blocks of translated code. Translating the target system code may include linking two or more blocks of translated code together to form a chain such that a look-up in a first translated block in the chain will directly branch to a second translated block. The target system code may be analyzed for the presence of one or more native target system instructions indicating modification of the target system code during execution. If such native target system instructions are present some or all of the blocks of translated code may be marked potentially invalid. The one or more blocks marked as potentially invalid may be re-translated and one or more instructions in the blocks of translated code may be overridden without undoing the chain.

Abstract: A graphical user interface (GUI) type model helps application designers create error free graphical user interface applications (GAPs). The GUI type model provides a reference set of GUI element types. The application designer assigns a selected GUI element type to each GUI element in a GAP design. The GUI element types help ensure consistent and proper treatment of the GUI element types at every stage in the development of the application, from initial planning and design, to compilation and execution.

Abstract: An example embodiment of the present invention provides a process for abstracting an implementation-independent model to an implementation-specific model during transformation in a MDA system. In the example embodiment, the MDA system comprises a transformation engine whose components might include software tools such as AndroMDA and Muse. The transformation engine accepts as input an implementation-independent model written in a modeling language such as UML that provides graphical notation to describe inheritable classes and their attributes and relationships. The transformation engine also accepts a configuration file which allows the designation of a class in the model as a manageable resource. From these inputs, the transformation engine creates a manageable resource corresponding to the class, which resource includes any subclasses by inheritance from the designated class unless the subclass is specifically excluded in the configuration file.

Abstract: The invention provides a solution for transforming a flow graph model to a structured flow language model. In particular, the nodes in the flow graph model are traversed, and each node is mapped to an activity in the structured flow language model. When a node comprises a branch point, the corresponding branch region is identified and mapped. This process is repeated until all nodes in the flow graph model have been mapped to corresponding activities in the structured flow language model. In this manner, the desired nesting and containment relationships can be identified and generated in the structured flow language model.

Abstract: Systems and methods associated with indexing of information in documents where the documents include line data with shift out/shift in (“SOSI”) code point encodings. SOSI controls are often embedded in documents encoded as simple line data (data formed to be printed on line printers). A document indexing system in accordance with features and aspects hereof converts the SOSI characters embedded in such a document to reserved codes for presentation on a user interface. The user may then precisely select trigger and field parameters used for identifying index values in such a line data document for purposes of indexing and archiving. The reserved controls help a user identify trigger and field value in a manner that the indexing system can track to determine whether and where the selected trigger and field values contain SOSI characters and thus require different column counting and indexing.

Abstract: A computer system which includes a plurality of threads and a garbage collector that traces memory objects and identifies memory objects according to a three-color abstraction. The computer system also includes two methods of deleting compiled code in a self-modifying multi-threaded computer system. The computer system also utilizes a method of handling links between fragments of code in a self-modifying multi-threaded computer system. The computer system also handles patches between two pieces of code.

Abstract: An application programming interface (API) implementation that can interface between an application and a programming library. The implementation includes a Function Router Wrapper that receives a formatted string from the application. The formatted string includes a function name element filled with a function name, an input element filled with function input parameters, and an unfilled output element. The Function Router Wrapper converts the formatted string and passes it to a Function Router, which parses the converted formatted string to access the function name and the function input parameters. The Function Router calls a library function based on the accessed information. When the called library function is completed, the Function Router collects generated function outputs and embeds them into the formatted string output element. The Function Router passes the formatted string back up to the Function Router Wrapper, which converts the formatted string and passes it back up to the application.

Abstract: A method and apparatus for creating a schema definition from a language-specific metamodel of a data structure written in a legacy computer language involves walking through the nodes of the metamodel, and creating corresponding schema element objects in a schema tree that is serialized to create the schema definition. The creation of the schema element objects follows rules, and permits the definition of nested data structures having conjunctive-type and disjunctive-type membership.

Abstract: According to one embodiment, as to a first program code including a plurality of variables, an access pattern of each variable by a processor is decided. The first program code is converted to a second program code including a plurality of threads. Each thread is executed by one of a plurality of cores of the processor. The second program code includes, (a) a first member structure including variables decided as a first access pattern, (b) a first route-pointer indicating the first member structure, the first route-pointer having a first access property representing accessibility by a core to execute a first thread, (c) a second member structure including variables decided as a second access pattern, (d) a second route-pointer indicating the second member structure, the second route-pointer having a second access property representing accessibility by the core to execute the first thread and a core to execute a second thread.

Abstract: A system, method, and computer-accessible medium are disclosed for identifying in-line synchronization instructions in binary program code. One or more executable segments of the binary program code may be scanned to identify one or more potential in-line synchronization instructions. For each potential in-line synchronization instruction, it may be determined whether neighboring potential instructions are valid instructions. For each potential in-line synchronization instruction, it may be determined that the potential in-line synchronization instruction is a valid in-line synchronization instruction if the neighboring potential instructions are valid instructions.