Combinatorial association and abundance of components of interferon-stimulated gene factor 3 dictate the selectivity of interferon responses.

Genes containing the interferon-stimulated response element (ISRE) enhancer have been characterized as transcriptionally responsive primarily to type I interferons (IFN alpha/beta). Induction is due to activation of a multimeric transcription factor, interferon-stimulated gene factor 3 (ISGF3), which is activated by IFN alpha/beta but not by IFN gamma. We found that ISRE-containing genes were induced by IFN gamma as well as by IFN alpha in Vero cells. The IFN gamma response was dependent on the ISRE and was accentuated by preexposure of cells to IFN alpha, a treatment that increases the abundance of ISGF3 components. Overexpression of ISGF3 polypeptides showed that the IFN gamma response depended on the DNA-binding protein ISGF3 gamma (p48) as well as on the 91-kDa protein STAT91 (Stat1 alpha). The transcriptional response to IFN alpha required the 113-kDa protein STAT113 (Stat2) in addition to STAT91 and p48. Mutant fibrosarcoma cells deficient in each component of ISGF3 were used to confirm that IFN gamma induction of an ISRE reporter required p48 and STAT91, but not STAT113. A complex containing p48 and phosphorylated STAT91 but lacking STAT113 bound the ISRE in vitro. IFN gamma-induced activation of this complex, preferentially formed at high concentrations of p48 and STAT91, may explain some of the overlapping responses to IFN alpha and IFN gamma.

Solução rasterizada para o problema de empacotamento de fita irregular utilizando a Montanha Voronoi.

O empacotamento irregular de fita é um grupo de problemas na área de corte e empacotamento, cuja aplicação é observada nas indústrias têxtil, moveleira e construção naval. O problema consiste em definir uma configuração de itens irregulares de modo que o comprimento do contêiner retangular que contém o leiaute seja minimizado. A solução deve ser válida, isto é, não deve haver sobreposição entre os itens, que não devem extrapolar as paredes do contêiner. Devido a aspectos práticos, são admitidas até quatro orientações para o item. O volume de material desperdiçado está diretamente relacionado à qualidade do leiaute obtido e, por este motivo, uma solução eficiente pressupõe uma vantagem econômica e resulta em um menor impacto ambiental. O objetivo deste trabalho consiste na geração automática de leiautes de modo a obter níveis de compactação e tempo de processamento compatíveis com outras soluções na literatura. A fim de atingir este objetivo, são realizadas duas propostas de solução. A primeira consiste no posicionamento sequencial dos itens de modo a maximizar a ocorrência de posições de encaixe, que estão relacionadas à restrição de movimento de um item no leiaute. Em linhas gerais, várias sequências de posicionamentos são exploradas com o objetivo de encontrar a solução mais compacta. Na segunda abordagem, que consiste na principal proposta deste trabalho, métodos rasterizados são aplicados para movimentar itens de acordo com uma grade de posicionamento, admitindo sobreposição. O método é baseado na estratégia de minimização de sobreposição, cujo objetivo é a eliminação da sobreposição em um contêiner fechado. Ambos os algoritmos foram testados utilizando o mesmo conjunto de problemas de referência da literatura. Foi verificado que a primeira estratégia não foi capaz de obter soluções satisfatórias, apesar de fornecer informações importantes sobre as propriedades das posições de encaixe. Por outro lado, a segunda abordagem obteve resultados competitivos. O desempenho do algoritmo também foi compatível com outras soluções, inclusive em casos nos quais o volume de dados era alto. Ademais, como trabalho futuro, o algoritmo pode ser estendido de modo a possibilitar a entrada de itens de geometria genérica, o que pode se tornar o grande diferencial da proposta.

Novel Photochemical Methodologies For Diversity Oriented Synthesis And Screening Of Combinatorial Libraries

