Abstract: A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field(s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field(s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.

Abstract: A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field(s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field(s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.

Abstract: A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field(s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field(s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.

Abstract: A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field(s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field(s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.

Abstract: A permutation algorithm using modular arithmetic is applied to the cells of one or more specific fields of a database or other file type. This permutation reorders the cells of the specific field(s) without altering content of any individual cell, thereby hiding relationships between cells of the permuted field(s) and the other information in the associated records. The permutation algorithm may use modular addition and modular subtraction, in either order. Different permutation algorithms may use varying numbers of parameters. To locate a specific cell in a permuted field, the parameter(s) from the permutation, an identification of the specific record associated with the cell, and an identification of the specific permuted field are applied in a modular arithmetic operation. A specific record with which a specific cell in a permuted field is associated may be obtained by an inverse modular arithmetic operation.

Abstract: Real-time, individualized traffic-routing assignments and recommendations are automatically determined and provided to multiple participants traversing through a specific area in association with a given event associated with a particular organization. A set of rules is applied to minimize the time to traverse through the area in association with the event, summed over the multiple participants, accounting for physical and incentive-compatibility constraints. An initial assignment is determined for each participant, based on the rules. Each initial assignment includes a departure time and an initial route for the participant. Updated information is received, such as real-time traffic information. Real-time recommendations are determined for participants, based on the rules accounting for the updated real-time data. Recommendations include suggestions to deviate from initial assignments or previous recommendations, based on the updated information.

Abstract: A computer system for managing an auction system configured to (a) transmit a starting asset price for an auction asset to the plurality of bidder computer devices; (b) monitor the plurality of bidder computer devices to detect a first accept response; (c) if a first accept response is detected, (i) determine which bidder computer device of the plurality of bidder computer devices transmitted the first accept response and set the corresponding bidder as a first bidder; (ii) transmit a reduced asset price for the auction asset to the plurality of bidder computer devices; (iii) monitor the plurality of bidder computer devices to detect a second accept response; and (iv) if a second accept response is detected, set the current reduced asset price as a final asset price.

Abstract: A computer system for managing an auction system configured to (a) transmit a starting asset price for an auction asset to the plurality of bidder computer devices; (b) monitor the plurality of bidder computer devices to detect a first accept response; (c) if a first accept response is detected, (i) determine which bidder computer device of the plurality of bidder computer devices transmitted the first accept response and set the corresponding bidder as a first bidder; (ii) transmit a reduced asset price for the auction asset to the plurality of bidder computer devices; (iii) monitor the plurality of bidder computer devices to detect a second accept response; and (iv) if a second accept response is detected, set the current reduced asset price as a final asset price.