No description available.

Due to the advances of image system, most researches are developed on high-resolution system. However, the low-resolution system have an advantage over the high-resolution system on processing speed, saving space and power consumption. From the research of hexagonal grid, we know that from the view of microcosmic, the angle resolution and connection of hexagonal grid are better than rectangular grid, so images on hexagonal grid also have the better quality. Almost input and output systems of image device are on rectangular grid, so its technology and theory are developed on rectangular grid system. For a displaying system, fonts and images are the main elements. If we want to substitute hexagonal grid system for rectangular grid system, they will be primary factories that we consider. In this research based on rectangular grid system, we will apply the plane parametric curves and fill algorithm on hexagonal grid system, and probe into the displaying method of fonts and images on hexagonal grid system.

Images scaling is a very common capability on rectangular grid. Similarly, its development on hexagonal grid is very fundamental and necessary. In this paper, we developed new techniques to scale digital image with resampling and without resampling. From now on, we haven¡¦t seen any research about color displaying on hexagonal grid. It limited the application of hexagonal grid displaying device. In this paper, we developed a color displaying system on hexagonal grid by using symmetrical triangular frame.

Die Arbeit bildet einen Einstieg in das Themengebiet der prozeduralen Karten Generierung mit Cellular Automata und verweist auf fortführende Möglichkeiten. Es wird gezeigt, wie eine zwei-dimensionale und hexagonale Terrain-Karte für Strategiespiele mit Cellular Automata erzeugt werden kann. Dazu wird eine allgemeine Einführung zu zellulären Automaten gegeben. Zusätzlich werden Fashion-based Cellular Automata und Cellular Automata mit mehreren aktiven Zellen erklärt. Es werden die Anforderungen an eine Karte des Strategie-Genres bestimmt, wobei der Fokus, auf dem durch Civilisation definierten Sub-Genre liegt. Anschließend wird gezeigt, wie die verschiedenen Bestandteile der Karte jeweils mit einem Cellular Automaton generiert werden können. Zu diesen werden Vorteile und Nachteile dargestellt und dabei auf die Performance eingegangen. Es zeigt sich das zelluläre Automaten in der Lage sind eine geeignete Karte zu erzeugen.:1 Einleitung 1.1 Videospiele im Trend 1.2 Produktionsaufwand 1.3 Prozedurale Content Generierung 1.4 Cellular Automata 1.5 Kartengenerierung 1.6 Aufbau der Arbeit 1.7 Verwendete Werkzeuge 2 Hintergrund 2.1 Cellular Automata 2.1.1 Grundsätze 2.1.2 Initiale globale Konfiguration eines CA 2.1.3 CA-Ansätze 2.1.3.1 Lattice Gases 2.1.3.2 CA mit mehreren aktiven Zellen 2.1.3.3 Fashion-based 3 Anforderungsanalyse 3.1 Eingrenzung der Karte 3.2 Betrachtete Spiele 3.3 Analyse der Karten 3.4 Anforderungen 4 Implementierung 4.1 Schichtenmodell 4.1.1 Regionen 4.1.1.1 Ansatz 4.1.1.2 Resultat 4.1.2 Höhenstufen 4.1.2.1 Ansatz 4.1.2.2 Resultat 4.1.3 Flüsse 4.1.3.1 Initiale Konfiguration 4.1.3.2 Flussrichtung 4.1.3.3 Resultat 4.1.4 Ressourcen 4.1.4.1 Wälder 4.1.4.2 Allgemeine Ressourcen 4.1.4.3 Siedlungen 4.1.5 Dynamische Veränderungen 4.1.6 Performance 5 Fazit 5.1 Ausblick 6 Verzeichnisse 6.1 Literaturverzeichnis 6.2 Abbildungsverzeichnis 6.3 Tabellenverzeichnis

