zilongwang/ReadingBank huggingface dataset:
set variable (expression) Changes the value of a variable that has already been created to the value of the expression. In the above NetLogo code: let x (4.5) creates a new variable x and sets its value to 4.5. forward x moves the turtle forward a number of steps equal to the value of x. The first time through the repeat loop, the value of x is 4.5. set x (x + 4.5) changes the value of x to the result of the expression (x + 4.5). The first time this command is reached, x has a value of 4.5 and the expression (x + 4.5), therefore, has a value of 9.0. Thus, the first time this command is reached, the value of x is changed from 4.5 to 9.0. GOTCHA: In NetLogo, mathematical expressions must have a space before and after the operators. For example, (x+4.5) is an error. (x + 4.5) is correct. forward x is inside the repeat loop and the second time it is reached, x has the value 9.0 so the second line drawn by the turtle is 9.0 steps long. Just as a variable can be used as the number of steps in the forward command, a variable can be used as the angle in the right command and as the color in the set color command. More than one variable can be used if you want! You just need to use the let and set commands to create and modify each one separately. In the circles image, the forward command and turn angle command are both hardcoded constants, but inside the repeat loop is the command: set color (color + 1) HAVE FUN! Grading Rubric [20 points total]:
methods Intended learning outcomes Activity Topic Date Week Introduction: Course Info 26/12/1438 1 Exams, assignments, and case studies 2.1, 2.4, 3.1 On-lab exercise assignments Algorithmic Problem Solving Problem solving, algorithms and Pseudo code Flow charts Introduction to Computers, programming, 4/1/1439 2 1.1, 2.2 Practical lab assignments Java basics I: Basics of a java program Memory, variables, and Data Types I/O operations 11/1/1439 3 1.1, 2.2 Practical lab Assignments Quiz # 1 Java basics II: Arithmetic Operations Constants, Comments c) programming style and Debugging 18/1/1439 4 1.1, 1.2, 1.3, 2.2, 3.1 Practical lab assignments Introduction to Classes: Encapsulation, Defining classes, instantiating objects, private vs. public access, constructors and overloaded constructors. 25/1/1439 5 1.1, 2.2, 2.3, 3.1 Practical lab Assignments Quiz # 2 Control Structures 1: Boolean Expressions &Relational Operators If statements Nested if statements 2/2/1439 6 Exam includes topic from Week#1 to the end of Week#5 Mid-term Exam 1 Revision EXAM DAY 1/2/1438 Exam solution 9/2/1439 7 1.1, 2.2, 2.3, 3.1 Practical lab Assignments Control Structures 2: switch statements 16/2/1439 8
compound assignment operators unary operators 1.1, 2.2, 2.3, 3.1 Practical lab Assignments Loops I: while looping do while loops for loops 23/2/1439 9 1.1, 2.2, 2.3 Practical lab Assignments Quiz # 3 Loops II break & continue nested loops nested control structures 1/3/1439 10 Exam includes topic from Week#6 to the end of Week#11 Mid-term Exam 2 revision EXAM_DAY 7/3/1438 Exam solution 8/3/1439 11 Exams, assignments, and case studies 1.1, 1.2, 2.2, 2.4, 3.1 Practical lab Assignments Methods I: Predefined Methods User-Defined Methods Parameters and casting 15/3/1439 12 1.1, 1.2, 2.2, 2.4 Practical lab Assignments Quiz # 4 Methods II: Returning values Scope & Stack Overloading 22/3/1439 13 1.1, 1.2, 2.2, 3.1 Practical lab Assignments Quiz # 5 Arrays: What is an array? processing Passing arrays to methods Multidimensional Arrays 29/3/1439 14 5. Books and references: [1] Java Programming From Problem Analysis To Program Design, By D.S. Malik, Fifth Edition. [2] Java : how to program , P.J. Deitel, H.M. Deitel. -- 9th ed.
Lab 2: Modules This lab accompanies Chapter 3 of Starting Out with Programming Logic & Design. Name: ___________________________ Lab 2.1 – Algorithms This lab requires you to think about the steps that take place in a program by writing algorithms. Read the following program prior to completing the lab. A retail company must file a monthly sales tax report listing the total sales for the month and the amount of state and county sales tax collected. The state sales tax rate is 4 percent and the county sales tax rate is 2 percent. Write a program that asks the user to enter the total sales for the month. The application should calculate and display the following: The amount of county sales tax The amount of state sales tax The sales tax (county plus state) Step 1: Examine the following algorithm. Get the total sales for the month. Multiply the total sales by .04 to calculate the state sales tax. Multiply the total sales by .02 to calculate the county sales tax. Add the state tax and county tax to calculate the total sales tax. Display the calculated county tax, state tax, and total sales tax. Step 2: Given a total sales of $27,097, answer the following: What is the calculated tax? _________________1083.88______________________ What is the calculated county tax? ___________________541.94__________________ What is the calculated tax? _____________________1625.82__________________ Variable Name Purpose Declare Real totalSales Stores total sales the user inputs Declare real countyTax Stores county tax
(Replace the following figure with your own figures and description of the results.) Figure 1: Distribution of the hour of wake-up by gender Discussion: The Discussion section of the paper draws together the individual pieces of the analysis to paint a coherent picture. Discuss the results of your sleep patterns in terms of what is known about sleep. Do you view yourself as a morning person or an evening person? Do you get enough sleep? How do your sleep patterns support or interfere with your learning? Would you benefit by changing or sleep habits? If so, how? One measure of morningness-eveningness is the Horne-Ostberg survey , which is available on Blackboard under assessments. If you wish, you can take the survey and score it according to the following table. Table 2. Horne-Ostberg survey breakout. Score Type 70-86 Definitely morning type 59-69 Moderately morning type 42-58 Neither type 31-41 Moderately evening type 16-30 Definitely evening type Conclusion: Provide a concluding paragraph summarizing the results.
Quizzes/Assignments/Exams Weight 10 Quizzes – drop lowest quiz. 20% 10 Assignments – drop lowest assignment. 20% 5 Forums - class discussions. 10% Midterm Exam (50 Multiple-Choice questions). 15% Final Team Project (MS Word, MS Excel, MS PowerPoint) – see guidelines in Moodle week-0. 25% Participation (2% points for each day missed). 10% TOTAL 100% Grades: IMPORTANT: A grade of “C” or higher is considered passing. A: 90-100% B: 80-89% C: 70-79% D: 60-69% F: < 60% P: >= 70% NP: < 70% Instructor and Student Responsibilities: Instructor Responsibilities Student Responsibilities I commit to starting all classes on time. You agree to attend all classes and to comply with college code of conduct. I commit to showing up to class prepared. You agree to actively participate in class discussions and exercises. I commit to balancing class time between lecture and hands-on exercises. You to spend an average of 4 hours per week on readings and assignments outside of class (see Moodle for details). I commit to holding published office You agree to complete all readings and course assignments on time (due on Sunday night). I commit to responding to your email within 24 hours (no voice mail please). You agree to collaborate professionally with fellow students on the class project. I commit to grading assignments within 3 days (after due date). If I'm unable to come to a class, I commit to doing my best to find a substitute instructor while keeping you up-to-date.
Week-1 assignment Week-2 Oct 1 Week-2 = Overview of Windows 10 Operating System, File System, and Snipping tool. Week-2 quiz Week-2 assignment Class discussion-1 (What do you hope to learn in this class?) Oct 7 @ 11:55 pm Week-3 Oct 8 Week-3 scope = Overview of Computer Networks, Internet, Browsers, and Cloud Computing (Google Drive & Microsoft OneDrive). Week-3 quiz Week-3 assignment NOTE: Project Teams formed. Oct 14 @ 11:55 pm Week-4 Oct 15 Week-4 = Overview of Google Gmail, Contacts, Calendar and Deeper Dive into Google Drive & OneDrive. Week-4 quiz Week-4 assignment discussion-2 (How has the Internet changed the world?) Oct 21 @ 11:55 pm Week-5 Oct 22 Week-5 scope = Intro to MS Office suite and overview of Microsoft Word. Week-5 quiz Week-5 assignment Oct 28 @ 11:55 pm Week-6 Oct 29 Week-6 scope = Complete Microsoft Word, Intro to Google Docs and OneDrive Word (including File Format Converting) and midterm exam. Midterm Exam Wed. Oct 31 1:30-3:20 pm (must be in class) Week-6 quiz Week-6 assignment Class discussion-3 (What’s the big deal about Cloud Computing?) Nov 4 @ 11:55 pm Week-7 Nov 5 Week-7 scope = Overview of Microsoft Excel. Week-7 quiz Week-7 assignment Nov 11 @ 11:55 pm Week-8 Nov 12 *** Monday, Nov 12 is Veterans Day = Holiday *** Week-8 = Complete Microsoft Excel and Intro to Google Sheets and OneDrive Excel (including File Format Converting). Week-8 quiz Week-8 assignment Nov 18 @ 11:55 pm
Class discussion-4 (Why are people concerned about Internet Security?) Final Project Outline (Only one team member to submit) Week-9 Nov 19 ** Thursday & Friday Nov 22 & 23 are Thanksgiving Holiday ** Week-9 scope = Overview of Microsoft PowerPoint and Intro to Google Slides and OneDrive PowerPoint. Week-9 quiz Week-9 assignment Class discussion-5 (How do you imagine embedded computers will be used 10 years from now?) Nov 25 @ 11:55 pm Week-10 Nov 26 Week-10 scope = Overview of Computer Security and Key System Utilities (Defender, Disk Cleanup, Defrag, Task Manager & Backup). Week-10 quiz Week-10 assignment Project teams artifacts (MS Word, Excel & PowerPoint) Only one team member to submit Dec 2 @ 11:55 pm Week-11 Dec 3 Team Presentations - on Wed, Dec 5 @ 8-9:50 am (must be in class)
Worksheet XI Introduction to Flowchart Flowchart is a diagrammatic representation of an algorithm. Flowchart are very helpful in writing program and explaining program to others. Basic Symbols Used in Flowchart Different symbols are used for different states in flowchart, For example: Input/Output and decision making has different symbols. The table below describes all the symbols that are used in making flowchart Symbol Purpose Description Flow line Used to indicate the flow of logic by connecting symbols. Terminal(Stop/Start) Used to represent and end of flowchart. Input/Output Used for input and output operation. Processing Used for airthmetic operations and Decision Used to represent the operation in which there are two
CS 1302 – Lab 9 This is a tutorial covering Lists: ArrayList, LinkedList, and PriorityQueue. There are 6 stages to complete this lab: Stage Title Text Reference 1 The ArrayList Class 20.2, 20.4 2 The LinkedList Class 20.4 3 Speed Comparison: ArrayList vs. LinkedList 20.4 4 The Comparator Interface 20.5 5 Static Methods for Lists & Collections 20.6 6 The PriorityQueue Class 20.9 To make this document easier to read, it is recommend that you turn off spell checking in Word: Choose: File, Option, Proofing At the very bottom, check: “Hide spelling errors…” and “Hide grammar errors…” The ArrayList Class In this stage we will demonstrate some of the methods in the ArrayList class that we have not considered before. Read (no action required) – A collection in programming is a general term to refer to any class that holds a group of items. The ArrayList class (Ch. 11) is a collection and so is an array, and a Stack. In this chapter we will study a number of other collection classes. The ArrayList class inherits its behaviors through the interfaces shown on the right. Note that Collection is the root interface and List is a subinterface. (Two abstract subclasses: AbstractCollection and AbstractList implement the behaviors). In this stage, we will consider some of the methods shown in red in the class diagram above. Setup – Do the following: Establish a Workspace – Create a folder on your drive where you will put your lab or use an existing one. Run Eclipse – As the program begins to run, it will ask you to navigate to the Workspace you want to use. Create a Project – Create a Java project with the name, lab09_lastNameFirstInitial, e.g. lab09_gibsond. Create a package named list_examples. Run Example Read (no action required) – The addAll method: public bool addAll(Collection<? Extends E> c)
OPTIONAL EFFORTS Respond to TPU’s Optional Efforts as described in RFP Section 2.04.G. The description of the effort, resources, hours and cost provided for each of the selected Optional Efforts is incremental to the Minimum Objective effort, staffing and cost described in 4.2 above. Provide a response in any or all of the items below if any of the Optional Efforts regarding Desired Bill Features will be included in the response. TPU will provide management, technical, and business resources to be involved in the project effort based on the Contractor’s project management approach and associated activities described in 4.2. Describe if and how your approach and methodology will differ for these optional efforts. Also address how you will utilize TPU personnel and ensure comprehensive knowledge transfer. Combine energy and energy delivery charges into one line for Power The charges are separately on the current utility bill. Describe the process to accomplish this Optional Effort. Describe how this complements or is different than the effort described in 4.2 above for the RFP’s Minimum Objective. Number of required to complete this Optional Effort. Include any subcontractor hours. 3rd hours (for work that will be required by someone other than the Contractor (and subcontractors) and TPU. TPU hours required. Addition of demand meter data on consumption graphs (dual axes display) This feature is intended to provide customers that have demand meters with demand and consumption data on the same graph for more comprehensive analysis. Describe the process to accomplish this Optional Effort. Describe how this complements or is different than the effort described in 4.2 above for the RFP’s Minimum Objective. Number of hours required to complete this Optional Effort. Include any subcontractor hours.
Performance Indicator 1 2 3 beginning satisfactory exemplary Calculate running time of a divide and conquer algorithm (assessed with an exam question) does not know how to calculate running time some correct steps in calculation, but incorrect solution correct solution Number of Students Solve recurrence with Master Theorem (MT) (assessed with an exam question) does not know how to apply MT correct steps but incorrect solution successfully use MT to find correct solution Number of Students Calculate running time of an algorithm given in pseudocode (for example sort algorithm) (assessed with an exam question) does not know how to calculate running time some correct steps in calculation, but incorrect solution correct solution Number of Students Apply an operation in an instance of an advanced data structure (assessed with an exam question) fail to apply operation some correct steps in application of operation, but incomplete performs operation correctly Number of Students BSCS Outcome j: An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices Performance Indicator 1 2 3 beginning satisfactory exemplary
Given an instance of data (eg. graph) and problem (eg. MST, search, shortest path), state and explain which algorithm would be best (assessed with an exam question) wrong algorithm chosen answer shows understanding of trade-off of algorithm in terms of space and time correct answer, correctly analyzes relative costs of algorithms for specific data and problem Number of Students Given pseudocode of two algorithms (eg. sort), analyze which is more efficient analysis incorrect answer shows understanding of time/space efficiency of algorithm correct answer, correctly analyzes relative costs of algorithm Number of Students a "real-life" problem, figure out which algorithm or data structure would be most helpful (assessed with an exam question) algorithm or data structure does not solve problem can explain how algorithm or data structure can solve problem can explain how algorithm or data structure can solve problem better than other algorithms or data structures Number of Students Part 3: Assessment Conclusions, Findings, and Recommendations BSCS/BSSE Outcome a conclusions BSCS Outcome j conclusions Findings and Recommendations
Team Names: Pawnee Panthers Eagleton Eagles Middletown Minutemen Jackson Jaguars Knutesford Knights Rockville Rams Children Enrolled: Megan Grant Heather Poole Andrea Cameron Sonia Davidson Theresa James Robert Ferguson Brian Walsh Donna Knox Kimberly Burgess Alexandra Greene Ruth Dowd Connor Marshall Alexander Simpson Andrew Bailey Angela Gray Owen James Victoria Graham Carl Slater Emily Cornish Lisa Cameron Melanie Taylor Tim Allan Frank Watson Sophie Abraham Joshua Jones Nicholas McDonald Dorothy Ogden Brandon Brown Steven Abraham Howard Graham Melanie Anderson Rebecca Davies Robert Mathis Kimberly Clarkson Carol Short Jack Lee Zoe Young William James Claire Greene Ian Sutherland Joan Greene Julian Rees Rebecca Knox Sonia Underwood Kimberly Taylor Carl Nash Warren Davidson Simon Russell Alan Ferguson Stewart Hughes Claire Hudson Grace Rees Joe Paterson Dominic Vaughan Isaac Arnold Wendy Springer Lucas Butler Sebastian Lambert Joanne Russell Connor Robertson Trevor Davidson Charles Martin
CHESHIRE SHIELD AND AREA 4/5 QUALIFYING EVENT SOMERFORD PARK FARM 1st JULY 2017 CROSS-COUNTRY COURSES – DISTANCES, SPEEDS, TIMES AND TIME PENALTIES Class 1 PC90 Novice Orange numbers Class 2 Intermediate Pink numbers Class 3 PC Open Open Yellow numbers Class 4 PC80 Newcomers Red and White numbers Prescribed Length of Course 1600 - 2800 m 1600 - 2800 m 1600 - 2800 m Up to 1800m Calculated length of course 2350 metres 2350 metres 2350 metres 1800 metres Speed calculation 450 mpm 475 mpm 520 mpm 435mpm Optimum Time (OT) 5 minutes 13 seconds 4 minutes 57 seconds 4 minutes 31seconds 4 minutes 08 seconds Penalty for exceeding Optimum Time (OT) (Too slow) 0.4 penalty points for every commenced second over OT up to TL 0.4 penalty points for every commenced second over OT up to TL 0.4 penalty points for every commenced second over OT up to TL No penalty Time Limit (TL) (Exceeding = Elimination) Optimum time x 2 10 minutes 26 seconds Optimum time x 2 9 minutes 54 seconds Optimum time x 2 9 minutes 2 seconds No Time Minimum Time Allowed (MTA) 15 seconds the Optimum Time 4 minutes 58 seconds 15 seconds the Optimum Time 4 minutes 42 seconds 15 seconds under the Optimum Time 4 minutes 16 seconds 15 seconds under the Optimum Time 3 minutes 53 seconds Penalty for not achieving OT (Too fast) 0.4 pp per second commenced in excess of MTA 0.4 pp per second commenced in excess of MTA 0.4 pp per second commenced in excess of MTA 0.4 pp per second commenced in excess of MTA Obstacles No. of jumping efforts Range 18 - 25 Range 18 - 25 Range 18 - 25 Range 16 - 25 Actual 22 Actual 23 Actual 22 Actual 19
Layer Overview Objectives Protocols/Mechanisms message Supports network applications, e.g. FTP, SMTP, HTTP, DNS Assumes that socket is box so just pick up the data. Therefore, transport layer should take note of reliability, throughput, delay and security Types of messages exchanged Message syntax Message semantics for when and how applications send & respond to messages segment Process-to-process data transfer e.g., TCP, UDP Data Integrity Reliable data transfer Handle delays/reordering Throughput Security datagram Routing of datagrams from source to destination, Delivers packets to receiving hosts DHCP CIDR RIP NAT IP Fragmentation ICMP
e.g., IP Runs on routers Link-layer frame Data transfer between neighbouring network elements e.g., Ethernet, WiFi Detection Error Correction CRC (Cyclic Redundancy Check) TDMA FDMA ALOHA CSMA MAC Addressing ARP Physical Bits “on the wire” Overview
rdt 2.1 – rdt 2.0 + packet sequence number (1s or 0s) Sender transmits packet sequence number so receiver knows it’s duplicate and can discard. Can handle 1) corrupted ACK; and 2) corrupted packet rdt 2.2 – ACK0/ACK1 instead of ACK/NAK rdt 3.0 – Channel may: 1) Flip bits; 2) Packet loss; 3) Long packet delay; 4) WILL NOT reorder Utilization Formula Pipelining: Go-bank-N GBN Sender GBN Receiver Up to N unacknowledged packets in pipeline (window size N) Insert sequence number in packet header Sliding window tracks unacknowledged packets Timeout for oldest unacknowledged retransmit packet n and all subsequent packets in the window Acknowledge packets that arrive in order only remember expectedSeqNum Discard out-of-order packets and acknowledge last in-order packet “ACKM” means all packets up to M are received Pipelining: Selective Repeat SR Sender SR Receiver Maintains timer for each unacknowledged packet when timeout, retransmit only that packet Individually acknowledges all correctly received packets Buffer out-of-order packets Note: Sender & Receiver window may not always be synchronized sender is unable to proceed until ACK (see below) SR Sender Behaviour SR Receiver Behaviour Data from application layer: If next sequence number available in window, send timeout(n) Resend pkt(n), restart ACK(n) is within window Mark pkt(n) as received If n is the smallest, advance window to next unacknowledged number pkt(n) in forward window Send ACK(n) If out-of-order, buffer If advance window to next packet pkt(n) in rear window [base-N, base-1] ACK(n) otherwise (i.e., pkt too far forward or back) Ignore (can cause window sync problems) Summary Defence Mechanism Problem rdt1.0 rdt2.0 rdt2.1/2.2 rdt3.0 Timeout & retransmission Packet Delay Y Sequence Number Duplicate data Y (1s & 0s) Y (1s & 0s) Acknowledgement Packet Loss/Corruption Y Y Y Checksum Corruption Y Y Y
Part 1: Course Details Division/Department requesting change: CIT Dept/BCIT Division Course developer name and contact information: Jim Bailey Division Dean: Chris Rehn Academic year (e.g., 2018-19) change will take effect: 2018-19 TYPE OF COURSE Lower Division Collegiate Professional/Technical Developmental, numbered below 100 CHANGES TO COURSE Enter Current Course Information (fill out this column completely) Proposed Change type all that apply) Proposed Course Changes Course number: CS260 Course number Course title: Data Structures Course title Credits __ Lecture _4_ Lecture/Lab __ Lab _4_ Total Credits Credit change _2_ Lecture _2_ Lecture/Lab ___ Lab _4_ Total Credits Contact hours per week __ Lecture _8_ Lecture/Lab __ Lab _8_ Total Contact Hours/Week Contact hours per week (see formula below) 1 lecture = 1 contact hour per week 1 lecture/lab = 2 contact hours per week 1 lab = 3 contact per week _2_ Lecture _4_ Lecture/Lab ___ Lab _6_ Total Contact Hours/Week Prerequisites (current) CS162C+ and MTH 111 Prerequisites Prerequisites (proposed) Placement test and code (e.g., 4cpa of 75-120; contact testing for codes) Prerequisite placement Co-requisites Co-requisites Grade option (letter or P/NP): Grade option (letter or P/NP) Grade option (proposed):
Implement the security controls and describe how the controls are employed within the information system and its environment of operation. Assess the security controls using appropriate assessment procedures to determine the extent to which the controls are implemented correctly, operating as intended, and producing the desired outcome with respect to meeting the security requirements for the system. Authorize information system operation on a determination of the risk to organizational operations and assets, individuals, other organizations, and the Nation resulting from the operation of the information system and the decision that this risk is acceptable. Monitor the security controls in the information system on an ongoing basis including assessing control effectiveness, documenting changes to the system or its environment of operation, conducting security impact analyses of the associated changes, and reporting the security state of the system to designated organizational officials. The Contractor will develop a Risk Management Framework Plan that includes processes and procedures to accomplish all of the above steps except Authorize. The Authorize step will be completed for each Task Order by the Ordering Activity. The Risk Management Framework Plan will be a post-award contract deliverable (see Section F.6). C.2.1.5 Climate Change Risk and Mitigation GSA has a leading role in ensuring that the Federal Government is better prepared to cope with the consequences of climate change that present many serious for government operations. These risks include damage to facilities and equipment and disruptions to communications networks. Climate change risk and mitigation shall be considered in the design and operations of services to be provided under this contract. The Contractor shall incorporate climate change adaptation strategies into programs to reduce property, infrastructure, and supply chain vulnerabilities. This includes identifying mission critical facilities, products and services, evaluating business operations and supply chains that may be vulnerable and anticipating needs that may arise from climate change.
Years 1 and 6 only. Do not include travel or shipping in CLIN 110001. 110001a-1 thru 110001a-11 FAR 52.217-8 (6 Month Extension) Satellite Communications Terminal and Equipment (Labor) Contractors shall provide pricing for the following labor associated with CLIN 110001: Yrs 1 & 6: Provide Integration, Testing, and Installation labor costs for all equipment provided in CLIN 110001. Yrs 2-5, 7-10 + 6-month extension: Provide labor costs for services to support operations and maintenance for equipment provided in CLIN 110001. Do not include travel, shipping or equipment in CLIN 110001a. 110001b-1 thru 110001b-11 FAR 52.217-8 (6 Month Extension) Satellite Communications Terminal and Equipment (Spares/Warranty) Contractors shall provide pricing for spares and warranty to support operations and maintenance for all equipment provided in CLIN 110001. This includes management (labor) for spares and warranty activities. Do not include travel or shipping in CLIN 110001b. 110002-1 thru 110002-11 FAR 52.217-8 (6 Month Extension) Program Management Contractors shall provide pricing for labor related to the following: Start-up labor costs, contract initiation, information assurance costs and system engineering costs proposed throughout the contract lifecycle (5-year base period, plus the two option periods and the 6-month extension), system documentation, configuration management documentation and system O&M Manuals. Additionally, any other program management related labor required for the Contractor’s solution should be included in CLIN 110002. Do not include travel or equipment in CLIN 110002. 110003-1 thru 110003-11 Space Segment Contractors shall provide bandwidth. Contractors shall of bandwidth (MHz) proposed description (entitled
In any academic community, certain standards and ethical behavior are required to ensure the unhindered pursuit of knowledge and the free exchange of ideas. Academic honesty means that you respect the right of other individuals to express their views and opinions, and that you, as a student, not engage in plagiarism, cheating, illegal access, misuse or destruction of college property, or falsification of college records or academic work. As a member of the Kennesaw State University academic community you are expected to adhere to these ethical standards. You are expected to read, understand and follow the code of conduct as outlined in the KSU graduate and undergraduate catalogs. You need to be aware that if you are found guilty of violating these standards you will be subject to certain penalties as outlined in the college judiciary procedures. These penalties include permanent expulsion from KSU. Read the Academic Honesty Statement and then sign and date in the space below. You are required to abide by these ethical standards while you are a student at KSU. Your signature indicates that you understand the ethical standards expected of you in this academic community, and that you understand the consequences of violating these standards. Your signature also indicates that you have read the syllabus and attended the course introduction and that you fully understand the policies and expectations of this specific course. CS3501 (Section____) _____ ___ Dr. Clincy _________ ______________ Course Name Professors Names Print Name Student ID Number Signature Date (Please fill-out, sign and turn-in this page to the Professor at the beginning of the semester – the Professor will not issue grades until this page is received from the student)
G.5.1.1.7 City – City of the Ordering Activity. G.5.1.1.8 State – State of the Ordering Activity in abbreviated format (e.g. AK, VA, MD). G.5.1.1.9 Zip Code – Zip Code of the Ordering Activity. G.5.1.1.10 Contracting Officer Name – First and Last name of the Contracting Officer that issued the order. G.5.1.1.11 Contracting Officer Phone Number – Phone number of the Contracting Officer that issued the order. Format (xxx) xxx-xxxx. G.5.1.1.12 Contracting Officer Email – Email address of the Contracting Officer that issued the order. G.5.1.1.13 Date of Order – The date the order or modification is signed by the Contracting Officer. G.5.1.1.14 Order Number – The order number assigned by the Ordering Activity. G.5.1.1.15 Modification Number – The modification number assigned by the Ordering Activity. G.5.1.1.16 Description of Services – A brief description of the equipment and/or services. G.5.1.1.17 Period of Performance Start Date – The actual date the service is scheduled to begin. This should be identified within the Task Order. Do not report option periods unless exercised by the Ordering Activity. G.5.1.1.18 Period of Performance End Date – The actual date the service is scheduled to end. This should be identified within the Task Do not report option periods unless exercised by the Ordering Activity. G.5.1.1.19 Total Order Value – Total dollar amount awarded/obligated on the Task Order, not including options. G.5.1.1.20 Total Sales this Month – Cumulative total value of Task Orders for this month.
SATCOM 101 Inc – CS3 MBVSR – Dec 2017 The Contractor shall also post copies of each Task Order received during the reporting period to the GSA SATCOM Report Portal on the 15th calendar day of each month. G.5.2 Monthly Revenue Report The Contractor shall provide a Monthly Revenue Report (MRR) using the format specified in Section J, Attachment J-6, in Microsoft Excel 2007 format on the 15th calendar day of each month. The Report shall be remitted to GSA via the GSA SATCOM Report Portal. The report shall provide detail relating back to individual Task Orders that have been invoiced by the Contractor and paid by the Ordering Agency. G.5.2.1 The monthly revenue report shall contain, at a minimum, the following information: G.5.2.1.1 Title – “CS3 Monthly Revenue Report” G.5.2.1.2 Reporting Period – The monthly reporting period in which invoices were received. Usually from 1st day of the month through the last day of the month. For each invoice payment: G.5.2.1.3 Vendor Name – Company name G.5.2.1.4 Contract Number – GSA CS3 Contract Number G.5.2.1.5 Task Order Number – The order number assigned by the Ordering Activity. G.5.2.1.6 Date Payment Received – Date the payment is received by the Contractor from the Ordering Agency. This may be in the form of a check or electronic funds transfer. G.5.2.1.7 Agency Name – Name of the Agency that received the products or services. G.5.2.1.8 Total Order Value – Total dollar amount awarded/obligated on the task order, not including options.
3.2.6.1 The high-speed Internet Quality of Service minimum requirement is 128 kbps per computer on the network. 3.2.6.2 The VoIP Quality of Service minimum requirement is 32 kbps per VoIP phone. 3.2.6.3 The video teleconferencing Quality of Service minimum requirement is 128 kbps per conference room. 3.2.6.4 The PoS Quality of Service minimum requirement is a rapid (4-6 seconds) satellite transmission of data, voice and video to and from PoS locations on the base to a credit card network for authorization of a transaction. 3.2.6.5 The cellular telephone service minimum requirement is measured by the grade of service (GoS), which measures the ratio of unsuccessful calls to total calls attempted. For the cellular circuit, the minimum requirement for the GoS is 0.02. This means that two users of the circuit group out of a hundred will encounter a call refusal during peak traffic periods. 3.2.6.6 The Offeror shall provide all infrastructure and communications services requirements to support wired and wireless Internet, VoIP, telephone, video teleconference, and PoS service as described in Table 1 below. The Offeror shall ensure that the VoIP telephones are compatible with the VoIP service. Table 1. Infrastructure and Communications Services Requirements Building Description Qty Communication Service Requirement Offices (A) Two-Story building; 100 desks per building; 10 conference rooms per building 5 Wired Local Area Network (LAN) with high-speed Internet access for offices in each building The LAN shall also provide VoIP telephone service with voicemail. 100 individual desks per building, each require a computer and telephone 10 conference rooms per building that provide 12 wired LAN ports each and must support video teleconferences Junior Enlisted Barracks (B) Two-Story building; 100 private rooms occupied by two persons; two phones per room 5 High-speed wired Internet access (Individual billing for private high-speed Internet service) Local and long-distance telephone service (Individual billing for telephone service)
ID/IQ Indefinite Delivery/Indefinite Quantity IFB Invitation For Bid IGCE Independent Government Cost Estimate IP Internet Protocol Invoicing, Receipt, Acceptance, and Property Transfer ISAC Information Sharing and Analysis Center ISO International Organization for Standardization ISR Individual Subcontracting Report IT Information Technology ITAR International Traffic in Arms Regulations ITS Information Technology Services JPAS Joint Personnel Adjudication System JPEG Photographic Experts Group JTR Joint Travel Regulations Kps Kilobits per second LAN Local Area Network LORA of Repair Analysis LPTA Lowest Price Technically Acceptable M2M Machine-to-Machine MBI Moderate Background Investigation MBPS Megabits Per Second MBVSR Monthly Business Volume (Sales) Report MHz Megahertz Mil-Std Military Standard MOA Memorandum of Agreement MRG Minimum Revenue Guarantee MRR Monthly Revenue Report MTBF Mean Time Between Failure MTTR Mean Time to Repair NAICS North American Industry Classification System NASA National Aeronautics and Administration NATO North Atlantic Treaty Organization NIPRNET Non-Secure Internet Protocol Router Network NISPOM National Industry Security Program Operating Manual NIST National Institute of Standards and Technology NIST SP National Institute of Standards and Technology Special Publication NOC Network Operations Center NPV Net Present NSA National Security Agency OCO Ordering Contracting Officer OCONUS Outside the Contiguous United States OMB Office of Management and Budget Operations Security OSBU Office of Business Utilization PCO Procuring Contracting Officer
Charles P. Pfleeger, Lawrence Pfleeger, "", Prentice Hall, 4th edition. Charlie Kaufman, Radia Perlman, Mike Speciner, "", Prentice Hall, 2nd edition. Matt Bishop, "", Addison-Wesleyl. Richard E. Smith, "", Jones&Bartlet Learning. Syllabus (Tentative) This is a tentative list of topics, subject to modification and reorganization. Introduction to computer security Computer Security Concepts Threats, Attacks, and Assets Computer Security Technology and Principles Cryptographic Tools User Authentication Access Control Database and Cloud Security Malicious Software Denial-of-Service Attacks Intrusion Detection Firewalls and Intrusion Prevention Systems Software Security and Trusted Systems Buffer Overflow Software Security Operating System Security Trusted Computing and Multilevel Security Management Issues Security Management and Risk Assessment Human Resources Security Legal and Ethical Aspects Cryptographic Algorithms Symmetric Encryption and Message Confidentiality Public-Key Cryptography and Message Authentication Network Security Internet Security Protocols and Standards Internet Authentication Applications Wireless Network Security Organization All course materials will be posted at the WebCampus.
5 Class & Object proprieties Basic concepts of java programming – advantages of java 6 Class & Object proprieties byte-code & JVM, data types, access specifiers, operators 7 Class & Object proprieties control statements & loops, array 8 Class & Object proprieties creation of class, object, constructor, finalize and garbage collection 9 Class & Object proprieties use of method overloading, this keyword, 10 Class & Object proprieties use of objects as parameter & methods returning objects, call by value & call by reference 11 Class & Object proprieties static variables & methods, garbage collection, nested & inner classes 12 Class & Object proprieties String (discuss charAt() ,compareTo(), equals(), equalsIgnoreCase(), indexOf(), length() , substring(), toCharArray() , toLowerCase(), toString(), toUpperCase() , trim() , valueOf() methods) 13 Class & Object proprieties StringBuffer classes (discuss append(), capacity(), charAt(), delete(), deleteCharAt(), ensureCapacity(), getChars(), indexOf(), insert(), length(), setCharAt(), setLength(), substring(), toString() methods) concept of mutable and immutable string, command line arguments, 14 Class & Object proprieties concept of mutable and immutable string, command line arguments 15 Reusability properties Super class & subclasses including multilevel hierarchy 16 Reusability properties Super class & subclasses including multilevel hierarchy, process of constructor calling in inheritance 17 Reusability properties process of constructor calling in inheritance 18 Reusability properties process of constructor calling in inheritance 19 Reusability properties use of super and final keywords with super() method 20 Reusability properties dynamic method dispatch 21 Reusability properties use of abstract classes & methods
22 Reusability properties interfaces 23 Reusability properties Creation of packages 24 Reusability properties importing packages 25 Reusability properties member access for packages 26 Exception handling & Multithreading Exception handling basics, different types of exception classes 27 Exception handling & Multithreading use of try & catch with throw 28 Exception handling & Multithreading throws & finally, creation of user defined exception classes 29 Exception handling & Multithreading Basics of multithreading, main thread 30 Exception handling & Multithreading thread life cycle, creation of multiple threads 31 Exception handling & Multithreading thread priorities 32 Exception handling & Multithreading thread synchronization, inter-thread communication, deadlocks for threads, suspending & resuming threads 33 Applet Programming Basics of applet programming, difference between application & applet programming, 34 Applet Programming applet life 35 Applet Programming parameter passing in applets ,concept of delegation event model and listener 36 Applet Programming I/O in applets, use of repaint(), creation of buttons & text fields 37 Applet Programming creation of buttons & text fields
OneR? J4.8? …? … … … … … [40 points] Summary of Classification Experiments in Python. Use 10-fold At most 2/3 page. Tech. Guiding questions Parameters & Pruning Accuracy, Precision, Recall, ROC Area Time to build model Size of Interesting patterns in the model Analysis & observations about experiment You can add other columns ZeroR? OneR? Decision tres? …? 1? 2? 3? … … … … … [20 points] Summary of Weka and Python Classification Results, Analysis, Discussion, and Visualizations (at most 1/3 page) 1. Analyze the effect of varying parameters/experimental settings on the results. 2. Analyze the results from the point of view of the dataset domain, and discuss the answers that the experiments provided to your guiding questions. 3. Include (a part of) the best classification model obtained. process Post-
[10 points] Three Guiding Questions for the Regression Experiments: (at most 1/3 page) … … … [40 points] Summary of Regression Experiments in Weka. Use 10-fold At most 2/3 page. Tech. Guiding questions Parameters & Pruning Correlation Coefficient and Metric(s) Time to build model Size of model Interesting patterns in the model Salient observations about experiment You can add other columns ZeroR? Linear regr? Regr. Model trees? 1? 2? 3? Specify what metric(s) you use here … … … [40 points] Summary of Regression Experiments in Python. Use 10-fold cross-validation. At most 2/3 page. Tech. Guiding questions Parameters process & Pruning Correlation Coefficient and Error Metric(s) Time to build model Size of model Interesting patterns in the model Salient observations about experiment You can add other columns ZeroR? Linear 1? 2? 3? Specify what
[40 points] Summary of Experiments with Partitional Clustering (k-means). At most 1 page total, including the guiding questions above. Tool # clusters Distance function # iterations SSE % of instances per cluster Observations about experiment Observations about visualization Interpretation of centroids Classes to cluster evaluation? You can add columns or remove this one P1 Weka? Python? P2 … P3 … … … … … … …
Topic: _________________________________________________ <at most 1 page> Description of the particular problem within the selected data mining topic to be addressed in this project: Description of the approach used in this project to tackle the above problem: Dataset Name: Where found: Dataset Description: Initial data preprocessing, if any: Three Guiding Questions about the dataset domain: … … … Summary of Experiments. At most 2 page. Tool Mining Technique Results … Results Time taken Evaluation Observations about experiment You can add
Discussion Grading Rubric Graded discussion periods are scheduled weekly, so please check the calendar to find out the due dates for each posting. They are moderated by your facilitator and are graded. Your facilitator may allow you to continue to post after that time but it will not be monitored and those additional postings will not count toward your discussion grade. You’re certainly welcome to continue a discussion past the grading period, but that additional posted material will not affect your discussion grade. The discussion grading rubric below is the guide we use to evaluate your discussion contributions. You will receive a grade and feedback for each of the chapter threads. There are also general discussions boards, which are not graded, for you to use to discuss any topics with your classmates and facilitators. Please refer to the discussion rubric and netiquette pages before you participate. Criteria 65-69 70-79 80-89 90-94 95-100 Participation Very limited participation Participation generally lacks frequency or relevance Reasonably useful relevant participation during the discussion period Frequently relevant and consistent participation throughout the discussion period Continually relevant and consistent participation throughout the discussion period Community Mostly indifferent to discussion Little effort to keep discussions or provide help Reasonable effort to respond thoughtfully, provide help, and/or keep discussions going Often responds thoughtfully, in a way that frequently keeps discussions going and provides help Continually responds thoughtfully in a way that consistently keeps discussions going and provides help Content No useful, or interesting information, ideas or analysis Hardly any useful, or interesting information, ideas or analysis Reasonably useful, and interesting information, ideas and/or analysis Frequently useful, and interesting information, ideas and analysis Exceptionally useful, and interesting information, ideas and analysis Reflection and Synthesis No significant effort to clarify, summarize or synthesize topics raised in discussions Contributes to group's effort to clarify, summarize or synthesize topics raised in discussions Leads group's effort to clarify, summarize or synthesize topics raised in discussions Quiz Instructions Accessing the Quiz topic,
derive expressions for πjs and Pjks, using the standard maximization procedure through Lagrange multipliers. Also give expressions for E(zij)s. (4+3+3=10) M-step calculations Applying constraint (1)
Use the expressions obtained in a. to find the alignment probabilities for a given parallel corpora of entities. That is, given, E1, E2, E3, …, ES in correspondence with F1, F2, F3, …, FT (Eis and Fjs can, for example, be words in two languages) the probability of mapping Ei with Fj has to be found. (10) Consider the S words E1, E2, E3, …, ES as S sources. Let U be the set of unique words from F1, F2, F3, …, FT The problem is now that of S sources each of which takes from U possible values. Thus the probability values are pjk following the same procedure as in a. Use the expressions in a. to derive the formulae of Baum-Welch algorithm for training an HMM. (10) In this case, the output sequence of length N takes the place of X. If there are M arcs in the HMM, they take the place of M sources. If there are K alphabets, they take the place of K outcomes. And pjks give the required probability values. zijs act like indicator variables. Do as directed: If you close your nose and try to pronounce the following words, how will they sound to the listener? Explain (no marks without the explanation; also no marks for unclear and long winded answer): Sing, Finger, Tinted, Gambit, Laundry, Pamper, Sanjay, Kandahar, Chanchal, Panther (10 X 1= 10)