All posts by : chebby

Lab Document and Data attached.

 2 Separate questions.. Please check attachments.  

(1) Give a working definition of Data Washing Machines (DWM) from your perspective. (2) Propose a conceptual framework on DMW’s. (3) Propose research directions or R&D approaches for DWM.

For your final assessment, you will use your work from the previous four assessments, along with this final piece to produce a cohesive plan for enterprise network optimization. Organize your work logically, as if you would actually present it to senior IT leadership in the organization you selected.

Use the following structure to organize and complete your assessment:

• Title page.
• Executive summary (approximately one page that provides a high-level overview of what is in the document).
• Body of the document:
  • Your network diagram, updated to include the following:
    • Apply basic load-balancing techniques as an effort to ensure network availability.
  • Analyze the technology presented in your diagram (you may use the information you provided in previous assessments, but do not simply cut and paste).
    • Explain your decisions for hardware placement, hardware devices, topology, and overall infrastructure design.
    • Support your analysis with recent, relevant resources.
  • Explain the techniques and strategies for maintaining high availability on the network.
  • Explain your load balancing strategy.
  • Explain how your network design addresses globalization. How can you be sure it will succeed internationally?
• References page.
  • Include at least six recent, relevant professional references.
  • Format references according to APA guidelines.

Additional Requirements

• Use the following template: Assessment 5 format.docx 
• 6–8 double-spaced pages, not including the title page and references page.
• Be sure it is professionally written
• free of errors
• Times New Roman, 12-point font.

Grading

Ensure you are following the scoring guide; this is how I will grade your paper:

• Design a network for an organization.
• Analyze the technology presented in a network design diagram.
• Explain the techniques and strategies for maintaining high availability on the network.
• Explain the load balancing strategy.        
• Explain how a network design addresses globalization.
• Write clearly with few spelling, grammatical, or mechanical errors.

i have source code  for app but cant run can anyone help me

see this

https://opuslabsin.github.io/doc-bustracking/

  Read Article attached then conduct a research paper

Christian Worldview Research Paper Instructions

I. Christian Worldview Integration

You will be able to evaluate ethical business management information systems practices within the context of your Christian Worldview.

In your review of the article in the Reading & Study folder, the authors discuss the impact of how modernism shapes our beliefs and approaches to ethics in business management information systems and academia. After reviewing the article, you will conduct additional research to:

· Discuss the major points that underlie the author’s conclusion that modernism provides limitations in both business management information systems and academia in addressing moral issues and religion. 

· Discuss how the introduction of the Christian worldview as an alternative approach provides a better approach for examining ethical issues in business management information systems. 

· Share your experiences as they relate to the authors’ main points, with respect to your experiences in business management information systems/academia.

II.  Paper Requirements

· Current APA Formatting

· At least 2 pages double-spaced 

· Title page, Reference page, and Figures/Diagrams/Tables will not be included in the page count.

Topic: Robust and Efficient Elimination of Cache and Timing Side Channels

Review Guidelines:

1. One page, single space, margin 1 inch (top, bottom, left, right), font (times new roman, size 10)

Supporting document are attached.

For this assignment, you will write one implementation of a Priority Queue. For this ADT, removal operations always return the object in the queue of highest priority that has been in the queue the longest. That is, no object of a given priority is ever removed as long as the queue contains one or more object of a higher priority. Within a given priority FIFO order must be preserved.

Your implementation will be:

1. BinaryHeap

The implementation must have identical behavior, and must implement the PriorityQueue interface (provided). The implementation must have two constructors, a default constructor with no arguments that uses the DEFAULT_MAX_CAPACITY constant from
the PriorityQueue interface, and a constructor that takes a single integer parameter that represents the maximum capacity of the priority queue.

The PriorityQueue interface follows:

/* The PriorityQueue ADT may store objects in any order. However,

• ** removal of objects from the PQ must follow specific criteria. The
• ** object of highest priority that has been in the PQ longest must be
• ** the object returned by the remove() method. FIFO return order
• ** must be preserved for objects of identical priority. **
• ** Ranking of objects by priority is determined by the Comparable
• ** interface. All objects inserted into the PQ must implement this ** interface.
  */
  package data_structures;
  import java.util.Iterator;
  public interface PriorityQueue> extends Iterable { public static final int DEFAULT_MAX_CAPACITY = 1000;

// Inserts a new object into the priority queue. Returns true if // the insertion is successful. If the PQ is full, the insertion // is aborted, and the method returns false.
public boolean insert(E object);

// Removes the object of highest priority that has been in the
// PQ the longest, and returns it. Returns null if the PQ is empty. public E remove();

// Deletes all instances of the parameter obj from the PQ if found, and
// returns true. Returns false if no match to the parameter obj is found. public boolean delete(E obj);

// Returns the object of highest priority that has been in the // PQ the longest, but does NOT remove it.
// Returns null if the PQ is empty.
public E peek();

// Returns true if the priority queue contains the specified element // false otherwise.
public boolean contains(E obj);

// Returns the number of objects currently in the PQ. public int size();

   //  Returns the PQ to an empty state.

    public void clear();

// Returns true if the PQ is empty, otherwise false public boolean isEmpty();

// Returns true if the PQ is full, otherwise false. List based // implementations should always return false.
public boolean isFull();

// Returns an iterator of the objects in the PQ, in no particular // order.
public Iterator iterator();

}

