Large-scale analysis of formations in soccer

Due to the demand for better and deeper analysis in sports, organizations (both professional teams and broadcasters) are looking to use spatiotemporal data in the form of player tracking information to obtain an advantage over their competitors. However, due to the large volume of data, its unstructured nature, and lack of associated team activity labels (e.g. strategic/tactical), effective and efficient strategies to deal with such data have yet to be deployed. A bottleneck restricting such solutions is the lack of a suitable representation (i.e. ordering of players) which is immune to the potentially infinite number of possible permutations of player orderings, in addition to the high dimensionality of temporal signal (e.g. a game of soccer last for 90 mins). Leveraging a recent method which utilizes a "role-representation", as well as a feature reduction strategy that uses a spatiotemporal bilinear basis model to form a compact spatiotemporal representation. Using this representation, we find the most likely formation patterns of a team associated with match events across nearly 14 hours of continuous player and ball tracking data in soccer. Additionally, we show that we can accurately segment a match into distinct game phases and detect highlights. (i.e. shots, corners, free-kicks, etc) completely automatically using a decision-tree formulation.

Key-private proxy re-encryption under LWE

Proxy re-encryption (PRE) is a highly useful cryptographic primitive whereby Alice and Bob can endow a proxy with the capacity to change ciphertext recipients from Alice to Bob, without the proxy itself being able to decrypt, thereby providing delegation of decryption authority. Key-private PRE (KP-PRE) specifies an additional level of confidentiality, requiring pseudo-random proxy keys that leak no information on the identity of the delegators and delegatees. In this paper, we propose a CPA-secure PK-PRE scheme in the standard model (which we then transform into a CCA-secure scheme in the random oracle model). Both schemes enjoy highly desirable properties such as uni-directionality and multi-hop delegation. Unlike (the few) prior constructions of PRE and KP-PRE that typically rely on bilinear maps under ad hoc assumptions, security of our construction is based on the hardness of the standard Learning-With-Errors (LWE) problem, itself reducible from worst-case lattice hard problems that are conjectured immune to quantum cryptanalysis, or “post-quantum”. Of independent interest, we further examine the practical hardness of the LWE assumption, using Kannan’s exhaustive search algorithm coupling with pruning techniques. This leads to state-of-the-art parameters not only for our scheme, but also for a number of other primitives based on LWE published the literature.

Efficient selective identity-based encryption without random oracles

We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in an adaptive-identity attack the adversary is allowed to choose this identity adaptively. Our first system—BB1—is based on the well studied decisional bilinear Diffie–Hellman assumption, and extends naturally to systems with hierarchical identities, or HIBE. Our second system—BB2—is based on a stronger assumption which we call the Bilinear Diffie–Hellman Inversion assumption and provides another approach to building IBE systems. Our first system, BB1, is very versatile and well suited for practical applications: the basic hierarchical construction can be efficiently secured against chosen-ciphertext attacks, and further extended to support efficient non-interactive threshold decryption, among others, all without using random oracles. Both systems, BB1 and BB2, can be modified generically to provide “full” IBE security (i.e., against adaptive-identity attacks), either using random oracles, or in the standard model at the expense of a non-polynomial but easy-to-compensate security reduction.

Shrinking the keys of discrete-log-type lossy trapdoor functions

To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ 2) group elements for a reduction from the decisional Diffie-Hellman assumption (where λ is a security parameter). We propose two realizations of lossy trapdoor functions that achieve public key size of only Θ(λ) group elements in bilinear groups, with a reduction from the decisional Bilinear Diffie-Hellman assumption. Our first construction achieves this result at the expense of a long common reference string of Θ(λ 2) elements, albeit reusable in multiple LTDF instantiations. Our second scheme also achieves public keys of size Θ(λ), entirely in the standard model and in particular without any reference string, at the cost of a slightly more involved construction. The main technical novelty, developed for the second scheme, is a compact encoding technique for generating compressed representations of certain sequences of group elements for the public parameters.

A tapestry of identity-based encryption : practical frameworks compared

This paper surveys the practical benefits and drawbacks of several identity-based encryption schemes based on bilinear pairings. After providing some background on identity-based cryptography, we classify the known constructions into a handful of general approaches. We then describe efficient and fully secure IBE and IBKEM instantiations of each approach, with reducibility to practice as the main design parameter. Finally, we catalogue the strengths and weaknesses of each construction according to a few theoretical and many applied comparison criteria.

