Abstract: A vapor compression apparatus and a method for operating a vapor compression system are provided. A working fluid is conveyed through a vapor compression system having a fluid line. A charging element is connected to the fluid line to direct an electric charge into working fluid. The electric charge is operable to disrupt intermolecular forces and weaken intermolecular attraction to enhance expansion of the working fluid to the vapor phase, increasing the capacity, performance and efficiency of the system components, and reducing system cycling mechanical wear and energy consumption.

Abstract: An automatic test generation system in which the coverage levels of the tests can be controlled to tradeoff between the extent of the test conducted and the length of time required to execute the test. The system under test is modeled as an extended finite state machine made up of interconnected models. The coverage level of each model can be controlled to avoid generating paths that differ only be edges within certain models if those differing edges are already included in other paths. The coverage level for each model can be set automatically through a process which computes the effect on the total number of paths generated when the coverage level of selected models is varied.

Abstract: An apparatus and method for generating connected graphs for display on a computer monitor. A data structure and virtual map are defined which provide a linked list of objects appearing at any location in the connected graph, the virtual map being larger than the dimensions of the display monitor if the connected graph demands larger dimensions. Commands carried out with respect to any object on the monitor are correlated with the cell maps in the virtual map, which point to the linked lists of objects, the lists in turn pointing to objects stored in an object records database. This provides rapid access to all objects at any given location on the display or in the connected graph. When a user gives a command to create a connection between two objects in the graph, the method generates the shortest connection possible, in terms of both pixel length and arc length for arc-connections, balanced against a minimization of collisions by the connection with existing objects, including other connections.

Abstract: A method for generating test programs for an implementation of a specification that has been modeled as an extended finite state machine (EFSM), the EFSM including vertices and transitions, where the transitions represent functions to be performed by the implementation, including predicates and actions such as variable assignments. The method includes traversing the EFSM in a depth-first manner from a root model start state to a root model exit state, through intermediate vertices which may be normal states or models. Models include further vertices and transitions, and may be called as submodels or as go-to models, where a go-to model includes an EFSM exit state. The EFSM may be traversed exhaustively, such that all possible paths are traversed, or in a partial transition coverage mode, where a user-defined subset of the possible paths are traversed.