Thus, your project will consist of the following files. You must use exactly these filenames.

• PriorityQueue.java The ADT interface (provided above)
• BinaryHeapPriorityQueue.java The binary heap implementation.
  Additional Details:
• Each method must be as efficient as possible. That is, a O(n) is unacceptable if the method could be written with O(log n) complexity. Accordingly, the ordered array implementation must use binary search where possible, such as the contains(), the delete(E obj) method and also to identify the correct insertion point for new additions. For binary heap implementation, both insert() and remove() must be O(log n).
• By convention, a lower number=higher priority. If there are five priorities for a given object, 1 .. 5, then 1 is the highest priority, and 5 the lowest priority.
• You BinaryHeap must be stable – able to determine the oldest entry among those with identical priority.
• You may not make any modifications to the PriorityQueue interface provided.
• You may import java.util.Iterator, and java.util.NoSuchElementException only. If you feel that you need to import anything else, let me know. You are expected to write
  all of the code yourself, and you may not use the Java API for any containers.
• Your code must not print anything.
• Your code should never crash, but must handle any/all error conditions gracefully. i.e. if the user attempts to call the clear() method on an empty PQ, or remove an item from an empty PQ, the program should not crash. Be sure to follow the specifications for all methods.
• You must write generic code according to the interface provided. You may not add any public methods to the implementations, but you may add private ones, if needed.

I only need the one Binary Heap java file (or code)

 SaaS computing and its impact on the workplace

This week as a group each team is required to deliver:

• The Project Design of your project. The paper must be well structured.
• State:
  • The focus of your research, (that is the problem that you were working on).
  • How was the problem identified? ( that is the background of the problem)
  • What are the benefits of your research? (that is the significance of your problem that you have researched)

 Descriptive Research Study

10.- Instruments – (Worth 6-points)

11.- Research procedures – (Worth 6-points)

12.- Data Analysis – (Worth 6-points)

 
NOTE1: You are not required to collect data from the primary source. Make sure you don’t state in your paper that you have collected data through interviews. If you mention in you paper that you have or will be collecting data, your group will receive zero (0) for this assignment.

NOTE2: You will only work with secondary data from Peer-Reviewed Journals.

NOTE3:  This is a continuation of your proposed project that you started in week-2  Each group to deliver:
     
Steps and Procedures:

• To complete this assignment, you are required to use “ONLY” Peer-Reviewed Journals. Do not use any other source to support your research. Use only Peer-Reviewed Journals.
• You need to list the reference of the article from The Peer-Reviewed Journal. All references must follow APA style, structure, and formatting.
• Use the basic citation styles mentioned in the APA Manual, Sixth or Seventh Editions, to cite your sources.
• Do not send your work via e-mail. Your document will be ignored. I will not grade your document if you send it via e-mail.
• Make sure you include the selected 10-Articles from Peer-Reviewed Journal as your references and sources (10-Annotated Bibliography).
• “Only” The leader of your team for week four (5) will submit the assignment.
• Please observe the Required Practical Connection Assignment Rubric

The current code (attached), developed by a junior developer, has several issues and is not functioning as expected. The desired functionality of the program is to allow a user to select from several choices on a menu. After the user selects the “Exit” option from the menu, the program will populate a password with ‘1’s and then display the value of the password. The program also captures a character so the screen can stay paused for review before exiting. Below are screenshots for successful program execution.

Unfortunately, not only are there security issues, the code you were provided doesn’t work as expected. For the first part of this exercise demonstrate your C developer environment is working properly. You can do this by running any of the sample C code applications. 

Modify the C code in this example to make the desired functionality work properly. Demonstrate the code works properly through screen captures and describing what changes were made to fix the functionality issues.

Carefully, review the code and perform analysis as needed. Consider the following rules and recommendations and hints for items that you might want to review. 

Note, that some rules and recommendations listed below may not be found as issues in the code. 

 STR31-C. Guarantee that storage for strings has sufficient space for character data and the null terminator. 

 MSC24-C. Do not use deprecated or obsolescent functions. 

 FIO34-C. Distinguish between characters read from a file and EOF or WEOF. 

 MSC17-C. Finish every set of statements associated with a case label with a break statement.  MSC33-C. Do not pass invalid data to the asctime() function. 

 MSC17-C. Finish every set of statements associated with a case label with a break statement. 

 DCL20-C. Explicitly specify void when a function accepts no arguments. 

 MEM30-C. Do not access freed memory. 

You can use any C compiler you have access to.