What realities of nature do source-sink models and landscape models include that basic metapopulation models do not include?

How would lifetime dispersal distance and neighborhood size differ for a plant whose seeds are carried by the wind and a plant whose seeds drop near the parent plant?

Why do most species have their highest densities near the center of their geographic range?

Q4) The temperature degrees of certain set of cities are normally distributed. The cities are classified into three categories. The lowest 12.92% are in category I, The highest 10.38% are in Category III, and the other cities are in category II, with degrees between α and β.

i. Find the z- scores of α and β.

ii. Given the mean temperature degrees is 6.84 and the standard deviation is 0.25. Find the values of α and β

Consider a single factor APT. Portfolio A has a beta of 1.5 and an expected return of 24%. Portfolio B has a beta of 0.9 and an expected return of 13%. The risk-free rate of return is 4%. An arbitrage portfolio in which you take a position in a combination of the highest beta portfolio and the risk-free asset, and an opposite position in the other risky portfolio would generate a rate of return of ______%.

HowRu, a private card business and its subsidiary, have a 14% share of the greeting card market. The card business is subject to seasonal cycles, with sales being highest during the holiday season. For this assignment, please complete the following:

Discuss at least 5 steps to diversify the card business.

Please give at least 6 suggestions of how and where funds can be allocated for new investments.

Using Python: 

cities = pd.DataFrame(
    [[2463431, 2878.52], [1392609, 5110.21], [5928040, 5905.71]],
 
    columns=['population', 'area'],
    index=pd.Index(['Vancouver','Calgary','Toronto'], name='city')
)

Do the following:

• Estimate the density for each city
• rank the cities from 1 to 3 with 1 is the city with the highest density and 3 is the lowest
• Display an updated data frame with the ranking and density information upended as new columns

Power distance refers to the degree to which the culture believes that institutional and organizational power should be distributed unequally and whether the decisions of the power holders should be challenged or accepted. Which countries have the lowest power distance and the highest power distance? Post a link to your source for this information and how power distance in these countries reflects each country’s approach to economic, political, and social equality.

A roller-coaster track is being designed so that the roller-coaster car can safely make it around the circular vertical loop of radius R = 24.5 m on the frictionless track. The loop is immediately after the highest point in the track, which is a height h above the bottom of the loop. What is the minimum value of h for which the roller-coaster car will barely make it around the vertical loop?

