766 resultados para Algebraic thinking
Resumo:
The study of codes, classically motivated by the need to communicate information reliably in the presence of error, has found new life in fields as diverse as network communication, distributed storage of data, and even has connections to the design of linear measurements used in compressive sensing. But in all contexts, a code typically involves exploiting the algebraic or geometric structure underlying an application. In this thesis, we examine several problems in coding theory, and try to gain some insight into the algebraic structure behind them.
The first is the study of the entropy region - the space of all possible vectors of joint entropies which can arise from a set of discrete random variables. Understanding this region is essentially the key to optimizing network codes for a given network. To this end, we employ a group-theoretic method of constructing random variables producing so-called "group-characterizable" entropy vectors, which are capable of approximating any point in the entropy region. We show how small groups can be used to produce entropy vectors which violate the Ingleton inequality, a fundamental bound on entropy vectors arising from the random variables involved in linear network codes. We discuss the suitability of these groups to design codes for networks which could potentially outperform linear coding.
The second topic we discuss is the design of frames with low coherence, closely related to finding spherical codes in which the codewords are unit vectors spaced out around the unit sphere so as to minimize the magnitudes of their mutual inner products. We show how to build frames by selecting a cleverly chosen set of representations of a finite group to produce a "group code" as described by Slepian decades ago. We go on to reinterpret our method as selecting a subset of rows of a group Fourier matrix, allowing us to study and bound our frames' coherences using character theory. We discuss the usefulness of our frames in sparse signal recovery using linear measurements.
The final problem we investigate is that of coding with constraints, most recently motivated by the demand for ways to encode large amounts of data using error-correcting codes so that any small loss can be recovered from a small set of surviving data. Most often, this involves using a systematic linear error-correcting code in which each parity symbol is constrained to be a function of some subset of the message symbols. We derive bounds on the minimum distance of such a code based on its constraints, and characterize when these bounds can be achieved using subcodes of Reed-Solomon codes.
Resumo:
We assume that the resistance matrix can be found in electrical impedance tomography from the assumption of linear dependence between the voltages and the currents and with the help of the resistance matrix and the transfer impedance between the electrodes, a directional algebraic reconstruction technique is proposed. The goal is to reconstruct the resistivity distribution by weighting the matrices that are obtained by calculating the orthogonal distance of the underlying mesh elements from the neighbouring port resistivity lines. These weighting matrices, which only depend on the topology of the underlying mesh, can be calculated offline and result in a computationally efficient online procedure with a reasonable image reconstruction performance. Simulation results are provided to validate this approach.
Resumo:
The performance of algebraic flame surface density (FSD) models has been assessed for flames with nonunity Lewis number (Le) in the thin reaction zones regime, using a direct numerical simulation (DNS) database of freely propagating turbulent premixed flames with Le ranging from 0.34 to 1.2. The focus is on algebraic FSD models based on a power-law approach, and the effects of Lewis number on the fractal dimension D and inner cut-off scale η i have been studied in detail. It has been found that D is strongly affected by Lewis number and increases significantly with decreasing Le. By contrast, η i remains close to the laminar flame thermal thickness for all values of Le considered here. A parameterisation of D is proposed such that the effects of Lewis number are explicitly accounted for. The new parameterisation is used to propose a new algebraic model for FSD. The performance of the new model is assessed with respect to results for the generalised FSD obtained from explicitly LES-filtered DNS data. It has been found that the performance of the most existing models deteriorates with decreasing Lewis number, while the newly proposed model is found to perform as well or better than the most existing algebraic models for FSD. © 2012 Mohit Katragadda et al.
Resumo:
Matching a new technology to an appropriate market is a major challenge for new technology-based firms (NTBF). Such firms are often advised to target niche-markets where the firms and their technologies can establish themselves relatively free of incumbent competition. However, technologies are diverse in nature and do not benefit from identical strategies. In contrast to many Information and Communication Technology (ICT) innovations which build on an established knowledge base for fairly specific applications, technologies based on emerging science are often generic and so have a number of markets and applications open to them, each carrying considerable technological and market uncertainty. Each of these potential markets is part of a complex and evolving ecosystem from which the venture may have to access significant complementary assets in order to create and sustain commercial value. Based on dataset and case study research on UK advanced material university spin-outs (USO), we find that, contrary to conventional wisdom, the more commercially successful ventures were targeting mainstream markets by working closely with large, established competitors during early development. While niche markets promise protection from incumbent firms, science-based innovations, such as new materials, often require the presence, and participation, of established companies in order to create value. © 2012 IEEE.
Resumo:
A direct numerical simulation (DNS) database of freely propagating statistically planar turbulent premixed flames with a range of different turbulent Reynolds numbers has been used to assess the performance of algebraic flame surface density (FSD) models based on a fractal representation of the flame wrinkling factor. The turbulent Reynolds number Ret has been varied by modifying the Karlovitz number Ka and the Damköhler number Da independently of each other in such a way that the flames remain within the thin reaction zones regime. It has been found that the turbulent Reynolds number and the Karlovitz number both have a significant influence on the fractal dimension, which is found to increase with increasing Ret and Ka before reaching an asymptotic value for large values of Ret and Ka. A parameterisation of the fractal dimension is presented in which the effects of the Reynolds and the Karlovitz numbers are explicitly taken into account. By contrast, the inner cut-off scale normalised by the Zel'dovich flame thickness ηi/δz does not exhibit any significant dependence on Ret for the cases considered here. The performance of several algebraic FSD models has been assessed based on various criteria. Most of the algebraic models show a deterioration in performance with increasing the LES filter width. © 2012 Mohit Katragadda et al.