Masters of Science / Codes Related to and Derived from Hamming Graphs T.R Muthivhi M.Sc thesis, Department of Mathematics, University of Western Cape For integers n; k 1; and k n; the graph 􀀀k n has vertices the 2n vectors of Fn2 and adjacency de ned by two vectors being adjacent if they di er in k coordinate positions. In particular, 􀀀1 n is the classical n-cube, usually denoted by H1(n; 2): This study examines the codes (both binary and p-ary for p an odd prime) of the row span of adjacency and incidence matrices of these graphs. We rst examine codes of the adjacency matrices of the n-cube. These have been considered in [14]. We then consider codes generated by both incidence and adjacency matrices of the Hamming graphs H1(n; 3) [12]. We will also consider codes of the line graphs of the n-cube as in [13]. Further, the automorphism groups of the codes, designs and graphs will be examined, highlighting where there is an interplay. Where possible, suitable permutation decoding sets will be given.

Since 1989, there rose many branches. One of them the company grounds with their work scope as ICT services, ICT trainings and system development. The households had started to use in huge the PCs and round 1992 joined WEB. The companies did start to ask for applications which would have been able to be in connection with the other branch offices and had been looking for such solutions that would have brought the new added value. There had been rising new bank systems, telecommunication, insurance, energy, industrial systems and the like. Today, we are dating 2011 and it is more than 20 year; and the systems are still in use. Therefore it is unavoidable to store all the data to be used further and based on the data to create competitive environment. Every company has got its own department assuring data storage, data analysis and reporting the results to the top management. In past the data was used to process decision streamline, and thus remedy the key branches. Hence a new line of business came up focused on data processing, the new technology standards conception, new storage data types etc. The new fundamental term was formed -- Business Intelligence. The subject of the diploma paper is Business Intelligence Solution in enterprise scoped to the process design, development, data purity and project management in pharmacy. There are mentioned the base components of Business Intelligence Solution, technology and meritorious aspect of design. Integral part of this work is description of pharmacy problematic and project management.

Convex cycles play a role e.g. in the context of product graphs. We introduce convex cycle bases and describe a polynomial-time algorithm that recognizes whether a given graph has a convex cycle basis and provides an explicit construction in the positive case. Relations between convex cycles bases and other types of cycles bases are discussed. In particular we show that if G has a unique minimal cycle bases, this basis is convex. Furthermore, we characterize a class of graphs with convex cycles bases that includes partial cubes and hence median graphs.

Nesse trabalho, foi feito o tratamento e a análise de cubos de dados de 8 núcleos ativos de galáxias próximos, no óptico e no infravermelho. O tratamento e a análise de todos os cubos de dados foram feitos utilizando-se uma série de metodologias específicas, muitas das quais foram desenvolvidas nos últimos anos pelo grupo de trabalho do autor. A análise de todos os cubos de dados foi feita com quatro objetivos principais: análise da fenomenologia geral nos arredores do AGN com a Tomografia PCA; análise das populações estelares, da emissão térmica de poeira e do featureless continuum nos arredores do AGN com uma síntese espectral feita com o software Starlight; análise da cinemática estelar e do gás ao redor do buraco negro central e, em alguns casos, simulação com o objetivo de se determinar a massa do buraco negro; análise dos mecanismos de excitação e ionização do gás ou da emissão de hidrogênio molecular. / In this work, we have treated and analyzed data cubes of 8 nearby active galactic nuclei, in the optical and in the infrared. All data cube treatment and analysis were performed using a series of specific methodologies, many of which were developed in the last few years by the author\'s working group. The analysis of all data cubes was performed with four main objectives: analysis of the general phenomenology of the AGN environment, using PCA Tomography; analysis of the stellar populations, of the thermal emission from dust and of the featureless continuum in the vicinity of the AGN, with a spectral synthesis performed with the Starlight software; analysis of the stellar and gas kinematics around the central black hole and, in some cases, simulations with the purpose of determining the mass of the black hole; analysis of the excitation and ionization mechanisms of the gas or of the emission from molecular hydrogen.

The CUBES (CUbesat x-ray Background Explorer using Scintillators) is a payload on the KTH student satellite MIST (MIniature STudent satellite) to evaluate Silicon Photo-multiplier technology and new scintillators such as GAGG (Gadolinium Aluminium Gallium Garnet, Gd3Al2Ga3O12) for future use in hard X-ray polarisation studies of Gamma-Ray Bursts. CUBES itself is designed to study the MIST in-orbit radiation environment by using a detector which is comprised of a silicon photomultiplier coupled to different scintillator materials. Three of these detectors will be mounted on the payload platform and then coupled to inputs of an Application Specific Integrated Circuit (ASIC) and connected to a Field-programmable Gate Array (FPGA) which will store and send data through the downlink on the MIST satellite to ground. This thesis covers the software development for the FPGA, together with two radiation tests of components and the preparation of these. / CUBES / MIST

The report describes the thesis project with the aim of fusing an arbitrary sequence of stereo measurements into a global 3D representation in real-time. The proposed method involves an octree-based signed distance function for representing the 3D environment, where the geomtric data is fused together using a cumulative weighted update function, and finally rendered by incremental mesh extraction using the marching cubes algorithm. The result of the project was a prototype system, integrated into a real-time stereo reconstruction system, which was evaluated by benchmark tests as well as qualitative comparisons with an older method of overlapping meshes. / <p>Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet</p>

