ateolf: (Robert points the bone at you)
[personal profile] ateolf
The University of Memphis
Computer Science
COMP 4/6601 MODELS OF COMPUTATION
HOMEWORK 7
DUE: November 20, 4:00pm

1. Determine the structure Of phase-space of the two neuron net with
identity threshold activation functions and weight matrix
|-1 2 |
| 2 0 |
[You need to partition the state space into three regions F (fixed
points/memories), P (orbits of ALL initial conditions that result in a
periodic orbit of period >), and Q (all other initial conditions that
do not settle anywhere).]
2. Find the H-distance between poligos X={catagggagctg, cagctccctatg}
and Y={tattaccggcgt, acgccggtaata}.
[The H-distance |X,Y| between two poligos X={x,x'} and Y={y,y'} is the
minimum of all Hamming distances between overlaps of x and (left or
right) shifts of y, or their complements x',y'. For example,
|cgtac,gtacg|=0
because they match perfectly as complements (at shift=0). Don't forget that
WC -complemntation requires reversing and exchanging a't's and c-g's.]
3. Find a 12-mer encoding for as large an instance of HamP as you can
subject to the condition that the H-distance between any two vertices
and/or edges is at least 7.
BONUS: If you can increase 7 to a larger lower bound, you get extra credit.
4. Find the solution strands for the instance in Problem 3.
5. Find a set of 20-mer strands that folds into the following three shapes
(uniformly in number) under appropriate hybridization conditions:
```````````___``````````````````````````````````````````````````````````````
``````````/```\`````````````````````-----```````````````````````````````````
`````````/`````\```````````````````/`````\``````````````````````````````````
```------```````------```````------```````------````````-------------------`
```------```````------```````------```````------````````-------------------`
`````````\`````/```````````````````\`````/``````````````````````````````````
````````` \```/`````````````````````-----```````````````````````````````````
```````````---``````````````````````````````````````````````````````````````
[The number of strands is your choice. A multiple of 3 over 15 would be nice.]

EndOfFile

cherry coke rules!

Date: 2001-11-19 10:54 pm (UTC)
From: [identity profile] ethangrim.livejournal.com
I read your posts and question my desire for higher education.

Re: cherry coke rules!

Date: 2001-11-19 11:30 pm (UTC)
From: [identity profile] ateolf.livejournal.com
the problem in the last post was cool...these just suck anus...especially considering how our text doesn't equip us w/ the necessary information on how to do this shit...

Date: 2001-11-19 11:33 pm (UTC)
From: [identity profile] techstep.livejournal.com
this looks less like the homework from a class on computational models (unless you're studying DNA computing) as opposed to a class on computational biology or something similar. except question 1, which has a perverse machine learning flavor to it.

models of computation

Date: 2001-11-19 11:40 pm (UTC)
From: [identity profile] ateolf.livejournal.com
the class progresses, starting w/ the machines and symbolic computation: finite state machines->pushdown automaton->turing machine...then goes to subsymbolic computation: neural networks->molecular computing...my major concern is the overwhelming gap between our text and our assignments...

December 2025

S M T W T F S
  1 2 3 4 5 6
7 8 9 10 11 12 13
14151617181920
21 22 23 24252627
28293031   

Style Credit

Expand Cut Tags

No cut tags
Page generated Dec. 24th, 2025 08:07 pm
Powered by Dreamwidth Studios