Abstract: Certain aspects of the present disclosure provide techniques and apparatus for executing a workload on a computing device based on an approximation of a target function. An example method generally includes generating a plurality of sample points from a multi-dimensional space representing domain of a target function. A plurality of sparse matrices is generated from the plurality of sample points, each respective sparse matrix being generated based on known non-zero coefficients of the target function. A plurality of transformed sparse matrices representing a relationship between Chebyshev coefficients of the target function and the plurality of sample points after applying lower dimensional cosine transformations are generated. An approximation of the target function is generated based on the plurality of transformed sparse matrices. An output of at least a portion of a neural network may be generated based on the approximation of the target function.

Abstract: Methods, systems, and media for solving quadratic optimization problems are disclosed herein. In some embodiments, a method may involve receiving, by one or more processors, a first quadratic optimization problem comprising an objective and a set of inequality constraints. The method may involve obtaining an initial solution to the first quadratic optimization problem subject to the set of inequality constraints. The method may involve identifying a subset of the set of inequality constraints that are active constraints with respect to an optimal solution. The method may involve obtaining an updated solution to the first quadratic optimization problem by solving a second quadratic optimization problem that corresponds to optimizing the objective subject to the active constraints. The method may involve determining an accuracy and precision associated with the updated solution.

Abstract: An aspect of the present invention relates to a tire comprising a sidewall, the sidewall having a surface comprising a surface portion including a hexagonal textured base pattern repeated over the surface portion so as to form a periodic textured pattern providing a high contrast to the surface portion. The hexagonal textured base pattern comprises protrusions and recesses, the protrusions and the recesses of the repeated textured base pattern cooperating to form respective lineal features extending over at least two of the repeated hexagonal textured base patterns.

