Potentialités des séquences d’étalement chaotiques pour l’amélioration duTEEB d’un systèmeDS-CDMA asynchrone

The use of chaotic sequences as spectral spreading sequences in a Direct Sequence-Code Division Multiple Access is proposed in this paper. The simulation of the system is performed with the system simulator Omnisys. The chaotic spreading sequences are generated from a non-linear recursive equation. The Bit Error Rate of this system is compared with theBER of the same system using binary Gold sequences. The results show that chaotic sequences can improve performances in terms of allowable number of users.     

Occurrence and numerical prediction of surface defects during flanging of metallic sheets

Surface defects can develop on automotive exterior panels after drawing and flanging steps, during springback and may alter significantly the vehicle quality. These defects are characterized by a small depth below 0.5 mm and are then difficult to detect numerically. This study focuses on the surface defects for two parts: an industrial upper corner of a front door and a L-shaped part designed on purpose to reproduce at a small scale surface defects that occur after flanging. Dimensions of these defects are measured from profiles obtained either with a non-contacting method or a tridimensional measuring machine. Numerical simulations of the processes are performed with the commercial codes PamStamp2G or Abaqus and deformed meshes are analyzed in the same way as the experimental data. There is a good correlation between experiments and simulations concerning the spatial position of the defect and their dimensions. Moreover, a buckling analysis during springback is performed for the L-shaped part, showing that the position of the defect corresponds to one of the buckling mode.     

Purification and properties of the chloroplastic form of biotin holocarboxylase synthetase from Arabidopsis thaliana overexpressed in Escherichia coli

Holocarboxylase synthetases (HCSs) are key enzymes in biotin utilisation in both prokaryotes and eukaryotes. In a previous study, we demonstrated that, in plants, HCS activity is localised in cytosol, chloroplasts and mitochondria. We also described the cloning and sequencing of a full-length cDNA encoding an Arabidopsis thaliana HCS isoform with a putative organelle-transit peptide. In the study reported here, this cDNA was used to construct an overproducing Escherichia coli strain. The recombinant enzyme was isolated using an efficient three-step purification procedure. Polyclonal antibodies raised against pure HCS were produced to elucidate the subcellular localisation of this protein. Immunodetection carried out by Western blotting of isolated pea leaf subcellular compartments specifically revealed a single polypeptide that was ascribed to the chloroplast compartment. Immunocytochemistry of thin-cut sections from tobacco leaves, transformed by the complete coding sequence of A. thaliana HCS cDNA via Agrobacterium tumefaciens, confirmed that the enzyme encoded by this cDNA is the chloroplastic isoform. Moreover, physicochemical, biochemical and kinetic properties of the pure recombinant HCS were determined. The native recombinant enzyme is a 37-kDa monomer. In contrast to the major part of HCS activity measured in leaf extracts, the recombinant chloroplastic enzyme did not require addition of Mg2+ to be fully active, but was substantially inhibited by EDTA. This suggested that the chloroplastic HCS may contain a tightly-bound divalent cation required for enzyme activity. The recombinant enzyme was able to biotinylate efficiently apo-biotin carboxyl carrier protein (BCCP) from E. coli and apo-methylcrotonoyl-CoA carboxylase (MCCase) from A. thaliana. Apparent Km values for the enzyme substrates D-biotin, ATP and apo-MCCase were found to be 130 nM, 4.4 microM and 32 microM, respectively. Steady-state kinetic analyses of the HCS-catalysed reaction were investigated with respect to reaction mechanism and inhibition by AMP, one of the end-products of the enzyme-catalysed reaction. Substrate interaction and product inhibition patterns indicated that ATP and D-biotin bind sequentially, in an ordered manner, to the enzyme and that ATP or D-biotin and apo-BCCP bind in ping-pong fashion.     

A generalization of ACP using Belnap’s logic

ACP is combined with Belnap’s four-valued logic via conditional composition (if–then–else). We show that the operators of ACP can be seen as instances of more general, conditional operators. For example, both the choice operator + and δ (deadlock) can be seen as instances of conditional composition, and the axiom x + δ = x follows from this perspective. Parallel composition is generalized to the binary conditional merge _ψ where covers the choice between interleaving and synchronization, and ψ determines the order of execution. The instance _BB is ACP’s parallel composition, where B (both) is the truth value that models both true and false in Belnap’s logic. Other instances of this conditional merge are sequential composition, pure interleaving and synchronous merge. We investigate the expression of scheduling strategies in the conditions of the conditional merge.     

