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.
We propose a fault injection attack on Salsa20 and ChaCha stream ciphers. In these stream ciphers, the initial matrix X, which consists of constants, a key, a block counter, and a nonce, is added to the matrix X(20) process with a round function to generate a keystream. Our proposed fault injection attack skips the corresponding addition (add) instruction to obtain the matrix X or X(20) and extracts...
Temporal reasoning is one of the cognitive capabilities humans involve in communicating with others and everything appears related because of temporal reference. Therefore, in this paper a geometric dynamic temporal reasoning algorithm is proposed to solve the temporal reasoning problem, especially in autonomous planning and scheduling. This method is based on the representation of actions in a two...
This paper presents an action guided constraint satisfaction technique for planning problem. Different from the standard algorithms which are almost domain independence and cannot reflect the characteristics of the planning progress, we discuss how the action rules in planning act in constraint satisfaction problems. Based on the conclusion, an action directed constraint is proposed to guide the variable...
Applications of clustering algorithms in biomedical research are ubiquitous, with typical examples including gene expression data analysis, genomic sequence analysis, biomedical document mining, and MRI image analysis. However, due to the diversity of cluster analysis, the differing terminologies, goals, and assumptions underlying different clustering algorithms can be daunting. Thus, determining...
A novel algorithm called free search (FS) is applied to solve the scheduling problems on a single batch processing machine with non-identical job sizes (NSBM) in this paper. The concept of sensibility was introduced in FS, with which the algorithm had no restriction of the probability to zero for the parts of the search space and thus it could avoid premature convergence. In order to make it feasible...
This paper aims at minimizing the makespan for a single batch-processing machine with non-identical job sizes (NSBM) using discrete particle swarm optimization algorithm (DPSO). PSO is a natural continuous function algorithm and there is some obstacle to solve combinatorial optimization problems. Recently, some hybrid PSO or DPSO have been presented by researchers to solve discrete problems in practical...
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.