41 results about "Innermost loop" patented technology

A method and system for use with VLIW processing architectures for avoiding redundant speculative computations in the compilation of the innermost loops. The method includes identifying a plurality of compiled flow paths, where each of the paths includes a plurality of conditions associated with the loop that permits transformation of the loop for more optimum execution. It is then determined whether the loop has an inductive variable and a conditional statement that depends on the inductive variable. It is also determined whether the loop set up values of the inductive variables to subsets, and at least one of which the conditional statement is a loop invariant. Finally, if conditions in the determination steps satisfy the conditions of one of the paths, the loop is transformed into two consecutive loops executable with a reduced set of values of the inductive variable.

The invention relates to the field of the protection of security documents such as for example banknotes and identity documents against counterfeit and illegal reproduction. In particular, the invention relates to optical effect layers (OEL) showing a viewing-angle dependent optical effect, devices and processes for producing said OEL and items carrying said OEL, as well as uses of said optical effect layers as an anti-counterfeit means on documents. The OEL comprises a plurality of non-spherical magnetic or magnetizable particles, which are dispersed in a coating composition comprising a binder material, the OEL comprising two or more loop-shaped areas, being nested around a common central area that is surrounded by the innermost loop-shaped area, wherein, in each of the loop-shaped areas, at least a part of the plurality of non-spherical magnetic or magnetizable particles are oriented such that, in a cross-section perpendicular to the OEL layer and extending from the centre of the central area to the outer boundary of the outermost loop-shaped area, the longest axis of the particles in each of the cross-sectional areas of the looped-shaped areas follow a tangent of either a negatively curved or a positively curved part of hypothetical ellipses or circles.

A transformer includes an iron core having a shaft around which a plurality of coil modules is mounted. Each coil module includes spiral, upper and lower coil sections each having an outer loop and a plurality of inner loops received in and coplanar with the outer loop. The inner loops of the spiral upper coil section and the inner loops of the spiral lower coil section include a common innermost loop through which the shaft extends. Upper and lower ends of each coil module are respectively interconnected to the outer loops of the upper and lower coil sections. The spiral upper section is superimposed on the spiral lower section to form a two-layer structure. The lower end of an upper one of two adjacent coil modules interconnected to the upper end of a lower one of the two adjacent coil modules.

A memory access method includes: obtaining a, b, and c from a program code for accessing a memory with a triple loop in a program, a being a number of values which an inner-most loop variable of the triple loop may have, b being a number of values which a middle loop variable of the triple loop may have, and c being a number of values which an outer-most loop variable of the triple loop may have; obtaining a starting address of the memory accessed by the triple loop; and obtaining an a×b×c number of addresses of the memory accessed by the triple loop using the starting address and a function.

A chip electronic component may include a magnetic material body including an insulating substrate and coil conductor patterns formed on at least one surface of the insulating substrate, and external electrodes disposed on both end portions of the magnetic material body so as to be connected to end portions of the coil conductor patterns, respectively. In a cross section of the magnetic material body in a length direction, a thickness of an innermost loop/section of the coil conductor patterns may be smaller than a thickness of the remaining loops/sections of the coil conductor pattern.

The eye dropper positioning and guiding apparatus includes a resilient guiding device having a selectively compressible member having a first opening adapted to receive an eye drop applicator and a second opening adapted to position an eye within an area of the second opening to receive a fluid from the eye drop applicator. The selectively compressible member is adapted for selective linear and nonlinear movement in relation to the eye positioned within the area of the second opening. The eye dropper positioning and guiding apparatus can also include a support base and a resilient guiding device including a selectively expandable member having a plurality of concentric loops having an outermost loop and an innermost loop, adapted for selective linear and nonlinear movement, or a support base and a resilient guiding device including a plurality of concentric, interconnected rings adapted for selective linear and nonlinear movement in relation to an eye.

The invention discloses a data processing method and device for radioastronomy data, wherein the data processing method comprises an outermost layer circulation processing process, a middle layer circulation processing process and an innermost layer circulation processing process. The method comprises the following step of allocating the calculation quantity of each time of iteration in the outermost layer circulation processing process to different threads, wherein each thread uses a vectorization instruction. According to the embodiment, a multi-thread task schedule method is used for allocating the calculation quantity of each time of iteration; the load calculation balance performance of each thread is improved; the deGridding is subjected to efficient optimization; and the performanceis greatly improved.

An antenna assembly for radiating at least one electromagnetic field for electromagnetic navigation and an electromagnetic navigation system including such an antenna assembly are provided. The antenna assembly includes a substrate and a planar antenna including a trace that is deposited on the substrate and arranged in a plurality of loops. Respective distances between adjacent pairs of the loops increase in a direction from an innermost loop to an outermost loop.

An electronic device and a housing for the electronic device are provided. The housing includes a metal part. The metal part includes at least one spiral slot formed on the metal part A portion of the metal part which is disposed between an innermost loop and an outermost loop of the spiral slot forms a spiral metal coil by being spaced by the spiral slot. The spiral metal coil is configured as an antenna radiation element electrically connected with an antenna circuit inside the electronic device, and the spiral slot is filled with an insulating material.

An obliquity adjusting method for an optical reading head comprises the following steps: recording the current focusing error signal generated from the innermost loop to outermost loop by the optical reading head; generating real obliquity adjusting parameter according to the current focusing error signal and the predefined initial obliquity adjusting parameter; storing the real obliquity adjusting parameter; adjusting the oblique angle of the optical reading head according to real obliquity adjusting parameter when reading the data on the optical disk and writing data into the optical disk. Therefore, the optical disk drive can read the data in the optical disk with different distortions in high quality. The invention further discloses an obliquity adjusting device of the optical reading head.

The invention relates to the calculation intelligent field and particularly relates to a multiple-scale quantum harmonic oscillator multi-mode function optimization system and a method. The invention improves the optimal position selection strategy of the current MQHOA method, all gauss sampling areas perform comparison on function values by targeting the sampling points generated by itself and the position of the optimal value is reserved as a new gauss sampling center. In the meantime, the convergence condition of the innermost loop is changed to the condition where the difference of the variance of all gauss sampling center positions between two iterations is smaller or equal to the current scale, and the QHO (quantum harmonic oscillator iteration ) performs internal layer circulation convergence. In the invention, the essence of the QHO convergence condition is to perform convergence when the change of each gauss sampling area position is small. The invention can realize the optimization problem of the complex function of the multi-global optimal position. For the complex functions having the multi-global optimal position, the method disclosed by the invention can perform convergence in most of time and thus realizes the search for the multiple global optimal positions.

The invention provides an optimization method based on 4-bit common convolution calculation, and the method comprises the steps: adding simd instruction operation in a cycle of an innermost layer of an algorithm in a complete convolution calculation process; data are loaded in the circulation of the innermost layer through a data loading simd instruction, and after the data are loaded, the data are not loaded repeatedly in the register all the time; in the circulation of the innermost layer, the repeated use of the data is realized by copying a simd instruction; and 8 pieces of 16-bit data are finally stored in a 128-bit register through a multiplication simd instruction, a selection simd instruction and a shift simd instruction. According to the method, 16 pieces of data are loaded at a time and 16 results are calculated at a time, one piece of data in the data loaded at each time is copied to a variable of a simd instruction, 8-bit multiplication simd instruction calculation is carried out, and after 16-bit conversion is carried out, simd instruction accumulation calculation is carried out; the multiplication and accumulation are realized in the innermost layer circulation of the algorithm. The method is simple, and the speed is increased by about 10-20 times compared with that of a pure C algorithm.