Abstract: The present disclosure provides a method for testing an internal force increment of an arch bridge suspender by inertial measurement, including the following steps: (1) selecting a suspender to be tested with internal force increment, and mounting an acceleration sensing device or a speed sensing device at a lower edge of the suspender to be tested; (2) setting an appropriate sampling frequency and collecting signals; (3) processing information data collected in step (2) by using Formulas; and (4) recording a result of the information data processing and obtaining the internal force increment of the suspender. The method can obtain the internal force increment of the suspender by collecting acceleration or speed signals of the lower edge of the suspender and performing calculation from the signals. This method has the advantages of simple and convenient testing, high replicability and low test cost.

Abstract: A method for generating and evaluating N-to-1 mappings, between spatial point sets in nD, n=2 or 3 implemented on a computing device comprising a programmable general purpose processor and a programmable data-parallel coprocessor and a memory coupled with them. Embodiments comprises using the computing device to receive a first and a second spatial point sets, the first spatial point set comprising a first non-empty portion of non-isolated points and a second non-empty portion of constrained points, an array of fixed correspondents for the second non-empty portion, and a CCISS or padded CCISS between the first non-isolated portion and the second spatial point set, and use these to generate an array of N-to-1 mappings between the first portion of non-isolated points and the second spatial point set, an array of overall distance measures for the array of N-to-1 mappings, and an optimal N-to-1 mapping with the lowest overall distance measure.

Abstract: A method for generating and evaluating N-to-1 mappings between spatial point sets in nD, n=2 or 3, implemented on a computing device comprising a programmable general purpose processor and a programmable data-parallel coprocessor and a memory coupled with them.

Abstract: A method for generating and evaluating N-to-1 mappings between spatial point sets in nD, n=2 or 3, implemented on a computing device comprising a programmable general purpose processor and a programmable data-parallel coprocessor and a memory coupled with them.

Abstract: A method for generating and evaluating N-to-1 mappings between spatial point sets in nD, n=2 or 3 implemented on a computing device comprising a programmable general purpose processor and a programmable data-parallel coprocessor and a memory coupled with them.

Abstract: A method implemented on a computing device comprising a data-parallel coprocessor and a memory coupled with the data-parallel processor for generating and evaluating N-to-1 mappings between spatial point sets in nD. The method comprises using the computing device to carry out steps comprising receiving a first and a second spatial point sets, an array of (n+1) combinations in the first spatial point set, an array of one or more pairs of neighbor (n+1) combinations referencing into the array of (n+1) combinations, and a CCISS between the two spatial point sets; computing a plurality of solving structures and provide a two-level indexing structure for (n+1) combinations for the plurality of (n+1) combinations; generating one or more N-to-1 mappings; and generating a plurality of local distance measures for unique combinations of the one or more pairs of neighbor (n+1) combinations and the one or more N-to-1 mappings.

Abstract: A computer implemented method for generating a one-to-one mapping between a first spatial point set and a second spatial point set in nD, n=2 or 3, comprising receiving a first and a second spatial point sets in nD and a plurality of candidate correspondences; computing unit conflict lists for the candidate correspondences; generating one or more MatchPairs between the first and the second point sets; computing local distance measures for the MatchPairs; converting the local distance measures to weights; computing conflict lists for pairs of the MatchPairs by taking the bitwise ORs of their candidate correspondences' unit conflict lists; computing correspondence lists for the MatchPairs; computing compatibilities between pairs of the MatchPairs by examining for each pair the bitwise AND of one's correspondence list and the other's conflict list; constructing a vertex-weighted undirected graph with its nodes corresponding to the MatchPairs, its edges representing the compatibilities, and its graph vertices ass

Abstract: A computer implemented method for generating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising receiving a first and a second spatial point sets in nD and a plurality of candidate correspondences; computing conflict lists for the candidate correspondences; generating one or more MatchPairs between the first and the second point sets using the Cartesian Products of the plurality of candidate correspondences; computing local distance measures for the MatchPairs; converting the local distance measures to weights; computing conflict lists for pairs of the MatchPairs by taking the bitwise UNIONs of their candidate correspondences' unit conflict lists; computing correspondence lists for the MatchPairs; computing compatibilities between pairs of the MatchPairs by examining for each pair of said pairs the bitwise AND of one's correspondence list and the other's conflict list; constructing an undirected graph with its nodes corresponding to the MatchPairs, its edges

