Abstract: Systems for displaying images in a cinema setting can include components to reduce screen-door effect. The systems can include an array of light emitting sources or other active sources of light. In one example, the light emitting source emit pixels of light to a projection lens to project an image represented by the projection lens and a baffle and an aperture stop can block part of the light from the sources that exceeds an allowable cone angle of acceptable of the system. In another example, a display includes the array of light emitting sources and additional elements, such as diffuser elements, positioned in front of the array of light emitting sources.

Abstract: A system, method, and media are provided for generating a structured labeling graphical user interface. The user interface receives user input that associates multimedia content with categories. The user input may include user-supplied tags that further define the category for the multimedia content. The user-supplied tags are rendered proximate to the categories. In turn, a database logs user events to store, among other things, the categories, the user-supplied tags, time associated with completing the user-supplied tags, and time for associating multimedia content with the categories or tags.

Abstract: An auction mechanism that decouples advertisement selection from advertisement ranking is described herein. A page to be displayed on a client computing device has a plurality of advertisement positions. Responsive to receipt of data that is indicative of content to be included on the page, a plurality of bids corresponding to a respective plurality of advertisements are received, wherein each bid has a respective bid value. Further, a respective quality score is computed for each advertisement responsive to the receipt of the data. A subset of advertisements are selected from the plurality of advertisements based upon their respective bid values. Subsequently, the selected advertisements are ranked and assigned to the advertisement positions based upon their quality scores, which are independent of their bid values.

Abstract: Counterfactual analysis can be performed “offline”, or “after the fact”, based on data collected during a trial in which random variations are applied to the output of the system whose parameters are to be the subject of the counterfactual analysis. A weighting factor can be derived and applied to data collected during the trial to emphasize that data obtained when the random variations most closely resembled the output that would be expected if counterfactual parameters were utilized to generate the output. If the counterfactual parameters being considered differ too much from the parameters under which the trial was conducted, the offline counterfactual analysis can estimate a direction and magnitude of the change of the system performance, as opposed to deriving a specific expected system performance value. In economic transactions, the random variations can be considered variations in the price paid by another party, thereby enabling derivation of their marginal cost.

Abstract: Counterfactual analysis can be performed “offline”, or “after the fact”, based on data collected during a trial in which random variations are applied to the output of the system whose parameters are to be the subject of the counterfactual analysis. A weighting factor can be derived and applied to data collected during the trial to emphasize that data obtained when the random variations most closely resembled the output that would be expected if counterfactual parameters were utilized to generate the output. If the counterfactual parameters being considered differ too much from the parameters under which the trial was conducted, the offline counterfactual analysis can estimate a direction and magnitude of the change of the system performance, as opposed to deriving a specific expected system performance value. In economic transactions, the random variations can be considered variations in the price paid by another party, thereby enabling derivation of their marginal cost.

Abstract: Systems and methods are described for trapdoor pairing. In one implementation, a trapdoor pairing is a cryptographic primitive generated by determining a bilinear pairing between an elliptic curve group and another group and selecting a parameter of the bilinear pairing, such as a group order or an isogeny between curves, to be a key for generating and evaluating the bilinear pairing. Trapdoor pairing allows construction of a group in which the Decisional Diffie-Hellman (DDH) problem is computationally infeasible given only the description of the group, but is easy given the secret key. Exemplary trapdoor pairing constructions have general applicability to cryptography and also lend themselves more specifically to certain special practical implementations, such as public key cryptography and certificate authority infrastructures.

Abstract: Multiple Bloom filters are generated to partition data between first and second disjoint data sets of elements. Each element in the first data set is assigned to a bucket of a first set of buckets, and each element in the second data set is assigned to a bucket of a second set of buckets. A Bloom filter is generated for each bucket of the first set of buckets. The Bloom filter generated for a bucket indicates that each element assigned to that bucket is part of the first data set, and that each element assigned to a corresponding bucket of the second set of buckets is not part of the first data set. Additionally, a Bloom filter corresponding to a subsequently received element can be determined and used to identify whether that subsequently received element is part of the first data set or the second data set.

