Abstract: The invention comprises a system and method for “waterfall” type payment processing using multiple alternative payment sources. A payor provides account information for multiple payment sources, such as a bank checking account, savings account, first credit card account, second credit card account, and so forth. The multiple payment sources are prioritized so that one is a primary payment source, another is a secondary payment source, another is a tertiary payment source, and so forth. After setting up the waterfall payment arrangement, when a bill becomes due a payee or third party payment administrator submits transactions against the payment sources in their order of priority until the payment is satisfied. Other variations and enhancements are disclosed.

Abstract: In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.

Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: The present invention is a collapsible self-propelled chair on wheels that is lightweight in construction and easily collapsed, carried, stored and transported by public or private means. The chair performs the function of a wheelchair while avoiding the appearance of a traditional wheelchair thus avoiding the invalid stigma often associated with wheelchairs. It can be configured as an assistive mobility device to fill the unmet needs of aging healthy adults who wish to retain their independence and social interactions or a medical device to assist those with medical needs. Additional features such as removable armrest, seat belts, a footrest, or a reclining back are easily added during manufacture and because of the chairs uncomplicated design and duplicity of parts, it is very economical to manufacture.

Abstract: The present invention relates to collapsible cribs. The cribs have one or more of the following characteristics: adjustable length and/or, width and/or height, lightweight, easily collapsed, very compact when collapsed and easily carried, stored and transported. Embodiments disclosed relate to pens, cribs, and play yards with and without wheels.

Abstract: The present invention relates to collapsible cribs. The cribs have one or more of the following characteristics: adjustable length and/or, width and/or height, lightweight, easily collapsed, very compact when collapsed and easily carried, stored and transported. Embodiments disclosed relate to pens, cribs, and play yards with and without wheels.

Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: Irregularities are provided in at least one dimension of a torus or mesh network for lower average path length and lower maximum channel load while increasing tolerance for omitted end-around connections. In preferred embodiments, all nodes supported on each backplane are connected in a single cycle which includes nodes on opposite sides of lower dimension tori. The cycles in adjacent backplanes hop different numbers of nodes.

Abstract: The present invention relates to collapsible self-supported cribs which have one or more of the following characteristics: adjustable length and/or, width and/or height, lightweight, easily collapsed, very compact when collapsed and easily carried, stored and transported. The cribs contain one or more of the following elements: anti-torque posts, crossed support arms, telescoping crossed support arms, flexible liners, Structure Locking Elements, Anti-Collapse Locking Elements and Anti-Tipping Assemblies.

Abstract: In a network router, a tree structure or a sorting network is used to compare scheduling values and select a packet to be forwarded from an appropriate queue. In the tree structure, each leaf represents the scheduling value of a queue and internal nodes of the structure represent winners in comparisons of scheduling values of sibling nodes of the tree structure. CBR scheduling values may first be compared to select a queue and, if transmission from a CBR queue is not timely, a packet may be selected using WFQ scheduling values. The scheduling values are updated to reflect variable packet lengths and byte stuffing in the prior packet. Scheduling may be performed in multiple stages.

Abstract: The required length of a route descriptor in a source routing system is obtained by inserting an implied exit field, use of run-length encoding, and use of variable-length encoding. In the variable-length encoding, codes having lesser bits are reserved for preferred directions. Preferred direction may be encoded in the routing header, and it may be implied by the arrival port.

Abstract: The present invention is a portable chair with caster wheels that is lightweight in construction and easily collapsed, carried, stored and transported by public or private means. The chair can be configured as an assistive mobility device to fill the unmet needs of aging healthy adults who wish to retain their independence and social interactions. It can also be configured as a collapsible office chair to meet the needs of employers with temporary working staff and for use by college students in crowded dorm rooms. Additional features such as an armrest, a foot rest, or a reclining back are easily added during manufacture and because of the chairs uncomplicated design and duplicity of parts, it is very economical to manufacture.

Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: The required length of a route descriptor in a source routing system is obtained by inserting an implied exit field, use of run-length encoding, and use of variable-length encoding. In the variable-length encoding, codes having lesser bits are reserved for preferred directions. Preferred direction may be encoded in the routing header, and it may be implied by the arrival port.

Abstract: Irregularities are provided in at least one dimension of a torus or mesh network for lower average path length and lower maximum channel load while increasing tolerance for omitted end-around connections. In preferred embodiments, all nodes supported on each backplane are connected in a single cycle which includes nodes on opposite sides of lower dimension tori. The cycles in adjacent backplanes hop different numbers of nodes.

Abstract: Irregularities are provided in at least one dimension of a torus or mesh network for lower average path length and lower maximum channel load while increasing tolerance for omitted end-around connections. In preferred embodiments, all nodes supported on each backplane are connected in a single cycle which includes nodes on opposite sides of lower dimension tori. The cycles in adjacent backplanes hop different numbers of nodes.

Abstract: A list of prefix keys, including enclosing prefix key pairs, are stored in leaves of a tree structure. In the leaf nodes, a prefix search key is compared to a set of prefix keys to identify a longest matching prefix. Each leaf node includes a single result pointer to a block of results and a single enclosing pointer to a result in a block of results for another node. Internal nodes which point to subsequent nodes include partitioning nodes and table nodes. In each partitioning node, a prefix search key is compared to a set of prefix keys which point to subsequent nodes through a common pointer and an index. Within each node, a middle prefix key is stored ahead of sets of high and low prefixes.

Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRAMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: Prefix searches for directing internet data packets are performed in a prefix search integrated circuit. The integrated circuit includes an array of search engines, each of which accesses a prefix search tree data structure to process a prefix search. An SDRAM is dedicated to each search engine, and SDRAMs share address and control pins to plural search engines on the IC chip. Internal nodes of the tree data structure are duplicated across banks of the SDRALMs to increase bandwidth, and leaf nodes are stored across the SDRAM banks to reduce storage requirements. Within each search engine, data stored in a data register from an SDRAM is compared to a prefix search key stored in a key register. Based on that comparison, an address is calculated to access further tree structure data from the SDRAM. Packet descriptors containing search keys are forwarded to the search engines from an input queue and the search results are forwarded to an output queue, the same packet order being maintained in the two queues.

Abstract: The present invention is a portable chair with caster wheels that is lightweight in construction and easily collapsed, carried, stored and transported by public or private means. The chair can be configured as an assistive mobility device to fill the unmet needs of aging healthy adults who wish to retain their independence and social interactions. It can also be configured as a collapsible office chair to meet the needs of employers with temporary working staff and for use by college students in crowded dorm rooms. Additional features such as an arm rest, a foot rest, or a reclining back are easily added during manufacture and because of the chairs uncomplicated design and duplicity of parts, it is very economical to manufacture.