Urgent !!!! answer in descriptive Demonstrate the particle swarm optimization for the following problem:Divide the N students into the K groups based on their marks in Al such that diversity in each group isminimized.For demonstration, you need to consider the followings:a. N=6 and K-2, set of marks={10,5,1,-3,-4,-1}b. Number of iterations: 2c. Initial set of particles: [10 -1], [5 1], [-4 -3]d. C1=2, C2=2, rand()=1e. Permissible range of velocity is -10 to +10

Particle Swarm Optimization (PSO) is a powerful meta-heuristic optimization algorithm. This…

Demonstrate the particle swarm optimization for the Divide the N students into the K groups based on th minimized. For demonstration, you need to consider the follow 1. N=6 and K-2, set of marks={10,5,1,-3,-4,-1} - Number of iterations: 2 Initial set of particles: [10 -1], [51], [-4 -3] C1=2, C2=2, rand()=1

Demonstrate the particle swarm optimization for the Divide the N students into the K groups based on th minimized. For demonstration, you need to consider the follow 1. N=6 and K-2, set of marks={10,5,1,-3,-4,-1} - Number of iterations: 2 Initial set of particles: [10 -1], [51], [-4 -3] C1=2, C2=2, rand()=1

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

You are given a N*N maze with a rat placed at maze[0][0]. Find whether any path exist that rat can follow to reach its destination i.e. maze[N-1][N-1]. Rat can move in any direction ( left, right, up and down).Value of every cell in the maze can either be 0 or 1. Cells with value 0 are blocked means rat cannot enter into those cells and those with value 1 are open.Input FormatLine 1: Integer NNext N Lines: Each line will contain ith row elements (separated by space)Output Format :The output line contains true if any path exists for the rat to reach its destination otherwise print false.Sample Input 1 :31 0 11 0 11 1 1Sample Output 1 :trueSample Input 2 :31 0 11 0 10 1 1Sample Output 2 : false Solution: //// public class Solution { public static boolean ratInAMaze(int maze[][]){ int n = maze.length; int path[][] = new int[n][n]; return solveMaze(maze, 0, 0, path); } public static boolean solveMaze(int[][] maze, int i, int j, int[][] path) {//…
Suppose a candidate solution p, where p is a phenotype consisting of 4 vertices. Suppose that minimum fitness occurs when no pair of vertices in p are connected, and maximum fitness occurs when all pairs of vertices in p are connected. Write a pseudocode on how to calculate the fitness F of p.
You are organizing a conference that has received n submitted papers. Your goal is to get people to review as many of them as possible. To do this, you have enlisted the help of k reviewers. Each reviewer i has a cost sij for writing a review for paper j. The strategy of each reviewer i is to select a subset of papers to write a review for. They can select any subset S; C {1,2, ..., n}, as long as the total cost to write all reviews is less than T (the time before the deadline): 2 Sij 1. (b) Show that for B = 2 this fraction is close to 1/3. [Hint: You can consider an instance with 3n + 1 papers and only n will be reviewed.]
A certain cat shelter has devised a novel way of making prospective adopters choose their new pet. To remove pet owners’ biases regarding breed, age, or looks, they are led blindfolded into a room containing all the cats up for adoption and must bring home whichever they pick up. Suppose you are trying to adopt two cats, and the shelter contains a total of N cats in one of only two colors: black or orange. is it still possible to pick up two black cats with probability ½, given that there is an even number of orange cats in the room? If so, how many cats should be in the room? How many black, how many orange?
Generate 100 synthetic data points (x,y) as follows: x is uniform over [0,1]10 and y = P10 i=1 i ∗ xi + 0.1 ∗ N(0,1) where N(0,1) is the standard normal distribution. Implement full gradient descent and stochastic gradient descent, and test them on linear regression over the synthetic data points. Subject: Python Programming
Imagine there are N teams competing in a tournament, and that each team plays each of the other teams once. If a tournament were to take place, it should be demonstrated (using an example) that every team would lose to at least one other team in the tournament.
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
Let L={(a, b)|a, b∈Z,(a−b) mod 4 = 0}. We want to program a robot that can get to each point (x, y)∈L starting at (0,0). (a)Give an inductive definition of L. This will describe the steps you want the robot to take to get to points in L starting at (0,0). Let L′ be the set obtained by your inductive definition. (b)Prove inductively that L′⊆L, i.e., every point that the robot can get to is in L. (c)Prove that L⊆L′, i.e., the robot can get to every point in L. To prove this, you need to give the path the robot would take to get to every point in L from (0,0), following the steps defined by your inductive rules.
The method is based on a population consisting of n vectors6 x0(k), . . . , xn(k), kis the generation/iteration of a method. In this section then notation x(i) is the ithelement of vector x.The basic method depends on the following parameters• n—size of the population,• d—size of the xi vector,• C R ∈ [0, 1]—crossover probability,• F ∈ [0, 2]—mutation scale factor, also called differential weight.In each iteration a new population is generated in Which way for eachmember of population x.
please try to simulate the probability of rolling a Die with Sample Space* S={1,2,3,4,5,6} and the probability of each sample point has a 1/6 chance of occurring, i.e., you need to verify that your simulation converges to 1/6 when you select one point of sample space. When X is a random variable for sample point of rolling a Die, Pr(X<=4)=2/3. Please verify this result by simulation. Please let me know how to make an Excel file as stated above.
We have N jobs and N workers to do these jobs. It is known at what cost each worker will do each job (as a positive numerical value). We want to assign jobs to workers in such a way that the total cost of completion of all jobs is minimal among other possible alternative assignments. For this problem, write the algorithm as pseudocode, whose input is a matrix representing worker/job costs, and the output is a list of tuples showing which work will be done by which worker, and that tries to reach the solution with GREEDY technique. Explain in what sense your algorithm exhibits greedy behavior. What is the time complexity of your algorithm? Interpret if your algorithm always produces the best (optimum) result for each instance of the problem.
7. For n 2 1, in how many out of the n! permutations T = (T(1), 7(2),..., 7 (n)) of the numbers {1, 2, ..., n} the value of 7(i) is either i – 1, or i, or i +1 for all 1 < i < n? Example: The permutation (21354) follows the rules while the permutation (21534) does not because 7(3) = 5. Hint: Find the answer for small n by checking all the permutations and then find the recursive formula depending on the possible values for 1(n).