266 results about "Data reorganization" patented technology

A system and method is provided for vectorizing misaligned references in compiled code for SIMD architectures that support only aligned loads and stores. In this framework, a loop is first simdized as if the memory unit imposes no alignment constraints. The compiler then inserts data reorganization operations to satisfy the actual alignment requirements of the hardware. Finally, the code generation algorithm generates SIMD codes based on the data reorganization graph, addressing realistic issues such as runtime alignments, unknown loop bounds, residual iteration counts, and multiple statements with arbitrary alignment combinations. Loop peeling is used to reduce the computational overhead associated with misaligned data. A loop prologue and epilogue are peeled from individual iterations in the simdized loop, and vector-splicing instructions are applied to the peeled iterations, while the steady-state loop body incurs no additional computational overhead.

An approach is provided for vectorizing misaligned references in compiled code for SIMD architectures that support only aligned loads and stores. In the framework presented herein, a loop is first simdized as if the memory unit imposes no alignment constraints. The compiler then inserts data reorganization operations to satisfy the actual alignment requirement of the hardware. Finally, the code generation algorithm generates SIMD codes based on the data reorganization graph, addressing realistic issues such as runtime alignments, unknown loop bounds, residue iteration counts, and multiple statements with arbitrary alignment combinations. Beyond generating a valid simdization, a preferred embodiment further improves the quality of the generated codes. Four stream-shift placement policies are disclosed, which minimize the number of data reorganization generated by the alignment handling.

Disclosed are a method and system for finding an optimal data layout. The approach of the present invention is to try one of several data layouts in the memory, measure the impact of said one data layout on a performance of a program, and decide which of said several data layouts to try next. The trying and measuring steps are repeated, and one of said several data layouts is selected as best or optimal based on the measurings. The preferred embodiment of the invention provides layout auditing, a framework for picking the best data layout online without requiring any user input. Layout auditing optimizes data layouts with a try-measure-decide feedback loop: use a data reorganizer to try one of several data layouts, use a profiler to measure the impact of the data layout on performance, and use a controller to decide which data layout to try next.

The invention discloses a method for calculating storage capacity of a reservoir, which belongs to the field of reservoir operation. The storage capacity of a traditional reservoir is obtained by taking the water level of a dam as a reservoir representative water level and calculating the capacity curve interpolation of the water level. In the method, a reservoir surface is a horizontal plane which takes the water level of the dam as a datum mark and neglects a backwater phenomenon at the tail end of the upper stream at a reservoir area as well as additional gradient influence along the upper stream and the lower stream of the reservoir. For a reservoir of a long narrow riverway type, the length-width ratio of the reservoir is very large, the additional gradient of the upper stream and the lower stream at the reservoir area is also large and the backwater phenomenon is obvious at the tail end of the upper stream, so that the storage capacity of the reservoiro, which is btained by calculating the interpolation according to a traditional method, has larger error and seriously affects the calculation accuracy of reservoir operation. By utilizing a dynamic water surface curve method, the invention carries out integral calculation on the basis of actually measured dynamic water surface curve materials collected at the reservoir area, and the integral calculation comprises three links: unit division calculation, telemetering water-level collection and segmented superposition calculation, wherein the unit division calculation is a core processing link, the telemetering water-level collection is a data reorganization and outfit link and the segmented superposition calculation is a result calculation link.

The invention relates to a forward correcting decoder and relative control method, wherein said device comprises forward correct FEC decode circuit, frame data divide module and frame data recombine module; the FEC decode circuit has at least two parallel paths; the frame data divide module receives the frame data transmitted via FEC code method, and divides each frame data via word length sequence; feeds divided data sections into each FEC decode circuit and decodes; the frame data recombine module recombines frame data. The invention can avoid bandwidth limit, in GPON network, to send and decode descending data continuously.

Disclosed herein are example embodiments of an improved narrative generation system where an analysis service that executes data analysis logic, including data re-organization logic, that supports story generation is segregated from an authoring service that executes authoring logic for story generation through an interface. Accordingly, when the authoring service needs analysis from the analysis service, it can invoke the analysis service through the interface. By exposing the analysis service to the authoring service through the shared interface, the details of the logic underlying the analysis service are shielded from the authoring service (and vice versa where the details of the authoring service are shielded from the analysis service). Through parameterization of operating variables, the analysis service can thus be designed as a generalized data analysis service that can operate in a number of different content verticals with respect to a variety of different story types.

The invention relates to the technical field of Android application reinforcement protection and the technical field of DEX shelling, and aims at providing a universal automatic DEX shelling method and system. According to the method and system, shelling codes are inserted into a portable interpreter of an Android Dalvik virtual machine. The method specifically comprises the following steps of: comparing all the classes in an Android Manifest.xml configuration file and all the classes obtained through decompilation by utilizing contrastive analysis so as to judge whether an application is reinforced, and recognizing a reinforcement service used by the application through homology analysis; and taking Man Activity of the application as a DEX shelling starting mark, recovering real byte codes of the application, extracting recovered real data and finally recombining the data into a new DEX file, wherein the recombination process refers to modification of corresponding pointers. The system is good in universality, can bypass all the Anti-debugging protection technologies, and can extract original DEX files of reinforced applications without carrying out manual analysis and understanding reinforcement strategies of reinforcement services in the shelling process. The invention provides a new solution for automatic DEX shelling of reinforced applications.

The invention discloses a rectification skin repair method based on wing body actual measurement data virtual butt joint, which comprises skin registration and repair, and the registration comprises the steps of denoising wing body point cloud data, and carrying out data recombination on a data set obtained after filtering to obtain a key point set; calculating a normal direction feature descriptor of any key point in the key point set and a normal direction feature descriptor of any point in the skin point cloud data; calculating the Euclidean distance between the feature descriptors of the two points by using a K-nearest neighbor tree structure search algorithm, and adding the points with high similarity into the set M; and calling a clustering and Hough voting algorithm for the set M toobtain a local point cloud set matched with the skin point cloud data in the key point set; matching the skin point cloud data with the local point cloud set through a point cloud iterative nearest point algorithm. Skin registration and repair can be completed through computer programs, manpower can be greatly saved, and production efficiency is improved. Meanwhile, the influence of human subjective factors is avoided, and the registration result is more accurate.