Monthly Archives: January 2024

Facial Recognition 

What is a Facial Recognition System?

How Does Facial Recognition Work?

How Facebook Uses the Face Recognition Feature?

all i need is these two files

Create VectorContainer.hpp

Create SelectionSort.hpp 

Test SelectionSort.hpp using the VectorContainer.hpp class you made

# Strategy Pattern

In this lab you will create a strategy pattern for sorting a collection of expression trees by their `evaluate()` value, which you will pair with different containers to see how strategies can be paired with different clients through an interface to create an easily extendable system. This lab requires a completed composite pattern from the previous lab, so you should begin by copying your or your partner’s code from the previous assignment into your new repo, making sure it compiles correctly, and running your tests to make sure everything is still functioning correctly.

You will start this lab by creating two expression tree containers: one that uses a vector to hold your trees (class `VectorContainer`) and one that uses a standard list (class `ListContainer`). Each of these container classes should be able to hold any amount of different expressions each of which can be of any size. You will implement them both as subclasses of the following `Container` abstract base class, which has been provided to you in container.h. You should create each one independently, creating tests for them using the google test framework before moving on. Each container should be it’s own commit with a proper commit message. Optionally you can create each one as a branch and merge it in once it has been completed.

class Container {

    protected:

        Sort* sort_function;

    public:

        /* Constructors */

        Container() : sort_function(nullptr) { };

        Container(Sort* function) : sort_function(function) { };

        /* Non Virtual Functions */

        void set_sort_function(Sort* sort_function); // set the type of sorting algorithm

        /* Pure Virtual Functions */

        // push the top pointer of the tree into container

        virtual void add_element(Base* element) = 0;

        // iterate through trees and output the expressions (use stringify())

        virtual void print() = 0;

        // calls on the previously set sorting-algorithm. Checks if sort_function is not

        // null, throw exception if otherwise

        virtual void sort() = 0;

        /* Functions Needed to Sort */

        //switch tree locations

        virtual void swap(int i, int j) = 0;

        // get top ptr of tree at index i

        virtual Base* at(int i) = 0;

        // return container size

        virtual int size() = 0;

};

Notice that our Container abstract base class does not have any actual STL containers because it leaves the implementation details of the container to the subclasses. You **must use the homogeneous interface above for your sort functions, and you are only allowed to manipulate the containers through this interface, not directly**. This will allow you to extend and change the underlying functionality without having to change anything that interfaces with it.

## Sorting Classes

