Q8.1 In MATLAB, implement the cellular automaton simulation where configurations 001, 011, 100 and 110 give rise to a live cell at the next step. Use 521 cells and take 255 steps. Set the initial states to be zero, except for a single 1 in the middle (i.e. at column 260). Use either "dead cell" or "wrap around" boundary conditions. Provide the final state of the simulation as your answer. It will be a single row with 521 columns. Just copy and paste this single row as your answer A1_final. If you've called your simulation array A in MATLAB, then the command disp(num2str(A(end, :))) will give you the last row in ready-to-paste form (but remember the square brackets when you enter it). By the way, be sure to visualise the full array in MATLAB - it's a picture of a very famous fractal!

Q8.1 In MATLAB, implement the cellular automaton simulation where configurations 001, 011, 100 and 110 give rise to a live cell at the next step. Use 521 cells and take 255 steps. Set the initial states to be zero, except for a single 1 in the middle (i.e. at column 260). Use either "dead cell" or "wrap around" boundary conditions. Provide the final state of the simulation as your answer. It will be a single row with 521 columns. Just copy and paste this single row as your answer A1_final. If you've called your simulation array A in MATLAB, then the command disp(num2str(A(end, :))) will give you the last row in ready-to-paste form (but remember the square brackets when you enter it). By the way, be sure to visualise the full array in MATLAB - it's a picture of a very famous fractal!

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In the famous dining philosophers problem, a bunch of philosophers aresitting around a circular table with one chopstick between each of them. A philosopher needsboth chopsticks to eat, and always picks up the left chopstick before the right one. A deadlockcould potentially occur if all the philosophers reached for the left chopstick at the same time. Usingthreads and locks, implement a simulation of the dining philosophers problem that prevents deadlocks.
write a java program that outputs a walk, trail, path, closed walk, circuit, and cycle of a given directed graph matrix. That matrix is to be hard coded as such... There are 4 vertices in this directed graph. We know that because there are 4 rows and 4 columns. If there is a 1 that means that the vertex on the left (you need to name them) has an arrow edge towards the vertex on the top. If there is a 2 that means there are two directed edges in the same direction going from the left vertex to the vertex on the top. If there is a 0 that means there are no edges from the vertex on the left to the top vertex. 1 2 2 1 2 1 2 1 2 2 1 2 1 1 1 0 - Make sure to program the matrix in to your code. - Output an example of each, make sure they are labeled. (6 outputs ) Example of a directed graph matrix below. The red numbers around the matrix are the vertices. If there is a 0 it means there is no edge from the vertex on the right to the vertex on the top.
There are m towns in a straight line, with a road joining each pair of consecutive towns. Legends say that an ordinary person in one of these towns will become a hero by completing a sequence of n quests. The first quest will be completed in their home town, but after each quest they may complete their next quest either in the same town or after moving to a neighbouring town.For example, if n = 5 and m = 4, a resident of town 2 may become a hero as follows:• begin in town 2 for quest 1,• then move to town 3 for quest 2,• stay in town 3 for quest 3,• return to town 2 for quest 4, and• move to town 1 for quest 5.Design an algorithm which runs in O(nm) time and finds the total number of waysto complete n quests.
Write a script (Python) for least squares l2 that can receive either: a 2D point cloud. Let the program load an ASCII txt file with the data in two columns, as appropriate. The number of points is arbitrary. In addition, display a graph with the cloud of points and the approximate line, together with the error made.
Question5: Write a python program to train neural network to classify two clusters in a 2-dimensional space for implementing XOR, where the weight is -0.50 and x>-0.5. Also name the class by your name
Suppose that you want to implement an algorithm that will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. What advantage would this algorithm have over Minimax? (if none, Justify).
In the cellular automata, some cells are filled while others are empty. Assume having a Boolean array of values corresponding to filled and empty cells, develop a Java code segment to plot the updated cellular automata assuming cell width and height is c, and the number of cells per row is n and the number of cells per column is n. solve it using Java2d and implement thread or timer in solution
Implement Velocity Verlet • Bouncing test: Simulate two particles starting from some distance approaching each other with some speed. Plot x(t), v(t), V(t), K(t) and H(t). Are they bouncing? Is H conserved? • Find the longest ∆t that conserves H to high precision in the bouncing test . I want simulation in python
Draw this scenario on a piece of paper and answer what is required on the next items, upload an image of your graph here. A system has three processes (P1, P2, P3) and three reusable resources (R1, R2, R3). There is one instance of R1, two instances of R2 and three instances of R3. P1 holds an R1 and an R3 and is requesting an R2. P2 holds an R3 and is requesting an R1 and an R2. P3 holds two R2 and an R3 and is requesting an R1. (rating in this item will be manually encoded by the instructor upon checking)
Computer Science Please finish the template that i provide. #includeclass Nurikabe{public:/*n is the size of the Nurikabe, n >= 5, n <= 20game is the result from some playerhere is one examplen: 5game = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };W represent wall*/Nurikabe(char game[20][20], int n){}/*return 1 if result fit the rule.return 0 if result not fit the rule.*/int isCorrect(){}private://請設計你自己的資料結構來儲存遊戲的結果//Please design your own data structure to keet the result};int main() {int n, j, l, k;char game[20][20] = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };std::cin>>n;for(j = 0;j < n;j ++)for(k = 0;k < n;k ++)std::cin>>game[j][k];Nurikabe *a = new Nurikabe(game, n);std::cout<iscorrect();return 0;}
The language for coding must be in python Neural Network Units Implement a single sigmoid neural network unit with weights of [-1.2, -1.1, 3.3, -2.1] Calculate the outputs for two training examples:Example 1: [0.9, 10.0, 3.1, 1]Example 2: [0.9, 2.1, 3.7, 1] Note that you don't have to explicitly include a threshold or bias since the examples include a last element of 1 which means that the last weight effectively operates as a threshold. Assuming that a sigmoid unit response >0.5 denotes a positive class and <0.5 is negative class, is example 1 positive or negative? is example 2 positive or negative? Create a single ReLU unit and provide the outputs for those examples. Calculate the derivative of the sigmoid with respect to net input for both examples Calculate the derivative of the ReLU with respect to net input for both examples
Implement the __getitem__ method to work with positive and negative indices. For example: > W = L1(Node(10, Node(20, Node(30)))) > print W [ 10, 20, 30 ] > print W[0], W[1], W[2] > print W[-1], W[-2], W[-3] 10 20 30 30 20 10 Be aware of cases where the index exceeds the size of the list, either positive or negative. In these cases you have to generate an assertion error. In the above example, W[3] and W[-4] should raise an AssertionError Complete the Code: class L(object): def __init__ (self, first_node=None): assert first_node is None or isinstance(first_node,Node), "first must be Node, not %s"%(type(first_node)) self.first_node = first_node def __len__(self): k = self.first_node if k is None: return 0 i=1 while k.next is not None: i+=1 k = k.next return i def __repr__ (self): if self.first_node is None:…