Národní úložiště šedé literatury Nalezeno 722 záznamů.  1 - 10dalšíkonec  přejít na záznam: Hledání trvalo 0.04 vteřin. 
Assessment of Independent EEG Components Obtained by Different Methods for BCI Based on Motor Imagery
Húsek, Dušan ; Frolov, A. A. ; Kerechanin, J. V. ; Bobrov, P.D.
Eight methods of decomposition of a multichannel EEG signal are compared in terms of their ability to identify the most physiologically significant components. The criterion for the meaningfulness of a method is its ability to reduce mutual information between components; to create components that can be attributed to the activity of dipoles located in the cerebral cortex; find components that are provided by other methods and for this case; and at the same time, these components should most contribute to the accuracy of the BCI based on imaginary movement. Independent component analysis methods AMICA, RUNICA and FASTICA outperform others in the first three criteria and are second only to the Common Spatial Patterns method in the fourth criterion. The components created by all methods for 386 experimental sessions of 27 subjects were combined into more than 100 clusters containing more than 10 elements. Additionally, the components of the 12 largest clusters were analyzed. They have proven to be of great importance in controlling BCI, their origins can be modeled using dipoles in the brain, and they have been detected by several degradation methods. Five of the 12 selected components have been identified and described in our previous articles. Even if the physiological and functional origins of the rest of identified components’ are to be the subject of further research, we have shown that their physiological nature is at least highly probable.\n
Nearly All Reals Can Be Sorted with Linear Time Complexity
Jiřina, Marcel
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached.
Score matching filters for Gaussian Markov random fields with a linear model of the precision matrix
Turčičová, Marie ; Mandel, J. ; Eben, Kryštof
We present an ensemble filter that provides a rigorous covariance regularization when the underlying random field is Gaussian Markov. We use a linear model for the precision matrix (inverse of covariance) and estimate its parameters together with the analysis mean by the Score Matching method. This procedure provides an explicit expression for parameter estimators. The resulting analysis step formula is the same as in the traditional ensemble Kalman filter.
Visual Images Segmentation based on Uniform Textures Extraction
Goltsev, A. ; Gritsenko, V. ; Húsek, Dušan
A new effective procedure for partial texture segmentation of visual images is proposed. The procedure segments any input image into a number of non-overlapping homogeneous ne-grained texture areas. The main advantages of the proposed procedure are as follows. It is completely unsupervised, that is, it processes the input image without any prior knowledge of either the type of textures or the number of texture segments in the image. In addition, the procedure segments arbitrary images of all types. This means that no changes to the procedure parameters are required to switch from one image type to another. Another major advantage of the procedure is that in most cases it extracts the uniform ne-grained texture segments present in the image, just as humans do. This result is supported by series of experiments that demonstrate the ability of the procedure to delineate uniform ne-grained texture segments over a wide range of images. At a minimum, image processing according to the proposed technique leads to a signficant reduction in the uncertainty of the internal structure of the analyzed image.
City simulation software for modeling, planning, and strategic assessment of territorial city units
Svítek, M. ; Přibyl, O. ; Vorel, J. ; Garlík, B. ; Resler, Jaroslav ; Kozhevnikov, S. ; Krč, Pavel ; Geletič, Jan ; Daniel, Milan ; Dostál, R. ; Janča, T. ; Myška, V. ; Aralkina, O. ; Pereira, A. M.
SVÍTEK, M., PŘIBYL, O., VOREL, J., GARLÍK, B., RESLER, J., KOZHEVNIKOV, S., KRČ, P., GELETIČ, J., DANIEL, M., DOSTÁL, R., JANČA, T., MYŠKA, V., ARALKINA, O., PEREIRA, A. M. City simulation software for modeling, planning, and strategic assessment of territorial city units. 1.1. Prague: CTU & ICS CAS, 2021. Technical Report. ABSTRACT: The Smart Resilience City concept is a new vision of a city as a digital platform and eco-system of smart services where agents of people, things, documents, robots, and other entities can directly negotiate with each other on resource demand principals providing the best possible solution. It creates the smart environment making possible self-organization in sustainable or, when needed, resilient way of individuals, groups and the whole system objectives.
Linear-time Algorithms for Largest Inscribed Quadrilateral
Keikha, Vahideh
Let P be a convex polygon of n vertices. We present a linear-time algorithm for the problem of computing the largest-area inscribed quadrilateral of P. We also design the parallel version of the algorithm with O(log n) time and O(n) work in CREW PRAM model, which is quite work optimal. Our parallel algorithm also computes all the antipodal pairs of a convex polygon with O(log n) time and O(log2n+s) work, where s is the number of antipodal pairs, that we hope is of independent interest. We also discuss several approximation algorithms (both constant factor and approximation scheme) for computing the largest-inscribed k-gons for constant values of k, in both area and perimeter measures.
Plný tet: Stáhnout plný textPDF
Two limited-memory optimization methods with minimum violation of the previous quasi-Newton equations
Vlček, Jan ; Lukšan, Ladislav
Limited-memory variable metric methods based on the well-known BFGS update are widely used for large scale optimization. The block version of the BFGS update, derived by Schnabel (1983), Hu and Storey (1991) and Vlček and Lukšan (2019), satisfies the quasi-Newton equations with all used difference vectors and for quadratic objective functions gives the best improvement of convergence in some sense, but the corresponding direction vectors are not descent directions generally. To guarantee the descent property of direction vectors and simultaneously violate the quasi-Newton equations as little as possible in some sense, two methods based on the block BFGS update are proposed. They can be advantageously combined with methods based on vector corrections for conjugacy (Vlček and Lukšan, 2015). Global convergence of the proposed algorithm is established for convex and sufficiently smooth functions. Numerical experiments demonstrate the efficiency of the new methods.
Plný tet: Stáhnout plný textPDF
Jak jsme (z)řídili ústav aneb Od Centrálního výpočetního střediska ČSAV k Ústavu informatiky AV ČR
Šebesta, Václav
Jak jsme (z)řídili ústav aneb Od Centrálního výpočetního střediska ČSAV k Ústavu informatiky AV ČR
Plný text: Stáhnout plný textPDF
Sort Program for Real Keys with Linear Time Complexity
Jiřina, Marcel
In this report we present a program for sorting data structures with sorting keys as real numbers, i.e. of type "real" or "float". The basis of the program is a modification of the countingsort algorithm for reals (instead of integers). It uses a comparision-type sorting for small part of data set given. The time complexity of this part of program can be bounded by linear function of n and thus, the total time complexity is also O(n) for n data items.
Plný tet: Stáhnout plný textPDF
Generalization of a Theorem on Eigenvalues of Symmetric Matrices
Rohn, Jiří
We prove that the product of a symmetric positive semide nite matrix and a symmetric matrix has all eigenvalues real.
Plný text: Stáhnout plný textPDF

Národní úložiště šedé literatury : Nalezeno 722 záznamů.   1 - 10dalšíkonec  přejít na záznam:
Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.