Author: claimsbot

1. A computer hardware system for editing a video signal comprising:
a first signal bus employing a first bus interface;
a second signal bus employing a second bus interface, and including an array of point-to-point interconnects, wherein each point-to-point interconnect is a multiplexed channel link capable of carrying a digital video stream, said video signal being carried by second signal bus along one or more of said point-to-point interconnects;
a router circuit for managing the routing of point-to-point interconnects on said second signal bus;
an IO circuit for inputting and outputting said video signal to said computer hardware system, said IO circuit converting said video signal into said digital video streams and routing said digital video streams to said router circuit;
a general purpose computer connected to said first bus and operating according to a first operating system; and
a plurality of video graphics computers, said video graphics computers having inputs and outputs connected to said point-to-point interconnects of said second signal bus, said routing circuit being operative to vary routing of said video streams through said point to point interconnects so as to pass said video streams through different ones of said video graphics computers.
2. The system of claim 1 wherein said general purpose computer is operative to command said video graphics computers to vary the alterations of a video signal input to each of said video graphics computers.
3. The system of claim 1 wherein said general purpose computer is operative to command said routing circuit to vary said routing of point-to-point interconnects on said second signal bus such that different video signals are presented to different ones of said video graphics computers.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method of routing comprising:
receiving updated link information from at least one other node in a wireless utility network;
receiving a packet from a node in the wireless utility network, the packet including a route to a destination address, the route specifying a path through one or more nodes in the wireless utility network;
determining whether there is an alternate route to the destination address;
in the event of the determination of at least one alternate route to the destination address, comparing the at least one alternate route to the route included in the packet to determine a preferred route;
in the event the preferred route is the at least one alternate route, replacing the route included in the packet with the preferred route; and
transmitting the packet according the to included route,
wherein the determination of the preferred route includes the received updated link information obtained by the utility node from at least one neighboring utility node, and wherein the obtained information is used to determine an updated path cost of the route included in the packet for comparison to determine the preferred route.
2. The method of claim 1, wherein the received link cost information used to update path cost specifies one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops.
3. The method of claim 2, wherein the received link cost information specifies link cost for at least one link in the wireless utility network.
4. The method of claim 2, wherein the route included in the received packet was determined by a gateway associated with the wireless utility network.
5. The method of claim 2, wherein path cost is based upon a combination of at least one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops, links with low link costs.
6. The method of claim 2, wherein the received link cost information is retrieved from packets received by the utility node for forwarding to another node in the wireless utility network.
7. The method of claim 2, wherein the received link cost information is received in response to at least one request for information of neighboring utility nodes.
8. The method of claim 2, further comprising:
transmitting the selected route to at least one other node in the wireless utility network.
9. The method of claim 8, wherein in the event the selected route is the route included in the packet prior to transmission, transmitting the selected route to at least one other node in the wireless utility network includes transmitting the updated path cost for the selected route.
10. A wireless utility network, comprising:
a plurality of utility nodes arranged to communicate within a wireless utility network; and
at least one gateway to the wireless utility network arranged to communicate with at least one of the utility nodes in the wireless utility network, the at least one gateway connecting the wireless utility network to at least one other network;
wherein a packet transmitted from one utility node in the wireless utility network to another utility node in the wireless utility network is transmitted according to a route included in the transmitted packet,
wherein the route included in the transmitted packet is updated with received network information to determine an updated path cost of the included route and compared to alternate routes to select a preferred route based upon path cost, and
wherein the selected preferred route is included in the packet and the packet is transmitted to another node in the utility network according to the selected preferred route.
11. The wireless utility network of claim 10, wherein the received link cost information used to update path cost specifies one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops.
12. The wireless utility network of claim 10, wherein the received link cost information is retrieved from packets received by the utility node for forwarding to another node in the wireless utility network.
13. The wireless utility network of claim 10, wherein the received link cost information is received in response to at least one request for information of neighboring utility nodes.
14. The wireless utility network of claim 10, further comprising:
transmitting the selected route to at least one other node in the wireless utility network.
15. The wireless utility network of claim 14, wherein in the event the selected route is the route included in the packet prior to transmission, transmitting the selected route to at least one other node in the wireless utility network includes transmitting the updated path cost for the selected route.
16. A wireless network, comprising
at least one server including a server controller and a radio for communicating in a wireless network, wherein the server controller controls the receipt and transmission of packets via the server radio, and wherein the server controller may select a route to nodes in the wireless network;
a plurality of nodes in the wireless network including a node controller and a node radio, wherein the node controller controls the receipt and transmission of packets via the node radio, and wherein the node controller may select a route to the at least one server;
wherein a packet transmitted from one utility node in the wireless utility network to the server in the wireless utility network is transmitted according to a route included in the transmitted packet,
wherein the route included in a transmitted packet is updated with received network information to determine an updated path cost of the included route and compared to alternate routes to select a preferred route based upon path cost, and
wherein the selected preferred route is included in the packet which is transmitted to another node in the utility network according to the selected preferred route.
17. The wireless network of claim 16, wherein inclusion of the selected route replaces the route included in a transmitted packet.
18. The wireless network of claim 16, wherein the received link cost information used to update path cost specifies one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops.
19. The wireless network of claim 16, wherein path cost is based upon a combination of at least one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops.
20. The wireless network of claim 16, wherein the received link cost information is retrieved from packets received by the utility node for forwarding to another node in the wireless utility network.
21. The wireless network of claim 16, wherein the received link cost information is received in response to at least one request for information of neighboring utility nodes.
22. The wireless network of claim 16, wherein the selected preferred route is transmitted to at least one other node in the wireless utility network.
23. The wireless network of claim 22, wherein in the event the selected preferred route is the route included in the packet prior to transmission, transmitting the selected route to at least one other node in the wireless utility network includes transmitting the updated path cost for the selected route.
24. The wireless network of claim 23, wherein the server receiving a packet from a node examines the packet to retrieve updated path cost information, and wherein the updated path cost information is used by the server controller in route selection.
25. The wireless network of claim 24, wherein the server calculates the path cost of a route based on at least one of: least possible number of hops, most robust hops, lowest traffic hops, or fastest hops.