Malgré des décennies de recherche sur l’optimisation de boucle auxhaut niveau et leur intégration réussie dans les compilateurs C/C++et FORTRAN, la plupart des systèmes de transformation de bouclene traitent que partiellement les défis posé par la complexité croissanteet la diversité du matériel d’aujourd’hui. L’exploitation de laconnaissance dédiée a un domaine d’application pour obtenir le codeoptimal pour cibles complexes, tels que des accélérateurs ou des microprocessorsmulti-coeur, pose des problèmes pour les formalismeset outils d’optimisation de boucle existants. En conséquence, de nouveauxschémas d’optimisation qui exploitent la connaissance dédiéea un domaine sont développées indépendamment sans profiter dela technologie d’optimisation de boucle existante. Cela conduit à despossiblités d’optimisation raté et ainsi qu’à une faible portabilité deces schémas d’optimisation entre des compilateurs différents. Un domainepour lequel on voit la nécessité d’améliorer les optimisationsest le calcul de pochoir itératifs, un probléme de calcul important quiest réguliérement optimisé par les compilateurs dédiées, mais pourlequel générer code efficace est difficile.Dans ce travail, nous présentons des nouvelles stratégies pour l’optimisationdédiée qui permettent la génération de code GPU haute performancepour des calculs de pochoir. À la différence de la façon dontla plupart des compilateurs existants sont mis en oeuvre, nous découplonsla stratégie d’optimisation de haut niveau de l’optimisationde bas niveau et la spécialisation nécessaire pour obtenir la performanceoptimale. Comme schéma d’optimisation de haut niveau, nousprésentons une nouvelle formulation de “split tiling”, une techniquequi permet la réutilisation de données dans la dimension du tempsainsi que le parallélisme équilibré à gros grain sans la nécessité derecourir à des calculs redondants. Avec le “split tiling”, nous montronscomment intégrer une optimisation dédiée dans un traducteurgénérique source-à-source, C vers CUDA, une approche qui nouspermet de réutiliser des optimisations existants non-dédiées. Nousprésentons ensuite notre technique appelée “hybrid hexagonal / parallelogramtiling", un schéma qui nous permet de générer du codeque cible directement les préoccupations spécifiques aux GPUs. Pourconclure notre travail sur le "loop tiling", nous étudions la rapport entre“diamond tiling” et “hexagonal tiling”. À partir d’une analyse de“diamond tiling” détailée, qui comprend les exigences qu’elle posesur la taille de tuile et les coefficients de front d’onde, nous fournissonsune formulation unifiée de l’“hexagonal tiling” et du “diamondtiling” qui nous permet de réaliser un “hexagonal tiling” pourvdes problèmes avec deux dimensions (un temps, un espace) dans lecadre d’un usage dans un optimiseur générique, comme “Pluto”. Enfin,nous utilisons cette formulation pour évaluer l’“hexagonal tiling”et le “diamond tiling” en terme de rapport de calcul-à-communicationet calcul-à-synchronisation.Dans la deuxième partie de ce travail, nous discutons nos contributionsaux composants de l’infrastructure les plus important, nos“building blocks”, qui nous permettent de découpler notre optimisationde haut niveau tant des optimisations nécessaires dàns la générationde code que de l’infrastructure de compilation générique. Nouscommençons par présenter le nouveau “polyhedral extractor” (pet),qui obtient une représentation polyédrique d’un morceau de code C.pet utilise l’arithmétique de Presburger en sa généralité pour élargirle fragment de code C supporté et porter une attention particulièreà la modélisation de la sémantique des langages même en présencede dépassement de capacité des entiers. / Despite decades of research on high-level loop optimizations and theirsuccessful integration in production C/C++/FORTRAN com- pilers, most compilerinternal loop transformation systems only partially address the challengesposed by the increased complexity and diversity of today’s hardware. Especiallywhen exploiting domain specific knowledge to obtain optimal code for complextargets such as accelerators or many-cores processors, many existing loopoptimization frameworks have difficulties exploiting this hardware. As aresult, new domain specific optimization schemes are developed independentlywithout taking advantage of existing loop optimization technology. This resultsboth in missed optimization opportunities as well as low portability of theseoptimization schemes to different compilers. One area where we see the need forbetter optimizations are iterative stencil computations, an importantcomputational problem that is regularly optimized by specialized, domainspecific compilers, but where generating efficient code is difficult.In this work we present new domain specific optimization strategies that enablethe generation of high-performance GPU code for stencil computations. Differentto how most existing domain specific compilers are implemented, we decouple thehigh-level optimization strategy from the low-level optimization andspecialization necessary to yield optimal performance. As high-leveloptimization scheme we present a new formulation of split tiling, a tilingtechnique that ensures reuse along the time dimension as well as balancedcoarse grained parallelism without the need for redundant computations. Usingsplit tiling we show how to integrate a domain specific optimization into ageneral purpose C-to-CUDA translator, an approach that allows us to reuseexisting non-domain specific optimizations. We then evolve split tiling into ahybrid hexagonal/parallelogram tiling scheme that allows us to generate codethat even better addresses GPU specific concerns. To conclude our work ontiling schemes we investigate the relation between diamond and hexagonaltiling. Starting with a detailed analysis of diamond tiling including therequirements it poses on tile sizes and wavefront coefficients, we provide aunified formulation of hexagonal and diamond tiling which enables us to performhexagonal tiling for two dimensional problems (one time, one space) in thecontext of a general purpose optimizer such as Pluto. Finally, we use thisformulation to evaluate hexagonal and diamond tiling in terms ofcompute-to-communication and compute-to-synchronization ratios.In the second part of this work, we discuss our contributions to importantinfrastructure components, our building blocks, that enviable us to decoupleour high-level optimizations from both the necessary code generationoptimizations as well as the compiler infrastructure we apply the optimizationto. We start with presenting a new polyhedral extractor that obtains apolyhedral representation from a piece of C code, widening the supported C codeto exploit the full generality of Presburger arithmetic and taking special careof modeling language semantics even in the presence of defined integerwrapping. As a next step, we present a new polyhedral AST generation approach,which extends AST generation beyond classical control flow generation byallowing the generation of user provided mappings. Providing a fine-grainedoption mechanism, we give the user fine grained control about AST generatordecisions and add extensive support for specialization e.g., with a newgeneralized form of polyhedral unrolling. To facilitate the implementation ofpolyhedral transformations, we present a new schedule representation, scheduletrees, which proposes to make the inherent tree structure of schedules explicitto simplify the work with complex polyhedral schedules.The last part of this work takes a look at our contributions to low-levelcompilers.

