Fr. Joannis de Aliaga ... Tomus tertius Quaest. commentariae in 1. 2. D. Thomae ...

Mode of access: Internet.

Local liquid holdups and hysteresis in a 2-D packed bed using X-ray radiography

An X-ray visualization technique has been used for the quantitative determination of local liquid holdups distribution and liquid holdup hysteresis in a nonwetting two-dimensional (2-D) packed bed. A medical diagnostic X-ray unit has been used to image the local holdups in a 2-D cold model having a random packing of expanded polystyrene beads. An aqueous barium chloride solution was used as a fluid to achieve good contrast on X-ray images. To quantify the local liquid holdup, a simple calibration technique has been developed that can be used for most of the radiological methods such as gamma ray and neutron radiography. The global value of total liquid holdup, obtained by X-ray method, has been compared with two conventional methods: drainage and tracer response. The X-ray technique, after validation, has been used to visualize and quantify, the liquid hysteresis phenomena in a packed bed. The liquid flows in preferred paths or channels that carry droplets/rivulets of increasing size and number as the liquid flow rate is increased. When the flow is reduced, these paths are retained and the higher liquid holdup that persists in these regions leads to the holdup hysteresis effect. Holdup in some regions of the packed bed may be an order of magnitude higher than average at a particular flow rate. (c) 2005 American Institute of Chemical Engineers

Effect of pore packing defects in 2-D ordered mesoporous carbons on ionic transport

Ordered mesoporous materials show great importance in energy, environmental, and chemical engineering. The diffusion of guest species in mesoporous networks plays an important role in these applications, especially for energy storage, such as supercapacitors based on ordered mesoporous carbons ( OMCs). The ion diffusion behavior in two different 2-D hexagonal OMCs was investigated by using cyclic voltametry and electrochemical impedance spectroscopy. In addition, transmission electron microscopy, small-angle X-ray diffraction, and nitrogen cryosorption methods were used to study the pore structure variations of these two OMCs. It was found that, for the OMC with defective pore channels ( termed as pore packing defects), the gravimetric capacitance was greatly decayed when the voltage scan rate was increased. The experimental results suggest that, for the ion diffusion in 2-D hexagonal OMCs with similar mesopore size distribution, the pore packing defect is a dominant dynamic factor.

Determinants of visual 2-D echo assessment of left ventricular wall motion: Comparison with myocardial thickening on cardiac magnetic resonance imaging

