26 resultados para Curves, Algebraic.
em Deakin Research Online - Australia
Resumo:
We present a new determining set, CZ, of Riemann invariants which possesses the minimum degree property. From an analysis on the possible independence of CZ, we are led to the division of all space-times into two distinct, invariantly characterized, classes: a general class MG+, and a special, singular class MS For each class, we provide an independent set of invariants (IG+) ⊂ CZ and IS ⊂ CZ, respectively) which, with the results of a sequel paper, will be shown to be algebraically complete.
Resumo:
We study the set CZ of invariants [Zakhary and Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors possess a null eigenvector. We show that all cases are maximally backsolvable, in terms of sets of invariants from CZ, but that some cases are not completely backsolvable and these all possess an alignment between an eigenvector of the Ricci tensor with a repeated principal null vector of the Weyl tensor. We provide algebraically complete sets for each canonically different space-time and hence conclude with these results and those of a previous article [Carminati, Zakhary, and McLenaghan, J. Math. Phys. 43, 492 (2002)] that the CZ set is determining or maximal.
Resumo:
Recent algebraic attacks on LFSR-based stream ciphers and S-boxes have generated much interest as they appear to be extremely powerful. Theoretical work has been developed focusing around the Boo- lean function case. In this paper, we generalize this theory to arbitrary finite fields and extend the theory of annihilators and ideals introduced at Eurocrypt 2004 by Meier, Pasalic and Carlet. In particular, we prove that for any function f in the multivariate polynomial ring over GF(q), f has a low degree multiple precisely when two low degree functions appear in the same coset of the annihilator of f q – 1 – 1. In this case, many such low degree multiples exist.
Resumo:
We present an algebraic attack approach to a family of irregularly clock-controlled bit-based linear feedback shift register systems. In the general set-up, we assume that the output bit of one shift register controls the clocking of other registers in the system and produces a family of equations relating the output bits to the internal state bits. We then apply this general theory to four specific stream ciphers: the (strengthened) stop-and-go generator, the alternating step generator, the self-decimated generator and the step1/step2 generator. In the case of the strengthened stop-and-go generator and of the self-decimated generator, we obtain the initial state of the registers in a significantly faster time than any other known attack. In the other two situations, we do better than or as well as all attacks but the correlation attack. In all cases, we demonstrate that the degree of a functional relationship between the registers can be bounded by two. Finally, we determine the effective key length of all four systems.
Resumo:
In this paper, we mount the first algebraic attacks against clock controlled cascade stream ciphers. We first show how to obtain relations between the internal state bits and the output bits of the Gollmann clock controlled cascade stream ciphers. We demonstrate that the initial states of the last two shift registers can be determined by the initial states of the others. An alternative attack on the Gollmann cascade is also described, which requires solving quadratic equations. We then present an algebraic analysis of Pomaranch, one of the phase two proposals to eSTREAM. A system of equations of maximum degree four that describes the full cipher is derived. We also present weaknesses in the filter functions of Pomaranch by successfully computing annihilators and low degree multiples of the functions.
Resumo:
This paper addresses the problem of asymptotic stability of a linear system with many delay units. A novel algebraic test is proposed for the delay-independent stability of the system, based on the root distribution of the system's characteristic equation. If the system is only stable dependent of delay, the whole stable regions of the system can be perfectly obtained. Two algorithms are derived to examine the delay-independent stability, and to compute the whole stable regions if the system is of delay-dependent stability. These algorithms are computationally efficient and applicable to both certain and uncertain systems. Some illustrative examples demonstrate the validity of the approach.
Resumo:
Algebraic attacks have been applied to several types of clock-controlled stream ciphers. However, to date there are no such attacks in the literature on mutually clock-controlled ciphers. In this paper, we present a preliminary step in this direction by giving the first algebraic analysis of mutually clock-controlled feedback shift register stream ciphers: the bilateral stop-and-go generator, A5/1, Alpha 1 and the MICKEY cipher. We show that, if there are no regularly clocked shift registers included in the system, mutually clock-controlled feedback shift register ciphers appear to be highly resistant to algebraic attacks. As a demonstration of the weakness inherent in the presence of a regularly clocked shift register, we present a simple algebraic attack on Alpha 1 based on only 29 keystream bits.
Resumo:
We study the set of invariants CZ [E. Zakhary and J. Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors do not possess a null eigenvector. We show that all cases are completely backsolvable in terms of sets of invariants from CZ. We provide algebraically complete sets for each canonically different space-time.
Resumo:
One of the fundamental machine learning tasks is that of predictive classification. Given that organisations collect an ever increasing amount of data, predictive classification methods must be able to effectively and efficiently handle large amounts of data. However, it is understood that present requirements push existing algorithms to, and sometimes beyond, their limits since many classification prediction algorithms were designed when currently common data set sizes were beyond imagination. This has led to a significant amount of research into ways of making classification learning algorithms more effective and efficient. Although substantial progress has been made, a number of key questions have not been answered. This dissertation investigates two of these key questions. The first is whether different types of algorithms to those currently employed are required when using large data sets. This is answered by analysis of the way in which the bias plus variance decomposition of predictive classification error changes as training set size is increased. Experiments find that larger training sets require different types of algorithms to those currently used. Some insight into the characteristics of suitable algorithms is provided, and this may provide some direction for the development of future classification prediction algorithms which are specifically designed for use with large data sets. The second question investigated is that of the role of sampling in machine learning with large data sets. Sampling has long been used as a means of avoiding the need to scale up algorithms to suit the size of the data set by scaling down the size of the data sets to suit the algorithm. However, the costs of performing sampling have not been widely explored. Two popular sampling methods are compared with learning from all available data in terms of predictive accuracy, model complexity, and execution time. The comparison shows that sub-sampling generally products models with accuracy close to, and sometimes greater than, that obtainable from learning with all available data. This result suggests that it may be possible to develop algorithms that take advantage of the sub-sampling methodology to reduce the time required to infer a model while sacrificing little if any accuracy. Methods of improving effective and efficient learning via sampling are also investigated, and now sampling methodologies proposed. These methodologies include using a varying-proportion of instances to determine the next inference step and using a statistical calculation at each inference step to determine sufficient sample size. Experiments show that using a statistical calculation of sample size can not only substantially reduce execution time but can do so with only a small loss, and occasional gain, in accuracy. One of the common uses of sampling is in the construction of learning curves. Learning curves are often used to attempt to determine the optimal training size which will maximally reduce execution time while nut being detrimental to accuracy. An analysis of the performance of methods for detection of convergence of learning curves is performed, with the focus of the analysis on methods that calculate the gradient, of the tangent to the curve. Given that such methods can be susceptible to local accuracy plateaus, an investigation into the frequency of local plateaus is also performed. It is shown that local accuracy plateaus are a common occurrence, and that ensuring a small loss of accuracy often results in greater computational cost than learning from all available data. These results cast doubt over the applicability of gradient of tangent methods for detecting convergence, and of the viability of learning curves for reducing execution time in general.
Resumo:
This thesis presents an algebraic framework for multimodal image fusion. The framework derives algebraic constructs and equations that govern the fusion process. The derived equations serve as objective functions according to which image fusion algorithms and metrics can be tuned. The equations also prove the duality between image fusion algorithms and metrics.
Resumo:
Corrosion testing (half-cell and LPR) was carried out on a number reinforced concrete panels which had been taken from the fascia of a twenty five year old high rise building in Melbourne, Australia. Corrosion, predominantly as a result of carbonation of the concrete, was associated with a limited amount of cracking. A monitoring technique was established in which probe electrodes (reference and counter) were retro-fitted into the concrete. The probe electrode setup was identical for all panels tested. It was found that the corrosion behaviour of all panels tested closely fitted a family of results when the corrosion potential is plotted against the polarisation resistance (Rp). This enabled the development of a so-called 'control curve' relating the corrosion potential to the Rp for all of the panels under investigation. This relationship was also confirmed on laboratory samples, indicating that for a fixed geometry and experimental conditions a relationship between the potential and polarisation resistance of steel can be established for the steel-concrete system. Experimental results will be presented which indicate that for a given monitoring cell geometry, it may be possible to propose criteria for the point at which remediation measures should be considered. The establishment of such a control curve has enabled the development of a powerful monitoring tool for the assessment of a number of proposed corrosion remediation techniques. The actual effect of any corrosion remediation technique becomes clearly apparent via the type and magnitude of deviation of post remediation data from the original (preremediation) control curve.
Resumo:
Replication, or repeated tests at the same stress amplitude, is used to provide statistical confidence in life data during the development of S-N curves. This paper discusses the effects of replication on the measurement of S-N curves and presents an alternative to traditional replication methods for the determination of S-N curves, particularly for the development of preliminary S-N curves. Using specimens made out of the extruded bars of a magnesium alloy, it is demonstrated that the S-N curve estimated using the data from non-replication tests is almost same as that from replication tests. The advantage of using non-replication fatigue tests is that it uses fewer specimens, in this instance, only half of that required for 50% replication fatigue test, to achieve the same estimation as that of the replication fatigue tests. Another advantage of using non-replication fatigue tests is that it can detect the non-linearity using limited specimens.