Flexible IBE and beyond in the commutative-blinding framework

The cryptographic community has, of late, shown much inventiveness in the creation of powerful new IBE-like primitives that go beyond the basic IBE notion and extend it in many new directions. Virtually all of these “super-IBE” schemes rely on bilinear pairings for their implementation, which they tend to use in a surprisingly small number of different ways: three of them as of this writing. What is interesting is that, among the three main frameworks that we know of so far, one has acted as a veritable magnet for the construction of many of these “generalized IBE” primitives, whereas the other two have not been nearly as fruitful in that respect. This refers to the Commutative Blinding framework defined by the Boneh-Boyen [Bscr ][Bscr ]1 IBE scheme from 2004. The aim of this chapter is to try to shed some light on this approach's popularity, first by comparing its key properties with those of the competing frameworks, and then by providing a number of examples that illustrate how those properties have been used.

Universal designated-verifier signatures

Motivated by privacy issues associated with dissemination of signed digital certificates, we define a new type of signature scheme called a ‘Universal Designated-Verifier Signature’ (UDVS). A UDVS scheme can function as a standard publicly-verifiable digital signature but has additional functionality which allows any holder of a signature (not necessarily the signer) to designate the signature to any desired designated-verifier (using the verifier’s public key). Given the designated-signature, the designated-verifier can verify that the message was signed by the signer, but is unable to convince anyone else of this fact. We propose an efficient deterministic UDVS scheme constructed using any bilinear group-pair. Our UDVS scheme functions as a standard Boneh-Lynn-Shacham (BLS) signature when no verifier-designation is performed, and is therefore compatible with the key-generation, signing and verifying algorithms of the BLS scheme. We prove that our UDVS scheme is secure in the sense of our unforgeability and privacy notions for UDVS schemes, under the Bilinear Diffie-Hellman (BDH) assumption for the underlying group-pair, in the random-oracle model. We also demonstrate a general constructive equivalence between a class of unforgeable and unconditionally-private UDVS schemes having unique signatures (which includes the deterministic UDVS schemes) and a class of ID-Based Encryption (IBE) schemes which contains the Boneh-Franklin IBE scheme but not the Cocks IBE scheme.

Representing team behaviours from noisy data using player role

Due to their unobtrusive nature, vision-based approaches to tracking sports players have been preferred over wearable sensors as they do not require the players to be instrumented for each match. Unfortunately however, due to the heavy occlusion between players, variation in resolution and pose, in addition to fluctuating illumination conditions, tracking players continuously is still an unsolved vision problem. For tasks like clustering and retrieval, having noisy data (i.e. missing and false player detections) is problematic as it generates discontinuities in the input data stream. One method of circumventing this issue is to use an occupancy map, where the field is discretised into a series of zones and a count of player detections in each zone is obtained. A series of frames can then be concatenated to represent a set-play or example of team behaviour. A problem with this approach though is that the compressibility is low (i.e. the variability in the feature space is incredibly high). In this paper, we propose the use of a bilinear spatiotemporal basis model using a role representation to clean-up the noisy detections which operates in a low-dimensional space. To evaluate our approach, we used a fully instrumented field-hockey pitch with 8 fixed high-definition (HD) cameras and evaluated our approach on approximately 200,000 frames of data from a state-of-the-art real-time player detector and compare it to manually labeled data.

Effect of constitutive material models on seismic response of two-story reinforced concrete frame

This paper focuses on the finite element (FE) response sensitivity and reliability analyses considering smooth constitutive material models. A reinforced concrete frame is modeled for FE sensitivity analysis followed by direct differentiation method under both static and dynamic load cases. Later, the reliability analysis is performed to predict the seismic behavior of the frame. Displacement sensitivity discontinuities are observed along the pseudo-time axis using non-smooth concrete and reinforcing steel model under quasi-static loading. However, the smooth materials show continuity in response sensitivity at elastic to plastic transition points. The normalized sensitivity results are also used to measure the relative importance of the material parameters on the structural responses. In FE reliability analysis, the influence of smoothness behavior of reinforcing steel is carefully noticed. More efficient and reasonable reliability estimation can be achieved by using smooth material model compare with bilinear material constitutive model.

