Abstract: The invention relates to an open drive regulator and a method for software generation which offers the capability for customer-specific selection of function objects which are compiled separately. The compiled function objects can be preprocessed in the form of a library routines. Based on the instantiated and compiled function objects, the software for the drive regulator is generated or is loaded online for an existing program sequence. It is particularly advantageous that the function objects can be changed by a customer, for example in order to implement a customer-specific functionality.

Abstract: A system or method enables a two tier computer application to operate in a three tier computer environment without specific programming for the three tier environment. Such a system or method receives a database call at a computer system and maps the database call to a general programming language call of a computer application. The general programming language call is executed to invoke functions of the computer application that correspond to functions of the database call. The general programming language call may be an Enterprise Java Bean (EJB) call. An application server receives the database call and maps the database call to the general programming language call. In response to executing the general programming language call, the application server generates a second database call to the database that may either correspond directly or indirectly to the database call received at the application server. The database calls may both be SQL calls.

Abstract: The present invention provides an active data type for use in a computer program. The active data type has an identifier and at least one algorithm associated therewith. The identifier is utilized by the computer program to identify the instance of the active data type. The algorithm is configured to be automatically executed when an attempt to access a value associated with the active data type instance is made by a routine or otherwise. When a particular routine that uses an instance of the active data type attempts to access the value associated with the active data type, the algorithm determines the value associated with the active data type before the routine obtains access to the value. The active data type may be a real, an integer, or a string, for example. The algorithm automatically determines the current value associated with the active data type instance. Preferably, the active data type has an identifier, a first algorithm and a second algorithm associated therewith.

Abstract: As to an object-oriented programming, reuse of softwares is enhanced and running speed is improved. There are made up a data element list in which pointers to data storage areas of object A are arranged and a pointer element list in which pointers to pointer storage areas of object B are arranged. A combination of the data element list and the pointer element list makes it possible to directly refer to data of the object A from the object B.

Abstract: A method and apparatus provide for the creating of a software tool, such as a Wizard, which is easily modifiable and which can simplify a complex procedure. Process steps, such as questions, are prompted and a plurality of potential selections associated with each of the process steps, such as answers to the questions, are also prompted. These process steps are questions and their corresponding answers are then stored and therefrom, a software tool is created.

Abstract: A method and system for performing generational garbage collection on a virtual heap in a virtual machine is provided. The garbage collection method is suited for use with small consumer and appliance devices that have a small amount of memory and may be using flash devices as persistent storage. The garbage collection method may provide good performance where only a portion of the virtual heap may be cached in the physical heap. The virtual heap may use a single address space for both objects in the store and the in-memory heap. In one embodiment, a single garbage collector is run on the virtual heap address space. The garbage collection method may remove non-referenced objects from the virtual heap. The garbage collection method may also include a compaction phase to reduce or eliminate fragmentation, and to improve locality of objects within the virtual heap.

Abstract: A method and computer program product is shown for use with a computer programming language having dynamic types and overloaded functions. A function data structure (a function handle) is constructed using a function name, which data structure contains or leads to information necessary to resolve function overloading, and also may lead to other auxiliary functions such as write, read or print. Application of the function data structure at the point of construction is functionally equivalent to application of a function name string. However, the function data structure may be applied without regard to the scope at the point of construction.

Abstract: The present invention relates a method and systems for generating, applying and defining patterns for software development. The software development tool receives an indication of a pattern, generates software code reflecting the pattern, and stores identification information for the pattern in a comment associated with the generated software code. The software development tool receives an indication of the software element, determines whether the software element is capable of playing the role, and when it is determined that the software element is capable of playing the role, designates that the software element plays the role in the pattern. The software development tool displays a plurality of software elements to a user, receives an indication of a selected one of the plurality of software elements, receives an indication of a user-defined pattern role that the selected software element plays in a pattern, and stores the plurality of software elements as the pattern.

