<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel rdf:about="http://hdl.handle.net/10464/2881">
<title>M.Sc. Computer Science</title>
<link>http://hdl.handle.net/10464/2881</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/10464/3961"/>
<rdf:li rdf:resource="http://hdl.handle.net/10464/3958"/>
<rdf:li rdf:resource="http://hdl.handle.net/10464/3957"/>
<rdf:li rdf:resource="http://hdl.handle.net/10464/3409"/>
</rdf:Seq>
</items>
<dc:date>2013-06-20T03:27:32Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/10464/3961">
<title>Automatic evolution of conceptual building architectures</title>
<link>http://hdl.handle.net/10464/3961</link>
<description>Automatic evolution of conceptual building architectures
Coia, Corrado
This thesis describes research in which genetic programming is used to automatically&#13;
evolve shape grammars that construct three dimensional models&#13;
of possible external building architectures. A completely automated fitness&#13;
function is used, which evaluates the three dimensional building models according&#13;
to different geometric properties such as surface normals, height,&#13;
building footprint, and more. In order to evaluate the buildings on the different&#13;
criteria, a multi-objective fitness function is used. The results obtained&#13;
from the automated system were successful in satisfying the multiple&#13;
objective criteria as well as creating interesting and unique designs that&#13;
a human-aided system might not discover. In this study of evolutionary&#13;
design, the architectures created are not meant to be fully functional and&#13;
structurally sound blueprints for constructing a building, but are meant to&#13;
be inspirational ideas for possible architectural designs. The evolved models&#13;
are applicable for today's architectural industries as well as in the video&#13;
game and movie industries. Many new avenues for future work have also&#13;
been discovered and highlighted.
</description>
<dc:date>2012-04-03T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10464/3958">
<title>Formalizing affordances in situation</title>
<link>http://hdl.handle.net/10464/3958</link>
<description>Formalizing affordances in situation
Lenarcic, Adam
The representation of a perceptual scene by a computer is usually limited&#13;
to numbers representing dimensions and colours. The theory of affordances&#13;
attempted to provide a new way of representing an environment, with respect&#13;
to a particular agent. The view was introduced as part of an entire field of&#13;
psychology labeled as 'ecological,' which has since branched into computer&#13;
science through the field of robotics, and formal methods. This thesis will&#13;
describe the concept of affordances, review several existing formalizations,&#13;
and take a brief look at applications to robotics. The formalizations put&#13;
forth in the last 20 years have no agreed upon structure, only that both&#13;
the agent and the environment must be taken in relation to one another.&#13;
Situation theory has also been evolving since its inception in 1983 by Barwise&#13;
&amp; Perry. The theory provided a formal way to represent any arbitrary piece&#13;
of information in terms of relations. This thesis will take a toy version of&#13;
situation theory published in CSLI lecture notes no. 22, and add to the given&#13;
ontologies. This thesis extends the given ontologies to include specialized&#13;
affordance types, and individual object types. This allows for the definition&#13;
of semantic objects called environments, which support a situation and a set&#13;
of affordances, and niches which refer to a set of actions for an individual.&#13;
Finally, a possible way for an environment to change into a new environment&#13;
is suggested via the activation of an affordance.
</description>
<dc:date>2012-04-03T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10464/3957">
<title>Comparison of classification ability of hyperball algorithms to neural network and k-nearest neighbour algorithms</title>
<link>http://hdl.handle.net/10464/3957</link>
<description>Comparison of classification ability of hyperball algorithms to neural network and k-nearest neighbour algorithms
Zibamanzar-Mofrad, Tanaby
The main focus of this thesis is to evaluate and compare Hyperbalilearning&#13;
algorithm (HBL) to other learning algorithms. In this work HBL is&#13;
compared to feed forward artificial neural networks using back propagation&#13;
learning, K-nearest neighbor and 103 algorithms.&#13;
In order to evaluate the similarity of these algorithms, we carried out&#13;
three experiments using nine benchmark data sets from UCI machine&#13;
learning repository. The first experiment compares HBL to other algorithms&#13;
when sample size of dataset is changing. The second experiment&#13;
compares HBL to other algorithms when dimensionality of data changes.&#13;
The last experiment compares HBL to other algorithms according to the&#13;
level of agreement to data target values.&#13;
Our observations in general showed, considering classification accuracy&#13;
as a measure, HBL is performing as good as most ANn variants.&#13;
Additionally, we also deduced that HBL.:s classification accuracy outperforms&#13;
103's and K-nearest neighbour's for the selected data sets.
</description>
<dc:date>2012-04-03T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/10464/3409">
<title>Evolution of architectural floor plans</title>
<link>http://hdl.handle.net/10464/3409</link>
<description>Evolution of architectural floor plans
Flack, Robert W. J.
Layout  planning is  a  process  of sizing  and  placing  rooms  (e.g.  in  a  house) &#13;
while  a t t empt ing  to  optimize  various  criteria.  Often  the r e   are  conflicting &#13;
c r i t e r i a  such  as  construction  cost,  minimizing the   distance  between  r e l a t ed &#13;
activities,  and meeting the   area  requirements  for  these  activities.  The  process  of layout  planning  ha s   mostly  been  done  by  hand,   wi th  a  handful   of &#13;
a t t empt s  to  automa t e  the  process.  Thi s  thesis  explores  some  of these  pa s t  &#13;
a t t empt s   and  describes  several  new  techniques  for  automa t ing  the   layout &#13;
planning process  using evolutionary computation.  These techniques  a r e  inspired by the  existing methods, while  adding some of the i r  own innovations. &#13;
Additional experimenLs are done to t e s t  the  possibility  of allowing polygonal &#13;
exteriors wi th  rectilinear interior  walls.  Several  multi-objective  approaches &#13;
are  used to  evaluate  and  compare  fitness.  The  evolutionary  r epr e s ent a t ion &#13;
and requirements specification used provide great flexibility in problem scope &#13;
and depth and is worthy of considering in future layout and design a t t empt s .  &#13;
The   system  outlined  in  thi s   thesis  is  capable  of  evolving  a  variety  of  floor &#13;
plans  conforming  to  functional  and  geometric  specifications.  Many  of the  &#13;
resulting  plans look  reasonable  even when  compared to  a  professional  floor &#13;
plan.  Additionally polygonal and multi-floor buildings were  also  generated.
</description>
<dc:date>2011-10-13T00:00:00Z</dc:date>
</item>
</rdf:RDF>
