|
Special Issue on the 18th International Conference on Artificial Neural Networks
Húsek, Dušan ; Neruda, Roman ; Koutník, J.
Special Issue on the 18th International Conference on Artificial Neural Networks. Neural Network World. Vol. 19, No. 5 (2009). The issue contains papers prepared specially for this issue by authors of some best evaluated papers presented on ICANGA 2008 conference. Covered are mainly following topics: Mathematical Theory of Neurocomputing, Computational Neuroscience, Connectionist Cognitive Science, Neuroinformatics, Image Processing, Signal and Time Series Processing, Reinforcement Learning, Binary Factor Analysis, Principal Component Analysis, Self-organization, Neural Network Hardware.
|
|
Methods and models in domain of complex networks
GÁLIK, Martin
The thesis deals with complex networks. The theoretical part describes the history of the known types of real complex networks and their main features. It seeks to explain why complex systems show natural dependencies and a certain form of self-organization. The practical part outlines basic definitions of graph theory, types of arrangement of nodes and links as well as models and methods used in analysis of complex networks. In addition, the thesis includes an analysis taking a closer look at facebook.com social networking service, examining a section of the service using Gephi software and the author?s own calculations. The final part presents the measured results, discusses them and illustrates them with graphs.
|
|
Detection of QRS complex using leads transformation
Nerušil, Václav ; Smital, Lukáš (referee) ; Vítek, Martin (advisor)
The aim of this bachelor’s thesis is to become familiar with methods of detection of the QRS complex and the one chosen detection method realize by the Matlab. The detection of QRS is tested on a database CSE and the results are compared with other methods. The second part of this thesis is devoted to the theory of transformation methods leads and their use to increase the success of QRS detection.
|
|
Performance tests of the minimum degree ordering implementation
Pařík, Petr
The minimum degree ordering is one of the most widely used algorithms to preorder a symmetric sparse matrix prior to numerical factorization. There are number of variants which try to reduce the computational complexity of the original algorithm while maintaining a reasonable ordering quality. An in-house finite element solver is used to test several minimum degree algorithm variants to find the most suitable configuration for the use in the Finite Element Method. The performance results obtained and their assessments are presented along with the minimum degree ordering algorithm overview.
|
|
Language of Preference Formulae
Nedbal, Radim
There is a need for handling preferences in relational query languages that arises naturally in real-world applications dealing with possible choices generated by the current state of the world captured in the relational data model. To address this problem, we propose a fully declarative language for encoding preferences conditional on the current state of the world represented as a relation database instance. Being based purely on the qualitative type of information about the preference model, the language is intuitive and leads to a exible approach for specifying the most desirable choices of autonomous systems that act on behalf of their designers. Throughout the paper, we use an example of a control support system for a bank surveillance to motivate the need for our framework and to illustrate it.
|
|
Zjišťování mikrostrukturálních vlastností acetabula lidské pánve pomocí mikro-CT
Kytýř, Daniel ; Jiroušek, Ondřej ; Vavřík, Daniel
The paper deals with microstructure investigation of trabecular bone in acetabular region. Trabecular bone microstructure is the main factor of the bone quality and mechanical propertites at macroscopic level. Data from high resolution micro Computed Tomography can be used to reconstruct the complex geometry of the trabecular bone inner structure and interface between bone and implant. The data are usable as for micro-FE modeling as well as for experimental loading tests evaluation.
|
|
Symposium molekulární biologie sinic /7./
Komenda, Josef ; Flores, E. ; Nixon, P. J. ; Waleron, K. ; Maršálek, Blahoslav
The conference was devoted to the recent advances in the field of molecular biology of cyanobacteria, namely in the structure and function of important proteins and their complexes, in the regulation of gene expression, in cell differentiation, in cellular metabolism and in molecular ecology and taxonomy. There were 170 participants presenting 101 posters and 12 invited and 29 selected lectures including a computer bioinformatics session
|
|
Generating Complex Procedural Terrains Using the GPU
Ryba, Jan ; Bartoň, Radek (referee) ; Herout, Adam (advisor)
Generating fully 3D terrains is a dificult task, meaning that we need to store a lot of data or do a lot of computing or both. We can reduce or completly eliminate the data srorage by using a procedural approch, but this is where the problem gets realy computationaly costly and the CUDA platform comes in. CUDA kernels runinng parallely on graphic accelerators can rapidly decrease time needed for computation, allowing even these complex calculations to work in real time or even better. Finding its use in game or movie industry.
|
|
Complex Animation in 3D Studio Max
Černý, Miloš ; Pečiva, Jan (referee) ; Přibyl, Jaroslav (advisor)
The goal of this project is to inform a reader about compact workflow of creating complex computer animation using 3D modelling and animation software 3ds Max. It guides him through the whole process from creating models, texturing and skinning them, to animation pointed at more difficult parts of the animation process. Beside the practical examples, this paper includes necessary theoretical explanation of particular problems. After reading this paper, the reader should be well acquainted with the compact process of creating the complex animation.
|
|
Evolution of Complex Behavior in Cellular Automata
Kontra, Matúš ; Vašíček, Zdeněk (referee) ; Bidlo, Michal (advisor)
Celular automata are one of many alternative models of computation. Massive parallelism and the posibillity to describe their local behaviour in a simple way are of particular interest. This thesis describes a different way of representing the local transfer function of cellular automata, which is particulary suitable for use in genetic algorithm. This representation is based on simple model, mirroring the way instruction based register machines operate. The aim of this publication is to analyze and assess applicability of proposed method.
|
guest ::