Abstract: A highly flexible, software-based architecture is disclosed for constructing distributed systems. The architecture supports cooperative task completion by flexible and autonomous electronic agents. One or more facilitators are used to broker communication and cooperation among the agents. The architecture provides for the construction of arbitrarily complex goals by users and service-requesting agents. Additional features include agent-based provision of multi modal interfaces, including natural language.

Abstract: Methods, systems and computer program products display data in a selected language. A data record formatted in a language independent markup format is received and a style sheet associated with the selected language is retrieved. The data record is formatted based on the style sheet and the formatted data record is displayed in the selected language. Data may be generated at a first data processing system that displays text in a first language and provided to a second data processing system that displays text in a second language different from the first language by generating data values at the first data processing system and incorporating the generated data values in a language independent markup document. The language independent markup document may include an identification of a style sheet that specifies how to present the data values in the second language to provide the data record.

Abstract: A system for remote computer access comprises a first computer upon which an application runs, and a second computer upon which outputs from the application are implemented and from which inputs to control the application are received. A network communicatively couples the first and second computing systems. As an application executes on the first computing system, output-related instructions such as those related to displaying data are translated into a non-proprietary data format such as, for example, an extensible markup language (XML) data item. The XML data item is transmitted over the network using non-proprietary protocols such as, for example, HTTP to the second computing system. At the second computing system, the output-related instruction is translated into a corresponding instruction native to the second computing system and thereafter executed on the second computing system.

Abstract: A representation of types, type-checker, method and compiler are provided for checking consistency in various forms of an intermediate language. Specifically, the typed intermediate language is suitable for use in representing programs written in multiple (heterogeneous) source languages including typed and untyped languages, loosely and strongly typed languages, and languages with and without garbage collection. Additionally, the type checker architecture is extensible to handle new languages with different types and primitive operations. The representation of types can be implemented as a data structure that represents two or more sets of types with one or more sub-structures for representing classifications of types. Alternatively, the type system can be implemented as a base class at the top of a hierarchy and a plurality of classes hierarchically below the base class can be defined to represent a number of types such as pointer types, container types, and function types.

Abstract: Methods and systems for selecting contexts during decoding of arithmetic code are disclosed. Aspects of the method may comprise assigning a plurality of default context identifiers to a plurality of current syntax elements within a current macroblock. A plurality of adjacent context identifiers may be acquired, where the adjacent context identifiers may be associated with a plurality of syntax elements within at least one macroblock adjacent to the current macroblock. At least one of the plurality of adjacent context identifiers may be selected utilizing at least one of the default context identifiers. Each of the default context identifiers may comprises a binary value. A top-adjacent context identifier associated with a syntax element within a top-adjacent macroblock to the current macroblock may be acquired. A left-adjacent context identifier associated with a syntax element within a left-adjacent macroblock to the current macroblock may be acquired.

Abstract: The present invention includes program storing unit 11 for storing a program, parsing/dependence-information generating unit 12 for generating dependence information and a syntax tree for a program, dependence-information storing unit 13 for storing dependence information, syntax-tree storing unit 14 for storing a syntax tree, dependence-information tracking unit 17 for extracting interface information on a program fragment according to specifying-information specifying the program fragment and extracting a part of a program fragment associated with interface information according to selection information for selecting the interface information, and information input/output unit 15 for passing specifying-information and selection information to dependence-information tracking unit 17 and outputting interface information and a part of a program fragment passed from dependence-information tracking unit 17.

Abstract: A system, method, and article of manufacture for caching a pre-processed version of an interpreted application at the time the interpreted application is first interpreted and executed by a computer, thereby improving response time for subsequent executions of the interpreted application. The pre-processed version of the interpreted application captures all execution paths through the interpreted application, despite the fact that the first execution of the interpreted application may only exercise a subset of the possible execution paths therein. Modifications to the interpreted application are dynamically detected, so that the pre-processed version can be replaced in the cache as needed.

