Abstract: A computer architecture allows for simplified exception handling by restarting the program after exceptions at the beginning of idempotent regions, the idempotent regions allowing re-execution without the need for restoring complex state information from checkpoints. Recovery from mis-speculation may be provided by a similar mechanism but using smaller idempotent regions reflecting a more frequent occurrence of mis-speculation. A compiler generating different idempotent regions for speculation and exception handling is also disclosed.

Abstract: A computer architecture allows for simplified exception handling by restarting the program after exceptions at the beginning of idempotent regions, the idempotent regions allowing re-execution without the need for restoring complex state information from checkpoints. Recovery from mis-speculation may be provided by a similar mechanism but using smaller idempotent regions reflecting a more frequent occurrence of mis-speculation. A compiler generating different idempotent regions for speculation and exception handling is also disclosed.

Abstract: A computer architecture allows for simplified exception handling by restarting the program after exceptions at the beginning of idempotent regions, the idempotent regions allowing re-execution without the need for restoring complex state information from checkpoints. Recovery from mis-speculation may be provided by a similar mechanism but using smaller idempotent regions reflecting a more frequent occurrence of mis-speculation. A compiler generating different idempotent regions for speculation and exception handling is also disclosed.

Abstract: A computer architecture allows for simplified recovery after mis-speculation during speculative execution by controlling speculation to occur within idempotent regions that may be recovered by re-execution of the region without the need for restoring complex state information from checkpoints. A compiler for increasing the size of idempotent regions is also disclosed.

Abstract: A computer architecture allows for simplified exception handling by restarting the program after exceptions at the beginning of idempotent regions, the idempotent regions allowing re-execution without the need for restoring complex state information from checkpoints. Recovery from mis-speculation may be provided by a similar mechanism but using smaller idempotent regions reflecting a more frequent occurrence of mis-speculation. A compiler generating different idempotent regions for speculation and exception handling is also disclosed.

Abstract: A computer architecture allows for simplified recovery after mis-speculation during speculative execution by controlling speculation to occur within idempotent regions that may be recovered by re-execution of the region without the need for restoring complex state information from checkpoints. A compiler for increasing the size of idempotent regions is also disclosed.

Abstract: A system and appertaining methods are provided that makes it possible to order pizza and other products using an instant messaging or other signaling mechanisms such as cell-phones and two-way pagers, using a tokenized representation of the order elements. Signaling mechanisms provide context sensitive help to facilitate the use of the tokens, and a system then processes the order to the end point system for immediate preparation and/or delivery of the products. Communications may be implemented by a system in which a non-secure channel is used to poll a central server to determine if there is any data available, and the actual data transmission, if available, is provided over a secure channel.

Abstract: A method is provided for securely storing and retrieving data. A data unit is split by an entity, into a first component and at least a further second component such that the data unit cannot be reconstructed without having the first and second component. The second component is stored on a secure server in a non-volatile memory, the secure server being separate from any entity that may store the first component. The first and second component of the data unit are then subsequently accessed by a secure data retriever who is not an originator of the data, where the second component is accessed from the secure server. The secure data retriever combines these components into the original data unit. The method is particularly applied in commerce for credit card information in which significant restrictions are placed on the permanent storage of such data.

Abstract: A method is provided for securely storing and retrieving data. A data unit is split by an entity, into a first component and at least a further second component such that the data unit cannot be reconstructed without having the first and second component. The second component is stored on a secure server in a non-volatile memory, the secure server being separate from any entity that may store the first component. The first and second component of the data unit are then subsequently accessed by a secure data retriever who is not an originator of the data, where the second component is accessed from the secure server. The secure data retriever combines these components into the original data unit. The method is particularly applied in commerce for credit card information in which significant restrictions are placed on the permanent storage of such data.

Abstract: A method provides for group purchasing of a product or service, comprising determining, by a first customer, a product or service to purchase from a vendor, contacting, by the first customer, a second customer interested in purchasing the product or services, establishing a customer-defined group identity with the first and second customer being group members, purchasing the product or service from the vendor by the first and second customer using the group identity, and providing, by the vendor, a benefit that is at least one of a pre-purchase incentive and a post-purchase reward to the first and second customer based on the group identity. The sequencing of the method steps can be varied, and various incentive and communication arrangements can also be varied.

Abstract: A method is disclosed by which a customer places an order for the provision of a service with one of one or more vendors that utilize electronic ordering terminals to process service orders, by transmitting information between the customer's computer and a server. The disclosed method comprising the steps of associating with each vendor a plurality of coordinate points defining the vertices of a polygonal geographic region within which region the vendor provides service, receiving information from a customer indicating the location to which service is to be provided; converting the received information into a coordinate point indicating the point to which service is to be provided; selecting each of the defined polygonal geographic regions that encompass the customer coordinate point; identifying the vendors associated with the selected polygonal geographic regions; choosing the vendor with which the order is to be placed, and placing an order with the chosen vendor.

