Improved data visualisation through nonlinear dissimilarity modelling

Inherent to state-of-the-art dimension reduction algorithms is the assumption that global distances between observations are Euclidean, despite the potential for altogether non-Euclidean data manifolds. We demonstrate that a non-Euclidean manifold chart can be approximated by implementing a universal approximator over a dictionary of dissimilarity measures, building on recent developments in the field. This approach is transferable across domains such that observations can be vectors, distributions, graphs and time series for instance. Our novel dissimilarity learning method is illustrated with four standard visualisation datasets showing the benefits over the linear dissimilarity learning approach

Sparse Distributed Memory

:#7KLV#SDSHU#GLVFXVVHV##KRZ#VRPH#VWDWLVWLFDO#SURSHUWLHV#RI#SDWWHUQ#GDWD#FDQ#DIIHFW# HIILFLHQF\#RI#.DQHUYD#V#6SDUVH#'LVWULEXWHG#0HPRU\##6'0###7KHQ##LW#VXJJHVWV#DQ#PHWKRG# ZKLFK#VKRXOG#LPSURYH#6'0#HIILFLHQF\##7KH#PHWKRG#ORRNV#IRU#RSWLPDO#6'0#SDUDPHWHUV# DFFRUGLQJ#WR#SURSHUWLHV#RI#SDWWHUQ#GDWD##5HVXOWV#RI#VLPSOH#H[SHULPHQW#DUH#LQFOXGHG## Key Words:#6SDUVH#'LVWULEXWHG#0HPRU\##QHXUDO#QHWZRUN##SDWWHUQ#UHFRJQLWLRQ# 1 Introduction 7KH#6'0#ZDV#GHYHORSHG#E\#.DQHUYD#>#@#DQG#LW#PD\#EH#UHJDUGHG#HLWKHU#DV#DQ#H[WHQVLRQ#RI#D# FODVVLFDO#UDQGRP#DFFHVV#PHPRU\##50##RU#DV#D#VSHFLDO#W\SH#RI#WKUHH#OD\HU#IHHGIRUZDUG#QHXUDO# QHWZRUN##7KH#PDLQ#6'0#DOWHUDWLRQV#WR#WKH#50#DUH## . 7KH 6'0 FDOFXODWHV +DPPLQJ GLVWDQFHV EHWZHHQ WKH UHIHUHQFH DGGUHVV DQG HDFK ORFDWLRQ DGGUHVV# )RU HDFK GLVWDQFH ZKLFK LV OHVV RU HTXDO WR WKH JLYHQ UDGLXV WKH FRUUHVSRQGLQJ ORFDWLRQ LV VHOHFWHG# . 7KH RZQ PHPRU\ LV UHSUHVHQWHG E\ m n FRXQWHUV #ZKHUH n LV QXPEHU RI ORFDWLRQV DQG m LV WKH LQSXW GDWD OHQJWK# LQVWHDG RI VLQJOH#EL..

Design Component Contracts: Modeling and

Component-based software development focuses on building large software systems by integrating existing software components. In object-oriented design, expert design experience is packaged as design patterns. Software patterns are a new design paradigm used to solve problems that arise when developing software within a particular context. Patterns capture the static and dynamic structure and collaboration among the components in a software design. A key promise of the pattern-based approach is that it may greatly simplify the construction of software systems out of building blocks and thus reuse experience and reduce cost. However, it also introduces significant problems in ensuring the integrity and reliability of these composed systems because of their complex software topologies, interactions, and transactions. There is a need to capture these features as a contract through a formal model that allows us to analyze pattern-based designs. The objective of this thesis is to define a formal framework for ensuring the integrity of the compositions in object-oriented designs by providing mathematically rigorous modeling and analysis techniques for object-oriented systems comprising pattern-based designs as the basic building blocks or design components