>Magister Scientiae - MSc / For integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors of lF2 and adjacency defined by two vectors being adjacent if they differ in k coordinate positions. In particular, r~is the classical n-cube, usually denoted by Hl (n, 2). This study examines the codes (both binary and p-ary for p an odd prime) of the row span of adjacency and incidence matrices of these graphs. We first examine codes of the adjacency matrices of the n-cube. These have been considered in [14]. We then consider codes generated by both incidence and adjacency matrices of the Hamming graphs Hl(n,3) [12]. We will also consider codes of the line graphs of the n-cube as in [13]. Further, the automorphism groups of the codes, designs and graphs will be examined, highlighting where there is an interplay. Where possible, suitable permutation decoding sets will be given.

In this work, we present off-chip communications architectures for line cards to increase the throughput of the currently used memory system. In recent years there is a significant increase in memory bandwidth demand on line cards as a result of higher line rates, an increase in deep packet inspection operations and an unstoppable expansion in lookup tables. As line-rate data and NPU processing power increase, memory access time becomes the main system bottleneck during data store/retrieve operations. The growing demand for memory bandwidth contrasts the notion of indirect interconnect methodologies. Moreover, solutions to the memory bandwidth bottleneck are limited by physical constraints such as area and NPU I/O pins. Therefore, indirect interconnects are replaced with direct, packet-based networks such as mesh, torus or k-ary n-cubes. We investigate multiple k-ary n-cube based interconnects and propose two variations of 2-ary 3-cube interconnect called the 3D-bus and 3D-mesh. All of the k-ary n-cube interconnects include multiple, highly efficient techniques to route, switch, and control packet flows in order to minimize congestion spots and packet loss. We explore the tradeoffs between implementation constraints and performance. We also developed an event-driven, interconnect simulation framework to evaluate the performance of packet-based off-chip k-ary n-cube interconnect architectures for line cards. The simulator uses the state-of-the-art software design techniques to provide the user with a flexible yet robust tool, that can emulate multiple interconnect architectures under non-uniform traffic patterns. Moreover, the simulator offers the user with full control over network parameters, performance enhancing features and simulation time frames that make the platform as identical as possible to the real line card physical and functional properties. By using our network simulator, we reveal the best processor-memory configuration, out of multiple configurations, that achieves optimal performance. Moreover, we explore how network enhancement techniques such as virtual channels and sub-channeling improve network latency and throughput. Our performance results show that k-ary n-cube topologies, and especially our modified version of 2-ary 3-cube interconnect - the 3D-mesh, significantly outperform existing line card interconnects and are able to sustain higher traffic loads. The flow control mechanism proved to extensively reduce hot-spots, load-balance areas of high traffic rate and achieve low transmission failure rate. Moreover, it can scale to adopt more memories and/or processors and as a result to increase the line card's processing power.

Detta arbete undersöker om de existerande algoritmerna Marching cubes och Perlin noise kan användas för att procedurellt generera terräng. Implementationen av dessa algoritmer genererar en terräng som representeras som en tredimensionell volym, för att lösa problem som kan uppkomma när terrängen representeras av ett tvådimensionellt höjdfält. Vidare parallelliseras kombinationen av dessa algoritmer och anpassas för körning på GPU, där experiment visade att parallelliseringen gav prestandaökning och således kortare genereringstider. / <p>Det finns övrigt digitalt material (t.ex. film-, bild- eller ljudfiler) eller modeller/artefakter tillhörande examensarbetet som ska skickas till arkivet.</p><p>There are other digital material (eg film, image or audio files) or models/artifacts that belongs to the thesis and need to be archived.</p>

In order to aid federal agencies and private companies in the ever-growing problem of invasive species target detection, an investigation has been done on classification accuracy data cubes for use in the determination of spectral, spatial, and temporal sensor resolution requirements. The data cube is the result of a developed automated target recognition system that begins with ?ideal? hyperspectral data, and then reduces and combines spectral and spatial resolutions. The reduced data is subjected to testing methods using the Best Spectral Bands (BSB) and the All Spectral Bands (ASB) approaches and classification methods using nearest mean (NM), nearest neighbor (NN), and maximum likelihood (ML) classifiers. The effectiveness of the system is tested via two target-nontarget case studies, namely, terrestrial Cogongrass (Imperata cylindrica)-Johnsongrass (Sorghum halepense), and aquatic Water Hyacinth (Eichhornia crassipes)-American Lotus (Nelumbo lutea). Results reveal the effects, or trade-offs, of spectral-spatial-temporal resolution combinations on the ability of an ATR system to accurately detect the target invasive species. For example, in the aquatic vegetation case study, overall classification accuracies of around 90% or higher can be obtained during the month of August for spectral resolutions of 80 ? 1000nm FWHM for target abundances of 70 ? 100% per pixel. Furthermore, the ATR system demonstrates the use of resolution cubes that can be readily used to design or select cost-effective sensors for use in invasive species target detection, since lower resolution combinations may be acceptable in order to gain satisfactory classification accuracy results.