Avaliação de métodos numéricos de análise linear de estabilidade para perfis de aço formados a frio.

Para o projeto de estruturas com perfis de aço formados a frio, é fundamental a compreensão dos fenômenos da instabilidade local e global, uma vez que estes apresentam alta esbeltez e baixa rigidez à torção. A determinação do carregamento crítico e a identificação do modo de instabilidade contribuem para o entendimento do comportamento dessas estruturas. Este trabalho avalia três metodologias para a análise linear de estabilidade de perfis de aço formados a frio isolados, com o objetivo de determinar os carregamentos críticos elásticos de bifurcação e os modos de instabilidade associados. Estritamente, analisa-se perfis de seção U enrijecido e Z enrijecido isolados, de diversos comprimentos e diferentes condições de vinculação e carregamento. Determinam-se os carregamentos críticos elásticos de bifurcação e os modos de instabilidade globais e locais por meio de: (i) análise com o Método das Faixas Finitas (MFF), através do uso do programa computacional CUFSM; (ii) análise com elementos finitos de barra baseados na Teoria Generalizada de Vigas (MEF-GBT), via uso do programa GBTUL; e (iii) análise com elementos finitos de casca (MEF-cascas) por meio do uso do programa ABAQUS. Algumas restrições e ressalvas com relação ao uso do MFF são apresentadas, assim como limitações da Teoria Generalizada de Viga e precauções a serem tomadas nos modelos de cascas. Analisa-se também a influência do grau de discretização da seção transversal. No entanto, não é feita avaliação em relação aos procedimentos normativos e tampouco análises não lineares, considerando as imperfeições geométricas iniciais, tensões residuais e o comportamento elastoplástico do material.

A knowledge-based textual entailment approach applied to the QA answer validation at CLEF 2006

The Answer Validation Exercise (AVE) is a pilot track within the Cross-Language Evaluation Forum (CLEF) 2006. The AVE competition provides an evaluation frame- work for answer validations in Question Answering (QA). In our participation in AVE, we propose a system that has been initially used for other task as Recognising Textual Entailment (RTE). The aim of our participation is to evaluate the improvement our system brings to QA. Moreover, due to the fact that these two task (AVE and RTE) have the same main idea, which is to find semantic implications between two fragments of text, our system has been able to be directly applied to the AVE competition. Our system is based on the representation of the texts by means of logic forms and the computation of semantic comparison between them. This comparison is carried out using two different approaches. The first one managed by a deeper study of the Word- Net relations, and the second uses the measure defined by Lin in order to compute the semantic similarity between the logic form predicates. Moreover, we have also designed a voting strategy between our system and the MLEnt system, also presented by the University of Alicante, with the aim of obtaining a joint execution of the two systems developed at the University of Alicante. Although the results obtained have not been very high, we consider that they are quite promising and this supports the fact that there is still a lot of work on researching in any kind of textual entailment.

Voronoi cells via linear inequality systems

The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.

Calmness of the Feasible Set Mapping for Linear Inequality Systems

In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system’s data.

Highest return farming systems for Tama and Muscatine soils: an application of linear programming to 240- and 480- acre farms operated by two men/

Cover title.

Highest return farming systems for Drummer-Flanagan soils : an application of linear programming to farm planning /

Cover title.

The new metal worker pattern book; a complete course of instruction in the modern methods of developing and cutting the patterns for sheet metal work, giving the principles underlying practically every problem that is likely to come up in practice and explaining the selection and use of drawing tools and linear and geometrical drawing so clearly that one, who has had no previous knowledge of arithmetic or drawing, may understand these essentials and apply them in using the 253 problems in the development of patterns by the parallel line, conical or flaring, and triangulation systems.

Mode of access: Internet.

An algorithm for solving linear recurrence systems on parallel and pipelined machines /

"UILU-ENG 78 1745."

On the identification of multi-output linear time-invariant and periodic dynamic systems /

Includes bibliographies (p. 27-29).

Evaluation of cross-correlation methods in the utilization of antenna systems /

Contract AF33(616)-6079 Project No. 9-(13-6278) Task 40572. Sponsored by: Wright Air Development Center"

Short-time stability in linear time-varying systems.

"SFOSR 748."

Specification and data presentation in linear control systems; [final report,

"EE 61-4. Research project PRF 30. Contract no. AF 29(600)-1933."

Linear theory of hydrologic systems /

"...shortened version of lectures given....in August 1967..."

Effect of mutual coupling on the interference rejection capabilities of linear and circular arrays in CDMA systems

This paper is concerned with assessing the interference rejection capabilities of linear and circular array of dipoles that can be part of a base station of a code-division multiple-access cellular communication system. The performance criteria for signal-to-interference ratio (SIR) improvement employed in this paper is the spatial interference suppression coefficient. We first derive an expression for this figure of merit and then analyze and compare the SIR performance of the two types of arrays. For a linear array, we quantitatively assess the degradation in SIR performance, as we move from array broadside to array end-fire direction. In addition, the effect of mutual coupling is taken into account.

Optimal unravellings for feedback control in linear quantum systems

For quantum systems with linear dynamics in phase space much of classical feedback control theory applies. However, there are some questions that are sensible only for the quantum case: Given a fixed interaction between the system and the environment what is the optimal measurement on the environment for a particular control problem? We show that for a broad class of optimal (state- based) control problems ( the stationary linear-quadratic-Gaussian class), this question is a semidefinite program. Moreover, the answer also applies to Markovian (current-based) feedback.