CIS142_5

Can you explain this?   What are the correct explanations for pooling layers? (Multiple Answers Possible)   A. An average pooling layer is differentiable since it is a linear operation. B. A max pooling layer has strictly fewer learnable parameters than a convolutional layer. C. A max pooling layer can be used between convolutional layers without breaking the computation graph. D. A pooling layer must include a non-linear activation function.

-With respect to the performance model, it should be implemented efficiently. Your answer Ring the network in a ring topology comes back around to the first node, creating a complete circuit. to a bus network, rings have nodes daisy chained, but the end of Your answer ----This part includes defining the problem, designing the corresponding model, and devising a set of experiments for the formulated simulation model.

Explain the concept of Path Adjacency Matrix in details? at least 2 pages

Find a balanced incomplete block design (BIBD) satisfying the values v=5, k=2, and h=1. Find b, the number of blocks, and r, the number of blocks on each variety. Explain why there is a BIBD for any value of v>2 with k=2 and h=1. Give formulas for b and r in terms of v.

Wireless sensor networks (WSNs) are an example of a network that may facilitate communication. Sensing nodes in WSNs communicate with one another and a central hub. The computing resources and storage space of a sensor node are limited. Think of an algorithm that can be solved by separating it into smaller chunks. To solve these subproblems at separate sensor nodes, would you prefer use divide and conquer or dynamic programming? Please be brief in your writing.

Describe the particular tasks required by software requirements. To illustrate, let's look at the Mask R-CNN.

Exercise 2: We have two lists of the same length representing sensors data. The second sensor is supposed to be redundant, so that the two lists should have identical values. But for practical reason there are going to be small differences. In order to evaluate the quality of data collected with our sensors, we want to calculate the total absolute values of differences between the values. For instance: Sensor 1 reading: Sensor 2 reading: 15, -4, 56, 10, -23 14, -9, 56, 14, -23 1, Differences: 5, 0, 4, The total absolute differences is 1+5+0+4+0 = 10 Write a python program that takes two lists of values and computes the total absolute values of differences between the values

The OSI model, on the other hand, says that there should be a certain number of layers, but most real computer systems don't follow this rule. The way computer systems work at their core is what has led to the current situation. If you can, try making the product with less pieces. How would it be bad to cut down on the total number of layers?

SIMULINK Implementation 1. Using SIMU LINK, set up the negative feedback system of (6) above. Plot on one graph the error signal of the system for an input of 5u(t) and K = 50,500, 1000, and 5000. Repeut for inputs of 5tu(t) and 5t²u(t). Use simulation time not less than 50 seconds for all the simulations 2. Using SIMULINK, set up the negative feedback system of (7) above. Plot on one graph the error signal of the system for an input of Su(t) and K = 50,500, 1000, and 5000. Repeat for inputs of 5tu(t) and 5tu(t). Use simulation time not less than 50 seconds for all the simulations 3. Using Simulink, set up the negative feedback system of (8) above. Plot on one graph the error signal of the system for an input of 5u(t) and K = 200, 400,800, and 1000. Repeat for inputs of 5tu(t) and 5t²u(t). Use simulation time not less than 50 seconds for all the simulations Postlab 1. Use your plots from Labs I and compare the expected steady-state errors to those calculated in the Prelab. Explain the…

The term "communication network" may also refer to WSNs. Nodes in a WSN collect data from sensors and relay it to other nodes and a central hub. The computing resources and storage space of a sensor node are limited. Let's think about an algorithm that can be decomposed into simpler issues. To solve these subproblems at separate sensor nodes, would you prefer use divide and conquer or dynamic programming? Use succinct language.

AP7.10 A feedback system is shown in Figure AP7.10. Sketch the root locus as K varies when K> 0. Deter- mine a value for K that will provide a step response with an overshoot less than 5% and a settling time (with a 2% criterion) less than 2.5 seconds. 10 R(s) Y(s) (s + 2)(s + 5) K s + K FIGURE AP7.10 A nonunity feedback control system. +

On the other hand, the majority of computer systems do not use as many layers as the OSI model implies they should. If it's at all feasible, try to cut down on the number of layers. Is there a drawback to using a lower number of layers?

Subject: Operating Systems

1),. Given the following descriptions of FSA, please answer the following questions. Q = {90, 91, 92, 93} I = {a,b} A = {91,92} The transition function is defined below: 8(90, a) = 91 8(92, a) = 92 a. Draw a diagram of this FSA. b. Give a state transition table of this FSA. 8(90, b) = 93 8(92, b) = 93 8(9₁, a) = 91 8(93, a) = 92 8(91, b) = 92 8(93, b) = 93

There are many sensors on a wind turbine, based on each sensor's reading many alerts are generated as (start, end). For easier monitoring, our customer is asking to raise alerts on the turbine level instead of on each sensor. If any sensor is having an alert, there should be an alert for the entire wind turbine. Suppose the alerts created with two sensors readings are [(0,3),(5,10),(1,4),(10,15)], then the turbine level alert should be [(0,4),(5,15)]. Return the alerts sorted by the start timestamp. If there is no alert from the sensor level, return an empty array []. Code needs to be in Python?

Wireless sensor networks are a type of communication network. In WSNs, sensor nodes are responsible for relaying information to and from other nodes and a central base station. Typically, a sensor node has limited resources, such as processing speed and storage space. Take a algorithm that can be decomposed into simpler issues. To solve these subproblems at separate sensor nodes, would you rather use divide and conquer or dynamic programming? Use succinct language.

The following are the three most important aspects of every functional network:Let's break them down and examine them separately.

The following are the three most important aspects of every functional network: Let's break them down and examine them separately.

A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.

Consider a demand-paging system with a paging disk that has an average access and transfer time of 25 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 75 percent of the accesses are in the associative memory and that, of those remaining, 10 percent (or 2.5 percent of the total) cause page faults. What is the effective memory access time?