1. A system for RTL test insertion in an integrated circuit layout pattern, the system comprising:
a core module describing a function defined by logical elements, interconnections between logical elements, input pins and output pins;
a test wrapper, which encapsulates the core module, comprises input pins and output pins corresponding to the input pins and output pins of the core module, and creates test pins for the core module regardless of whether the core module includes test structures with corresponding test pins; and
a smart wrapper, which encapsulates the test wrapper and comprises input pins and output pins corresponding to the input pins and output pins of the test wrapper, wherein the smart wrapper hides the test pins and assigns the test pins to a non-asserted state, wherein the smart wrapper places an assertion on one or more of the test pins for static or dynamic testing of the integrated circuit layout pattern.
2. The system of claim 1 wherein the test wrapper and the smart wrapper comprise computer readable blocks of RTL code.
3. The system of claim 1 further comprising:
chip-level test resources coupled to gate-level test structures of the core module that are swapped in at the gate-level for the RTL-level test pins of test wrapper.
4. The system of claim 1 wherein the core module comprises gate-level test structures, and wherein the test pins of the test wrapper correspond to pins of the gate-level test structures.
5. The system of claim 1 wherein the core module comprises a placed and routed macro, and wherein the test wrapper represents test structures to a design tool for the core module that does not include test structures.
6. A system for test insertion within an integrated circuit layout pattern, the system comprising:
a core module describing a function defined by logical elements, interconnections between logical elements, input pins and output pins, the core module defining a test structure with module test pins;
an RTL test wrapper, which encapsulates the core module, comprises input pins and output pins corresponding to the input pins and output pins of the core module, and creates test pins coupled to the module test pins; and
an RTL smart wrapper, which comprises input and output pins corresponding to the input pins and output pins of the RTL test wrapper, wherein the RTL smart wrapper ties off and hides test pins of the RTL test wrapper.
7. The system of claim 6 wherein the integrated circuit layout pattern comprises gate-level test resources, and wherein the test structure of the core module is coupled to the gate-level test resources through the smart wrapper by the test pins.
8. The system of claim 6 wherein the smart wrapper further comprises:
assertions, which assign at least one of a value or an expectation of the value to one or more test pins.
9. The system of claim 8 wherein the smart wrapper assigns the value to an input test pin for static formal model checking of the core module after test hookups are made to global test resources.
10. The system of claim 8 wherein the smart wrapper assigns the value to an input test pin for dynamic assertion-based verification of the core module.
11. The system of claim 8 wherein a change to the value during functional simulations is indicative of improper use of the test pin.
12. The system of claim 6 wherein the test pins of the test wrapper are tied to a non-asserted state by the smart wrapper.
13. A system for test insertion in an integrated circuit layout pattern, the system comprising:
a core module describing a function defined by logical elements, interconnections between logical elements, input pins and output pins;
a test wrapper, which encapsulates the core module comprises input pins and output pins corresponding to the input pins and output pins of the core module, and creates test pins representing test structures of the core module; and
a smart wrapper, which encapsulates the test wrapper, comprises input and output pins corresponding to the input pins and output pins of the RTL test wrapper, and assigns the test pins to a non-asserted state, and wherein the smart wrapper hides the test pins.
14. The system of claim 13 wherein the integrated circuit layout pattern comprises chip level test resources and wherein the core module is coupled to the chip level test resources though the smart wrapper by the test pins.
15. The system of claim 13 wherein the smart wrapper further comprises:
assertions placed on one or more test pins of the core module.
16. The system of claim 15 wherein the assertions comprise values for checking test pin connections statically through formal verification techniques.
17. The system of claim 13 wherein the non-asserted state comprises a value selected such that test structures of the core module are not activated.
18. The system of claim 13 wherein the core module comprises:
a core test structure;
core test input pins coupled to the core test structure, which receive a test input; and
core test output pins coupled to the core test structure, which deliver a test output from the core test structure;
wherein the core test input pins and the core test output pins are coupled to the test pins of the test wrapper at an RTL level.
19. The system of claim 13 wherein the core module, the test wrapper, and the smart wrapper comprise computer readable RTL code.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. An MFA (Metabolic Flux Analysis) information system comprising a computer operatively arranged with a computer readable medium storing a program executable by said computer for generating, editing, storing and visualizing an MFA model feature and an MFA object and editing, storing and visualizing the result obtained by performing MFA based on the MFA object, the system comprising:
an MFA model feature authoring tool for generating a DID (Document Type Definition) or schema file of XML (eXtensible Markup Language) from an MFA model feature, wherein the MFA model feature comprising metabolic network information, metabolic condition information, MFA result information and MFA visualization information is generated, collected and edited prior to generation of the DID or schema file of XML;
an MFA object authoring tool for generating a new MFA object with reference to the DID or schema file of XML generated by the MFA model feature authoring tool or storing an edited MFA object in the XML file after editing the existing MFA object; and
an MFA object analysis browser for reading the DID or schema file of XML generated by the MFA model feature authoring tool and the XML file stored by the MFA object authoring tool to visualize the MFA object, carrying out MFA based on the MFA object to obtain an MFA result, and visualizing by integrating the MFA result with MFA object information; and wherein the MFA model feature authoring tool comprises:
a means of defining a new MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method to obtain a defined MFA result; and
a means of changing the related existing MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method of the edited MFA model feature to obtain a changed MFA result.
2. The MEA information system according to claim 1, wherein the MEA object authoring tool comprises:
a means of inputting a new MEA object name, metabolic network information, metabolic condition information, MEA result information and MEA visualization information; and
a means of changing the related existing MEA object name, metabolic network information, metabolic condition information, MEA result information and MEA visualization information.
3. The MEA information system according to claim 1, wherein the MEA object analysis browser comprises:
a means of parsing the DID or schema file of XML generated by the MEA model feature authoring tool to obtain information about a data format and the MEA model feature;
a means of parsing the XML file generated by the MEA object authoring tool to obtain information about the MEA object;
a means of visualizing the obtained information in a text or graph form to output; and
a means of performing MEA based on the obtained information and visualizing the MEA result in a text or graph form, or visualizing by combining the MEA result with the obtained information in a text or graph form to output.
4. A method for operating an MFA (Metabolic Flux Analysis) information system capable of generating, editing, storing and visualizing an MFA model feature and an MFA object and editing, storing and visualizing the result obtained by performing MFA based on the MFA object, the method comprising the steps of:
(a) a first step of generating a DID (Document Type Definition) or schema file of XML (eXtensible Markup Language) from an existing MFA model feature, wherein the existing MFA model feature comprising metabolic network information, metabolic condition information, MFA result information and MFA visualization information is generated, collected and edited prior to generation of the DID or schema file of XML within an MFA model feature authoring tool;
(b) a second step of generating a new MFA object with reference to the generated DID or schema file of the XML and storing the MFA object in an XML file after editing an existing MFA object;
(c) a third step of reading the DID or schema file of the XML generated in the first step and the XML file stored in the second step to visualize the MFA object; and
(d) a fourth step of carrying out MFA based on the MFA object visualized in the third step (c) to obtain an MFA result, editing, storing and visualizing the MFA result; and wherein the first step comprises:
(i) a first sub-step of defining a new MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method, to obtain a defined MFA result; and
(ii) a second sub-step of collecting and editing related existing information to change an MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method of the edited MFA model feature, to obtain a changed MFA result.
5. The method according to claim 4, wherein the first step comprises storing the result defined in the first sub-step and the result changed in the second sub-step in a DID or schema file of XML.
6. The method according to claim 4, wherein the second step comprises:
(i) a first sub-step of inputting a new MEA object name, metabolic network information, metabolic condition information, MEA result information and MEA visualization information; and
(ii) a second sub-step of changing the corresponding existing MEA model object name, metabolic network information, metabolic condition information, MEA result information and MEA visualization information.
7. The method according to claim 6, wherein the second step comprises storing the result inputted in the first sub-step and the result changed in the second sub-step in an XLM file.
8. The method according to claim 4, wherein the third step comprises:
(i) a first sub-step of parsing the DID or schema file of XML generated in the first step to obtain information about a data format and the MEA model feature;
(ii) a second sub-step of parsing the XML file generated in the second step to obtain information about the MEA object; and
(iii) a third sub-step of visualizing the information obtained in the first and second sub-steps in a text or graph form to output.
9. The method according to claim 8, wherein the fourth step comprises:
(i) a first sub-step of performing MEA based on the information obtained in the first and second sub-steps of the third step; and
(ii) a second sub-step of visualizing the result of the first sub-step in a text or graph form or visualizing by combining the result of the first sub-step with the existing information in a text or graph form to output.
10. A computer readable recording medium storing a program for executing a method of operating an MFA (Metabolic Flux Analysis) information system comprising:
(a) defining a new MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method, to obtain a defined MFA result;
(b) collecting and editing related existing information to change the MFA model feature name, types of metabolic network information, metabolic condition information, MFA result information, MFA visualization information, a data type and a storing method, to obtain a changed MFA result; and
(c) storing the defined MFA result and the changed MFA result in a DID (Document Type Definition) or schema file of XML, wherein the DID or schema file of XML is generated from a generated MFA model feature comprising metabolic network information, metabolic condition information, MFA result information and MFA visualization information;
(d) generating a new MFA object with reference to the generated DID or schema file of the XML generated in said step (c) and editing an existing MFA object, storing the MFA object in an XML file, inputting a new MFA object name, metabolic network information, metabolic condition information, MFA result information, MFA visualization information, and changing the existing MFA model object name, metabolic network information, metabolic condition information, MFA result information and MFA visualization information;
(e) storing the data inputted and the data changed in said step (d) in the XML file;
(f) parsing the generated DID or schema file of XML to obtain information about a data format and the MFA model feature and parsing the XML file to obtain information about the MFA object;
(g) visualizing the information obtained in said step (I) in text and graph forms (node and edge) to output; and
(h) performing MFA based on the information obtained in said step (I) to obtain an MFA result, and visualizing the MFA result in a text or graph form or visualizing by combining the MFA result with the existing information in a text or graph form to output.