Computation of bases of free modules over the Weyl algebras

A well-known result due to J.T. Stafford asserts that a stably free left module M over the Weyl algebras D=A_n(k) or B_n(k)–where k is a field of characteristic 0–with is free. The purpose of this paper is to present a new constructive proof of this result as well as an effective algorithm for the computation of bases of M. This algorithm, based on the new constructive proofs [Hillebrand, A., Schmale, W., 2001. Towards an effective version of a theorem of Stafford. J. Symbolic Comput. 32, 699–716; Leykin, A., 2004. Algorithmic proofs of two theorems of Stafford. J. Symbolic Comput. 38, 1535–1550] of J.T. Stafford’s result on the number of generators of left ideals of D, performs Gaussian elimination on the formal adjoint of the presentation matrix of M. We show that J.T. Stafford’s result is a particular case of a more general one asserting that a stably free left D-module M with is free, where denotes the stable rank of a ring D. This result is constructive if the stability of unimodular vectors with entries in D can be tested. Finally, an algorithm which computes the left projective dimension of a general left D-module M defined by means of a finite free resolution is presented. It allows us to check whether or not the left D-module M is stably free.     

Carbon Source-Dependent Changes of the Structure of Streptococcus pneumoniae Capsular Polysaccharide with Serotype 6F

The structure of the exopolysaccharide capsule of Streptococcus pneumoniae is defined by the genetic arrangement of the capsule operon allowing the unequivocal identification of the pneumococcal serotype. Here, we investigated the environment-dependent composition of the polysaccharide structure of S. pneumoniae serotype 6F. When grown in a chemically defined medium (CDM) with glucose versus galactose, the exopolysaccharide capsule of the serotype 6F strains reveals a ratio of 1/0.6 or 1/0.3 for galactose/glucose in the capsule by ¹H-NMR analyses, respectively. Increased production of the capsule precursor UDP-glucose has been identified by ³¹P-NMR in CDM with glucose. Flow cytometric experiments using monoclonal antibodies showed decreased labelling of Hyp6AG4 (specific for serotype 6A) antibodies when 6F is grown in glucose as compared to galactose, which mirrors the 1H-NMR results. Whole-genome sequencing analyses of serotype 6F isolates suggested that the isolates evolved during two different events from serotype 6A during the time when the 13-valent pneumococcal conjugate vaccine (PCV-13) was introduced. In conclusion, this study shows differences in the capsular structure of serotype 6F strains using glucose as compared to galactose as the carbon source. Therefore, 6F strains may show slightly different polysaccharide composition while colonizing the human nasopharynx (galactose rich) as compared to invasive locations such as the blood (glucose rich).     

Cobalt‐Catalyzed Cross‐Coupling Reaction between Functionalized Primary and Secondary Alkyl Halides and Aliphatic Grignard Reagents

The coupling of primary and secondary unactivated alkyl bromides with alkyl‐Grignard reagents was performed in good yields under mild conditions by using a new catalytic system: consisting of cobalt chloride and tetramethylethylenediamine (CoCl₂⋅2 LiI, 4 TMEDA). The reaction is very chemoselective since ketone, ester and nitrile functions are tolerated.     

A co-located partitions strategy for parallel CFD–DEM couplings

In this work, a new partition-collocation strategy for the parallel execution of CFD–DEM couplings is investigated. Having a good parallel performance is a key issue for an Eulerian-Lagrangian software that aims to be applied to solve industrially significant problems, as the computational cost of these couplings is one of their main drawback. The approach presented here consists in co-locating the overlapping parts of the simulation domain of each software on the same MPI process, in order to reduce the cost of the data exchanges. It is shown how this strategy allows reducing memory consumption and inter-process communication between CFD and DEM to a minimum and therefore to overcome an important parallelization bottleneck identified in the literature. Four benchmarks are proposed to assess the consistency and scalability of this approach. A coupled execution on 280 cores shows that less than 0.1% of the time is used to perform inter-physics data exchange.     

Secure time-stamping schemes: a distributed point of view

Time-stamping is a technique used to prove the existence of a digital document prior to a specific point in time. Today, implemented schemes rely on a centralized server model that has to be trusted. We point out the drawbacks of these schemes, showing that the unique serveur represent a weak point for the system. We propose an alternative scheme which is based on a network of servers managed by administratively independent entities. This scheme appears to be a trusted and reliable distributed time-stamping scheme.