Abstract: A structured multithreaded programming system is described for integrated use with existing and new programming languages and systems. The structured multithreaded programming system enables programs to be developed which include both multithreaded and multithreadable code constructs. The multithreaded code constructs require explicitly concurrent execution. The multithreadable code constructs can be executed either sequentially or concurrently, at the selection of the programmer or computer user. When executed concurrently, the different threads of execution in a multithreaded program developed with this system can be synchronized using innovative synchronization objects. One type of synchronization object is a special type of counter, which can be constrained to be monotonically increasing in value. Another related type of synchronization object is a special type of flag, which can be constrained to have its value set monotonically.

Abstract: A present invention emulation class revision process performs emulation class revisions. In one embodiment of the present invention an indication of an emulation class revision initiation is received. A safe state for performing the emulation class revision is established. In one exemplary implementation the safe state retains prior processing results. An emulation class revision is performed.

Abstract: In a threading mechanism, a system and method for providing automatic value inheritance when a parent thread creates a child thread. Upon thread creation, the system iterates over all of the inheritable thread-local values associated with a parent thread and initializes a child's values of these inheritable thread-local values, based on an appropriate child value method. The child's values may be a copy of the parent's values, or a predetermined function of the parent's values.

Abstract: A storage medium is disclosed. The storage medium having stored on it a set of programming instructions defining a number of data objects and operations on the data objects for use by another set of programming instructions to enable the other set of programming instructions to be compilable into either a version suitable for use in a hardware/software co-simulation that effectively includes calls to hardware simulation functions that operate to generate bus cycles for a hardware simulator, or another version without the effective calls, but explicitly expressed instead, suitable for use on a targeted hardware.

Abstract: The grammar of this invention is an approach to regular expressions which introduces advantages to programmers who use regular expressions for scanning, searching, and tokenizing text:

Abstract: An authorization architecture for authorizing access to resource objects in an object-oriented programming environment. In one distributed environment, the permission model of JAAS (Java Authentication and Authorization Service) is replaced or enhanced with role-based access control. Thus, users and other subjects (e.g., pieces of code) are assigned membership in one or more roles, and appropriate permissions or privileges to access resource objects are granted to those roles. Permissions may also be granted directly to users. Roles may be designed to group users having similar functions, duties or similar requirements for accessing the resources. Roles may be arranged hierarchically, so that users explicitly assigned to one role may indirectly be assigned to one or more other roles (i.e., descendants of the first role). A realm or domain may be defined as a namespace, in which one or more role hierarchies are established.

Abstract: Software development tools, such as a static analyzer, debugger or source browser, incorporates techniques to process macro expansions and provide display of macro expansion information, so as to facilitate program analysis and debugging during the development process. The tool processes macro expansions during a build of a programming project's source files, and collects and records the macro expansion information into an output file or database. The tool then utilizes the recorded information to provide a displays of the macro expansions in a graphical user interface of the tool, such as for source browsing or viewing static analysis.

Abstract: The use of XML types can allow the combination of XML- and Java-type systems, which overcomes many deficiencies in existing marshaling and unmarshaling systems by translating XML schemas which define XML data in an XML document into XML types in Java. Unlike traditional attempts at translating between XML and Java, XML schemas realized as XML types can remain fully faithful to the XML, and are capable of a number of XML data operations. In addition, the XML types can be easily transformed among themselves and Java types, and a lightweight store retaining XML information at tag level allows incremental XML marshaling and unmarshaling. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

Abstract: A programming language type system includes, in a memory, a set of numeric type including integer types, fixed-point types and floating-point types, a set of type propagation rules to automatically determine result types of any combination of integer types, fixed-point types and floating-point types, constant annotations to explicitly specify a result type of a literal constant, context-sensitive constants whose type is determined from a context of a constant according to the set of type propagation rules, an assignment operator to explicitly specify a type of a value or computation, and operator annotations to explicitly specify a result type of a computation.

Abstract: The specification may disclose a method of overloading a programming language programs, where a distinction between the overloaded methods are their return parameter types.