Abstract: A system for determining the frequency coefficients of a one or multi-dimensional signal that is sparse in the frequency domain includes determining the locations of the non-zero frequency coefficients, and then determining values of the coefficients using the determined locations. If N is total number of frequency coefficients across the one or more dimension of the signal, and if R is an upper bound of the number of non-zero ones of these frequency coefficients, the systems requires up to (O(Rlog(R) (N))) samples and has a computation complexity of up to O(Rlog2(R) log (N). The system and the processing technique are stable to low-level noise and can exhibit only a small probability of failure. The frequency coefficients can be real and positive or they can be complex numbers.

Abstract: The present disclosure provides systems and methods for substantially continuous and dynamic vulnerability scoring. According to the present disclosure, the method includes detecting one or more vulnerabilities. The method includes determining a contextual prioritization score (CPS) for each of the one or more vulnerabilities based on historical data, the historical data including a series of contextual features corresponding to each one of the one or more vulnerabilities. The method may include, in response to detection of an event, determining a partial CPS score by an agent. The method may include, if a new partial CPS is determined, generating an updated CPS based on the CPS and the new partial CPS and transmitting the updated CPS to each of one or more computing devices.

Abstract: A tire having a high contrast design pattern is described, wherein one design has a first set of spaced apart wavy lines oriented in a first direction, and a second set of spaced apart wavy lines oriented in a first direction, wherein the first set of wavy lines is out of phase with the second set of wavy lines. A second high contrast design pattern is described, and is formed of a plurality of circles, wherein the plurality of circles do not overlap with each other and are tangent to each other.

Abstract: A processor-implemented method includes approximating an optimization problem for training an artificial neural network as a nested polynomial optimization problem. The method also includes dividing the nested polynomial optimization problem into a sequence of sub-problems. The method further includes hierarchically solving the sequence of sub-problems to train the artificial neural network.

Abstract: A processor-implemented method includes receiving as input, a global polynomial optimization problem that approximates a training problem of a neural network. The method also includes relaxing the global polynomial optimization problem including polynomial constraints with multiple semi-definite programs. The method further includes solving the semi-definite programs based on a pre-defined structure and outputting a solution indicating a location of a global optimum of the optimization problem. The method includes performing inference with the neural network based on the solution.

Abstract: A processor-implemented method includes receiving, as input, an array of values characterizing a polynomial feasibility problem representing a physical system for solving a computational problem. The method also includes reducing dimensions of the polynomial feasibility problem by transforming the polynomial feasibility problem into a high-dimensional linear feasibility problem and a non-linear feasibility problem. The method further includes solving the high-dimensional linear feasibility problem to obtain a first set of interim solutions. The method includes solving the non-linear feasibility problem based on the first set of interim solutions to obtain a result of the non-linear feasibility problem. The method also includes outputting parameters characterizing the physical system, with a ground state corresponding to an output solution of the computational problem based on the result obtained from solving the non-linear feasibility problem.

Abstract: An insert for a run slide for a vehicle window. The insert may be overmoulded to form a connecting wedge between two strands of the run slide. The insert may be formed in one piece and is configured to cooperate with a portion of a vehicle door frame. The insert is further configured to cooperate with a portion of a hubcap to be attached to one of the strands. The insert includes a protruding pin configured to be engaged in a recess of a rabbet of the vehicle door frame to index the insert along an axis X substantially parallel to an axis of elongation of the rabbet. The insert is configured to cooperate with the portion of the hubcap to ensure indexing the hubcap along the axis X and along an axis Z perpendicular to X and substantially parallel to an axis of elongation of the hubcap.

Abstract: A technique for measuring properties of a material includes measuring the electromagnetic radiation scattered by one or more scattering points associated with the material, and adjusting the radiation according to the respective sensitivities of the scattering points to changes in material properties at that scattering point for several pairs of radiation sources and receivers. The material properties are determined using the updated measurements and corresponding simulated measurements.

Abstract: A system for determining the frequency coefficients of a one or multi-dimensional signal that is sparse in the frequency domain includes determining the locations of the non-zero frequency coefficients, and then determining values of the coefficients using the determined locations. If N is total number of frequency coefficients across the one or more dimension of the signal, and if R is an upper bound of the number of non-zero ones of these frequency coefficients, the systems requires up to (O (R log(R) (N))) samples and has a computation complexity of up to O (R log2(R) log (N). The system and the processing technique are stable to low-level noise and can exhibit only a small probability of failure. The frequency coefficients can be real and positive or they can be complex numbers.

Abstract: An insert for a run slide for a vehicle window, the insert being intended to be overmoulded to form a connecting wedge between two strands of the run slide, the insert being formed in one piece and comprising first indexing means configured to cooperate with a portion of a vehicle door frame and second indexing means configured to cooperate with a portion of a hubcap to be attached to one of the strands, wherein the first means comprise at least one protruding pin configured to be engaged in a recess of a rabbet of the vehicle door frame to index the insert along an axis X substantially parallel to an axis of elongation of the rabbet, and wherein the second means are configured to cooperate by complementarity of shapes with the portion of the hubcap to ensure indexing the hubcap along the axis X and along an axis Z perpendicular to X and substantially parallel to an axis of elongation of the hubcap.

Abstract: A method for obtaining, for at least one pixel of an image sensor comprised in an optical device, parameters defining a pixel beam is described. The method is remarkable in that it includes determining a direction of a chief ray associated with at least one pixel of the image sensor from the features of an optical system associated with the optical device, determining a set of pixels formed in a screen of a display device, the set of pixels comprising at least one pixel close to a point corresponding to an intersection of the chief ray and the screen, and the set of pixels comprising only pixels which are detected by the at least one pixel of the image sensor, when they are illuminated.

Abstract: A package sorting system is described that can be used to efficiently sort and pack Ropak containers for transporting packages from a sorting facility to a destination facility. The package sorting system can determine a particular Ropak container to place the package in as well as determine if the package was placed in the current Ropak container.

Abstract: A signal pre-compensation system analyzes one or more properties of a communication medium and, taking advantage of the locality of propagation, generates using sparse fast Fourier transform (sFFT) a sparse kernel based on the medium properties. The system models propagation of data signals through the medium as a fixed-point iteration based on the sparse kernel, and determines initial amplitudes for the data symbol(s) to be transmitted using different communication medium modes. Fixed-point iterations are performed using the sparse kernel to iteratively update the initial amplitudes. If the iterations converge, a subset of the finally updated amplitudes is used as launch amplitudes for the data symbol(s). The data symbol(s) can be modulated using these launch amplitudes such that upon propagation of the pre-compensated data symbol(s) through the communication medium, they would resemble the original data symbols at a receiver, despite any distortion and/or cross-mode interference in the communication medium.

Abstract: A method for obtaining, for at least one pixel of an image sensor comprised in an optical device, parameters defining a pixel beam is described. The method is remarkable in that it includes determining a direction of a chief ray associated with at least one pixel of the image sensor from the features of an optical system associated with the optical device, determining a set of pixels formed in a screen of a display device, the set of pixels comprising at least one pixel close to a point corresponding to an intersection of the chief ray and the screen, and the set of pixels comprising only pixels which are detected by the at least one pixel of the image sensor, when they are illuminated.

Abstract: A signal pre-compensation system analyzes one or more properties of a communication medium and, taking advantage of the locality of propagation, generates using sparse fast Fourier transform (sFFT) a sparse kernel based on the medium properties. The system models propagation of data signals through the medium as a fixed-point iteration based on the sparse kernel, and determines initial amplitudes for the data symbol(s) to be transmitted using different communication medium modes. Fixed-point iterations are performed using the sparse kernel to iteratively update the initial amplitudes. If the iterations converge, a subset of the finally updated amplitudes is used as launch amplitudes for the data symbol(s). The data symbol(s) can be modulated using these launch amplitudes such that upon propagation of the pre-compensated data symbol(s) through the communication medium, they would resemble the original data symbols at a receiver, despite any distortion and/or cross-mode interference in the communication medium.

Abstract: There is described a module for detecting an electronic file, the module embodied on a computer readable medium and configured for: receiving a portion of a file and extracting content from the portion; applying an initial hashing function numerous times to the content, the initial hashing function being applied to each one of a plurality of blocks of elements within the content and resulting in a representation for each one of the blocks; selecting one of the representations from multiple representations as an initial imprint for the file portion; comparing the initial imprint to contents of a first memory containing a plurality of detection imprints for known electronic files to be detected, the detection imprints having been created using at least the initial hashing function; and determining a match when the initial imprint corresponds to a detection imprint in the first memory.

Abstract: A method for collectively delivering electronically certified credentials is disclosed. In one aspect, the method includes a) collecting personal data related to credential recipients and including a valid electronic mail address, b) collecting data related to each credential to be delivered to each recipient at a granting authority, c) sending to a centralized server of a certifying authority the collected data of each recipient, the data being stored in a centralized database, d) sending an personalized e-mail corresponding to each recipient, the e-mail including a link to the centralized server, for approval of the data related to the each recipient, and e) activation of the electronic credential.