Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for creating mobile device applications using a visual programming integrated development environment (IDE). In one aspect, a method includes receiving a user input entered through a visual programming interface of a visual programming IDE, advancing a mobile device application that is under development in the visual programming IDE to a state in which one or more sensor events that are associated with the user input are assumed to have been received, and outputting a mock-up of the mobile device application in the advanced state, through the visual programming interface.

Abstract: A method for installing software components includes: a terminal receives a software component package delivered by a Device Management (DM) server directly or a download address of the component package and a command instructing to download delivered by the DM server, where the software component package contains more than one software component; if the terminal receives the download address and the command instructing to download, the terminal downloads the software component package from the download address; the terminal installs the obtained software component package locally and generates management nodes and subnodes of the management nodes corresponding to the software components under a Deployed subtree of the Software Component Management Object (SCOMO) of the terminal. With the present invention, the process of installing software component is more reasonable. A system and apparatus for installing software components are also provided.

Abstract: A method and system which enable preconfiguration of an information handling system to function as a media hub. In certain embodiments, during the preconfiguration a customer can select media services such as television services (e.g., Cable TV or Dish Network Service provider) and an information handling system manufacturer can then preconfigure the information handling system during a factory install process for the selected television provider. Additionally, the preconfiguration process can load media guides onto the preconfigured information handing systems during the factory install process. Additionally, in certain embodiments, if a remote control for a receiver is found, then the remote control settings can be preinstalled onto the information handling system. When a user receives the preconfigured information handling system, all that is necessary to setup the system is to couple an IR emitter to the receiver.

Abstract: Devices, compilers and methods to reduce energy consumption associated with execution of a program by adjusting a computational capability of a CPU with higher accuracy than before. A device sets an appropriate computational capability to the CPU. It includes: changing a computational capability of the CPU every time each of a plurality of program areas included in the execution program is executed while the execution program is being executed, and measuring execution time each of the program areas; deciding an optimal computational capability required to execute the program area using the CPU, based on the execution time for each of the computational capabilities measured for the respective program areas; and performing setting of the optimal computational capability for executing the program area, which is to be used when executing the program area again in the course of executing the execution program, for each of the program areas.

Abstract: A method, system, and computer-readable medium for assembling work packets within a software factory are presented. In a preferred embodiment, the computer-implemented method comprises the steps of: collecting a plurality of software artifacts that have been archived during an assembly of previous work packets; collecting a plurality of metrics that have been utilized during the assembly of previous work packets; defining a template for a new work packet, wherein the template for the new work packet is created by a packet definition process that defines attributes that are needed in the new work packet; selecting requisite software artifacts from the plurality of software artifacts; selecting requisite metrics from the plurality of metrics; and sending the template, requisite software artifacts and requisite metrics to a packet assembly process, wherein the packet assembly process assembles the requisite software artifacts to create the new work packet.

Abstract: A computer implemented method is provided for optimizing at the time of compiling a program that employs a message-passing interface (MPI). The method includes: detecting an MPI application source file; identifying a non-blocking communication within the MPI application source file; and overlapping independent computation concurrently with the non-blocking communication. A system is also provided.

Abstract: Operation of a computer system is governed by an executable application and settings set forth in an XML document to which the application refers during execution. When an application is published for installation, it includes the application and a base XML document. Portions of the base XML document are marked as editable during installation. During installation, an installation manager review the base XML document, identifies editable portions therein and reads installation settings data therefor. The installation manager may generate a modified XML document representing the settings of the base XML document and any modified settings obtained for installation. Modified settings data may be obtained from an operator, from a computer system on which installation occurs or from a dataset representing settings data obtained in prior installations.

Abstract: The method for generating test cases for a software program includes the step of setting a plurality of reference points in accordance with a sentence of the software program. The tracing pairs each including an initial test case as well as its adjacent vertex are set if one of them is among the reference points and the other one is not among the reference points. The essential test cases are chosen from the tracing pairs.

Abstract: A pattern implementation technique in which a pattern is defined as a software artifact that comprises a pattern signature representing one or more parameters of the pattern and a pattern implementation model representing one or more methods for expanding the pattern in a selected software context by assigning one or more arguments to the one or more parameters. The pattern implementation model can be based on one or more framework code sets, each of which supports the creation of plural patterns by providing a pattern implementation model for a particular software context. The framework code sets can be rendered extensible by a pattern author by virtue of providing methods whose code is adapted to be modified by a pattern author when defining a pattern. The pattern can be applied by creating an instance of the pattern in a software context and presenting a graphical representation of the pattern instance that can be manipulated by the pattern user in order to apply arguments to the pattern parameters.