The main goal of this project was to develop an efficient methodology allowing rapid access to structurally diverse scaffolds decorated with various functional groups. Initially, we discovered and subsequently developed an experimentally straightforward, high-yielding photoinduced conversion of readily accessible diverse starting materials into polycyclic aldehydes and their (hemi)acetals decorated by various pendants. The two step sequence, involving the Diels-Alder addition of heterocyclic chalcones and other benzoyl ethylenes to a variety of dienes, followed by the Paternò-Büchi reaction, was described as an alkene-carbonyl oxametathesis. This methodology offers a rapid increase in molecular complexity and diversity of the target scaffolds. To develop this novel methodology further and explore its generality, we directed our attention to the Diels-Alder adducts based on various chromones. We discovered that the Diels-Alder adducts of chromones are capable of photoinduced alkene-arene [2+2] cycloaddition producing different dienes, which can either dimerize or be introduced into a double-tandem [4π+2π]·[2π+2π]·[4π+2π]·[2π+2π] synthetic sequence, followed by an acid-catalyzed oxametathesis, leading to a rapid expansion of molecular complexity over a few experimentally simple steps. In view of the fact that oxametathesis previously was primarily observed in aromatic oxetanes, we decided to prepare model aliphatic oxetanes with a conformationally unconstrained or "flexible" methyl group based on the Diels-Alder adducts of cyclohexadiene or cyclopentadiene with methyl vinyl ketone. Upon addition of an acid, the expected oxametathesis occurred with results similar to those observed in the aromatic series proving the generality of this approach. Also we synthesized polycyclic oxetanes resulting from the Diels-Alder adducts of cyclic ketones. This not only gave us access to remarkably strained oxetane systems, but also the mechanism for their protolytic ring opening provided a great deal of insight to how the strain affects the reactivity. Additionally, we discovered that although the model Hetero-Diels-Alder adducts did not undergo [2+2] cycloaddition, both exo- and endo-Sulfa-Diels-Alder products, nonetheless, were photochemically active and various products with defined stereochemistry could be produced upon photolysis. In conclusion, we have developed an approach to the encoding and screening of solution phase libraries based on the photorelease of externally sensitized photolabile tags. The encoding tags can be released into solution only when a binding event occurs between the ligand and the receptor, equipped with an electron transfer sensitizer. The released tags are analyzed in solution revealing the identity of the lead ligand or narrowing the range of potential leads.

High speed imaging and algorithms for non invasive vibrations measurement

Comunicación presentada en EVACES 2011, 4th International Conference on Experimental Vibration Analysis for Civil Engineering Structures, Varenna (Lecco), Italy, October 3-5, 2011.

GE models and algorithms for condensed phase equilibrium data regression in ternary systems: limitations and proposals

Phase equilibrium data regression is an unavoidable task necessary to obtain the appropriate values for any model to be used in separation equipment design for chemical process simulation and optimization. The accuracy of this process depends on different factors such as the experimental data quality, the selected model and the calculation algorithm. The present paper summarizes the results and conclusions achieved in our research on the capabilities and limitations of the existing GE models and about strategies that can be included in the correlation algorithms to improve the convergence and avoid inconsistencies. The NRTL model has been selected as a representative local composition model. New capabilities of this model, but also several relevant limitations, have been identified and some examples of the application of a modified NRTL equation have been discussed. Furthermore, a regression algorithm has been developed that allows for the advisable simultaneous regression of all the condensed phase equilibrium regions that are present in ternary systems at constant T and P. It includes specific strategies designed to avoid some of the pitfalls frequently found in commercial regression tools for phase equilibrium calculations. Most of the proposed strategies are based on the geometrical interpretation of the lowest common tangent plane equilibrium criterion, which allows an unambiguous comprehension of the behavior of the mixtures. The paper aims to show all the work as a whole in order to reveal the necessary efforts that must be devoted to overcome the difficulties that still exist in the phase equilibrium data regression problem.

Open-access operating algorithms for commercial videokeratographer and improvement of corneal sampling

We present an algorithm to process images of reflected Placido rings captured by a commercial videokeratoscope. Raw data are obtained with no Cartesian-to-polar-coordinate conversion, thus avoiding interpolation and associated numerical artifacts. The method provides a characteristic equation for the device and is able to process around 6 times more corneal data than the commercial software. Our proposal allows complete control over the whole process from the capture of corneal images until the computation of curvature radii.

A memetic algorithm for the delineation of local labour markets

Given a territory composed of basic geographical units, the delineation of local labour market areas (LLMAs) can be seen as a problem in which those units are grouped subject to multiple constraints. In previous research, standard genetic algorithms were not able to find valid solutions, and a specific evolutionary algorithm was developed. The inclusion of multiple ad hoc operators allowed the algorithm to find better solutions than those of a widely-used greedy method. However, the percentage of invalid solutions was still very high. In this paper we improve that evolutionary algorithm through the inclusion of (i) a reparation process, that allows every invalid individual to fulfil the constraints and contribute to the evolution, and (ii) a hillclimbing optimisation procedure for each generated individual by means of an appropriate reassignment of some of its constituent units. We compare the results of both techniques against the previous results and a greedy method.

Grouping genetic operators for the delineation of functional areas based on spatial interaction

