Abstract: In one example embodiment, a method includes obtaining a duration of a first network element scanning period of a first network element for a plurality of first beacons, the plurality of first beacons associated with the different direct energy beams, scanning for the plurality of first beacons over a second network element scanning period of a second network element, the second network element scanning period including a number of first network element scanning periods, the first network element scanning period being part of the number of the first network element scanning periods, receiving at least one of the plurality of first beacons during the number of the first network element scanning periods, determining a preferred first beacon based on the received at least one of the plurality of first beacons and transmitting an indication of the preferred first beacon to a base station.

Abstract: In one example embodiment, a method includes transmitting a plurality of first beacons over a first scanning period, the plurality of first beacons associated with different direct energy beams, the transmitting including, transmitting the plurality of first beacons over sub-periods of the first scanning period, respectively; obtaining an indication of a preferred first beacon, the preferred beacon being received by a network element during the transmitting of the plurality of beacons over the first scanning period; and communicating with the element during a scheduled portion of a first data communication period using the beam associated with the preferred first beacon, a length of the first scanning period and a length of the first data communication period forming a length of a time transmission interval.

Abstract: In one example embodiment, a method includes obtaining a duration of a first network element scanning period of a first network element for a plurality of first beacons, the plurality of first beacons associated with the different direct energy beams, scanning for the plurality of first beacons over a second network element scanning period of a second network element, the second network element scanning period including a number of first network element scanning periods, the first network element scanning period being part of the number of the first network element scanning periods, receiving at least one of the plurality of first beacons during the number of the first network element scanning periods, determining a preferred first beacon based on the received at least one of the plurality of first beacons and transmitting an indication of the preferred first beacon to a base station.

Abstract: In one example embodiment, a method includes transmitting a plurality of first beacons over a first scanning period, the plurality of first beacons associated with different direct energy beams, the transmitting including, transmitting the plurality of first beacons over sub-periods of the first scanning period, respectively; obtaining an indication of a preferred first beacon, the preferred beacon being received by a network element during the transmitting of the plurality of beacons over the first scanning period; and communicating with the element during a scheduled portion of a first data communication period using the beam associated with the preferred first beacon, a length of the first scanning period and a length of the first data communication period forming a length of a time transmission interval.

Abstract: A method comprising the steps of creating a random permutation of data from a data input by executing at least one of a Pseudo-Random Permutation (PRP) and a Pseudo-Random Function (PRF), creating a first data block by combining the random permutation of data with a received second data block and executing an ?-differentially uniform function on the result of the combination, XORing the result of the ?-DU function evaluation with a secret key, and reducing the first data block to a first message authentication code.

Abstract: A method comprising the steps of creating a random permutation of data from a data input by executing at least one of a Pseudo-Random Permutation (PRP) and a Pseudo-Random Function (PRF), creating a first data block by combining the random permutation of data with a received second data block and executing an ?-differentially uniform function on the result of the combination, XORing the result of the ?-DU function evaluation with a secret key, and reducing the first data block to a first message authentication code.

Abstract: An executing first computing module verifies the run-time provenance of an unverified second computing module. A signed certificate identifying an author of the second computing module is received at the first computing module. An association between the signed certificate and the second computing module is verified. A first provenance certificate and associated private key signed by the first computing module and identifying a runtime provenance of the second computing module is then generated, and the first provenance certificate is published to the second computing module. A chain of signed certificates, including provenance certificates and a static identification certificates, can be published. Each provenance certificate in the chain verifies the integrity of a layer of execution, and the plurality of static identification certificates identifies a respective author of the computing module associated with each layer of software.

Abstract: A computer system arranged for faster processing operations by providing a stack cache in internal register memory. A full stack is provided in main memory. The stack cache provides a cache representation of part of the main memory stack. Stack relative addresses contained in procedure instructions are converted to absolute main memory stack addresses. A subset of the absolute main memory stack address is used to directly address the stack cache when a "hit" is detected. Otherwise, the main memory stack is addressed. The stack cache is implemented as a set of contiguously addressable registers. Two stack pointers are used to implement allocation space in the stack as a circulating buffer. Cache hits are detected by comparing the absolute stack address to the contents of the two circular buffer pointers. Space for a procedure is allocated upon entering a procedure. The amount of space to allocate is stored in the first instruction. Space is deallocated when a procedure is terminated.

Abstract: Arrangement and method for avoiding the processing time associated with executing branch instructions in a computer. An instruction fetch unit appends a next instruction address field to each instruction it passes it via an instruction cache to an instruction execution unit. The fetch unit decodes the present instruction being read and the next sequential instruction in main memory. If neither instruction is a branch instruction, the next address field is set to the address of the next sequential instruction. If the present instruction is a branch, the next instruction address field is set to the branch address contained in the present instruction. If neither of these cases are true and the next sequential instruction from main memory is a branch, the next instruction address field is set to the branch address of this instruction. The execution unit uses the next instruction address to access instructions from the instruction cache. Thus, execution of branch instructions by the execution unit are avoided.