Photoletter to the editor: Response of linear porokeratosis to photodynamic therapy in an 11-year-old girl.

Porokeratoses are a group of different entities that belong to the skin keratinization disorders. From the histological point of view the main and common characteristic of these disorders is the presence of compact parakeratotic columns known as cornoid lamellae. All varieties should be carefully treated and followed-up because of the risk of developing malignant epithelial tumors. We report the successful response to photodynamic therapy (PDT) in a pediatric patient diagnosed with linear porokeratosis.

Disseny d’un muntatge experimental per les practiques de Resistència de materials

Degut a l’augment del nombre de classes i d’alumnes en l’Àrea de Mecànica de MedisContinus i Teoria d’Estructures (MMCTE), s’ha fet necessari la reestructuració i ocupació denous espais per la realització de les pràctiques de Resistència de materials.Per tal de realitzar les pràctiques al nou laboratori de Resistència de materials, calredissenyar les pràctiques referents a Allargaments longitudinals en bigues sotmeses acompressió i tracció simple i la referent a la Deformada d’una biga biarticulada amb voladís.El disseny de les noves pràctiques ha de complir les condicions exigides pel client. A més,els muntatges de cada pràctica han d’anar muntats sobre un pòrtic adquirit recientment perl’Àrea de Mecànica de Medis Continus i Teoria d’Estructures (MMCTE) que actuaran debancada. La pràctica relacionada amb Allargaments longitudinals en barres sotmeses a compressió itracció simple consta d’un muntatge experimental (Muntatge 1) i un guió de pràctiques perl’alumnat i professorat docent La pràctica relacionada amb la Deformada d’una biga biarticulada amb voladís consta d’unmuntatge experimental (Muntatge 2) i un guió de pràctiques per l’alumnat i professoratdocent. Les dos pràctiques permeten comparar els valors obtinguts experimentalment de cadamuntatge amb uns resultats teòrics i d’aquesta manera validar l’èxit de cada muntatge

Bayesian nash equilibrium in ''linear'' cournot models with private information about costs

Calculating explicit closed form solutions of Cournot models where firms have private information about their costs is, in general, very cumbersome. Most authors consider therefore linear demands and constant marginal costs. However, within this framework, the nonnegativity constraint on prices (and quantities) has been ignored or not properly dealt with and the correct calculation of all Bayesian Nash equilibria is more complicated than expected. Moreover, multiple symmetric and interior Bayesianf equilibria may exist for an open set of parameters. The reason for this is that linear demand is not really linear, since there is a kink at zero price: the general ''linear'' inverse demand function is P (Q) = max{a - bQ, 0} rather than P (Q) = a - bQ.

Genetic structure of a linear population of Beta vulgaris ssp maritima (sea beet) revealed by isozyme and RFLP analysis

Knowledge of the genetic structure of plant populations is necessary for the understanding of the dynamics of major ecological processes. It also has applications in conservation biology and risk assessment for genetically modified crops. This paper reports the genetic structure of a linear population of sea beet, Beta vulgaris ssp. maritima (the wild relative of sugar beet), on Furzey Island, Poole Harbour. The relative spatial positions of the plants were accurately mapped and the plants were scored for variation at isozyme and RFLP loci. Structure was analysed by repeated subdivision of the population to find the average size of a randomly mating group. Estimates of F-ST between randomly mating units were then made, and gave patterns consistent with the structure of the population being determined largely by founder effects. The implications of these results for the monitoring of transgene spread in wild sea beet populations are discussed.

Linear response functions for a vibrational configuration interaction state

Linear response functions are implemented for a vibrational configuration interaction state allowing accurate analytical calculations of pure vibrational contributions to dynamical polarizabilities. Sample calculations are presented for the pure vibrational contributions to the polarizabilities of water and formaldehyde. We discuss the convergence of the results with respect to various details of the vibrational wave function description as well as the potential and property surfaces. We also analyze the frequency dependence of the linear response function and the effect of accounting phenomenologically for the finite lifetime of the excited vibrational states. Finally, we compare the analytical response approach to a sum-over-states approach

Variational calculation of vibrational linear and nonlinear optical properties

A variational approach for reliably calculating vibrational linear and nonlinear optical properties of molecules with large electrical and/or mechanical anharmonicity is introduced. This approach utilizes a self-consistent solution of the vibrational Schrödinger equation for the complete field-dependent potential-energy surface and, then, adds higher-level vibrational correlation corrections as desired. An initial application is made to static properties for three molecules of widely varying anharmonicity using the lowest-level vibrational correlation treatment (i.e., vibrational Møller-Plesset perturbation theory). Our results indicate when the conventional Bishop-Kirtman perturbation method can be expected to break down and when high-level vibrational correlation methods are likely to be required. Future improvements and extensions are discussed

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

Micro-organismos da subclasse Coccidia: resistência e implicações para o processamento de materiais de assistência à saúde