The delineation of functional economic areas, or market areas, is a problem of high practical relevance, since the delineation of functional sets such as economic areas in the US, Travel-to-Work Areas in the United Kingdom, and their counterparts in other OECD countries are the basis of many statistical operations and policy making decisions at local level. This is a combinatorial optimisation problem defined as the partition of a given set of indivisible spatial units (covering a territory) into regions characterised by being (a) self-contained and (b) cohesive, in terms of spatial interaction data (flows, relationships). Usually, each region must reach a minimum size and self-containment level, and must be continuous. Although these optimisation problems have been typically solved through greedy methods, a recent strand of the literature in this field has been concerned with the use of evolutionary algorithms with ad hoc operators. Although these algorithms have proved to be successful in improving the results of some of the more widely applied official procedures, they are so time consuming that cannot be applied directly to solve real-world problems. In this paper we propose a new set of group-based mutation operators, featuring general operations over disjoint groups, tailored to ensure that all the constraints are respected during the operation to improve efficiency. A comparative analysis of our results with those from previous approaches shows that the proposed algorithm systematically improves them in terms of both quality and processing time, something of crucial relevance since it allows dealing with most large, real-world problems in reasonable time.

Parallel relaxed and extrapolated algorithms for computing PageRank

In this paper, parallel Relaxed and Extrapolated algorithms based on the Power method for accelerating the PageRank computation are presented. Different parallel implementations of the Power method and the proposed variants are analyzed using different data distribution strategies. The reported experiments show the behavior and effectiveness of the designed algorithms for realistic test data using either OpenMP, MPI or an hybrid OpenMP/MPI approach to exploit the benefits of shared memory inside the nodes of current SMP supercomputers.

An approach to the application of shift-and-add algorithms on engineering and industrial processes

Different kinds of algorithms can be chosen so as to compute elementary functions. Among all of them, it is worthwhile mentioning the shift-and-add algorithms due to the fact that they have been specifically designed to be very simple and to save computer resources. In fact, almost the only operations usually involved with these methods are additions and shifts, which can be easily and efficiently performed by a digital processor. Shift-and-add algorithms allow fairly good precision with low cost iterations. The most famous algorithm belonging to this type is CORDIC. CORDIC has the capability of approximating a wide variety of functions with only the help of a slight change in their iterations. In this paper, we will analyze the requirements of some engineering and industrial problems in terms of type of operands and functions to approximate. Then, we will propose the application of shift-and-add algorithms based on CORDIC to these problems. We will make a comparison between the different methods applied in terms of the precision of the results and the number of iterations required.

Aid decision algorithms to estimate the risk in congenital heart surgery

Background and objective: In this paper, we have tested the suitability of using different artificial intelligence-based algorithms for decision support when classifying the risk of congenital heart surgery. In this sense, classification of those surgical risks provides enormous benefits as the a priori estimation of surgical outcomes depending on either the type of disease or the type of repair, and other elements that influence the final result. This preventive estimation may help to avoid future complications, or even death. Methods: We have evaluated four machine learning algorithms to achieve our objective: multilayer perceptron, self-organizing map, radial basis function networks and decision trees. The architectures implemented have the aim of classifying among three types of surgical risk: low complexity, medium complexity and high complexity. Results: Accuracy outcomes achieved range between 80% and 99%, being the multilayer perceptron method the one that offered a higher hit ratio. Conclusions: According to the results, it is feasible to develop a clinical decision support system using the evaluated algorithms. Such system would help cardiology specialists, paediatricians and surgeons to forecast the level of risk related to a congenital heart disease surgery.

Methods and algorithms for video-based multi-point frequency measuring and mapping

Software for video-based multi-point frequency measuring and mapping: http://hdl.handle.net/10045/53429

Exploring Multi-Component Superconducting Compounds by a High-Pressure Method and Ceramic Combinatorial Chemistry

In this short review, we provide some new insights into the material synthesis and characterization of modern multi-component superconducting oxides. Two different approaches such as the high-pressure, high-temperature method and ceramic combinatorial chemistry will be reported with application to several typical examples. First, we highlight the key role of the extreme conditions in the growth of Fe-based superconductors, where a careful control of the composition-structure relation is vital for understanding the microscopic physics. The availability of high-quality LnFeAsO (Ln = lanthanide) single crystals with substitution of O by F, Sm by Th, Fe by Co, and As by P allowed us to measure intrinsic and anisotropic superconducting properties such as Hc2, Jc. Furthermore, we demonstrate that combinatorial ceramic chemistry is an efficient way to search for new superconducting compounds. A single-sample synthesis concept based on multi-element ceramic mixtures can produce a variety of local products. Such a system needs local probe analyses and separation techniques to identify compounds of interest. We present the results obtained from random mixtures of Ca, Sr, Ba, La, Zr, Pb, Tl, Y, Bi, and Cu oxides reacted at different conditions. By adding Zr but removing Tl, Y, and Bi, the bulk state superconductivity got enhanced up to about 122 K.

Efficient algorithms for solving systems of ordinary differential equations for ecosystems modeling /

Mode of access: Internet.

An evaluation of existing incident detection algorithms.

Texas Department of Transportation, Austin