Abstract: Latency reduction by fast forward (FF) in multi-hop communication device and/or systems is disclosed. Packets may be received and forwarded using a codeword (CW)-based approach with and/or without per-CW CRC. A FF session may have a flow ID and packets may have sequence numbers. Packets targeted for FF may be divided into independently decodable CWs that may be transmitted in the next hop, for example, as soon as the destination is determined without waiting for an entire packet's arrival and/or for CRC verification. Low latency (e.g. FF) traffic may be indicated. CW-based FF may be extensible for an e2e RAN path from a WTRU to the last access node in a RAN. Intermediate metrics, a packet CRC and/or a per-CW CRC may be utilized for data integrity. HARQ and/or CW retransmission procedures may be implemented between network nodes for error handling.

Abstract: A method for performing a pooling operation in bitwise manner, the method includes performing a pooling operation on ternary data upon receiving an input ternary vector, receiving an input binary vector, providing a fused hardware for performing the pooling operation on any of the received binary and the ternary data, and executing the pooling operation performed bitwise through the fused hardware.

Abstract: According to an aspect of an embodiment, operations may include obtaining a basis “A” that defines a lattice in an m-dimensional space. The operations may further include obtaining a target vector “y” that defines a particular location in the m-dimensional space. In addition, the operations may include generating an Ising model connection weight matrix “W” by multiplying a transposition of “A” (“AT”) by “A”. Moreover, the operations may include generating an Ising model bias vector “b” by multiplying a transposition of “y” (“yT”) by “A”. The operations may further include providing “W” and “b” to an annealing system configured to solve problems written according to the Ising model. Additionally, the operations may include obtaining an output from the annealing system that represents an output vector “x” of a particular point included in the lattice that is the closest point in the lattice to the particular location defined by “y”.

Abstract: A method may include obtaining a secret key, a user device secret key, and a server secret key based on the secret key and the user device secret key. The method may include dividing the user device secret key into a plurality of user device shares and the server secret key into a plurality of server shares. The method may include distributing the plurality of user device shares to a plurality of user devices and the plurality of server shares to a plurality of service providers. The method may include obtaining a public key based on the secret key. The method may also include publishing the public key. The method may include obtaining a recovery authority secret key and a recovery vault secret key such that a user may recover an account if the user devices and/or the service providers are compromised.

Abstract: According to an aspect of an embodiment, a method of determining information leakage of a computer-readable program may include obtaining a first component of the computer-readable program. The first component may have a first information leakage that may be unknown. The first component may be comprised of a second component and a third component. The method may also include obtaining a second information leakage of the second component. The method may also include obtaining a third information leakage of the third component. The method may also include determining a relationship between the second component and the third component relative to the first component. The method may also include determining the first information leakage based on the second information leakage, the third information leakage, and the relationship.

Abstract: A method for computing an inner product on a binary data, a ternary data, a non-binary data, and a non-ternary data using an electronic device. The method includes calculating the inner product on a ternary data, designing a fused bitwise data path to support the inner product calculation on the binary data and the ternary data, designing a FPL data path to calculate an inner product between one of the non-binary data and the non-ternary data and one of the binary data and the ternary data, and distributing the inner product calculation for the binary data and the ternary data and the inner product between one of the non-binary data and the non-ternary data and one of the binary data and the ternary data in the fused bitwise data path and the FPL data path.

Abstract: Systems, devices, and methods for operating in an unlicensed band are disclosed herein. In one example, a device may receive configuration information that includes a maximum channel occupancy time (MCOT) and a plurality of parameters including a plurality of transmission opportunity windows (TOWs). Based on the configuration information, the device may split a transmission into a plurality of bursts that may be grouped into sets of bursts based on how many bursts fit within a TOW. The number of bursts in a set of bursts may be less than or equal to the MCOT. The device may perform a clear channel assessment (CCA) to determine if the channel is busy and to determine a start time within the TOW for the bursts. The device may then transmit the set of bursts for that TOW, where each burst may have a burst indicator (BI).

Abstract: A method of solving a large scale combinatorial optimization problem including inputting, via at least one processor, an objective function and an initial solution as a mapping from a plurality of n nodes, randomly clustering the plurality of nodes into k clusters of n/k nodes each, for each cluster of the k clusters, assigning binary variables to denote each possible permutation of a label set within the cluster, determining that there are u=k2 variables if k>2, and u=1 variables if k=2, expressing the objective function in terms of the un/k variables, solving the objective function in terms of the un/k variables using a Quadratic Unconstrained Binary Optimization (QUBO) solver to obtain an updated solution, determining whether a convergence criteria is satisfied for the updated solution, and upon a determination that a convergence criteria is satisfied, outputting the updated solution to the objective function.

Abstract: A method may include receiving, from a first trusted authority, a secret key specific to a party for use in posting to a blockchain. The method may also include receiving, from a second trusted authority, a correlated randomness component specific to the party and associated with a given temporal segment. The method may additionally include generating a party-generated randomized mask, and computing, using an input from the party, the correlated randomness component, and the party-generated randomized mask in a non-interactive multi-party computation (NIMPC), an NIMPC-encrypted input associated with the party for the given temporal segment. The method may also include encrypting the NIMPC-encrypted input according to a blockchain encryption algorithm to yield a ciphertext, and submitting the ciphertext to a block associated with the given temporal segment in a blockchain.

Abstract: A method may include extracting feature-data from an image which includes location data that indicates multiple locations within the image and multiple feature vectors that each correspond to one of the multiple locations. Each feature vector may represent a feature of an object in the image. The method may include determining a feature-data plot based on relative positions of the multiple locations and selecting a grid for the feature-data plot. The method may include generating a first representative feature vector for a first cell of the grid based on a first feature vector set and generating a second representative feature vector for a second cell of the grid based on a second feature vector set. The method may include generating a single feature vector that represents the object in the image based on the first representative feature vector and the second representative feature vector and encrypting the single feature vector.

