Search results for " trees."
showing 10 items of 207 documents
The interaction between social media, knowledge management and service quality: A decision tree analysis
2020
The existing literature fails to identify to which extent the utilization of social media could be relevant for increasing the effectiveness of knowledge management, in respect to overall business operations. In order to shed some light on this area we define three goals. Firstly, we investigate to what extent the different activities of clients on social media (SM), are important to the processes of knowledge management (KM) in companies. Secondly, we examine to what extent KM functions can be relevant in attaining the quality of IT services. Thirdly, we analyze to what extent KM mediates between SM and the quality of IT services, that is, which client activities on SM should be formalised…
Identification of Explanatory Variables in Possession of the Ball in High-Performance Women’s Football
2021
[Abstrac] Women’s football is a phenomenon that is experiencing an unstoppable increase in recent years. The objective of this study was to analyze how ball possessions are performed in highperformance women’s football. For this, the 52 matches played by all the national teams participating in the Women’s World Cup 2015 were analyzed. A total of 3740 ball possessions were examined. Using the “move outcome” variable as a reference criterion, a statistically significant relationship was found between possessions that ended in success and possessions that have failed. Specifically, the successful possessions were those that were made in the offensive zone, with a clear intention to progress to…
On the listing and random generation of hybrid binary trees
1994
We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.
Restricted 123-avoiding Baxter permutations and the Padovan numbers
2007
AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
On extremal cases of Hopcroft’s algorithm
2010
AbstractIn this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different executions that can lead to different sequences of refinements of the set of the states up to the final partition. We find an infinite family of binary automata for which such a process is unique, whatever strategy is chosen. Some recent papers (cf. Berstel and Carton (2004) [3], Castiglione et al. (2008) [6] and Berstel et al. (2009) [1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata as…
Hopcroft's algorithm and tree-like automata
2011
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have running time with the same asymptotic growth rate. In particular, we provide a lower and upper bound for the running time of the algorithm expressed in terms of combinatorial properties of the trees…
Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks
2017
A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN-2 spanning trees and to find such trees it is necessary to perform more than O(NN-2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are p…
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
Discrete wavelet transform based multispectral filter array demosaicking
2013
International audience; The idea of colour filter array may be adapted to multi-spectral image acquisition by integrating more filter types into the array, and developing associated demosaicking algorithms. Several methods employing discrete wavelet transform (DWT) have been proposed for CFA demosaicking. In this work, we put forward an extended use of DWT for mul-tispectral filter array demosaicking. The extension seemed straightforward, however we observed striking results. This work contributes to better understanding of the issue by demonstrating that spectral correlation and spatial resolution of the images exerts a crucial influence on the performance of DWT based demosaicking.
Split decomposition A technique to analyze viral evolution
1993
A clustering technique allowing a restricted amount of overlapping and based on an abstract theory of coherent decompositions of finite metrics is used to analyze the evolution of foot-and-mouth disease viruses. The emerging picture is compatible with the existence of viral populations with a quasispecies structure and illustrates various forms of evolution of this virus family. In addition, it allows the correlation of these forms with geographic occurrence.