An Explicit Guidance Scheme For A Low-Thrust Terminal Rendezvous

An explicit near-optimal guidance scheme is developed for a terminal rendezvous of a spacecraft with a passive target in circular orbit around the earth. The thrust angle versus time profile for the continuous-thrust, constant-acceleration maneuver is derived, based on the assumption that the components of inertial acceleration due to relative position and velocity are negligible on account of the close proximity between the two spacecraft. The control law is obtained as a ''bilinear tangent law'' and an analytic solution to the state differential equations is obtained by expanding a portion of the integrand as an infinite series in time. A differential corrector method is proposed, to obtain real-time updates to the guidance parameters at regular time intervals. Simulation of the guidance scheme is carried out using the Clohessy-Wiltshire equations of relative motion as well as the inverse-square two-body equations of motion. Results for typical examples are presented.

Low cycle fatigue behaviour of a low interstitial Ni-base superalloy

The low cycle fatigue behaviour of precipitation strengthened nickel-base superalloy 720Li containing a low concentration of interstitial carbon and boron was studied at 25, 400 and 650 degrees C. Cyclic stress response at all temperatures was stable under fully reversed constant total strain amplitude (Delta epsilon/2) when Delta epsilon/2 <= 0.6%. At Delta epsilon/2 > 0.6%, cyclic hardening was followed by softening, until fracture at 25 and 650 degrees C. At 400 degrees C, however, cyclic stress plateaued after initial hardening. Dislocation-dislocation interactions and precipitate shearing were the micromechanisms responsible for the cyclic hardening and softening, respectively. The number of reversals to failure vs. plastic strain amplitude plot exhibits a bilinear Coffin-Manson relation. Transmission electron microscopy substructures revealed that planar slip was the major deformation mode under the conditions examined. However, differences in its distribution were observed to be the cause for the bilinearity in fatigue lives. The presence of fine deformation twins at low Delta epsilon/2 at 650 degrees C suggests the role of twinning in homogenization of cyclic deformation.

Prediction of Compressibility of Overconsolidated Uncemented Soils

Overconsolidated soils exhibit a bilinear e-log p relationship. During virgin compression, microstructural units form larger stable groups, thereby reducing the operating specific surface and, in turn, net osmotic repulsive forces in the soil. The rebound portion of the e-log p curve is consequently flatter. The generalized relationship for compressibility of uncemented soils in the overconsolidated state has been developed in the form of e/eL = 1.122 = 0.188 log pc - 0.0463 log p in which e/eL is the generalized soil state parameter, pc is the preconsolidation pressure in kPa, p is the effective overburden pressure in kPa, e is the in situ void ratio, and eL is the void ratio corresponding to the liquid limit water content (wLG). This relationship can be usefully employed to predict both the preconsolidation pressure and compressibility responses of overconsolidated uncemented soils.

Phase transitions in (NH4)2SO4 and (NH4)2SO4---K2SO4 mixed crystals as studied by EPR of CrO3- radicals

A study of the phase transitions in (NH4)2SO4 and (NH4)2SO4---K2SO4 mixed crystals by EPR of the CrO3- ion is reported. The results indicate a bilinear coupling of the order parameter with spontaneous polarization and a crossover from a discontinuous to a continuous nature of the phase transition in mixed crystals.

A note on the period of oscillation of non-linear systems

This paper deals with two approximate methods of finding the period of oscillations of non-linear conservative systems excited by step functions. The first method is an extension of the analysis presented by Jonckheere [4] and the second one is based on a weighted bilinear approximation of the non-linear characteristic. An example is presented and the approximate results are compared with the exact results

Influence of adhesive non-linearities on the performance and optimal length of adhesive bonded joints

An analytical study for the static strength of adhesive lap joints is presented. The earlier solutions of Volkersen [i], DeBruyne[2] and others were limited to linear adhesives. The influence of adhesive non-linearity was first considered by Grimes' et al[3] and Dickson et al [4]. Recently Hart-Smith[5] successfully introduced elastic-plastic behaviour of the adhesive. In the present study the problem is formulated for general non-linear adhesive behaviour and an efficient numerical algorithm is written for the solution. Bilinear and trilinear models for the nonlinearity yield closed form analytical solutions.