Affine hom-complexes

For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural tensor product of polytopal complexes, which is the left adjoint functor for Hom. This extends the corresponding facts from single polytopes, systematic study of which was initiated in [6,12]. Explicit examples of computations of the resulting structures are included. In the special case of simplicial complexes, the affine hom-complex is a functorial subcomplex of Kozlov's combinatorial hom-complex [14], which generalizes Lovasz' well-known construction [15] for graphs.Comment: final version, to appear in Portugaliae Mathematic

BIG DATA A BIG DEAL FOR CAPITAL MARKET COMPANIES IN THEIR TRANSFORMATION PROCESS?

Abstract The following article discusses the importance of using big data, especially in the operation of capital market companies, both in terms of benefits and potential risks. Given the growing dynamic business environment, capital market companies have to transform their operations in order to accommodate the raising demands. Fast business decision making is of particular importance in this process. Structured use of data plays a major role in decision-making, especially as the amount of large digital data in the modern world grows at an unprecedented rate. Author of the article focuses on the statistical and econometric techniques required for the analysis of big data. The article also highlights some use cases and the growing interest of capital market companies in introducing big data analytical technologies and the relevant challenges and benefits. In addition, using so-called "Simpson’s Reversal Paradox" author explains that using big data and digging deep into details might be counterproductive and lead to loss of global picture and wrong decision-making

A Case Study of the Higher Education System in Georgia

The higher education system of countries is an important area that determines the countries drive for development. This thesis aims to scrutinize the higher education system in Georgia and how the system translates and resonates with Georgia’s development. Several questions have been raised in light of the several reforms that have greeted the higher education system in Georgia and these questions are summed up into three all-encompassing questions in this thesis. The questions includes – How is the higher education situation in Georgia? Why is it in its current state and what are the implications of this current state? This thesis used the single case study method and supported it with policy analysis to analyze the several reforms and to find answers to these questions. This thesis gathered corroborative information through interviews conducted with four experts who have played active roles and still do in the Georgian higher education system. The internal determinants for each policy and reform was explored to understand the motive behind the changes and this thesis eventually compared the changes in the Georgian higher education system to that effected in the Estonian higher education system. It became clear that the questions about the sustainability of the Georgian higher education system were premised upon credible consequences trailing each reform and this thesis eventually reached the conclusion that the Georgian higher education system lacked long-term credibility. This thesis concludes that while Georgia aspires for EU membership, the country’s higher education system is pivotal for all round development

A parametrized sorting System for a large set of k-bit elements

In this paper, we describe a parametrized sorting system for a large set of k-bit elements. The structure of the system is independent from the problem size (the number of elements to be sorted) and the type of the sorting set (for example, a set of k-bit numbers, an alphabetical list of k-bit words etc.), as well as from the ordering relation defined on the set of the elements (such as ascending or descending order of k-bit numbers, or a specific order of alphabetical words). The general structure of the underlying parallel network is based on the n- dimensional hypercube. The node circuit construction defines the type of the sorting elements, thus defining the semantics of the system. The structure of the circuit implements the Columnsort algorithm introduced by Leighton in [Lei85]. By changing only one subcircuit of the size O(k) in the node, we can define different ordering relations of the sorted elements. The system is based on specific VLSI chips that were developed in [Gam96] with the CAD system Cadic [Bur95], that has been developed in the project B1 "VLSI design systems and parallelity" under guidance of Prof. G. Hotz. The result is a fast system that sorts the sets of up to 2^28 64-bit numbers. The maximal sorting time is less than 43.6 seconds that is better than some of the fastest software realizations implemented at 32-processor Paragon ([Hard96]), Cray Y-MP ([ZagBlel91]) and MasPar MP-1 ([BrockWan97])

Zur Frage des Systems der Verschluss- und Frikativlaute im "Minoischen" nach Ausweis der griechischen Linearschrift B

N/