Abstract: Various technologies and techniques are disclosed for providing an integration framework that enables tools to be integrated. The integration framework enables tools participating in the framework to be encapsulated in a manner that hides their implementations, thereby preventing them from taking deep dependencies on each other. The integration framework also enables the tools participating in the framework to carry formal type definitions called service and data contracts that describe the public behaviors they offer. The integration framework also provides support for migrating integration logic from tools into pluggable commands to further reduce coupling between the tools.

Abstract: Methods, apparatuses, articles, and systems for identifying, by a state machine, a first module installation of a first module of a plurality of modules of one or more applications, at least a subset of the modules each having one or more installation relationships with one or more other modules of the plurality of modules, and the identifying being based at least in part on the first module's installation relationship(s), if any, with the other modules as described by a data structure describing the installation relationships of the plurality of modules, are described herein. In various embodiments, the state machine may further execute the first module installation and repeat the identifying and the executing for at least a second module installation of a second module of the plurality of modules.

Abstract: A method is described which permits a computer programmer to write a program with the assistance of the computer itself. The computer will provide instant feedback, following the procedures herein described, to the result of performing each instruction. Therefore, the programmer may instantaneously observe the working of the program as the computer will perform it. Thus any difference in the result produced by the computer from what the programmer expects to happen may be recognized and, if appropriate, corrected. In a higher order implementation of this method the computer will display icons to link the in-process programming to a working routine resident on a remote computer. Thus, the tools and benefits of so-called Service Oriented Architecture (SOA) can be made available to the programmer. Employing the method of this invention, the computer becomes an integral part of the creative process of writing a program.

Abstract: Using a WSDL document to exchange an interface definition for back-end business logic includes automatically mapping various elements of the WSDL document to corresponding XQuery elements to generate an XQuery interface definition “skeleton”. From such an XQuery interface skeleton, an XQuery statement can be generated by filling in the body of the function that implements the logic. The XQuery statement serves as an interface definition for an interface to the function. Furthermore, at runtime a Web Service request that is based on the WSDL document can be translated into an XQuery call into an XQuery function that implements the logic defined in the WSDL document. From there, results are obtained from the XQuery function, translated into the appropriate return format defined in the WSDL, and returned.

Abstract: A method for analyzing a latency of a transaction performance is provided.

Abstract: Techniques for verifying a signature of an executable file are disclosed. In one particular exemplary embodiment, the techniques may be realized as a computer-implemented method for verifying a signature of a first executable file, comprising creating a first functional flow graph from the first executable file, storing the first functional flow graph, receiving, using a processor, a rule for the first executable file, and storing the rule. The techniques may also comprise receiving a second executable file, creating a second functional flow graph from the second executable file, determining whether a difference between the first functional flow graph and the second functional flow graph is less than a tolerance, and when it is determined that the difference between the first functional flow graph and the second functional flow graph is less than the tolerance, applying the rule to the second executable file.

Abstract: The method in accordance with the invention is characterized in that a detailed implementation model is produced in the UML language, that the data of this model are structured to render them utilizable by the scripts generation tool “ModelInAction” (termed “MIA” and produced by the company Sodifrance), and that this tool is made to produce files in the C language, namely .C files, .H files, a generation report file, configuration management “batch” files and compilation project files.

Abstract: A location to insert stack clearing code into a method to be executed in an execution environment of a computer system is determined. The stack clearing code is inserted into the location of the method. The stack clearing code is executed during execution of the method to clear a stack. Other embodiments are also described and claimed.

Abstract: Optimizations are programmatically applied by a compiler (preferably, a just-in-time or “JIT” compiler), and enable achieving improved performance while a variable acts as a global constant, yet also allow code to execute correctly if the global constant's run-time value changes from the value on which the optimization was originally based. Code snippets that dynamically patch executable code are described, where these code snippets take corrective actions to enable correct program execution following a run-time change to the value of a glacial constant. A backup recovery path may also be maintained, where this path provides code that is executed in the event of a change to a glacial constant and that treats the glacial constant as a variable. Recompilation may also be used after a change to a glacial constant, where the originally-compiled code has made an assumption about the glacial constant's value that is no longer accurate. Combinations of these approaches may be used.

Abstract: Customizations are applied to a software product by determining whether any of the customizations to be applied are in conflict with one another. If so, product dependency information, which identifies a product that the customizations are based on, is used to reduce a number of conflicting customizations to be made to the software product. Any remaining conflicts are resolved, and the customizations are applied.

Abstract: The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.