scholarly journals Space Complexity Analysis of the Binary Tree Roll Algorithm

2017 ◽  
Vol 13 (1) ◽  
Author(s):  
Adrijan Božinovski ◽  
George Tanev ◽  
Biljana Stojčevska ◽  
Veno Pačovski ◽  
Nevena Ackovska
Keyword(s):  
Theoretical Analysis ◽  
Empirical Analysis ◽  
Binary Tree ◽  
Complexity Analysis ◽  
Space Complexity ◽  
Worst Case ◽  
Average Case ◽  
Tree Topologies ◽  
The Given ◽  
The Empirical Analysis

This paper presents the space complexity analysis of the Binary Tree Roll algorithm. The space complexity is analyzed theoretically and the results are then confirmed empirically. The theoretical analysis consists of determining the amount of memory occupied during the execution of the algorithm and deriving functions of it, in terms of the number of nodes of the tree n, for the worst - and best-case scenarios. The empirical analysis of the space complexity consists of measuring the maximum and minimum amounts of memory occupied during the execution of the algorithm, for all binary tree topologies with the given number of nodes. The space complexity is shown, both theoretically and empirically, to be logarithmic in the best case and linear in the worst case, whereas its average case is shown to be dominantly logarithmic.

scholarly journals Time Complexity Analysis of the Binary Tree Roll Algorithm

2017 ◽  
Vol 12 (2) ◽  
Author(s):  
Adrijan Božinovski ◽  
George Tanev ◽  
Biljana Stojčevska ◽  
Veno Pačovski ◽  
Nevena Ackovska
Keyword(s):  
Theoretical Analysis ◽  
Empirical Analysis ◽  
Binary Tree ◽  
Time Complexity ◽  
Recurrence Relations ◽  
Complexity Analysis ◽  
Worst Case ◽  
Average Case ◽  
The Empirical Analysis

This paper presents the time complexity analysis of the Binary Tree Roll algorithm. The time complexity is analyzed theoretically and the results are then confirmed empirically. The theoretical analysis consists of finding recurrence relations for the time complexity, and solving them using various methods. The empirical analysis consists of exhaustively testing all trees with given numbers of nodes  and counting the minimum and maximum steps necessary to complete the roll algorithm. The time complexity is shown, both theoretically and empirically, to be linear in the best case and quadratic in the worst case, whereas its average case is shown to be dominantly linear for trees with a relatively small number of nodes and dominantly quadratic otherwise.

scholarly journals CONFLICTOLOGICAL CULTURE OF PERSONALITY IN A PROFESSIONAL ENVIRONMENT (BY THE EXAMPLE OF PEDAGOGUES AND ENGINEERS)

2016 ◽  
Vol 1 ◽  
pp. 524 ◽  
Author(s):  
Olga Shcherbakova ◽  
Anna Tatarinceva
Keyword(s):  
Theoretical Analysis ◽  
Empirical Analysis ◽  
Work Experience ◽  
Scientific Literature ◽  
Gender And Work ◽  
Professional Environment ◽  
The Given ◽  
The Empirical Analysis

The levels of conflictological culture of pedagogues and engineers, the peculiarities of its formation as well as the comparison of the conflictological culture’s levels among representatives of these specialties on the base of their gender and work experience are analyzed in the proposed research. Each specialist owns a certain level of the conflictological culture’s development and he/she expresses it in a professional environment. The relevance of the research’s theme is caused by the necessity to improve conflictological culture of specialists for their further successful activities. The Aim of the research is the identification of differences in the levels’ formation of specialists’ conflictological culture by the example of pedagogues and engineers and the influence of such a characteristic as a gender and work experience  on it. The Object of the research is the process of forming conflictological culture of pedagogues and engineers. The Methods of the research are the following:1. the theoretical analysis of scientific literature on the given problem;2.the empirical analysis of obtained data reflected the level’s formation of pedagogues and engineers. 

scholarly journals Risk Measurement by G-Expected Shortfall

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Ziting Pei ◽  
Xuhui Wang ◽  
Xingye Yue
Keyword(s):  
Explicit Formula ◽  
Empirical Analysis ◽  
Risk Measure ◽  
Computational Cost ◽  
Expected Shortfall ◽  
Risk Measurement ◽  
Worst Case ◽  
New Type ◽  
The Empirical Analysis ◽  
Low Computational Cost

G-expected shortfall (G-ES), which is a new type of worst-case expected shortfall (ES), is defined as measuring risk under infinite distributions induced by volatility uncertainty. Compared with extant notions of the worst-case ES, the G-ES can be computed using an explicit formula with low computational cost. We also conduct backtests for the G-ES. The empirical analysis demonstrates that the G-ES is a reliable risk measure.

