Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Analysis of an N/G/1 finite queue with the supplementary variable method.
Analysis of correlation based dimension reduction methods
Dimension reduction is an important topic in data mining and machine learning. Especially dimension reduction combined with feature fusion is an effective preprocessing step when the data are described by multiple feature sets. Canonical Correlation Analysis (CCA) and Discriminative Canonical Correlation Analysis (DCCA) are feature fusion methods based on correlation. However, they are different in that DCCA is a supervised method utilizing class label information, while CCA is an unsupervised method....
Analysis of finite state automata by state isolation
Analysis of gradient flow of a regularized Mumford-Shah functional for image segmentation and image inpainting
This paper studies the gradient flow of a regularized Mumford-Shah functional proposed by Ambrosio and Tortorelli (1990, 1992) for image segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting. It is shown that the gradient flow with initial data possesses a global weak solution, and it has a unique global in time strong solution, which has at most finite number of point singularities in the space-time, when the initial data are in . A family of fully discrete approximation...
Analysis of gradient flow of a regularized Mumford-Shah functional for image segmentation and image inpainting
This paper studies the gradient flow of a regularized Mumford-Shah functional proposed by Ambrosio and Tortorelli (1990, 1992) for image segmentation, and adopted by Esedoglu and Shen (2002) for image inpainting. It is shown that the gradient flow with L2 x L∞ initial data possesses a global weak solution, and it has a unique global in time strong solution, which has at most finite number of point singularities in the space-time, when the initial data are in H1 x H1 ∩ L∞. A family of fully...
Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial...
Analysis of monotonicity properties of some rule interestingness measures
Analysis of multibackground memory testing techniques
March tests are widely used in the process of RAM testing. This family of tests is very efficient in the case of simple faults such as stuck-at or transition faults. In the case of a complex fault model-such as pattern sensitive faults-their efficiency is not sufficient. Therefore we have to use other techniques to increase fault coverage for complex faults. Multibackground memory testing is one of such techniques. In this case a selected March test is run many times. Each time it is run with new...
Analysis of multi-server queueing model of ABR.
Analysis of problem solving process of a mental rotations test. Performance in Shepard-Metzler tasks.
Analysis of quickselect : an algorithm for order statistics
Analysis of some statistics for increasing tree families.
Analysis of transmissions scheduling with packet fragmentation.
Analytické derivovanie na číslicovom počítači
Analýza problémov lokálneho prehľadávania a ich heuristík
Analyzing sets of phylogenetic trees using metrics
The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.
Analyzing the reasoning mechanisms in fuzzy rule based classification systems.
Fuzzy Rule-Based Systems have been succesfully applied to pattern classification problems. In this type of classification systems, the classical Fuzzy Reasoning Method classifies a new example with the consequent of the rule with the greatest degree of association. By using this reasoning method, we do not consider the information provided by the other rules that are also compatible (have also been fired) with this example.In this paper we analyze this problem and propose to use FRMs that combine...
Another look at a model for evaluating interface aesthetics
Gestalt psychologists promulgated the principles of visual organisation in the early twentieth century. These principles have been discussed and re-emphasised, and their importance and relevance to user interface design is understood. However, a limited number of systems represent and make adequate use of this knowledge in the form of a design tool that supports certain aspects of the user interface design process. The graphic design rules that these systems use are extremely rudimentary and often...