Differences

This shows you the differences between two versions of the page.

--- public:t-622-arti-11-1:final_project [2011/04/24 21:13] – angelo
+++ public:t-622-arti-11-1:final_project [2024/04/29 13:33] (current) – external edit 127.0.0.1
@@ Line 7: / Line 7: @@
 	border-width: 3px;
 	border-spacing: 2px;
-	border-style: solid;
+	border-style: none;
 	border-color: black;
 	border-collapse: collapse;
@@ Line 15: / Line 15: @@
 	border-width: 1px;
 	padding: 4px;
-	border-style: solid;
+	border-style: none;
 	border-color: black;
 	background-color: white;
@@ Line 23: / Line 23: @@
 	border-width: 1px;
 	padding: 4px;
-	border-style: solid;
+	border-style: none;
 	border-color: black;
 	background-color: white;
@@ Line 627: / Line 627: @@
 <tr valign="top">
 <td align="center">
-<img src="_media/public:t-622-arti-11-1:arti-s2011-finalproject-winprocessanalysis.jpg" height="200" width="400">
+<img src="_media/public:t-622-arti-11-1:arti-s2011-finalproject-winappsalysis.jpg" height="200" width="400">
 </td>
 <td>
 <b>Title: </b>Ascr: Windows Process Analysis
 <br>
-<b>Author: </b>:Sindri Bjarnason
+<b>Author: </b>Sindri Bjarnason
 <br>
 <b>Abstract:</b>
@@ Line 649: / Line 649: @@
 <li>If successful, execute the training program and attach to its process using the Debug API.
 Attempt to match those patterns in the process memory.
-<ul>
+</ul>
 </p>
 <p>
@@ Line 674: / Line 674: @@
 <li>X86 instruction set (intel): <a href="http://ref.x86asm.net/coder64">http://ref.x86asm.net/coder64">http://ref.x86asm.net/coder64">http://ref.x86asm.net/coder64</a>. A quite comprehensive html resource about the intel instruction set and the decoding process;
 <li>Beaengine: A library for decoding Intel instructions.
-<ol>
+</ol>
 </p>
 <p>
@@ Line 692: / Line 692: @@
 D2, … , Dn }, where Di is a higher-level representation of that sequence. For other sequences with ν
 > 0, we apply the following algorithm:
-•
+<br>
 Let sk be a sequence where ν(sk) > 0 and |sk| > α, α is the largest single instruction. Then we
 have an index Δ, such that sk = { o1, o2, … , oΔ , … , on } => s'k = { o1, o2, … , oΔ } and ν(s'k) = 0,
@@ Line 710: / Line 710: @@
 <br>
 <span onclick="toggle('abstract15', 'project15')" id="project15" style="cursor:pointer;font-weight: bold">[More]</span>
+</td>
+</tr>
+<tr valign="top">
+<td align="center">
+<img src="_media/public:t-622-arti-11-1:arti-s2011-finalproject-contractbridge.jpg" height="200" width="200">
+</td>
+<td>
+<b>Title: </b>STRIPS planning for Contract Bridge bidding
+<br>
+<b>Authors: </b>Árni St. Sigurðsson, Baldur Blöndal, Pétur Ólafur Aðalgeirsson
+<br>
+<b>Abstract:</b>
+<br>
+We want to try using STRIPS-like operators to make descriptive bids for a given bridge hand and bid history.
+<div id="abstract16" style="display:none">
+<p>
+To our knowledge this is a fresh approach to the problem.
+</p>
+<p>
+We managed to implement lazy-evaluation to structure bidding conventions.  We made a robot class that was convention-card-abstract and a convention-card class representing the bid system.  Each bid would carry with it an implication for the cards in hand.  We did not make an inference engine to infer the implication.  We used reflective Python programming heavily.
+</p>
+<p>
+We realized that we should modify the robot to pass the hand *and the bid history* to the convention card functions for evaluation but lacked time to implement such deep surgery.
+</p>
+</div>
+<br>
+<span onclick="toggle('abstract16', 'project16')" id="project16" style="cursor:pointer;font-weight: bold">[More]</span>
 </td>
 </tr>