scholarly journals Research on the Collocation of Natural Casings

2020 ◽  
Vol 189 ◽  
pp. 01007
Author(s):  
Qiming Feng ◽  
Suping Qian
Keyword(s):  
Empirical Analysis ◽  
Optimization Algorithm ◽  
Optimization Problem ◽  
Hierarchical Optimization ◽  
Multi Objective Optimization ◽  
Optimal Model ◽  
Important Idea ◽  
Collocation Scheme ◽  
The Given ◽  
The Empirical Analysis

This paper discusses the reasonable collocation of natural casings. Through the analysis and research of the problems, the optimal model of the bundle number of assembled products is established. For this multi-objective optimization problem, the finished products are sorted according to the length from long to short, and then the method of hierarchical optimization algorithm is used to solve the problem. Finally, the empirical analysis of the given actual data is carried out. It provides an important idea for the formulation of the collocation scheme, and the solution of this problem can be extended to other aspects of production.

scholarly journals The Comparative Analysis of Higher School Students’ Conflictological Culture On The Basis Of Their Left-/Right- Handedness

2015 ◽  
Vol 1 ◽  
pp. 369
Author(s):  
Olga Shsherbakova ◽  
Anna Tatarinceva
Keyword(s):  
Empirical Analysis ◽  
Quantitative Methods ◽  
European Council ◽  
School Students ◽  
Life Long Learning ◽  
Left And Right ◽  
The Given ◽  
The Empirical Analysis ◽  
Integral Quality

<p><em>We face with different kinds of conflicts every day. The problem of the conflictological culture   of personality is urgent nowadays, because only a person with a highly developed level of the ability to avoid or successfully solve conflicts can succeed at work and in life-long learning. The European Council defined five key competences necessary for future specialists’ successful functioning in the contemporary society. The first place in this list was assigned for social competence as the ability to be responsible, able to take part in group decisions, avoid and resolve conflicts (The Symposium of the European Council. Brussels, 1996). The authors of the given research analyze the essence of the notions ”conflict”,  “conflictological culture”, as an integral quality of a person where the main stress is paid on its structural components’ content. They also  investigate different aspects of activities and psychophysiological development of left- and right-handedness of people. The empirical analysis conducted in the research presents the data obtained in the investigation  of the left- and right-handed students’ conflictological culture’s level. The Object of the research is the conflictological culture’s  level of students  at higher school. The Aim of the research is to investigate: 1) the essence of  the notions “ conflict”, “ conflictological  culture”, 2) the level of conflictological culture  of students of the 1<sup>st</sup> and 4<sup>th</sup> courses at  higher school on the basis of their left-/right—handedness. The Methods of the research are the following:1. Theoretical methods:The theoretical analysis of scientific literature on the given problem.2.Quantitative methods: questionnaires.3.The empirical analysis of obtained data.</em></p><p> </p>

scholarly journals Audiovisual cultural artifacts of protest in the Basque Country

2014 ◽  
Vol 20 (2) ◽  
pp. 224 ◽  
Author(s):  
Arkaitz Letamendia
Keyword(s):  
Theoretical Analysis ◽  
Empirical Analysis ◽  
Basque Country ◽  
Theoretical Discussion ◽  
Visual Sociology ◽  
Alternative Communication ◽  
Cultural Artifacts ◽  
Cultural Artifact ◽  
Complex Relationships ◽  
The Empirical Analysis

In this article we propose the emergence of a new kind of visual protest and alternative communication called the Audiovisual Cultural Artifact of Protest (ACAP). These will be studied in the context of the Basque Country, which currently combines structural and conjunctural characteristics that make it an outstanding laboratory for the study of these artifacts. A theoretical analysis of the complex relationships between power, communication and resistance will be carried out, and a reading is proposed that deals with the different planes on which these resistances and disputes are expressed. Based on this analysis, four kinds of audiovisual artifacts produced in the Basque Country are studied. For the empirical analysis, the methodological reflections of visual sociology are taken into consideration. The results provide an overview of these Audiovisual Cultural Artifacts of Protest and the theoretical discussion confirms the emergence of these new forms of visual protest, indicating the existence of a broad-based dynamic in which their proliferation and diversification is occurring. The analysis of the case of the Basque Country allows these tactical and communicative innovations to be contextualised and a discussion to take place about the importance of that context, the discourse’s construction and the possible trend towards spectacularisation of the resistances.Caption: #U12Bilbora: MobiLIPDUBzioa Durangon (2012).

FORMATION AND URGENCY OF THE CONCEPT `MUSICAL TASTE`: FROM ANCIENT TIMES TILL NOWADAYS