Abstract: The present system imports data from a source schema into a target schema while keeping the semantics, structure, and constraints of the data intact. The system is driven by user inputs that define a set of correspondences between the source schema and the target schema. The system meets the requirement that data produced at the target not violate the schema of the target; rather, the data must conform to the target schema. The system can be applied in both target materialization and query unfolding, producing all the meaningful queries required in data translation by finding all the associations that exist in the schemas. Each query maps from a source association to a target association. The user selects a subset of those queries that match the desired data translation. Target constraints are taken into account by the present system to infer the user intention and to guarantee that the generated data satisfies the structure and constraints of the target schema.

Abstract: The invention relates to the field of source code development and in particular a method and system for generating a tutorial application from one or more selected source code elements. The invention provides for a user to select one or source code elements and one or more data elements to be tagged to one or more source code elements. The selected source code elements are tagged using a mark-up language and a tutorial application is generated displaying the tagged selected source code elements and the data elements.

Abstract: A system and method for an ejection failure mechanism is provided. The system receives a request to eject an ejectable resource, and, provides information associated with a failure of the ejection of the ejectable resource, if ejection of the ejectable resource is unsuccessful. The system thus provides a deterministic mechanism through which information associated with failure of the ejection of an ejectable resource can be communicated. As such, an initiator of the request to eject can receive information associated with a cause of the ejection failure.

Abstract: A system and method for interfacing additional translation logic via composer(s) to a compiler to extend the capabilities of the compiler is provided. Generally, composer(s) can be software libraries that provide employment of componentization and polymorphism to compiler add-ons in order to extend compiler capabilities. One or more composers can be accessible to the compilation process by reference(s) made in a source code file. For example, additional translation logic for data types and/or expressions (e.g., markup language) created after compiler design can be made accessible to a compiler via composer(s), thus extending the existing compiler. The present invention mitigates problems associated with conventional compiler extending schemes and affords for compile code optimization without having to consider substantially all of the operations of a single query.

Abstract: A system and method for multi-language compilation is provided. The system and method provide a mechanism for two or more separately written compiler components to co-operate in the compilation of mixed language compilation units. The system mitigates problems associated with conventional approaches to dealing with embedded code blocks. Extensibility is facilitated through the use of a common compiler infrastructure (CCI) in the form of a base class library. Compilers for specific languages are written as extensions of these classes. Common conventions and a flexible extensibility mechanism facilitate cooperation amongst the compilers.

Abstract: A system and method for enriching object oriented programming languages by employing XML literals, embedded expressions, and a flexible validator is provided. Object instantiation is accomplished by employing XML literals with optional embedded expressions. The XML literals themselves provide a means for concise programmatic denotation, which facilitates coding and debugging of XML data. XML embedded expressions, inter alia, allow complex objects to be constructed dynamically. The validation system and method provides flexible validation for the XML literals and embedded expressions using inference rules to describe when a literal expression is valid and what the resulting witness or proof is for the value denoted by the literal.

Abstract: There is disclosed a simplified rating language for crafting price plans for ratable events which may be interpreted by either a source level interpreter resident upon a device also comprising a device based rating engine or via a virtual machine designed for said rating language.

Abstract: Certain exemplary embodiments can provide a computer-based translation method that translates source information into target information using knowledge that arises from relationships between elements of the source information.

Abstract: 14A method includes providing an executable code that is executable on a series of mobile phone models, and loading the executable code into a memory of a selected mobile phone. The method further includes providing a plurality of parameter sets having a uniform data format, each parameter set corresponding to at least one mobile phone, and then, determining the parameter set corresponding to the selected mobile phone. The method finally includes loading the selected parameter set into the memory of the selected mobile phone. According to the method, the executable code and the selected parameter set combined form operational program code of the selected mobile phone.

Abstract: A computer programming system for scripting and executing an application program including a processor, an object oriented programming language system, and a memory. The processor executes the applications program under the control of an operating system. The memory is associated with the processor and stores the operating system, the object oriented programming language system, and the application program. The object oriented programming language system includes a scripting program for composing code written in a text file according to an object oriented programming grammar, a parser program for converting the code written in the text file into one or more executable task actions and one or more properties of one or more objects, and an execution engine for executing the one or more task actions upon the one or more properties of one or more objects.