Abstract: A method of converting a HOBO problem into a QUBO problem. The method may include creating a data structure of key-value pairs by sorting the plurality of indices of the variables of the HOBO problem, the key in each key-value pair corresponding to combinations of quadratic terms appearing in the HOBO and the value corresponding to all terms of at least degree three that contain the associated key. For each key of the data structure, a quadratization process is performed including identifying a key with the largest number of associated values, replacing the identified key with an auxiliary variable, and updating the data structure so as to correspond with the replacement of the auxiliary variable, storing the auxiliary variable and a quadratic term the auxiliary variable replaced as a pair in a data map. The method may also include constructing a quadratic polynomial for each pair in the data map.

Abstract: Systems, procedures, and instrumentalities are disclosed providing mixed data services such as mixed URLLC and eMBB services. In one example implementation, hierarchical modulation is dynamically configured and/or applied to provide the mixed services. The dynamic configuration and application of hierarchical modulation may be based on the respective priorities of the services and a condition of the concerned wireless network. The provision of the mixed services may utilize polar coding techniques. Control information may be mixed with data associated with the services.

Abstract: A method of outsourcing an operation with encryption is provided. A method may include encrypting data at trusted execution environment (TEE) to generate a first ciphertext. The method may also include conveying the first ciphertext to a graphics processing unit (GPU). Further, the method may include performing, at the GPU, at least one somewhat homomorphic encryption (SHE) evaluation operation on the first ciphertext to generate a second ciphertext. Moreover, the method may include conveying the second ciphertext to the TEE. In addition, the method may include decrypting, at the TEE, the second ciphertext to generate a function.

Abstract: A method may include generating, via a setup function, public parameters associated with a random updatable function. The method may further include generating, via an initialization function and based at least in part on the public parameters generated by the setup function, a first random element and a first state. The method may further include generating, via an update function and based at least in part on the public parameters generated by the setup function, a third random element and a second state. Inputs of the update function may include the first state generated by the initialization function and a second random element.

Abstract: A method to reserve a directional channel, such as in an unlicensed spectrum for instance, is disclosed. In an example embodiment, the method may be performed by a receiving node, such as a user equipment (UE) for instance. In such method, the receiving node may receive an enhanced directional transmit request message from a transmitting node and transmit an enhanced directional transmit confirmation message using one or more first beams, with at least one first beam being directed in a first direction towards the transmitting node. Further, the receiving node may transmit at least one additional enhanced directional transmit confirmation message using one or more second beams, with at least one second beam being directed in a second direction towards a potentially interfering node. In the method, the second direction is a different direction than the first direction.

Abstract: A method and apparatus are disclosed for communication in a Millimeter Wave Hotspot (mmH) backhaul system which uses mesh nodes. A mmH mesh node may receive a control signal which includes a total number of available control slots. The mesh node may determine the number of iterations of a resource scheduling mechanism that can be made during the time period of all available control slots, based on the number of neighbor nodes for the mesh node. Further, the mesh node may receive control slot information, including information about traffic queues and priorities. The mesh node may then perform resource scheduling using the resource scheduling mechanism based on the currently received control slot information and control slot information received in previous iterations of resource scheduling. The mesh node may also adjust a preamble based on a time between a last packet transmission and a current packet transmission to a neighboring node.

Abstract: A station (STA) may include an antenna and a processor operatively coupled to the antenna. The antenna and the processor may be configured to receive a request message from an access point (AP). The request message may include identity information of one or more other STAs and an indication to perform measurements of the one or more other STAs. The antenna and the processor may be further configured to perform the measurements of the one or more STAs to determine a link metric associated with each STA of the one or more other STAs. The antenna and the processor may be further configured to send a reply message to the AP after the link metric associated with each STA of the one or more STAs is determined. The reply message may include results of the determination.

Abstract: A method of secure hash table implementation includes performing a secret key exchange between a server enclave of a server device and a client enclave of a client device and establishing an encrypted channel between the server enclave and the client enclave using the exchanged secret keys. The method includes generating a random key for a keyed hash function or a pseudo random function (PRF) and communicating the random key to the client enclave. The method includes receiving hashes of input data at the server enclave. The method includes building a hash table based on key-value pairs included in the received hashes. The method includes receiving a hash table query that includes keys. The method includes retrieving values that correspond to the keys. The method includes returning the retrieved values that correspond to the keys or a null if a value has not been inserted into the hash table for one of the keys.

Abstract: Techniques and mechanisms for providing anisotropic etching of a metallization layer of a substrate. In an embodiment, the metallization layer includes grains of a conductor, wherein a first average grain size and a second average grain size correspond, respectively, to a first sub-layer and a second sub-layer of the metallization layer. The first sub-layer and the second sub-layer each span at least 5% of a thickness of the metallization layer. A difference between the first average grain size and the second average grain size is at least 10% of the first average grain size. In another embodiment, a first condition of metallization processing contributes to grains of the first sub-layer being relatively large, wherein an alternative condition of metallization processing contributes to grains of the second sub-layer being relatively small. A grain size gradient across a thickness of the metallization layer facilitates etching processes being anisotropic.

Abstract: A method may include obtaining a set of multivariate quadratic polynomials associated with a multivariate quadratic problem and generating an Ising Model connection weight matrix “W and an Ising Model bias vector “b” based on the multivariate quadratic polynomials. The method may also include providing the matrix “W” and the vector “b” to an annealing system configured to solve problems written according to the Ising Model and obtaining an output from the annealing system that represents a set of integers. The method may also include using the set of integers as a solution to the multivariate quadratic problem.