2015 ◽  
pp. 46
Author(s):  
Marina Marčenoka
Keyword(s):  
Theoretical Analysis ◽  
Music Education ◽  
Retrospective Analysis ◽  
Empirical Analysis ◽  
Contemporary Society ◽  
Musical Preference ◽  
Musical Taste ◽  
Ancient Times ◽  
The Empirical Analysis ◽  
Education Process

<p>The aim of the paper is a retrospective analysis of formation of the 'musical taste' concept and its urgency in the contemporary society. The Methods of the research are: the theoretical analysis of the philosophical and musical literature on the approaches to the concepts “esthetical taste” (C. Batteux, D. Hume, C. Montesquieu, M. Zeltser, F. Hutcheson, A. Shafstbery, J. Herder), “artistic taste” (L. Kogan), “musical taste” (M. Marchenoka); the theoretical analysis of the psychological literature on the approaches to the problem of musical taste in the contemporary society (A. North, J. Charles &amp; L. Sant-Kvinton, P. Rentfrow &amp; S. Gosling); the empirical analysis of musical preference in the music education process (M. Marchenoka). The Results of the research are the following: in the research the essence of the musical taste is defined and is examined its urgency in the contemporary society and the empirical analysis of musical preference in the music education process.</p>

An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme

2012 ◽  
Vol 2 (2) ◽  
pp. 1-14 ◽  
Author(s):  
Sanjay Ram ◽  
Somnath Pal
Keyword(s):  
Chemical Reactions ◽  
Efficient Algorithm ◽  
Time Complexity ◽  
Symmetric Matrix ◽  
Reaction Scheme ◽  
Space Complexity ◽  
Worst Case ◽  
Average Case ◽  
Model Driven

There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In this paper, the authors develop an efficient algorithm based on a model-driven approach developed by Ugi and co-workers for classification of chemical reactions. The authors’ algorithm takes reaction matrix of a chemical reaction as input and generates its appropriate class as output. Reaction matrices being symmetric, matrix implementation of Ugi’s scheme using upper/lower tri-angular matrix is of O(n2) in terms of space complexity. Time complexity of similar matrix implementation is O(n4), both in worst case as well as in average case. The proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Time complexity both in worst and average cases of the algorithm is linear.

scholarly journals Computing Maximal Lyndon Substrings of a String

2020 ◽  
Author(s):  
Frantisek Franek ◽  
Michael Liut
Keyword(s):  
Theoretical Analysis ◽  
Suffix Array ◽  
Input String ◽  
Sorting Algorithm ◽  
Worst Case ◽  
Average Case ◽  
Linear Algorithm ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Novel Algorithm

There are two reasons to have an efficient algorithm for identifying all maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the knowledge of maximal Lyndon substrings of the input string. Among the presented were two well-known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on iterated Duval's algorithm for Lyndon factorization, and a linear algorithmic scheme based on linear suffix sorting, computing inverse suffix array, and applying to it the Next Smaller Value algorithm. Duval's algorithm works for strings over any ordered alphabet, while for linear suffix sorting, a constant or an integer alphabet is required. The authors at that time were not aware of Baier's algorithm. In 2017, our research group proposed a novel algorithm for the Lyndon array. Though the proposed algorithm is linear in the average case and has O(n log(n)) worst-case complexity, it is interesting as it emulates the fast Fourier algorithm's recursive approach and introduces tau-reduction that might be of independent interest. In 2018, we presented a linear algorithm to compute the Lyndon array of a string inspired by Phase I of Baier's algorithm for suffix sorting. This paper presents theoretical analysis of these two algorithms and provides empirical comparisons of both their C++ implementations with respect to iterated Duval's algorithm.

PATH CONSISTENCY REVISITED

1996 ◽  
Vol 05 (01n02) ◽  
pp. 127-141 ◽  
Author(s):  
MONINDER SINGH
Keyword(s):  
Time Complexity ◽  
Real Life ◽  
Space Complexity ◽  
Minimal Amount ◽  
Worst Case ◽  
Average Case ◽  
Main Factors ◽  
High Space

One of the main factors limiting the use of path consistency algorithms in real life applications is their high space complexity. Han and Lee proposed a path consistency algorithm, PC-4, with O(n3a3) space complexity, which makes it practicable only for small problems. I present a new path consistency algorithm, PC-5, which has an O(n3a2) space complexity while retaining the worst-case time complexity of PC-4. Moreover, the new algorithm exhibits a much better average-case time complexity. The new algorithm is based on the idea (due to Bessiere) that, at any time, only a minimal amount of support has to be found and recorded for a labeling to establish its viability; one has to look for a new support only if the current support is eliminated. I also show that PC-5 can be improved further to yield an algorithm, PC5++, with even better average-case performance and the same space complexity.

Sign in / Sign up

Export Citation Format

Share Document