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 presents a series of further modifications to the parallel algorithm used for finding digraphs realisations of the characteristic polynomial. What distinguishes the mentioned algorithm from other state-of-the-art solutions is the ability to find a complete set of existing solutions, not just a few of them. Moreover, solutions found tend to be minimal in terms of a rank of matrices created...
In this paper, the new method of the determination of entries of the state matrices of the positive one-dimensional systems with delay using multidimensional digraphs theory D(n) has been presented. For the proposed method, parallel computing algorithm was constructed. This algorithm is based on GPGPU (General-Purpose Computing on Graphics Processing Units) computing method to gain needed speed and...
In this paper, the new alternative method for the determination of the set of all minimal realisations of the positive two-dimensional hybrid linear systems in a second Fornasini-Marchesini (IIF-M) model based on the two-dimensional digraphs theory has been presented. In addition, all realisations in the set are minimal. For the proposed method, parallel computing algorithm was constructed. Algorithm...
In this paper the alternative method for determination of all possible lower reachability indices has been proposed. Method is based on the extension of parallel digraphs creation algorithm presented previously. As a solution of problem of determination of lower reachability index, method finds all possible finite paths in the digraphs — each of them representing one of the indices. By performing...
In this paper, the new method of the determination of entries of the state matrices of the positive two-dimensional systems described by the second Fornasini-Marchesini model (IIF-M) using digraphs theory D(2) has been presented. For the proposed method parallel computing algorithm was constructed. Algorithm is based on GPGPU (General- Purpose Computing on Graphics Processing Units) computing method...
Frequent pattern mining is a field with many practical applications, where large computational power and speed are needed. Many state-of-the-art frequent pattern mining applications are an inefficient solutions for both shared memory and multiprocessor systems due to problems with parallelism and memory. One of possible solutions to the problem is the use of Graphics Processing Unit (GPU) in the system...
Frequent pattern mining is the field with many practical applications, where large computational power and speed are needed. Many solutions, both software and hardware, are proposed for those applications, but specialised solutions in form of embedded systems are not so common as one could imagine. This is especially true when we consider problems that can be paralleled. Many of the state-of-the-art...
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.