I am currently working on an HOME AUTOMATION PROJECT(((that which controls home appliances via web/Google Assistant/application..
My question is HOW CAN SUCH PROJECT BE IMPROVED..
And also HOW CAN IT BE MADE DIFFERENT from series of such projects on the web..
I need 4-5 ideas on HOW TO DISTINGUISH MY OWN from others..

TECHNICALITY OF THE HIGHEST ORDER IS DEMANDED IN THE ANSWERS

CSC202-001 Clark

Problem 1:

For this class Java’s ArrayList is used to store a collection of different elements. Please design and implement your own array-based version of MyArrayList that stores items of type

String and supports the following operations:

+MyArrayList()

//a constructor that creates an empty array list

+emptyHere() : Boolean

// Determines whether the list is empty or not

+sizeHere() : integer

// Returns the # of items stored in the array list

+add(in item : String) : void

// Appends the specified elements to the list

+removeMe(in item : String) : void

// Removes the first occurrence of the specified element from the list (if it is present)

+get(in index : integer) : String

// Returns the element at the specified index from the list. The list will remain unmodified.

+removeAll() : void

// Removes all the items in the list here

2. Your implementation should contain two class attributes. The first, called firstArray, is an

array of String. The second, called size, is of type int. The firstArray class attribute

should be created on the call to the constructor and initially have a size of two (2). The

constructor should also initialize the size attribute to zero (0).

3. On each call to add, check to see if firstArray is full. If adding the new element would

cause the array to overflow, then do the following:

a. please create a new bigger array that is twice the size of original array;

b. copy the whole contents of the original array to new array;

c. add the new element to the new array; and

d. reassign firstArray to reference the new array correctly

4. On each call to remove, check to see if firsttArray is less than or equal to a quarter full. If

removing the specified element would cause the array to be less than 25% full, then

a. remove the selected element from original array;

b. create a new smaller array that is half the size of the original array;

c. copy the whole contents of the original array to the new array; and

d. reassign firstArray to reference this new array.

5. Your implementation should reset the size of firstArray back to size 2 if all the elements

are removed (i.e. removeAll() is called).

6. To make sure that your implementation is working correctly, you will create an

MyArrayListException class. This exception needs to be thrown if any attempt is

made to access an illegal index within the lstArray attribute. Create a file called

MyArrayListException.java containing the following code:

public class MyArrayListException extends RuntimeException {

public MyArrayListException(String s) {

super(s);

}

}

Your submission should NOT contain a main method, the code implementing MyArrayListException, or any extra testing code

You may write any private helper methods, as needed.

You may use notes and help from internet.

Implement the following functions for an array based stack.

#include <stdexcept>
#include <iostream>

using namespace std;

#include "Stack.h"

template <typename DataType>
class StackArray : public Stack<DataType> {
public:
    StackArray(int maxNumber = Stack<DataType>::MAX_STACK_SIZE);
    StackArray(const StackArray& other);
    StackArray& operator=(const StackArray& other);
    ~StackArray();
    void push(const DataType& newDataItem) throw (logic_error);
    DataType pop() throw (logic_error);
    void clear();
    bool isEmpty() const;
    bool isFull() const;
    void showStructure() const;

private:
    int maxSize;
    int top;
    DataType* dataItems;
};

//--------------------------------------------------------------------
//
//
//  ** Array implementation of the Stack ADT **
//
//--------------------------------------------------------------------
//--------------------------------------------------------------------

template <typename DataType>
StackArray<DataType>::StackArray(int maxNumber)

// Creates an empty stack.

        : maxSize(maxNumber), top(-1)
{
    
}

//--------------------------------------------------------------------

template <typename DataType>
StackArray<DataType>::StackArray(const StackArray& other)

// Copy constructor for  stack

        : maxSize( other.maxSize ), top( other.top )
{
    
}

//--------------------------------------------------------------------

template <typename DataType>
StackArray<DataType>& StackArray<DataType>::operator=(const StackArray& other)

// Overloaded assignment operator for the StackArray class.
// Because this function returns a StackArray object reference,
// it allows chained assignment (e.g., stack1 = stack2 = stack3).

{
   return *this;
}

//--------------------------------------------------------------------

template <typename DataType>
StackArray<DataType>::~StackArray()

// Frees the memory used by a stack.

{
    
}

//--------------------------------------------------------------------

template <typename DataType>
void StackArray<DataType>::push(const DataType& newDataItem) throw (logic_error)

// Inserts newDataItem onto the top of a stack.

{
   
}

//--------------------------------------------------------------------

template <typename DataType>
DataType StackArray<DataType>::pop() throw (logic_error)

// Removes the topmost data item from a stack and returns it.

{
   
    return dataItems[top];
}

//--------------------------------------------------------------------

template <typename DataType>
void StackArray<DataType>::clear()

// Removes all the data items from a stack.

{
    
}

//--------------------------------------------------------------------

template <typename DataType>
bool StackArray<DataType>::isEmpty() const

// Returns true if a stack is empty. Otherwise, returns false.

{
    return true;
}

//--------------------------------------------------------------------

template <typename DataType>
bool StackArray<DataType>::isFull() const

// Returns true if a stack is full. Otherwise, returns false.

{
    return true;
}

//--------------------------------------------------------------------

template <typename DataType>
void StackArray<DataType>::showStructure() const

// Array implementation. Outputs the data items in a stack. If the
// stack is empty, outputs "Empty stack". This operation is intended
// for testing and debugging purposes only.

{
    if( isEmpty() ) {
        cout << "Empty stack." << endl;
    }
    else {
        int j;
        cout << "Top = " << top << endl;
        for ( j = 0 ; j < maxSize ; j++ )
            cout << j << "\t";
        cout << endl;
        for ( j = 0 ; j <= top  ; j++ )
        {
            if( j == top )
            {
                cout << '[' << dataItems[j] << ']'<< "\t"; // Identify top
            }
            else
            {
                cout << dataItems[j] << "\t";
            }
        }
        cout << endl;
    }
    cout << endl;
}