Level Eulerian Posets

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the longest interval one needs to check to verify Eulerianness. Furthermore, we show that every level Eulerian poset associated to an indecomposable matrix has even order. A condition for verifying shellability is introduced and is automated using the algebra of walks. Applying the Skolem--Mahler--Lech theorem, the ${\bf ab}$-series of a level poset is shown to be a rational generating function in the non-commutative variables ${\bf a}$ and ${\bf b}$. In the case the poset is also Eulerian, the analogous result holds for the ${\bf cd}$-series. Using coalgebraic techniques a method is developed to recognize the ${\bf cd}$-series matrix of a level Eulerian poset

Smoothing and Matching of 3-D Space Curves

International audienceWe present a new approach to the problem of matching 3-D curves. The approach has a low algorithmic complexity in the number of models, and can operate in the presence of noise and partial occlusions. Our method builds upon the seminal work of Kishon et al. (1990), where curves are first smoothed using B-splines, with matching based on hashing using curvature and torsion measures. However, we introduce two enhancements: -- We make use of nonuniform B-spline approximations, which permits us to better retain information at highcurvature locations. The spline approximations are controlled (i.e., regularized) by making use of normal vectors to the surface in 3-D on which the curves lie, and by an explicit minimization of a bending energy. These measures allow a more accurate estimation of position, curvature, torsion, and Frtnet frames along the curve. -- The computational complexity of the recognition process is relatively independent of the number of models and is considerably decreased with explicit use of the Frtnet frame for hypotheses generation. As opposed to previous approaches, the method better copes with partial occlusion. Moreover, following a statistical study of the curvature and torsion covariances, we optimize the hash table discretization and discover improved invariants for recognition, different than the torsion measure. Finally, knowledge of invariant uncertainties is used to compute an optimal global transformation using an extended Kalman filter. We present experimental results using synthetic data and also using characteristic curves extracted from 3-D medical images. An earlier version of this article was presented at the 2nd European Conference on Computer Vision in Italy

Purification of plasmid DNA from clarified and non-clarified Escherichia coli lysates by berenil pseudo-affinity chromatography

In this study, berenil was tested as a ligand, specifically to purify plasmids of different sizes pVAX1-LacZ (6.05 Kbp) and pCAMBIA-1303 (12.361 Kbp) from clarified Escherichia coli alkaline lysates. For this purpose, chromatographic experiments were performed using Sepharose derivatized with berenil. The results showed that both pDNA molecules are completely purified using lower amounts of salt in the eluent than those previously reported for other pseudo-affinity and hydrophobic interaction chromatography based processes. Total retention of all lysate components was achieved with 1.3 M ammonium sulphate in the eluent buffer and pDNA elution was obtained by decreasing the salt concentration to 0.55 M. All impurities were eluted after decreasing the concentration to 0 M. The recovery yield for pCAMBIA-1303 (45%) was lower than that obtained for pVAX1-LacZ (85%), however the larger pDNA showed a higher purity level. Purification of pVAX1-LacZ was also performed using non-clarified E. coli process streams, replacing the clarification step with a second chromatographic run on the berenil-Sepharose. Using the same binding and elution conditions as before, a pure plasmid sample was obtained with a 33% yield and with all host impurity levels in accordance with the requirements established by the regulatory agencies. These results suggest that this chromatographic method is a promising alternative to purify pDNA for therapeutic use.Fundação para a Ciência e Tecnologia (FCT) - PTDC/QUI-QUI/100896/2008, SFRH/BD/64918/200

“If You Can Dream It, You Can Achieve It.” Parent Memorable Messages as Indicators of College Student Success

This study investigated various aspects of parents’ memorable messages about college as they relate to indicators of college student success. Findings revealed that parents’ memorable messages about college focused on working (and playing) hard, the necessity of attending college, providing encouragement and support, and general advice based on parents’ own experiences. Although these message themes were not uniquely predictive of college student success, the students’ perceptions of message and sender characteristics emerged as significant predictors of cognitive learning indicators, learner empowerment, college motivation, and satisfaction with college. Theoretical and practical implications for findings are discussed