Ba0.5Sr0.5Co0.8Fe0.2O3-delta (BSCF) and SrCo0.48Fe0.12Ti0.4O3-delta (SCFT) were synthesised by co-precipitation. BSCF was pressed and sintered at 1100℃ for 10 hours to pellets (relative density: 93%) from which X-ray diffraction (XRD) revealed single Pm-3m phase (a=3.9782 A). Scanning electron microscopy (SEM) revealed clear equiaxed grains (grain size 33 ± 16 micro metre). The pellets were decomposed in 7 ± 1 % CO2/N2 at 800℃ for 1 to 30 minutes. XRD confirmed secondary phases: R-3mH phase (a=b=5.1397 A, c=9.4847 A) and Fm-3m phase (a=4.2490 A). Electron backscattered diffraction (EBSD) ascribed R-3mH and Fm-3m phases to the surface and part of the cross-section precipitates, respectively as revealed by SEM. Energy dispersive X-ray spectroscopy (EDX) revealed the compositions of R-3mH and Fm-3m phases to be Ba0.65±0.03Sr0.35±0.03CO3 (BSC) and CoO, respectively. Transmission electron microscopy (TEM) and EDX revealed the structure (15R, R3m and R-3mH) and composition (Ba0.20Sr0.10Co0.59Fe0.10Ox) of lamellar precipitates in cross-section, suggesting Ba and Sr diffuse from the lamellae to BSC. A unique orientation relation (BSCF {111} // BSC {0001}) was uncovered by EBSD. TEM revealed high symmetry contact planes of lamellae and BSCF, suggesting nucleation energy governs decomposition. Fresh BSCF pellets were decomposed in N2 at 800℃. Fm-3m and P63/mmc phases were confirmed by XRD and lamellae were observed by SEM, followed by decomposition in 7±1 % N2/CO2 at 800℃. XRD revealed higher weight % of BSC and CoO. SEM revealed BSC preferring lamellae, hence hexagonal phases accelerated BSC formation. BSCF pellets were dip coated in SCFT propan-2-ol suspension (3:10), followed by sintering at 1165℃ for 10 hours. XRD revealed a Pm-3m phase (a=3.885 A) and SEM revealed a grain size of 65 ± 9 micro metre and open porosity of 1.6 ± 1 %. They were annealed in 7 ± 1 % CO2/N2 at 800℃. XRD revealed no secondary phases, suggesting enhanced stability. However, oxygen permeability was reduced (1.2 ml/cm2 to 0.8 ml/cm2) because the coating composition changed to Ba0.20Sr0.27Co0.40Fe0.10Ti0.04Ox; this was revealed by EDX.

To interpret the data from spaceborn lidar measurements, one must have a basic understanding of the backscattering of oriented ice particles. The conventional raytracing method is not applicable to the scattering of light by oriented particles. In this study, the dipole approximation (DDA) method is employed to the scattering of light on oriented hexagonal ice columns and plates with various tilting angles. It is found that the oriented hexagonal ice particles tend to have strong backscattering intensity with low depolarization ratios which are strongly dependant on the tilting angle of oriented particles. The present results show that the e ffect of particle orientation plays an important role in determining the optical properties of ice clouds consisting of horizontally oriented ice crystals.

Pattern recognition is very important in automatic industry. The automation machinery vision system must exchange information very fast with the object we need. So the machinery vision system must have powerful recognition ability. There are more important on image processing, lately. But most researches of image processing are developed on high-resolution image. However, in same situation, for increasing the processing speed, reducing the saving space. Low-resolution image are the only way to achieve the above condition up to now. For the purpose of quickly recognition, we construct the recognition system on low-resolution image. From observing the characteristic of hexagonal grid, we knew the hexagonal grid have greater angular resolution and better image performance than rectangular grid. Therefore, we apply the hexagonal grid on low-resolution image, and using Curve Bend Function (call CBF) on hexagonal gird system; for promoting the accuracy of recognition.We presented an technique of subpixel on low-resolution hexagonal image to obtain better results.

In this paper, hexagonal grid is extended to hierarchical structure. This technique can be applied to collision detection. By using concept of node, we develop an effectually linear decode called ¡§HCD¡¨. To develop to three dimensions, the structure of octahedron is applied to develop hexagonal hierarchical structure in three dimensions. This is helpful to simulate objects and approximate objects. The object¡¦s data is commonly deposited in float. In this paper, Symmetrical Hexagonal Frame makes whole object to be deposited in integer. So the data of object can be compressed to smaller size. Otherwise, by concept of k-dops, we can close to object¡¦s real surfaces with hierarchical hexagonal structures at low level.

The polyglutamate which grafts with flexible alkyl side-chain by ester exchange reaction is like rod-hairy molecule. The numbers of methylene group of side-chain and the graft-density affect the molecular packing of poly(gama-alkyl-L-glutamate)s. To be sure the correct chemical structure of poly(gama-alkyl-L-glutamate)s by Fourier transform infrared spectrometer (FTIR), and find out the graft-density of each sample by proton nuclear resonance spectrometer (1H-NMR). Phase behavior of poly(gama-alkyl-L-glutamate)s were studied via differential scanning calorimetry (DSC) and variable temperature x-ray diffraction (XRD).We combine the results from C. C. Hsu(24). When the side-chain length is long enough (m>10), side-chains will crystallize into a 3D hexagonal lattice. The results of DSC and XRD analyses show that the side-chain crystalline phase will melt at Tm1, where as a liquid crystalline (LC) phase transition exists at Tm2. Poly(gama-alkyl-L-glutamate)s with shorter side-chain (m<8) tend to form 2D hexagonal LC structure. On the other hand, longer side-chains (m>10) tend to give lamellar structure. The critical number of methylene group of side-chain between hexagonal and lamellar structure is between 8 and 10.