In addition to the containers you will also create two sort functions capable of sorting your containers, one that uses the [selection sort](https://www.mathbits.com/MathBits/CompSci/Arrays/Selection.htm) algorithm and one that uses the [bubble sort](https://www.mathbits.com/MathBits/CompSci/Arrays/Bubble.htm) algorithm (you may adapt this code when writing your sort functions). They should both be implemented as subclasses of the `Sort` base class below which has been provided. You should create each one independently, creating tests for them using the google test framework before moving on. Each sort class should be it’s own commit with it’s own proper commit message. When creating tests for these sort classes, make sure you test them with each of the containers you developed previously, and with a number of different expression trees.

“`c++

class Sort {

    public:

        /* Constructors */

        Sort();

        /* Pure Virtual Functions */

        virtual void sort(Container* container) = 0;

};

sort.hpp

#ifndef _SORT_HPP_

#define _SORT_HPP_

#include “container.hpp”

class Container;

class Sort {

public:

/* Constructors */

Sort();

/* Pure Virtual Functions */

virtual void sort(Container* container) = 0;

};

#endif //_SORT_HPP_

base.hpp

#ifndef _BASE_HPP_

#define _BASE_HPP_

#include

class Base {

public:

/* Constructors */

Base() { };

/* Pure Virtual Functions */

virtual double evaluate() = 0;

virtual std::string stringify() = 0;

};

#endif //_BASE_HPP_

container.hpp

#ifndef _CONTAINER_HPP_

#define _CONTAINER_HPP_

#include “sort.hpp”

#include “base.hpp”

class Sort;

class Base;

class Container {

protected:

Sort* sort_function;

public:

/* Constructors */

Container() : sort_function(nullptr) { };

Container(Sort* function) : sort_function(function) { };

/* Non Virtual Functions */

void set_sort_function(Sort* sort_function); // set the type of sorting algorithm

/* Pure Virtual Functions */

// push the top pointer of the tree into container

virtual void add_element(Base* element) = 0;

// iterate through trees and output the expressions (use stringify())

virtual void print() = 0;

// calls on the previously set sorting-algorithm. Checks if sort_function is not null, throw exception if otherwise

virtual void sort() = 0;

/* Essentially the only functions needed to sort */

//switch tree locations

virtual void swap(int i, int j) = 0;

// get top ptr of tree at index i

virtual Base* at(int i) = 0;

// return container size

virtual int size() = 0;

};

#endif //_CONTAINER_HPP_

Example

#ifndef _LISTCONTAINER_HPP_

#define _LISTCONTAINER_HPP_

#include “container.hpp”

#include

#include

#include

class Sort;

class ListContainer: public Container{

public:

std::list baseList;

//Container() : sort_function(nullptr){};

//Container(Sort* function) : sort_Function(function){};

//void set_sort_funtion(Sort* sort_function){

// this -> sort_function = sort_function;

//}

void add_element(Base* element){

baseList.push_back(element);

}

void print(){

for(std::list::iterator i = baseList.begin(); i != baseList.end(); ++i){

if(i == baseList.begin()){

std::cout <<(*i) -> stringify();

}

else{

std::cout << ", " << (*i) -> stringify();

}

}

std::cout << std::endl;

}

void sort(){

try{

if(sort_function != nullptr){

sort_function -> sort(this);

}

else{

throw std::logic_error(“invalid sort_function”);

}

}

catch(std::exception &exp){

std::cout << "ERROR : " << exp.what() << "n";

}

}

//sorting functions

void swap(int i, int j){

std::list::iterator first = baseList.begin();

for(int f = 0; f < i; f++){

first++;

}

Base* temp = *first;

std::list::iterator second = baseList.begin();

for(int s = 0; s < j; s++){

second++;

}

*first = *second;

*second = temp;

}

Base* at(int i){

std::list::iterator x = baseList.begin();

for(int a = 0; a < i; a++){

x++;

}

return *x;

}

int size(){

return baseList.size();

}

};

#endif //_LISTCONTAINER_HPP_

bubblesort.hpp

#ifndef __BUBBLESORT_HPP__

#define __BUBBLESORT_HPP__



#include "sort.hpp"

#include "container.hpp"



class BubbleSort: public Sort{

	public:

	void sort(Container* container){

		memContainer = container;

		

                int flag = 1;

                int numLength = memContainer->size();

                for(int i = 1; (i <= numLength) && (flag == 1); i++){

                        flag = 0;

			for(int j = 0; j < (numLength - 1); j++){

				if(memContainer->at(j+1)->evaluate() < memContainer->at(j)->evaluate()){

					memContainer->swap(j+1, j);

					flag = 1;

				}

			}

		}

		}

};

#endif // __BUBBLESORT_HPP__

Go to the website: https://epic.org/privacy/litigation/ which focuses on civil rights issues and privacy. Pick a case.

Using WORD, in you OWN WORDS, write an ORIGINAL brief essay of 300 words or more  :

• Summarize the case
• Give your opinion of the decision.
• Describe how the case deals with the material in this chapter

1. Write a research report on the topic “Managing Transaction Processing using MongoDB”.

Instructions:

Please refer to attached Doc for guidelines and please strictly follow all the instructions carefully while writing the report.

2. Prepare a PPT 

·       PPT should reflect a summary of the Research Report.

·       Should have 12-15 slides.

·       The design elements and content will be judged equally.

Note: No Plagiarism, Relevant research goal and questions are must.

 Assignment 1: 

In Chapter 2, the author talks about four key stages with regards to data visualization workflow. Select one key stage and expand on the author’s comments about the stage.

Textbook is attached, “Andy Kirk – Data Visualisation_ A Handbook For Data Driven Design-Sage Publications (2019)”.

Requirement: 

· ****Separate word document for each assignment****

· Minimum 300-350 words. Cover sheet, abstract, graphs, and references does not count.

· Add reference separately for each assignment question.

· Strictly follow APA style. 

· Include at least two citations (APA) from academic resources

· No plagiarized content please! Attach a plagiarized report.

· Check for spelling and grammar mistakes!

· $5 max. Please bid if you agree.

Assignment 2: 

A human resources manager stores a spreadsheet with sensitive personal information on her local workstation. The spreadsheet is the only file with sensitive data, and the name of the spreadsheet does not change.

As a security specialist, you must choose the best form of encryption to protect the spreadsheet. Your choices are:

· BitLocker

· BitLocker To Go

· File encryption via Encrypting File System (EFS)

· Folder encryption via EFS

Answer the following question(s):

Ø Which form of encryption would ensure the spreadsheet is always stored on the disk in encrypted format? More than one form may be correct.

Requirement: 

· ****Separate word document for each assignment****

· Minimum 300-350 words. Cover sheet, abstract, graphs, and references do not count.

· Add reference separately for each assignment question.

· Strictly follow APA style. Length – 2 to 3 paragraphs. 

· Sources: 2 References to Support your answer

· No plagiarized content please! Attach a plagiarized report.

· Check for spelling and grammar mistakes!

· $5 max. Please bid if you agree.

Assignment 3: 

Project Part 2.

Refer to the “Project Part 2-Access Controls Procedure Guide” word document for tasks and instructions. 

Requirement: 

· ****Separate word document for each assignment****

· Minimum 3 pages. Cover sheet, abstract, graphs, and references do not count.

· Strictly follow APA style.

· No plagiarized content please! Attach a plagiarized report.

· Check for spelling and grammar mistakes!

· $10 max. Please bid if you agree.

1) What type of device or system did you select to conduct your forensics investigation?

2) What tool did you use for the data capture? 

3) What did you learn from the experience?

· No Plagiarism 

· APA Format required

· Each Answer Should be 350 words without References.

!!! NEED 2 ANSWERS FOR THIS QUESTION WITH 0% PLAGIARISM!!!!

!!! One Answer using FTK IMAGER LITE Tool !!! 

!!! Second Answer using Autopsy Tool !!! 

Please write a research paper of 3000 – 3500 words on Describe and contrast the operational challenges faced by the following startups: (a) consumer Web services startup, (b) iPhone application company, and (c) electronic device company.provide at least five appropriate, properly cited sources. project (paper) must be formatted according to APA guidelines as a Word document, double spaced, Times New Roman, 12-font, with one inch margins. do not do plagiarism. this is a research paper for the course emerging technologies.

From a technology entrepreneurial perspective, the dangers of having exclusive focus on the product or service without due consideration to whether it sincerely addresses a real market or public concern raises numerous ethical issues. Address the following questions:

With the development of several COVID-19 smartphone applications used for tracking COVID affected people and virus heighten areas,

· Is this a possible violation of personal safety?

· Should all personnel be required to download and use the COVID app for monitoring and tracking purposes?

· What are crucial areas of commercialization of the COVID-19 smartphone app? Do you agree with the medical and social safety of their importance and if so why do you agree or disagree that commercialization of innovation is important. 

· What are the external and internal environmental uncertainties?

· What is the risk profile associated with the smartphone tracking app?

· What other rewards besides financial and monetary gains can be obtained using this app?

NOTE:  

• 5-7 pages in length (excluding cover page, abstract, and reference list)
• Include at least 5 online references to support your research. 
•  Assignments will need actual references from EBSCO host, google scholar, and semantic scholar With a website link at the end.  Only use APA 7th edition. (There should be Abstract and conclusion) 

need answers of the question i have uploaded file

 What role do you feel that VR/AR will play in the future for managing products within an enterprise supply chain system? 

augmented reality (AR) and virtual reality (VR)