Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

Second Order Representations of the Least Absolute Deviation Regression Estimator

We consider exact weak and strong Bahadur-Kiefer representations of the least absolute deviation estimator for the linear regression model. The precise behavior of these representations is obtained under minimal conditions.     

Large-scale production of cellulose-binding domains. Adsorption studies using CBD-FITC conjugates

A method for the gram-scale production of cellulose-binding domains (CBD) through the proteolytic digestion of a commercial enzymatic preparation (Celluclast) was developed. The CBD obtained, isolated from Trichoderma reesei cellobiohydrolase I, is highly pure and heavily glycosylated. The purified peptide has a molecular weight of 8.43 kDa, comprising the binding module, a part of the linker, and about 30% glycosidic moiety. Its properties may thus be different from recombinant ones expressed in bacteria. CBD-fluorescein isothiocyanate conjugates were used to study the CBD-cellulose interaction. The presence of fluorescent peptides adsorbed on crystalline and amorphous cellulose fibers suggests that amorphous regions have a higher concentration of binding sites. The adsorption is reversible, but desorption is a very slow process.     

Conjugate points and Maslov index in locally symmetric semi-Riemannian manifolds

We study the singularities of the exponential map in semi Riemannian locally symmetric manifolds. Conjugate points along geodesics depend only on real negative eigenvalues of the curvature tensor, and their contribution to the Maslov index of the geodesic is computed explicitly. We prove that degeneracy of conjugate points, which is a phenomenon that can only occur in semi-Riemannian geometry, is caused in the locally symmetric case by the lack of diagonalizability of the curvature tensor. The case of Lie groups endowed with a bi-invariant metric is studied in some detail, and conditions are given for the lack of local injectivity of the exponential map around its singularities.     

Comparison between structural and residual error formulations of an optimum design mechanism problem

Summary The model formulation of the objective function is one of the most important steps for solving an optimization problem. Generally, the objective function of an optimal design mechanism problem can be mathematically formulated either with structural or residual errors. In this paper we have conducted some comparisons between the results obtained by the structural and residual error formulations utilized in solving the optimum design of a four-bar linkage. The optimization problem is defined as a nonlinear least-squares problem. The damped Gauss-Newton algorithm is utilized for computing the solution, which ensures a local convergence for almost all nonlinear least-squares problems.

---

Sommario La formulazione matematica della funzione obiettivo è uno degli aspetti più delicati nella soluzione di un problema di ottimizzazione. Generalmente la funzione obiettivo di un problema di progettazione ottima di un meccanismo può essere formulata sia mediante l'errore strutturale che residuo. In questo lavoro sono stati eseguiti dei confronti tra i risultati ottenuti mediante le due precedenti formulazioni, in riferimento al problema della progettazione ottima di un quadrilatero articolato. Il problema di ottimizzazione viene definito come un problema nonlineare ai minimi quadrati la cui soluzione numerica è ottenuta mediante l'algoritmo damped di Gauss-Newton.

---

---

This paper was partially discussed at theII Congegno di Meccanica Computazionale, Roma, 1987.