Abstract: Methods and systems are provided for mapping markup language data and schema, such as eXtensible Markup Language (XML) data and XML schema, to selected fields (cells, columns, rows) of a spreadsheet application document. An XML schema file is associated with a spreadsheet application document by providing a mechanism of adding the schema definitions to the spreadsheet application document. Furthermore, XML schema constructs such as elements, attributes, and simple content are associated to regions in the spreadsheet application document by providing a tree view structure of a generalized instance of a given XML schema file. A user may drag and drop markup language nodes representing elements, attributes and simple data content, from the tree view structure of the generalized instance of the XML schema file onto a spreadsheet worksheet grid.

Abstract: Described is a system, method, and data structure that enables an executable assembly associated with a subclass to be generated from a subclass definition within a markup document. In accordance with the invention, the subclass definition is written based on a schema. The schema may be XML-based. The schema includes a subclass tag for defining a name for the subclass. The name is associated with a type for an object that is instantiated when the executable assembly executes. The schema further includes one or more hints, such as for specifying a programming language to compile the subclass definition, for specifying a superclass from which the subclass derives, for specifying actions to perform when the object becomes instantiated, for creating an event definition and event handler for the subclass, and for specifying a property that becomes a member within the object when the object is instantiated.

Abstract: A system and method for translating output received from an electronic device. In one embodiment, the method comprises receiving self test output (STO) from an electronic device, retrieving identification information from the STO, retrieving an output decoder corresponding to the identification information and translating the STO into a specified format using the output decoder. The output decoder may be generated from the same computer code used to generate the output of the electronic device. The output decoder may include descriptive information used to describe the output generated by the electronic device. In one embodiment, the output decoder is generated when the computer code is run on an external processor. In one embodiment, the STO and the output decoder include version information. The STO may be in XML or some other format. The output decoder may be in XML schema or some other format.

Abstract: A uniform resource locator (URL) is embedded in computerized or digital documentation for a physical and/or a software process control element existing within a process control environment to thereby provide an automatic link to documentation or other applications that exist in other processing or data environments, such as in a word processing environment or in a data manipulation environment.

Abstract: Source code is compiled using a multi-stage compiler that includes a tokenizer, a type checker, and a composer. The tokenizer segments source code into a sequence of tagged segments. The source code includes at least one instruction that composes a first abstraction and a second abstraction with a selected composition operator. The parser builds a tree using the sequence of tagged segments. The type checker performs a first pass of the tree to determine whether abstractions on the tree are well typed. The composer reduces the at least one instruction composing the first and the second abstractions on the tree to a third abstraction. The composer substitutes the first and the second abstractions on the tree with the third abstraction, wherein the type checker performs a second pass of the tree to determine whether the third abstraction is well typed.

Abstract: An integrated development environment for using a mark-up language (JMSML) to access JMS/JMX interfaces. The invention comprises a JMSML Integrated Development Environment in which a Graphical User Interface (GUI) is provided to enable the user to develop JMSML application. Using this IDE, the user can Edit, Manage and Execute and see the execution results of the JMSML program all within this IDE. The IDE provides the user two ways to write the JMSML program. One way is to type in the JMSML XML code using the Source Editor and another way is to visually assemble the JMSML components from the GUI toolbars provides in the Design Editor that in turn will generate the JMSML XML source code.

Abstract: In an information processing apparatus capable of receiving data and displaying objects, the convenience of display operation is improved. More specifically, an information processing apparatus for receiving data described in a markup language and including first hierarchical level elements delimited by predetermined tags and second hierarchical level elements which belong to a range delimited by the predetermined tags, and displaying the received data on a display device, includes a receiving unit for receiving key-input first and second signals, a switching unit for switching selection between the first hierarchical level elements or between the second hierarchical level elements when the first signal is received, and switching selection between the first and second hierarchical level elements when the second signal is received, and a selected element display unit for displaying the selected element on the display device. A desired display object can be selected by a few key input operations.