Abstract: Multiple Bloom filters are generated to partition data between first and second disjoint data sets of elements. Each element in the first data set is assigned to a bucket of a first set of buckets, and each element in the second data set is assigned to a bucket of a second set of buckets. A Bloom filter is generated for each bucket of the first set of buckets. The Bloom filter generated for a bucket indicates that each element assigned to that bucket is part of the first data set, and that each element assigned to a corresponding bucket of the second set of buckets is not part of the first data set. Additionally, a Bloom filter corresponding to a subsequently received element can be determined and used to identify whether that subsequently received element is part of the first data set or the second data set.

Abstract: Function properties may be approximated using an expander graph. For example, an approximate average of a function may be determined by randomly exploring an expander graph. Values of the function are associated with vertices of the expander graph. The expander graph is randomly explored by traversing edges and encountering vertices. The exploration may comprise a crawl, a walk, and so forth. An approximate average of the function is determined based on the function values that are associated with encountered vertices.

Abstract: Systems and methods are described for trapdoor pairing. In one implementation, a trapdoor pairing is a cryptographic primitive generated by determining a bilinear pairing between an elliptic curve group and another group and selecting a parameter of the bilinear pairing, such as a group order or an isogeny between curves, to be a key for generating and evaluating the bilinear pairing. Trapdoor pairing allows construction of a group in which the Decisional Diffie-Hellman (DDH) problem is computationally infeasible given only the description of the group, but is easy given the secret key. Exemplary trapdoor pairing constructions have general applicability to cryptography and also lend themselves more specifically to certain special practical implementations, such as public key cryptography and certificate authority infrastructures.

Abstract: Pscudorandom numbers may be generated from input seeds using expander graphs. Expander graphs are a collection of vertices that are interconnected via edges. Generally, a walk around an expander graph is determined responsive to an input seed, and a pseudorandom number is produced based on vertex names. Specifically, a next edge, which is one of multiple edges emanating from a current vertex, is selected responsive to an extracted seed chunk. The next edge is traversed to reach a next vertex. The name of the next vertex is ascertained and used as a portion of the pseudorandom number being produced by the walk around the expander graph.

Abstract: Digital signatures for network coding are described. In one aspect, digital signatures for network coding are described. In one aspect, segmented blocks of content for distribution are digitally signed using homomorphic digital signatures generated from an elliptic curve. A linear combination of packets comprising the digitally signed content is distributed to a destination device according to an implemented distribution scheme. The linear combination of packets includes public information when digitally signing the segmented blocks. The homomorphic digital signatures and the public information allow a device receiving one or more packets of the linear combination of packets to verify and authenticate content associated with the one of our packets independent of secure transmission of secret keys and hash digests used to digitally sign the one or more packets.

Abstract: Hash function constructions from expander graphs are described. In one aspect, an expander graph is walked to compute a hash function. The expander graph is walked using respective subsets of an input message. A label of a last vertex walked is an output of the hash function.

Abstract: Systems and methods for elliptic curve octupling using Single Instruction Multiple Data (SIMD) processing are described. In one aspect, a weighted projective point P on an elliptic curve, P having coordinates (x, y, z) is identified. Value 8P is computed from P with 12 sets of field multiplications using SIMD processing. Each set of field multiplications includes one to four respective field multiplications. Each set of field multiplications is performed in parallel according to an assigned time-step.

Abstract: Systems and methods for elliptic curve octupling for weighted projective coordinates are described. In one aspect, a weighted projective point P on an elliptic curve is identified. 8P is computed from P independent of repeated doubling operations using fewer field multiplications.

Abstract: Systems and methods for computing modular polynomials modulo large primes are described. In one aspect, the systems and methods generate 1-isogenous elliptic curves. A modular polynomial modulo a large prime p is then computed as a function of 1-isogenous elliptic curves modulo p.

Abstract: Systems and methods for cryptographically processing data as a function of a Cartier pairing are described. In one aspect, a Cartier pairing is generated from two different abelian varieties or abelian varieties and an isogeny between them. Data is cryptographically processed based on the Cartier pairing.

Abstract: A field subassembly for a dynamo electric machine comprises a plurality of laminations secured together to form a stack, the stack having at least two spaced pole pieces and a pair of coil slots per pole piece, a field coil in each one of the pairs of slots, apertures in said stack, each aperture being located in one of the regions between adjacent pole pieces, and electrically-insulating terminal blocks mounted on the stack, each of said blocks being associated with one of the apertures, and each of the blocks having an external configuration corresponding to the region between said pole pieces and such that the blocks do not extend either externally of the stack in a radial direction or within the stack.