Abstract: A computer implemented method for generating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising receiving a first and a second spatial point sets in nD; generating one or more MatchPairs between the first and the second point sets; computing local distance measures for the MatchPairs; converting the local distance measures to weights; computing compatibility between each pair of the MatchPairs; constructing an undirected graph with its nodes corresponding to the MatchPairs, its edges representing the compatibilities, and its graph vertices assigned the weights; computing a maximum-weight clique of the graph; and merging the maximum-weight clique to generate the one-to-one mapping.

Abstract: A method implemented on a computing device comprising a data-parallel coprocessor and a memory coupled with the data-parallel processor for generating and evaluating N-to-1 mappings between spatial point sets in nD. The method comprises using the computing device to carry out steps comprising receiving a first and a second spatial point sets, an array of (n+1) combinations in the first spatial point set, an array of one or more pairs of neighbor (n+1) combinations referencing into the array of (n+1) combinations, and a CCISS between the two spatial point sets; computing a plurality of solving structures and provide a two-level indexing structure for (n+1) combinations for the plurality of (n+1) combinations; generating one or more N-to-1 mappings; and generating a plurality of local distance measures for unique combinations of the one or more pairs of neighbor (n+1) combinations and the one or more N-to-1 mappings.

Abstract: An embedded system controls an electric fluid valve, and the embedded system is connected to and receives overlooking images from an overlooking camera. It processes the images using a sequence labeling unit to tell if a fluid container is ready to receive and operates the valve accordingly.

Abstract: The present disclosure relates to a card protective film, a production method thereof and a payment card, wherein the card protective film comprises a core layer of a biaxially oriented polyester film, a first connection layer and a printed bonding layer connected to a printed layer of a card substrate, as well as a surface processing layer with function(s) of thermal laminating release, thermal jointing and/or hot stamping; the printed bonding layer is connected to one side of the core layer through the first connection layer, and the surface processing layer is connected to the other side of the core layer.

Abstract: A computer implemented method for evaluating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising the steps of receiving a first and a second spatial point sets in nD and a one-to-one mapping between the two spatial point sets; generating a pair of mapped agreeable (n+1)-combinations in the first point set; computing two affine transformations that transform the pair of mapped agreeable (n+1)-combinations to correspondents in the second point set; computing the difference of the left sub-matrices of the two affine transformations; and computing a local distance measure based on the difference of the left sub-matrices of the two affine transformations.

Abstract: A computer implemented method for evaluating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising the steps of receiving a first and a second spatial point sets and a one-to-one mapping between the two spatial point sets; defining a spatial agent; generating multiple mapped (n+1)-combinations in the first point set; computing multiple affine transformations that transform the multiple mapped (n+1)-combinations to correspondents in the second point set; applying the multiple affine transformations to the spatial agent to generate multiple transformed spatial agents; and computing a distance measure using the multiple transformed spatial agents.

Abstract: A computer implemented method for evaluating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising the steps of receiving a first and a second spatial point sets in nD and a one-to-one mapping between the two spatial point sets; generating a pair of mapped agreeable (n+1)-combinations in the first point set; computing two affine transformations that transform the pair of mapped agreeable (n+1)-combinations to correspondents in the second point set; computing the difference of the left sub-matrices of the two affine transformations; and computing a local distance measure based on the difference of the left sub-matrices of the two affine transformations.

Abstract: A computer implemented method for evaluating a one-to-one mapping between a first spatial point set and a second spatial point set in nD comprising the steps of receiving a first and a second spatial point sets and a one-to-one mapping between the two spatial point sets; defining a spatial agent; generating multiple mapped (n+1)-combinations in the first point set; computing multiple affine transformations that transform the multiple mapped (n+1)-combinations to correspondents in the second point set; applying the multiple affine transformations to the spatial agent to generate multiple transformed spatial agents; and computing a distance measure using the multiple transformed spatial agents.