No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

The Polarizer-Sample-Analyzer (PSA) arrangement with the optical components P and A rotating with a fixed speed ratio (3:1) was originally introduced to determine nine Mueller matrix elements from Fourier analysis of the output signal of a photodetector. The arrangement is modified to the P'PSAA' arrangement where P' and A' represent fixed polarizers that are added at both ends with the speed ratio of the rotating components (P and A) remaining the same as before. After determination of the partial Mueller matrix in the ideal case, azimuthal offsets and imperfection parameters are introduced in the straight-through configuration and the imperfection parameters are determined from the Fourier coefficients. Finally, the sample is reintroduced and the full Mueller matrix elements are calculated to show the deviation from the ideal case and their dependency on the offsets and imperfection parameters.

A implementação das regras de negócio em sistemas de informação não é uma atividade trivial. Isso acontece porque os modelos utilizados para representá-las não determinam como elas podem ser efetivamente implementadas em situações reais. Neste trabalho é proposta um método para a transformação das regras de negócio descritas em SBVR para um modelo de implementação. Essa tradução é feita mapeando todos os elementos relevantes do modelo em SBVR em um modelo em $\\pi$-calculus baseado em eventos. Neste modelo, existe uma representação explícita de todos os eventos que precisam ser monitorados a fim de identificar quando a regra pode ter sido violada. O objetivo é facilitar o gerenciamento das regras de negócio ao permitir que elas permaneçam separadas dos outros elementos da arquitetura e com isso possam ser gerenciadas de forma independente. / The implementation of business rules in an information system is not an easy task. This happens because most of the models used to represent them capture only the meaning of the rules and do not provide means to make them to be effectively implemented. In this work we provide an approach for the translation from a SBVR semantic description of business rules into a implementation model. This was done by mapping all relevant elements of the SBVR semantic representation into a $\\pi$-calculus event-driven model. On this model will be described explicitly all the events that must be monitored in order to identify when some rule may have been violated. This makes the business rule implementation easier because there is a explicit indication of the moment when make sense to do a verification in order to see if any rule was violated. Besides that, it easier the business rule management since the rules stay separate from the others elements of the system architecture and in this way can be managed independently.

"Abstraction creates custom programming languages that facilitate programming for specific problem domains. It is traditionally partitioned according to a two-phase model of program evaluation, into syntactic abstraction enacted at translation time, and semantic abstraction enacted at run time. Abstractions pigeon-holed into one phase cannot interact freely with those in the other, since they are required to occur at logically distinct times. Fexprs are a Lisp device that subsumes the capabilities of syntactic abstraction, but is enacted at run-time, thus eliminating the phase barrier between abstractions. Lisps of recent decades have avoided fexprs because of semantic ill-behavedness that accompanied fexprs in the dynamically scoped Lisps of the 1960s and 70s. This dissertation contends that the severe difficulties attendant on fexprs in the past are not essential, and can be overcome by judicious coordination with other elements of language design. In particular, fexprs can form the basis for a simple, well-behaved Scheme-like language, subsuming traditional abstractions without a multi-phase model of evaluation. The thesis is supported by a new Scheme-like language called Kernel, created for this work, in which each Scheme-style procedure consists of a wrapper that induces evaluation of operands, around a fexpr that acts on the resulting arguments. This arrangement enables Kernel to use a simple direct style of selectively evaluating subexpressions, in place of most Lisps' indirect quasiquotation style of selectively suppressing subexpression evaluation. The semantics of Kernel are treated through a new family of formal calculi, introduced here, called vau calculi. Vau calculi use direct subexpression-evaluation style to extend lambda calculus, eliminating a long-standing incompatibility between lambda calculus and fexprs that would otherwise trivialize their equational theories. The impure vau calculi introduce non-functional binding constructs and unconventional forms of substitution. This strategy avoids a difficulty of Felleisen's lambda-v-CS calculus, which modeled impure control and state using a partially non-compatible reduction relation, and therefore only approximated the Church-Rosser and Plotkin's Correspondence Theorems. The strategy here is supported by an abstract class of Regular Substitutive Reduction Systems, generalizing Klop's Regular Combinatory Reduction Systems."

This project presents the homogenization analysis for a static contact problem with slip dependent friction between an elastic body and a rigid foundation. The homogenization for the static eigenvalue problem associated to this model is studied. We prove that the eigenvalues are of order epsilon. We obtain the limit problem for the contact model. The analysis is carried out by using the Gamma-convergence theory.