Abstract: A system and appertaining methods are provided that makes it possible to order pizza and other products using an instant messaging or other signaling mechanisms such as cell-phones and two-way pagers, using a tokenized representation of the order elements. Signaling mechanisms provide context sensitive help to facilitate the use of the tokens, and a system then processes the order to the end point system for immediate preparation and/or delivery of the products. Communications may be implemented by a system in which a non-secure channel is used to poll a central server to determine if there is any data available, and the actual data transmission, if available, is provided over a secure channel.

Abstract: A system for storing and indexing unique computer transactions taken asynchronously across one or more systems such that a complete database of all transactions taken by all member systems can be recreated in a coherent time sequence in each member system.

Abstract: A method and appertaining system are provided for creating and utilizing unique transaction identifiers for transactions within a service center comprising multiple processing hosts. A service center transaction number range based on a service center transaction handling capacity is established, and both first and second processing hosts each having their own transaction handling capacity are provided to the service center. A system-wide unique range of transaction sequence numbers are allocated to the first and second processing hosts that are respectively related to the handling capacity of each host. The hosts then use a time value combined with the unique range of identifiers for the transactions transmitted throughout the system.

Abstract: A method and computer operating system is disclosed to provide redundant hardware and software from multiple compatible computer operating systems and servers of a proprietary organization connected by a communication medium or connected on the Internet as a computer network as requested from said multiple servers by a specific host computer operating system per a transfer protocol.

Abstract: Internet service that links a plurality of stores of a chain of restaurants together on the Internet at a central server website, whereby the Internet service is based upon postal address alone, and where the software at the web site determines the store closest to the calling customer on the Internet strictly by both postal address which corresponds to the same type of postal-address driven system employed at each store serviced by the system of the invention. The customer order is input directly into the computerized ordering system of the closest, selected store, thereby bypassing the conventional manner of ordering through a live order-taker. The system of the invention is directly linked to the computers of the restaurants of the chain of restaurants, whereby the menu and pricing of each store may be made uploaded to the web site, and displayed on the Internet server web site.

Abstract: A method and apparatus is provided to retain elements of the spine and/or pelvis in a desired spatial relationship. A plurality of fasteners are connected with a plurality of the elements. A longitudinal member is connected with the fasteners by a plurality of connector members. The longitudinal member and fasteners are movable relative to each other to adjust the distance between the longitudinal member and fasteners to thereby obtain the desired spatial relationship between the longitudinal member and elements to which the fasteners are connected. Once the longitudinal member and fasteners have been positioned in the desired spatial relationship, clamps are engaged to hold the longitudinal member, fasteners and connector members against relative movement. To provide for the adjustability of the longitudinal member relative to the fasteners, oblong openings are formed in the connector members.

Abstract: A bone alignment assembly is disclosed having bone anchor subassemblies for securing to both bones and a bone position retainer, wherein the bone position retainer includes a longitudinal member for maintaining a desired alignment of the bones when the bone anchor assemblies are secured to the bone position retainer. Each of the bone anchor subassemblies includes a shaft and one or more pairs of components (e.g., washers) wherein the components of each pair have mating spherical concave and convex surfaces that can mate together in a plurality of angular positions. When the shaft extends through each of the pairs of mating components, and also through a passageway of the bone position retainer that is sandwiched between the two pairs of mating components, the shaft can be secured at any one of a plurality of orientations relative to the bone position retainer.

Abstract: A method and apparatus is provided to retain elements of the spine and/or pelvis in a desired spatial relationship. A plurality of fasteners are connected with a plurality of the elements. A longitudinal member is connected with the fasteners by a plurality of connector members. The longitudinal member and fasteners are movable relative to each other to adjust the distance between the longitudinal member and fasteners to thereby obtain the desired spatial relationship between the longitudinal member and elements to which the fasteners are connected. Once the longitudinal member and fasteners have been positioned in the desired spatial relationship, clamps are engaged to hold the longitudinal member, fasteners and connector members against relative movement. To provide for the adjustability of the longitudinal member relative to the fasteners, oblong openings are formed in the connector members.

Abstract: An apparatus for maintaining vertebrae of a spinal column in a desired spatial relationship includes a longitudinal member extendable along the spinal column. A fastener connects the longitudinal member to a vertebra. The fastener has a first end portion engaging a vertebra and a second end portion. A staple, through which the second end portion of the fastener is extendable, includes a plurality of projections for engaging a vertebra. A washer, including an opening through which the second end portion of the fastener is extendable, engages the staple and the longitudinal member. The washer prevents pivotal movement of the longitudinal member relative to the staple. The longitudinal member, the fastener, the staple, and the washer are connected together.