Abstract: Verification of a software program may be automated by receiving a program source file comprising program source code and at least one formal specification annotation, extracting the at least one formal specification annotation from the program source file, compiling the program source code and linking the compiled program and the at least one extracted formal specification annotation to create an executable program that includes at least one reference to an executable formal specification module. According to one aspect, a virtual machine includes a target virtual machine for executing one or more program implementation instructions, and a formal virtual machine for executing one or more formal specification modules corresponding to one or more program implementation instructions and configured to call a formal specification module, and to compare a first result obtained by executing the program implementation instructions with a second result obtained by the call to the formal specification module.

Abstract: A network-based computing system that automates, simplifies, and optimizes the compilation, deployment, and execution of an application by any type of a client machine connected to a server via any type of a network connection. The system includes a client runtime environment, a server runtime environment and an object-oriented markup-business logic binding mechanism. The client runtime environment manages client side code and screen definitions. The server runtime environment dynamical compiles code to ensure client platform compatibility. The system delivers network applications on demand, by separating them into lightweight modules and delivering these modules.

Abstract: Programming abstractions with at least one expression are composed to a single abstraction using a composition operator. Expressions from the abstractions are unfolded by removing the prefix of each abstraction and substituting formal parameter names in each expression with a common parameter name to define open variables. The unfolded expressions are transformed to a reduced expression using a composition pattern that tunes semantics of the composition operators. The reduced expression is nested in the single abstraction by: appending a selected prefix of the composed abstraction to the reduced expression, binding the open variables of the reduced expression to the formal parameter of the selected prefix, and computing the type of the formal parameter of the selected prefix.

Abstract: An outline-processor that surrounds each program constituted from a plurality of programs by a respective frame having diagram-displays that connect the frames by a line, such that if the inside of the frame is clicked by a mouse, a source of the program therein is outline-displayed. Diagram-displays display respective arguments of the programs in the vicinity of the frames of the programs and display frame lines of the program thick before expansion and thin after expansion to change the thicknesses of the frame lines of the program before and after expansion. Further, when the plurality of programs are outline-displayed in a plural number, a newest outline-display is displayed in front.

Abstract: A method is described for providing required values as needed in a class of computer-program compilers, which transform a first computer-program (source program) into a second computer-program (target program), such that the target program has modified or augmented functionality. The source and target programs may be written in the same or different programming languages. As an example, the compiler may perform automatic differentiation (AD), where the source program evaluates a function and the target program evaluates both the function and its derivative, and both programs are written in a high level programming language such as Fortran. In this example, required values are needed in the target program to evaluate its control flow, index expressions, or local derivative information. Providing required values in an efficient way is essential in AD but constitutes a major complexity for various modes of AD. For typical applications, our method is significantly more efficient than standard approaches.

Abstract: An arrangement is provided for estimating type-cast sets of a program. Type-cast sets of a program are computed with respect to the declared types contained in the program.

Abstract: There is provided a method for generating a software module based upon elements from multiple software modules. The method includes the step of extracting a plurality of sets of elements from the multiple software modules based upon at least one extraction criterion. Any elements in the sets that violate at least one correctness and completeness criterion are identified. The violating elements are automatically brought into compliance with the at least one correctness and completeness criterion. A plurality of single software modules is generated, wherein each of the single software modules contains one of the sets of elements. The plurality of single software modules are composed to form a final, single software module.

Abstract: The present invention provides a system and method for automatically tagging documents with a given set of user-defined tags. The present invention takes as input the document to be tagged, and also a list of tags along with keywords belonging to these tags. The present invention then selects a tag, and scans the document for sentences that have keywords corresponding to the selected tag. Sentences that match the keywords are tagged with the selected tag. Once the whole document has been scanned, the present invention selects the next tag and repeats the whole process. This process is repeated until all tags have been seen.