Este estudo teórico propõe uma reflexão sobre a resistência intrínseca da subclasse Coccidia, particularmente o gênero Cryptosporidium, considerado como um agente potencialmente patogênico para pacientes imunocomprometidos, e suas repercussões na prática assistencial. Atualmente, as diretrizes internacionais e nacionais aprovam como procedimento seguro a desinfecção química de alto nível de endoscópios digestivos, após sua limpeza. No entanto, estudos evidenciaram que micro-organismos da subclasse Coccidia, especificamente o Cryptosporidium, responsável por infecção entérica, são mais resistentes que as micobactérias e não são inativados pelos desinfetantes químicos de alto nível, exceto pelo Peróxido de Hidrogênio a 6% e 7,5%, formulação ainda não disponível no Brasil. Conclui-se que a legislação deve incluir este agente entre os micro-organismos teste para aprovação de desinfetantes químicos de alto nível e que as autoridades sanitárias devem se esforçar para garantir que os estabelecimentos de assistência à saúde tenham acesso a produtos eficazes contra o Cryptosporidium.

Generalized linear and generalized additive models in studies of species distributions: setting the scene

An important statistical development of the last 30 years has been the advance in regression analysis provided by generalized linear models (GLMs) and generalized additive models (GAMs). Here we introduce a series of papers prepared within the framework of an international workshop entitled: Advances in GLMs/GAMs modeling: from species distribution to environmental management, held in Riederalp, Switzerland, 6-11 August 2001.We first discuss some general uses of statistical models in ecology, as well as provide a short review of several key examples of the use of GLMs and GAMs in ecological modeling efforts. We next present an overview of GLMs and GAMs, and discuss some of their related statistics used for predictor selection, model diagnostics, and evaluation. Included is a discussion of several new approaches applicable to GLMs and GAMs, such as ridge regression, an alternative to stepwise selection of predictors, and methods for the identification of interactions by a combined use of regression trees and several other approaches. We close with an overview of the papers and how we feel they advance our understanding of their application to ecological modeling.

Importância da Programação Linear na Determinação de Informações de Gestão - Caso Moave, Sa

A Investigação Operacional vem demonstrando ser uma valiosa ferramenta de gestão nos dias de hoje em que se vive num mercado cada vez mais competitivo. Através da Programação Linear pode-se reproduzir matematicamente um problema de maximização dos resultados ou minimização dos custos de produção com o propósito de auxiliar os gestores na tomada de decisão. A Programação Linear é um método matemático em que a função objectivo e as restrições assumem características lineares, com diversas aplicações no controlo de gestão, envolvendo normalmente problemas de utilização dos recursos disponíveis sujeitos a limitações impostas pelo processo produtivo ou pelo mercado. O objectivo geral deste trabalho é o de propor um modelo de Programação Linear para a programação ou produção e alocação de recursos necessários. Optimizar uma quantidade física designada função objectivo, tendo em conta um conjunto de condicionalismos endógenas às actividades em gestão. O objectivo crucial é dispor um modelo de apoio à gestão contribuindo assim para afectação eficiente de recursos escassos à disposição da unidade económica. Com o trabalho desenvolvido ficou patente a importância da abordagem quantitativa como recurso imprescindível de apoio ao processo de decisão. The operational research has proven to be a valuable management tool today we live in an increasingly competitive market. Through Linear Programming can be mathematically reproduce a problem of maximizing performance or minimizing production costs in order to assist managers in decision making. The Linear Programming is a mathematical method in which the objective function and constraints are linear features, with several applications in the control of management, usually involving problems of resource use are available subject to limitations imposed by the production process or the market. The overall objective of this work is to propose a Linear Programming model for scheduling or production and allocation of necessary resources. Optimizing a physical quantity called the objective function, given a set of endogenous constraints on management thus contributing to efficient allocation of scarce resources available to the economic unit. With the work has demonstrated the importance of the quantitative approach as essential resource to support the decision process.

Determinants of linear judgment: A meta-analysis of lens model studies

The mathematical representation of Brunswik s lens model has been usedextensively to study human judgment and provides a unique opportunity to conduct ameta-analysis of studies that covers roughly five decades. Specifically, we analyzestatistics of the lens model equation (Tucker, 1964) associated with 259 different taskenvironments obtained from 78 papers. In short, we find on average fairly high levelsof judgmental achievement and note that people can achieve similar levels of cognitiveperformance in both noisy and predictable environments. Although overall performancevaries little between laboratory and field studies, both differ in terms of components ofperformance and types of environments (numbers of cues and redundancy). An analysisof learning studies reveals that the most effective form of feedback is information aboutthe task. We also analyze empirically when bootstrapping is more likely to occur. Weconclude by indicating shortcomings of the kinds of studies conducted to date, limitationsin the lens model methodology, and possibilities for future research.