Numerical modelling of single-layer folding: clarification of an issue regarding the possible effect of computer codes and the influence of initial irregularities

The influence of initial perturbation geometry and material propel-ties on final fold geometry has been investigated using finite-difference (FLAC) and finite-element (MARC) numerical models. Previous studies using these two different codes reported very different folding behaviour although the material properties, boundary conditions and initial perturbation geometries were similar. The current results establish that the discrepancy was not due to the different computer codes but due to the different strain rates employed in the two previous studies (i.e. 10(-6) s(-1) in the FLAC models and 10(-14) s(-1) in the MARC models). As a result, different parts of the elasto-viscous rheological field were bring investigated. For the same material properties, strain rate and boundary conditions, the present results using the two different codes are consistent. A transition in Folding behaviour, from a situation where the geometry of initial perturbation determines final fold shape to a situation where material properties control the final geometry, is produced using both models. This transition takes place with increasing strain rate, decreasing elastic moduli or increasing viscosity (reflecting in each case the increasing influence of the elastic component in the Maxwell elastoviscous rheology). The transition described here is mechanically feasible but is associated with very high stresses in the competent layer (on the order of GPa), which is improbable under natural conditions. (C) 2000 Elsevier Science Ltd. All rights reserved.

Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.

Utilização de QR Codes em museologia

Trabalho de Projeto apresentado para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Comunicação e Artes

Über die Automorphismengruppe extremaler Codes der Längen 96 und 120

Magdeburg, Univ., Fak. für Mathematik, Diss., 2012

Extremal self-dual codes

Magdeburg, Univ., Fak. für Mathematik, Diss., 2012

Codes of best practice in competitive markets for managers

We study firms' corporate governance in environments where possibly heterogeneous shareholders compete for possibly heterogeneous managers. A firm, formed by a shareholder and a manager, can sign either an incentive contract or a contract including a Code of Best Practice. A Code allows for a better manager's control but makes manager's decisions hard to react when market conditions change. It tends to be adopted in markets with low volatility and in low-competitive environments. The firms with the best projects tend to adopt the Code when managers are not too heterogeneous while the best managers tend to be hired through incentive contracts when the projects are similar. Although the matching between shareholders and managers is often positively assortative, the shareholders with the best projects might be willing to renounce to hire the best managers, signing contracts including Codes with lower-ability managers.

The Pf332 gene codes for a megadalton protein of Plasmodium falciparum asexual blood stages

We characterized the Plasmodium falciparum antigen 332 (Ag332) which is specifically expressed during the asexual intraerythrocytic cycle of the parasite. The corresponding Pf332 gene has been located in the subtelomeric region of chromosome 11. Furthermore, it is present in all strais so far analyzed and shows marked restriction length fragment polymorphism. Partial sequence and restriction endonuclease digestion of cloned fragments revealed that the Pf332 gene is composed of highly degenerated repeats rich is glutamic acid. Mung been nuclease digestion and Northern blot analysis suggested that Pf332 gene codes for a protein of about 700 kDa. These data were further confirmed by Western blot and immunoprecipitation of parasites extracts with an antiserum raised against a recombinant clone expressing part of the Ag332. Confocal immunofluorescence showed that Ag332 is translocated from the parasite to the surface of infected red blood cells within vesicle-like structures. In addition, Ag332 was detected on the surface of monkey erythrocytes infected with Plasmodium falciparum.

Transcodage des codes opératoires et diagnostiques VESKA (version 1979) en codes ICD-9-CM

Ce travail décrit les opérations théoriques et pratiques concernant le transcodage des opérations d'une part, des diagnostics d'autre part; il décrit également le programme informatique de transcodage.