Background: left ventricular wall motion on 2d echo (2de) is usually scored visually. we sought to examine the determinants of visually assessed wall motion scoring on 2de by comparison with myocardial thickening quantified on MRI. Methods: using a 16 segment model, we studied 287 segments in 30 patients aged 61+/ -11 years (6 female), with ischaemic LV dysfunction (defined by at least 2 segments dysfunctional on 2de). 2de was performed in 5 views and wall motion scores (WMS) assigned: 1 (normal) 103 segments, 2 (hypokinetic) 93 segments, 3 (akinetic) 87 segments. MRI was used to measure end systolic wall thickness (ESWT), end diastolic wall thickness (EDWT) and percentage systolic wall thickening (SWT%) in the plane of the 2de and to assess WMS in the same planes visually. No patient had a clinical ischemic event between the tests. Results: visual assessment of wall motion by 2de and MRI showed moderate agreement (kappa = 0.425). Resting 2de wall motion correlated significantly (p

Contribuciones sobre métodos óptimos y subóptimos de aproximaciones poligonales de curvas 2-D

Esta tesis versa sobre el an álisis de la forma de objetos 2D. En visión articial existen numerosos aspectos de los que se pueden extraer información. Uno de los más usados es la forma o el contorno de esos objetos. Esta característica visual de los objetos nos permite, mediante el procesamiento adecuado, extraer información de los objetos, analizar escenas, etc. No obstante el contorno o silueta de los objetos contiene información redundante. Este exceso de datos que no aporta nuevo conocimiento debe ser eliminado, con el objeto de agilizar el procesamiento posterior o de minimizar el tamaño de la representación de ese contorno, para su almacenamiento o transmisión. Esta reducción de datos debe realizarse sin que se produzca una pérdida de información importante para representación del contorno original. Se puede obtener una versión reducida de un contorno eliminando puntos intermedios y uniendo los puntos restantes mediante segmentos. Esta representación reducida de un contorno se conoce como aproximación poligonal. Estas aproximaciones poligonales de contornos representan, por tanto, una versión comprimida de la información original. El principal uso de las mismas es la reducción del volumen de información necesario para representar el contorno de un objeto. No obstante, en los últimos años estas aproximaciones han sido usadas para el reconocimiento de objetos. Para ello los algoritmos de aproximaci ón poligonal se han usado directamente para la extracci ón de los vectores de caracter ísticas empleados en la fase de aprendizaje. Las contribuciones realizadas por tanto en esta tesis se han centrado en diversos aspectos de las aproximaciones poligonales. En la primera contribución se han mejorado varios algoritmos de aproximaciones poligonales, mediante el uso de una fase de preprocesado que acelera estos algoritmos permitiendo incluso mejorar la calidad de las soluciones en un menor tiempo. En la segunda contribución se ha propuesto un nuevo algoritmo de aproximaciones poligonales que obtiene soluciones optimas en un menor espacio de tiempo que el resto de métodos que aparecen en la literatura. En la tercera contribución se ha propuesto un algoritmo de aproximaciones que es capaz de obtener la solución óptima en pocas iteraciones en la mayor parte de los casos. Por último, se ha propuesto una versi ón mejorada del algoritmo óptimo para obtener aproximaciones poligonales que soluciona otro problema de optimización alternativo.

2 D game ediror on-line : A edição de videojogos em contexto web

Descreve-se, no presente trabalho, os esforços envidados no sentido de criar uma solução informática generalista, para os problemas mais recorrentes do processo de produção de videojogos 20, baseados em sprites, a correr em plataformas móveis. O sistema desenvolvido é uma aplicação web que está inserida no paradigma cloud­computing, usufruindo, portanto, de todas as vantagens em termos de acessibilidade, segurança da informação e manutenção que este paradigma oferece actualmente. Além das questões funcionais, a aplicação é ainda explorada do ponto de vista da arquitetura da implementação, com vista a garantir um sistema com implementação escalável, adaptável e de fácil manutenção. Propõe-se ainda um algoritmo que foi desenvolvido para resolver o problema de obter uma distribuição espacial otimizada de várias áreas retangulares, sem sobreposições nem restrições a nível das dimensões, quer do arranjo final, quer das áreas arranjadas. ABSTRACT: This document describes the efforts taken to create a generic computing solution for the most recurrent problems found in the production of two dimensional, sprite­based videogames, running on mobile platforms. The developed system is a web application that fits within the scope of the recent cloud-computing paradigm and, therefore, enjoys all of its advantages in terms of data safety, accessibility and application maintainability. In addition, to the functional issues, the system is also studied in terms of its internal software architecture, since it was planned and implemented in the perspective of attaining an easy to maintain application, that is both scalable and adaptable. Furthermore, it is also proposed an algorithm that aims to find an optimized solution to the space distribution problem of several rectangular areas, with no overlapping and no dimensinal restrictions, neither on the final arrangement nor on the arranged areas.

Spectral Splitting of Purely Magnetic Schrödinger Operator in 2-d

La tesi ripercorre i procedimenti utilizzati per il calcolo dell'asintotica dello splitting dell'operatore puramente magnetico di Schrödinger nel limite semiclassico (con campo magnetico costante) in un dominio aperto limitato e semplicemente connesso il cui bordo ha simmetria assiale ed esattamente due punti di curvatura massima non degeneri. Il punto di partenza è trovare stime a priori sulle sue autofunzioni, che permettono di dire che sono localizzate esponenzialmente vicino al bordo del dominio in oggetto, grazie a queste stime di riesce a modificare l'operatore in maniera tale che l'asintotica dello splitting rimanga equivalente. Si passa in seguito a coordinate tubulari, quindi si rettifica il borso del dominio, andando però a complicare il potenziale magnetico. Si ottengono nuove stime a priori per le autofunzioni. A questo punto si considera lo stesso operatore differenziale ma su un dominio modificato, in cui viene eliminato uno dei punti di curvatura massima. Per tale operatore si ha uno sviluppo asintotico delle autofunzioni (anche dette soluzioni WKB). Si utilizzano poi strumenti di calcolo pseudo-differenziale per studiare l'operatore nel nuovo dominio, ne si localizza la fase per renderlo limitato ed ottenere così una parametrice (anch'essa limitata) avente un simbolo esplicito. Se ne deducono stime di tipo ellittico che possono essere portate all'operatore senza la fase localizzata aggiungendo dei termini di errore. Grazie queste stime si riesce ad approssimare lo splitting (controllando sempre l'errore) che volevamo calcolare (quello dell'operatore sul dominio con due punti di curvatura massima) tramite le autofunzioni dell'operatore sul dominio con un solo punto di curvatura massima, e per queste autofunzioni abbiamo lo sviluppo asintotico (WKB). Considerando l'ordine principale di questi sviluppi si riesce a calcolare esplicitamente il termine dominante dello splitting, ottenendone così l'asintotica nel limite semiclassico.

On the Error-Free Computation of Fast Cosine Transform

We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without any intermediate number representation conversions. The resulting architecture is very regular and reduces latency by 50% compared to a previous error-free design, with virtually the same hardware cost.

Interaction of zinc(II) with the cyclic octapeptides, cyclo[Ile(Oxn)-D-Val(Thz)](2) and ascidiacyclamide, a cyclic peptide from Lissoclinum patella

The interactions between zinc salts and the naturally occurring cyclic octapeptide ascidiacyclamide in methanol, as well as a synthetic analogue cyclo[Ile(Oxn)-D-Val(Thz)](2), were monitored by H-1 NMR and CD spectroscopy. Three zinc complexes were identified, their relative amounts depending on the nature of the anion (perchlorate, triflate or chloride) and the presence or absence of base. Binding constants for two of the zinc species were calculated from CD or H-1 NMR spectra, [Zn(L - H)](+) (KZn(L-H) = [Zn(L - H)(+)]/[Zn2+][(L - H)(-)] = 10(7 +/- 2) M-1; 95% methanol/5% water, 298.0 K, NEt3/HClO4 buffer 0.04 M) and [ZnLCl](+) (K-ZnCIL = [ZnCIL+]/[Zn2+][Cl-][L] = 10(7.2) (+/-) (0.1) M-2; d(3)-methanol, 301 K).

Unified transform architecture for AVC, AVS, VC-1 and HEVC high-performance codecs

A unified architecture for fast and efficient computation of the set of two-dimensional (2-D) transforms adopted by the most recent state-of-the-art digital video standards is presented in this paper. Contrasting to other designs with similar functionality, the presented architecture is supported on a scalable, modular and completely configurable processing structure. This flexible structure not only allows to easily reconfigure the architecture to support different transform kernels, but it also permits its resizing to efficiently support transforms of different orders (e. g. order-4, order-8, order-16 and order-32). Consequently, not only is it highly suitable to realize high-performance multi-standard transform cores, but it also offers highly efficient implementations of specialized processing structures addressing only a reduced subset of transforms that are used by a specific video standard. The experimental results that were obtained by prototyping several configurations of this processing structure in a Xilinx Virtex-7 FPGA show the superior performance and hardware efficiency levels provided by the proposed unified architecture for the implementation of transform cores for the Advanced Video Coding (AVC), Audio Video coding Standard (AVS), VC-1 and High Efficiency Video Coding (HEVC) standards. In addition, such results also demonstrate the ability of this processing structure to realize multi-standard transform cores supporting all the standards mentioned above and that are capable of processing the 8k Ultra High Definition Television (UHDTV) video format (7,680 x 4,320 at 30 fps) in real time.

Further results on the inverse along an element in semigroups and rings

In this paper, we introduce a new notion in a semigroup $S$ as an extension of Mary's inverse. Let $a,d\in S$. An element $a$ is called left (resp. right) invertible along $d$ if there exists $b\in S$ such that $bad=d$ (resp. $dab=b$) and $b\leq_\mathcal{L}d$ (resp. $b\leq_\mathcal{R}d$). An existence criterion of this type inverse is derived. Moreover, several characterizations of left (right) regularity, left (right) $\pi$-regularity and left (right) $*$-regularity are given in a semigroup. Further, another existence criterion of this type inverse is given by means of a left (right) invertibility of certain elements in a ring. Finally we study the (left, right) inverse along a product in a ring, and, as an application, Mary's inverse along a matrix is expressed.