The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a Modified Multiple Triangular Inequality Elimination (MMTIE) to further reduce the search number of candidate codevectors. The MMTIE adopts the same original search space as the MTIE scheme with the initial best-matched codevector selected by the Initial Index Code Assignment (IICA), and integrates the intersection rule of the Candidate Codevectors Group (CCG) scheme to further...
This paper presents the problem of robot deployment for a number of scattered tasks. We aim to minimize the duration it takes for all robots to reach their assigned task locations. In previous work, we have proposed a team composed of one carrier robot (CR) and several servant robots to accomplish the mission. Then we have suggested an algorithm that determines a path of the CR for an efficient deployment...
The hyperspectral unmixing problem can be formulated as a combinatorial optimization which selects the spectral vectors that maximize the volume of a simplex, with the assumptions that the dataset contain pure pixels and the mixture is linear. Submodularity presents an intuitive diminishing returns property which arises naturally in discrete and combinatorial optimization problems. Submodular functions...
This paper proposes a compensation algorithm of analog rotor position errors due to nonideal sinusoidal encoder signals. The position sensors such as resolvers or incremental encoders are being replaced by sinusoidal encoders that offer much higher resolution. However, the periodic position errors are generated by the gain and offset errors between sine and cosine signals. In this paper, the effects...
In the paper, a review for web register control technology is presented. Based on the development of nonlinear control theory, a web register control algorithm is proposed for roll-to-roll system based printed electronics by using the non-linear feedback controller. The optimal gain of obtained controller is determined by using the modified genetic algorithm. The simulation results employed in Matlab/Simulink...
This study investigates the relative performances of Array, Wallace, Dadda and Reduced Area multipliers for several synthesis optimization modes. All multiplier designs were modeled in Verilog HDL and synthesized based on the TSMC 0.35-micron ASIC Design Kit standard cell library. Performance data was extracted after logic synthesis in LeonardoSpectrum for Area, Speed and Auto optimization modes....
The problem of interference alignment in time-varying MIMO interference channels is considered. To reduce complexity, an adaptive algorithm for beam vector design is proposed based on our previous work of least squares approach to beam design for interference alignment and matrix perturbation theory. The proposed algorithm calculates interference-aligning beam vectors by additive update of the previous...
Thread counting algorithms seek to determine the vertical and horizontal weave densities of the canvas underlying a painting. X-ray images of a painting serve as the raw data. Canvas texture can be modeled as a sum of two sinusoids having nearly orthogonal spatial frequencies. The actual painting serves as an additive signal that only distracts from the thread-counting process. The algorithm employs...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.