Hello, dear friend, you can consult us at any time if you have any questions, add : ECE3700J Introduction to Computer Organization Lab 1 RISC-V Assembly Instructions Purpose This lab is intended to help you have a better understanding of the RISC-V assembly instructions, and get familiarized with Ripes which is a visual computer architecture simulator and assembler built for the RISC-V instruction set architecture. Tasks 1. Read Ripes Introduction at https://github.com/mortbopet/Ripes/blob/master/docs/introduction.md to learn about the software. Learn more information about Ripes at the wiki page. Everything else about the software can be found at https://github.com/mortbopet/Ripes. 2. Download and install Ripes simulator on your computer. You can find the latest release that suits your operating system on your computer at https://github.com/mortbopet/Ripes/releases. Play with the software and get familiarized with the software environment. 3. Learn RISC-V assembly syntax at https://github.com/riscv-non-isa/riscv-asm-manual/blob/master/riscv-asm.md. In the software, load example assembly files and learn from the example code. 4. Write a short assembly program. Create a string of characters of your choice in the .data segment of memory using .string directive. Then copy the string to a different memory section starting at address 0x10000100. Click the Select Processor button on the upper left corner, and select 32-bit Single-cycle processor to debug your program. Deliverables This is a 1-week lab. This lab is not counted towards the lab grade. 1) Demonstrate your program to the TAs before your lab session ends. Go through the program step by step and show corresponding changes in the registers and memory. 2) Upload the source file(s) on Canvas by 22:00 pm, May 25, 2024. This is an individual assignment. Your work must be submitted electronically to Canvas before the specified due date.
ADAD9311 Designing the Experience Exhibitions and Beyond Assessment 01 ASSESSMENT SUMMARY: Title: Developing exhibition content (with analysis of its context) Weight: 40% Assessment Type: Design Studio Work Submission Requirements: Group Work: No Where to Submit: Turnitin (Moodle) Due: Week 5 Assessment Description and feedback process: The practice of exhibition design is a highly engaging and often ephemeral experiential format, that has evolved to become an integral part of our sociocultural activity. Contemporary exhibition design builds on thousands of years of human experience in creative storytelling through art, the display of meaningful objects, and the shaping of spaces for contemplation, focused attention, and heightened experience. Every decision in an exhibition design is informed by this history – whether we are aware of it or not. The changing paradigms and models of display embody, perform, and reinforce different ways of knowing and understanding the world, as well as how knowledge is conceived. They also represent the semantics of these epistemologies—how their creators choose to represent and communicate knowledge and power. Informed by display paradigms discussed in class, this assessment task asks you to ideate the concept and curate the content for a small exhibition to be held in a Sydney-based cultural institution. With consideration to the structure, sequencing, and display of works, you will devise and design a range of texts that support your exhibition ideas. Feedback will be provided on a regular basis through discussion with peers and your tutor. Summative assessment and feedback on this assessment task will be provided digitally. How to complete this assessment: Exhibitions are a highly structured visual communication medium. Central to every exhibition is an interpretation plan and approach for how the content and complexity of information is to be communicated. For this assessment you will develop a curatorial concept for a Sydney-based institution, exploring its identity and relevant precedents as well as analysing and proposing display strategies fitting for your exhibition. For this assessment you will develop a curatorial concept as well as explore and analyse display strategies, precedents, and institutional identities. In response to the historic and contemporary display paradigms presented in class you will also apply insights and provide context to those employed or referenced (invoked or subverted) within your exhibition. Your project report will showcase a range of descriptive and interpretive texts that communicate the scope and stories of your exhibition to a range of audiences, incorporating both practical and thematic information. Steps to follow: 1. Select a Venue: Choose one of the following venues for your exhibition: • The Australia Museum • Elizabeth Bay House or Vaucluse House • The Powerhouse Museum • Firstdraft • White Rabbit Gallery • Australian Design Centre 2. Curate Content Research and select 8-12 artworks, objects, or design projects for inclusion in an exhibition to be featured at the selected venue. The ideas communicated in the exhibition and the format underpinning it should be your original concept. Artworks or artefacts can be sourced from anywhere; however, you are encouraged to review the collections of a cultural institutions both within Australia and Internationally to help determine the exhibition content. 3. Consider the Experience Design the format, structure and sequence of your exhibition and identify key display paradigms to employ or reference in the exhibition space. 4. Craft the Communication Methods Produce the following texts that communicate your exhibition scope and stories: • Exhibition Concept Precis – including curatorial rationale, analysis of institutional identity, approach to display and narrative strategy • Object list (for curators/conservators/designers etc) • Exhibition text example (found in the exhibition) Choose from an introductory panel; theme panel; or, extended object label for an object/artwork • Short/standard object labels for all objects/artworks] • Audience feedback document • Formal essay (1000 words – academic writing with references) responding to the question: Which display paradigms were employed in the design/curation of your proposed exhibition? With reference to your chosen venue’s identity and the historic and contemporary display paradigms addressed in class, consider how and why your exhibition employs, invokes or subverts these exhibition- making conventions and techniques. With the exhibition texts, ensure you have considered: • Institutional context • Graphic design (font, size, colour, materiality) • Physical context (location and installation method) • Audience context (adjustments specific to target audiences incl. content, readability, accessibility) It is important to consider both the hierarchy and clarity of information conveyed within the texts as well as the layout of the texts themselves. Decisions on graphic design elements such as font selection, text size and formatting and the relationship between text and visuals are critical to clear communication of your exhibition ideas and the significant objects and stories contained within it. Interactive prompts or technology-based communication methods can be represented. You may wish to include mockups for QR codes, or show how an online audience survey would appear to the user, or an idea for audience information that uses mobile devices. Note: a visual representation of the format is sufficient; you do not need to do the programming. Course Learning Outcomes being assessed in this task: 1. Apply research methods to inform. a response to the requirements of a design brief 2. Examine and critically analyse the relationship between key stakeholders 3. Demonstrate design practice as an interdisciplinary and collaborative process Submission Requirements: Electronic Submission: Please submit your design project to Turnitin (Moodle) as an optimized pdf file by 11.55pm AEDST on day of scheduled class in Week 5. Your pdf file must be under 40mb. Please use the following naming protocol: zXXXXXXX _surname_firstname_ADAD9311_task01.pdf Please ensure that your submission is properly submitted and not left in draft form. Note: it is critical that you maintain documentation of all your research, experimentation and iteration including images from your analogue process journal. Be prepared to share versions or elements of this throughout the course. It is also important to actively engage, participate and contribute to group and individual activities.
COMP5618 - Applied Cybersecurity S2 2024 Assignment 2 Due: Sunday the 13th of October, 2024 23:59 Assignment worth-15%of your final mark This is an individual assignment Task Introduction You are given access to two vulnerable images on the Hack the Box platform, named Rental and Invalidated,for the COMP5618 Assignment dedicated lab. Rental is a Linux machine that features an Apache server hosting the Car Rental Management System application.Research reveals that suffers from SQL injection and Arbitrary File Upload vulnerabilities.The SQL injection vulnerability is leveraged in order to gain access to the administrative panel,upload PHP code and gain a reverse shell.Post-exploitation enumeration reveals a set of credentials for the MySQL database,which is running in the context of the manager user.The database user is found to have FILE privileges,which is used to read the Bash history file of the service user.The history file contains the user's password passed over the command line,allowing us to move laterally.Examination of sudo permissions reveals that the user can execute htop as root.Through the htop command,a script. running in the context of root is identified,and the environmental variables of the process can be read.The environmental variables of the script contain the root password. Invalidated is a business logic machine that showcases how improper input validation can lead to authentication bypass and SQL injection.The former can be achieved through sending an empty({})JSON request to sign in on the platform, this results in the first user being returned,in this case being the admin user.Next it is possible to exploit SQL injection through the JSON parameter names. The Report You need to complete the 10 questions for the Rental image and obtain the root flag on the Hack the Box platform.Your report should include detailed steps with supporting snapshots,covering Enumeration,Foothold,SQL Injection,Arbitrary File Upload,Lateral Movement,and Privilege Escalation,along with the answers to the questions and the flags.Additionally,provide recommendations for addressing the discovered vulnerabilities,supported by proper references. For the Invalidated image,you should answer the five questions and capture both the user and root flags on the Hack the Box platform.Your report should detail the steps with supporting snapshots,including Enumeration,SQL Injection,and JSON Sign-In Requests,as well as the answers to the questions and the flags.Also,discuss the recommended steps for mitigating the found vulnerabilities,with appropriate references. Submission Details Your report is due by 23:59 Sunday 13th of October. Please submit your report in the“Assignment”section of Canvas. Allowed submission format is PDF only.(not DOCX). Questions and flags must be answered in the HTB platform. A video should be submitted,demonstrating vour conducted steps.Your username should appear in the recording.The recording should be up to 10 minutes MAX. Late submissions will be penalised according to the late submission policy. Plagiarism will not be tolerated and your assignment will be submitted to a plagiarism checking service. Marking Your report is worth 15%of your overall grade for the course. ● Answering Questions and Capturing Flags (10 points total): o You will receive 0.5 points for each correctly answered question/flag,up to a total of 19 questions/flags on the HTB platform.Each answer must be both demonstrated and explained in your report,clearly outlining the steps you followed,the objective of each step,and the results you obtained.Additionally, a video demonstration (showing your username)is required to showcase the conducted steps(no explanation is needed in the video,only the execution of commands/steps).If either the video or the report is missing,your answers will NOT be accepted. ● Recommendations (3 points total): o You will receive 0.5 points for each relevant recommendation provided for the discovered vulnerabilities.You must provide three recommendations for each box.Each recommendation must be clearly explained and supported in your report,with proper referencing. ● Report Structure(2 points total) o You will be marked based on the report structure,cover page,organization, references and English grammar. Your report will be marked according to the following rubric,the maximum score is 15 marks. Novice Competent Proficient Answering questions and capturing flags. 0:No important issues identified or described. 1-5(0.5 each question/flag):up to 10 questions/flags were answered and explained in the report and demonstrated in the video. 7-10(0.5 each question/flag):more than 10 and up to 20 questions/flags were answered and explained in the report and demonstrated in Recommendations 0:Recommendations are missing,irrelevant or ineffective. 1-2(0.5 each recommendation):Up to4 relevant recommendations are listed explained. 2 30.5 ach recommendation): more than 4 and up to 6 related recommendations are Report Structure 0:Report structure is unorganised and difficult to read. 1:Report conveys Information effectively but lacks professionalism. listed Rnd explained professional and well written.i.e.,Well formatted and presented.No English or grammar mistakes.
ECE5550: Applied Kalman Filtering STATE-SPACE DYNAMIC SYSTEMS 2.1: Introduction to state-space systems ■ Representation of the dynamics of an nth-order system as a first-order differential equation in an n-vector called the state. ➠ n first-order equations. ■ Classic example: Second-order equation of motion. ■ Define a (non-unique) state vector (note that x˙(t) = dx(t)/dt, etc.) ■ We can write this as x˙(t) = Ax(t) + Bu(t), where A and B are constant matrices. ■ Complete the model by computing z(t) = Cx(t) + Du(t), where C and D are constant matrices. ■ Fundamental form. for deterministic, time-invariant, continuous-time linear state-space model: x˙(t) = Ax(t) + Bu(t) z(t) = Cx(t) + Du(t), where u(t) is input, x(t) is the state, A, B, C, D are constant matrices. • Systems with noise inputs are considered in notes chapter 3. • Time-varying systems have A, B, C, D that change with time. DEFINITION: The state of a system at time t0 is a minimum amount of information at t0 that, together with the input u(t), t ≥ t0, uniquely determines the behavior. of the system for all t ≥ t0. ■ State variables provide access to what is going on inside the system. ■ Convenient way to express equations of motion. ■ Matrix format great for computers. ■ Allows new analysis and synthesis tools. SIMULATING IN SIMULINK: To investigate state-space systems, we can simulate them in Simulink. The block diagram below gives explicit access to the state and other internal signals. It is a direct implementation of the transfer function above, and the initial state may be set by setting the initial integrator values. Example: The nearly constant position (NCP) model ■ Consider a relatively immobile object that we would like to track using a Kalman filter. ■ It gets bumped around by unknown forces. ■ We let our model state be where ξ(t) is the x-coordinate and η(t) is the y-coordinate of position. ■ Our model’s state equation is then x˙(t) = 0x(t) + w(t), where w(t) is a random process-noise input (unlike known u(t)). ■ One possible output equation is z(t) = x(t) + v(t), where v(t) is a random sensor-noise input. ■ A possible Simulink implementation and output trajectory: Example: The nearly constant velocity (NCV) model ■ Another model we might consider is that of an object with momentum. ■ The velocity is nearly constant, but gets perturbed by external forces. ■ We let our model state be ■ Our model’s state equation is then ■ One possible output equation is ■ A possible Simulink implementation and output trajectory: Example: The coordinated turn model ■ A third model considers an object moving in a 2D plane with constant speed and angular rate Ω where Ω> 0 is counter-clockwise motion and Ω < 0 is clockwise motion. ξ (¨ t) = −Ωη(˙ t) and η(¨ t) = Ωξ (˙ t), ■ We again let our model state be ■ Our model’s state equation is then ■ One possible output equation is ■ A possible Simulink implementation and output trajectory: 2.2: Time (dynamic) response ■ Develop more insight into the system response by looking at time-domain solution for x(t). Homogeneous part ■ Start with x˙(t) = Ax(t) and some initial state x(0). ■ Take Laplace transform. X(s) = (s I − A) −1 x(0). ■ So, we have: x(t) = L −1 [(s I − A) −1 ]x(0). But, so, ■ e At : “Transition matrix” or “state-transition matrix.” ■ In MATLAB, x = expm(A*t)*x0; ■ e (A+B)t = e Ate Bt iff AB = B A. (i.e., not in general). ■ Will say more about e At when we discuss the structure of A. ■ Computation of e At = L −1 [(s I − A) −1 ] straightforward for 2 × 2. EXAMPLE: Find e At when ■ Solve ■ This is the best way to find e At if A 2 × 2. Forced solution ■ Where did this come from? ■ Clearly, if z(t) = Cx(t) + Du(t), More on the matrix exponential ■ Have seen the key role of e At in the solution for x(t). Impacts the system response, but need more insight. ■ Consider what happens if the matrix A is diagonalizable, that is, there exists a matrix T such that T −1AT = 3 =diagonal. Then, and ■ Much simpler form. for the exponential, but how to find T, 3? ■ Write T −1AT = 3 as T −1A = 3 T −1 with wTi A = λiwi T , so wi is a left eigenvector of A and note that wi T v j = δi,j . ■ How does this help? ■ Very simple form, which can be used to develop intuition about dynamic response ≈ e λi t . ■ Trajectory can be expressed as a linear combination of modes: vie λi t . ■ Left eigenvectors decompose x(0) into modal coordinates wi T x(0). ■ e λi t propagates mode forward in time. Stability? ■ vi corresponds to “relative phasing” of state’s part of the response. EXAMPLE: Let’s consider a specific system x˙(t) = Ax(t) z(t) = Cx(t), with x(t) ∈ R 16×1 , z(t) ∈ R (16-state, single output). ■ A lightly damped system. ■ Typical output to initial conditions are shown: ■ Waveform. is very complicated. Looks almost random. ■ However, the solution can be decomposed into much simpler modal components. 2.3: Discrete-time state-space systems ■ Computer monitoring of real-time systems requires analog-to-digital (A2D) and digital-to-analog (D2A) conversion. ■ Discrete-time systems can also be represented in state-space form. xk+1 = Ad xk + Bduk zk = Cd xk + Dduk. ■ The subscript. “d” is used here to emphasize that, in general, the “A”, “B”, “C” and “D” matrices are different for discrete-time and continuous-time systems, even if the underlying plant is the same. ■ I will usually drop the “d” and expect you to interpret the system from its context. Time (dynamic) response ■ The full solution, found by induction from xk+1 = Axk + Buk, is ■ Clearly, if zk = Cxk + Duk, Converting plant dynamics to discrete time. ■ Combine the dynamics of the zero-order hold and the plant. ■ The continuous-time dynamics of the plant are: x˙(t) = Ax(t) + Bu(t) z(t) = Cx(t) + Du(t). ■ Evaluate x(t) at discrete times. Recall ■ With malice aforethought, break up the integral into two pieces. The first piece will become Ad times x(kT ). The second part will become Bd times u(kT). ■ In the remaining integral, note that u(τ ) is constant from kT to (k + 1)T, and equal to u(kT ). ■ So, we let σ = (k + 1)T − τ ; τ = (k + 1)T − σ ; dτ = −dσ . ■ So, we have a discrete-time state-space representation from the continuous-time representation xk+1 = Ad xk + Bduk where ■ Similarly, zk = Cxk + Duk. • That is, Cd = C; Dd = D. Calculating Ad, Bd, Cd and Dd ■ Cd and Dd require no calculation since Cd = C and Dd = D. ■ Ad is calculated via the matrix exponential Ad = e AT . This is different from taking the exponential of each element in AT . ■ If MATLAB is handy, you can type in Ad=expm(A*T) ■ If MATLAB is not handy, then you need to work a little harder. Recall from earlier that e At = L −1 [(s I − A) −1 ]. So, which is probably the “easiest” way to work it out by hand. ■ Now we focus on computing Bd. Recall that ■ If A is invertible, this method works nicely; otherwise, we will need to perform. the integral. ■ Also, in MATLAB, [Ad,Bd]=c2d(A,B,T)
CP1402 Assignment - Networking Case Study Due Sunday of Week [email protected] Introduction This case study has been divided into three (3) components. You are to design a network, research and source appropriate devices justifying choices (feasibility, efficiency, etc.), subnet the network, and assign IP addresses to the appropriate devices. Deliverables 1. A SINGLE pdf (.pdf) – containing all parts Assignment breakdown Scenario grandData Inc., an Australian data analytics company, has asked you to assess and redesign their network. They are opening a new branch in Sapporo, which will require new equipment. They have existing contracts and hardware to maintain fibre-optic leased line WAN links between sites. PART 1 - Network diagram PART 2 - Subnet the network and assign IP addresses to the appropriate devices PART 3 - Research and source appropriate devices justifying choices (feasibility, efficiency, etc.) with a Weighted Scoring Model (WSM) PART 1 - Network specifications and diagram Network Specifications You have been given a rough sketch of the network topology below. You are to draw the network using draw.io (https://app.diagrams.net/), subnet the network (see Part 2), and assign port numbers and IP addresses to ports. Also, label the networks and devices. Network Structure Hardware • Only include one switch in your diagram for each LAN or WLAN (even if more are required). • Servers are to be on their own LAN. • The Internet router port address is 199.202.35.1/30. • The Sydney router is connected to the Internet and provides access to the public backbone, which contains a mail server, a web server, and a database server. PART 2 - Subnet the network using VLSM and assign IP addresses to the appropriate devices. Each location has the following number of hosts Location Workstations WLAN addresses Sydney 1020 80 Dunedin 450 Copenhagen 900 Mumbai 480 Kuala Lumpur 252 Sapporo 150 100 Use VLSM to subnet the network topology using a public class B network. You are to use the table format below to provide the subnet details. Table 1. Subnets (including WAN subnets) Spreadsheet Columns: Subnet name, subnet address, subnet mask (in slash format ONLY), first useable address, last useable address, broadcast address, static address range and DHCP address range (all addresses to be in dotted decimal notation) Table 2. Router Interfaces Spreadsheet Columns: Location, interface, IP address, subnet mask (in slash format ONLY) Table 3. Servers Spreadsheet Columns: Location, server name, IP address, subnet mask (in slash format ONLY) Additional requirements: • Choose one public B class network address for the entire network and subnet this block of addresses to optimise spare addresses for future expansion. • Place the WAN subnets in the blocks directly following the LAN/WLAN address space (i.e., finish putting all the LAN/WLAN subnets in the table first, then follows by the WAN subnets). • ADD 100% to each subnet to allow for growth in the number of hosts specified for each LAN (i.e., workstations × 2). o DO NOT ALLOW for any growth in the number of servers or size of WLANs. • DHCP will to be used for IP address allocation for hosts in each subnet and these ranges are to be allocated for each LAN. • Static IP addresses are to be allocated where appropriate: router interfaces and servers. • The ISP has given us an IP address of 199.202.35.1/30 for our Internet connection at Brisbane. Note: this address is part of the ISP’s network, and is NOT involved in subnetting for the corporate network. PART 3 - Research and source appropriate devices justifying choices (feasibility, efficiency, etc.) You are to research and submit a project procurement plan for the Sapporo network. The devices you must include are routers, switches, and wireless access points. Make sure the devices you select can handle the number of workstations required and provide a good quality of service to wired and wireless users. Devices should be enterprise-grade, not home or gaming equipment. Your project plan and final recommendations should be based on a Weighted Decision Matrix (like the WDM you did in the Procurement Practical). You are to compare three (3) devices from each category and to base the decision on reasonable and well-justified attributes. The budget for procurement is $5,500. You may exceed this if you can justify it well. Your project plan is to contain the following components: Weighted Decision Matrix - hardware resource requirements analysis • Include a written justification for priorities and attributes given in the matrix • Create your WDMs in Excel and copy and paste them into your document Budget • Create a well-presented table of the prices of all devices and the total cost • Include hardware only, not labour
Module handbook, 2024/25: COMM751/COMM752 Big Data and Society: Foundations, Politics, and Policy Introduction This module aims to introduce you to the study of online media and platforms, with a particular focus on ‘big’ social trace data. As well as developing your understanding of how Internet-based media systems work, you will learn about the strengths and weaknesses of using big data for social science research and engage with key online political communication policy questions. COMM751 (“Big Data and Society: Foundations, Politics, and Policy A”) is a core module for students on the MA Media, Data and Society and is 30 credits. COMM752 (“… B”) is a 15-credit option for students on other MA and MSc programmes. The content and expectations for students on both courses are identical, except that COMM751 students have an additional assessment. No handbook can answer all questions, and this one has a bias for being brief. We are very happy to answer your questions, either in class or in our office hours. Learning Outcomes and Skills The aims of this module are that you: · Will analyse interactions between the media, platforms, and citizens. · Will develop your understanding of how digital data is generated, collected and used in the modern world. · Will engage with key current debates around media, data and society. · Will develop your skills in building and presenting an argument, while selecting appropriate sources. · Will further develop your academic writing skills. · Will be able to link key public policy questions to social science research approaches that could help practically address them. · Will develop skills in critically engaging with evidence. Course Outline Teaching structure The content for this module is broadly divided into two blocs. Alex leads on topics 1-4 and 6. They cover foundations, with content such as the development of the Internet and social media, the characteristics of big data, issues with access to data and platform. gatekeeping, social science methods for using data, the nature of social networks, and understandings of social media and user content. The second bloc + topic 5 are taught by Dr Hannah Little and goes into more depth into some of the opportunities and threats that arise in online political communication, covering topics such as misinformation, disinformation and trolling; hate speech and radicalisation; participation, protest, polarisation, and echo chambers; and the effects of digital and social media on well-being. The module is taught with a 1-hour lecture and a 1-hour seminar each week. The lectures and seminars are face-to-face. There is one lecture for everyone and two different seminar groups. Weekly topics This is the provisional outline of each week’s focus. Canvas will have more details. 1. Welcome and introduction. The role of data in modern society and the processes that generate it; overview of the course as a whole. 2. Power, the Internet, and data. A history and the structure of the Internet; Data and the design of Internet services; nexuses of network control and visibility; how political and social power and data are linked. 3. Data collection and social media platforms. User-generated content and platforms that rely on it; collection of online trace and content data; relationships and the networks they form. as key data. 4. Data analysis in private and public sectors. What we can learn from large-scale datasets; commercial uses of data science; academic and government research. 5. Privacy, data protection, and identity. Identity, anonymity, and pseudonymity online; problems in privacy and accountability; legal and social controls over personal information; the right to be forgotten. 6. A big truth or a big mistake? Algorithmic biases; transparency; data availability problems; biases towards answerable questions; computational complexity. 7. Reading and formative assignment week. 8. Surveillance. Utopian and pessimistic accounts of Internet freedom; legal frameworks for interception; data brokers and government-private partnerships. 9. Regulation and control. Who controls the Internet?; How should it be regulated?; filtering; censorship. 10. Online news, misinformation and disinformation. Online and offline sources of misinformation; the dynamics of information spread; citizen and professional journalism; fact checking and online debate; ‘fake news’. 11. Participation, protest, and polarisation. Online political activity; partisan polarisation; hate speech; moderation and censorship of discussion; “echo chambers.” 12. Revision and assessment guidance. Readings are on the Reading Lists @ Liverpool system, linked from Canvas. Assessment Summary Assessment in this module will be in coursework, in two or three parts: one formative and two (COMM752) or three (COMM751) summative. These will be: 1. A 7-minute presentation (COMM751, COMM752) – 10% of the final mark 2. A formative essay (COMM751, COMM752) – not marked 3. A summative essay (COMM751, COMM752) – 60% of the final mark for COMM751 and 90% of the final mark for COMM752. 4. A weekly reading blog (COMM751 only) – 30% of the final mark All coursework, except the presentation, must be word processed and submitted electronically through Canvas. Guidelines for submission are available on the School of the Arts website. Please consult Alex if you are in any doubt about this. 1. Presentation You will be assigned a reading, which you must present to the rest of your seminar group in one seminar. The final assigned reading for each student will be posted to Canvas, including the week you have been assigned to present in. Your presentation can either be a “classic” one-way presentation or a more interactive presentation. You should not just read your notes/script. – this will only count for a pass. The presentation does not need to be elaborate: a well-polished slide deck is not a requirement (though you may use slides), but you will need to have studied the key reading, have read additional reading on the week’s topic to give it context, and be prepared to talk for 7 minutes maximum and then contribute to the subsequent discussion. In preparing the presentations, please use the following guiding principles: · Reflect on the reading and convey a story which includes definitions of the main concepts, the main theoretical approaches, a review of the argument. · Use practical or real-world examples to provide clearer understanding. · You can use interactive elements to engage the other students in a debate or conversation or make them reflect on the main concepts. · Avoid describing the literature in great detail – you only have 7 minutes! · Prepare a question to spark a discussion at the end of the presentation. 2. Formative essay The purpose of the formative essay is to provide you with an opportunity to get to grips with academic writing at the master level, particularly for those of you whose first degree was outside the social sciences, or from countries with a different approach to assessment. We also aim to reduce the uncertainty that you might feel as new MA/MSc students about how you’re doing, and to provide constructive feedback in advance of the summative essay submission. You must use the essay to engage with academic literature (the reading list is a good starting point). You must thorough reference your sources using Harvard referencing. The formative essay is due on Monday 11 November 2024 (the first day of week 8) and has a limit of 1,500 words. 3. Summative essay Both COMM751 and COMM752 students will produce a summative essay, designed to test the students’ critical thinking and reasoning skills, and engagement with the material presented in the course. The formative and summative essays will be on different topics of your choice. You can answer one of the possible questions below, or agree your own question with the module leader. You MUST not answer the same question for the formative and summative. If you are found to have done so, you will receive 0. You must use the essay to engage with academic literature (the reading list is a good starting point). You must thorough reference your sources using Harvard referencing. The summative essay is due on Wednesday 8 January 2025 and has a limit of 3,000 words. This is twice as long as the formative. Both are submitted online, through Canvas. 4. Weekly reading blog (only COMM751 students) You must submit a weekly blog post covering your thoughts on a reading seminar paper each week, in advance of the seminar. In this way, work towards assessment will take place each week. Highlight what you found most interesting about the reading and try to critically engage with the arguments made. If you cite literature beyond the reading, please provide citations in the Harvard style. Each week’s post should be 200 words long with 10% leeway. You should submit a post for each of the following weeks: 1-6 and 8-11. You must submit the final blog containing all blog posts by 16 December for assessment through Canvas. Essay questions For each essay (formative; summative; and, if necessary, resit) you can choose from any one of the following essay questions. If you would prefer to answer a different question we are often happy to let you write your own, but you must get our approval before end of term 13 December 2024. Contact Alex during the classes, in office hours, or email. Your formative and summative essays must be on different questions, and your resit must be on a third if you need one. You may never use the same essay question twice. 1. Will and should big data approaches replace traditional social science approaches to building knowledge? Critically discuss. 2. Why does the collection and use of data by social media companies matter? Critically discuss. 3. Is the culture of the Internet inevitable given its technical design? Critically discuss. 4. In what ways do data biases limit the usefulness of big data for complex social issues such as crime? Critically discuss. 5. Should online anonymity be banned on social media? Critically discuss. 6. Should end-to-end encrypted platforms be banned? Critically discuss. 7. Whose responsibility should it be to regulate the internet and digital platforms? Critically discuss. 8. Can people be “inoculated” against online misinformation? Critically discuss. 9. How the reliance on big data changes authoritarian societies? Critically discuss. 10. Is big data a threat to democracy? Critically discuss. 11. How can an industry (of your choice) can further benefit (or suffer) from implementing big data approaches? Critically discuss. What we expect from you You need to attend lectures and seminars, and work between sessions to read and understand the material set and to research and to write your assignments (in principle, an average of 10 or so hours a week for COMM752 students). Attendance at sessions is monitored: please check Canvas and the guidelines in the School of the Arts handbook. This is a small group course; contributing to seminars is not optional. You have four responsibilities for participation in the seminar. You are expected to: 1. Attend each week. 2. Read the key readings each week, in advance of the seminar.
BUSINESS 114 Accounting for Decision Making SEMESTER TWO 2022 SECTION A: MULTIPLE CHOICE QUESTIONS QUESTION 1 - Module 1 (Professional Emails) You would like to request an extension from your supervisor, Jacky, on one of your work projects as you have been ill after having caught COVID-19. Which is the most appropriate request based on your knowledge of the PAPER model used for writing professional emails? (a) Hey Jacky, please can you give me an extension on that project as I have been ill after having caught COVID-19. (b) Hello Jacky. I understand the importance of completing the project on time; however, I have been ill due to having caught COVID-19. Are you happy to approve an extension for this? (c) Unfortunately, I have been ill with COVID-19 symptoms and have been delayed in completing the work on the project. Please can you give mean extension. Thankyou! (d) Dear Jacky. I need an extension on the project. Thankyou. (Total for question 1: 1 mark) QUESTION 2 - Module 2 (Budgeting) Which of the following describes away in which budgeting can assist in decision making? (a) Identifying expected revenue shortages. (b) Managing production. (c) Determining inventory levels. (d) All of the options listed. (Total for question 2: 1 mark) QUESTION 3 - Module 3 (Time Value of Money) Your friend is considering a 6-year investment costing $21,000 with a required rate of return of 10% per year. What is the minimum annual cash inflow at the beginning of each year that the investment must provide in order to satisfy your friend’s required return? (a) $4,384. (b) $3,850. (c) $4,822. (d) $5,680. (Total for question 3: 1 mark) QUESTION 4 - Module 4 (Sources of Finance) Which of the following is not a source of debt finance from the New Zealand market? (a) Corporate bonds. (b) Grants. (c) Unsecured notes. (d) Debentures. (Total for question 4: 1 mark) QUESTION 5 - Corporate structures, Fiduciary obligations and Agency Jamie is a director and shareholder of Aqua Ltd. Aqua Ltd sells diving equipment through multiple retail stores. On the 6th of September, Jamie became aware of an opportunity to purchase discounted diving equipment from Stephen an importer of sports goods. Jamie thinks this will be a very good opportunity for Aqua Ltd to obtain and resell quality diving equipment. However, Jamie decides that she wants to profit from the opportunity. On the 19th of September, Jamie buys the diving equipment from Stephen at the discounted price through a company she wholly owns and controls, Thalassa Ltd. On the 21st of September, Thalassa Ltd on sells all the diving equipment bought from Stephen to Aqua Ltd. Thalassa Ltd makes a profit of $10,000 from the sale. The $10,000 is then distributed to Jamie through dividends from the shares Jamie owns in Thalassa Ltd. At the time of the purchase by Aqua Ltd, no one at Aqua Ltd knew that Jamie was also a director/shareholder of Thalassa Ltd. However, on the 23rd of September, another director of Aqua Ltd finds out that Jamie is also a director of Thalassa Ltd. Which of the following statements is incorrect? (a) Jamie may have to pay $10,000 to Aqua Ltd as the $10,000 from the sale of diving equipment from Thalassa Ltd to Aqua Ltd is a ‘secret profit’ . (b) Jamie has breached her fiduciary obligations to Aqua Ltd by not disclosing her conflict of interest. (c) Separation of legal and beneficial ownership. As a shareholder of Thalassa Ltd, Jamie has limited liability and Thalassa Ltd cannot ask Jamie to contribute to her personal assets to pay off Thalassa’sdebts. (d) Aqua Ltd is a separate legal entity and does not need any agents to acton its behalf if Aqua Ltd wants to sue Jamie for making a secret profit. (Total for question 5: 1.5 marks) QUESTION 6 - Partnerships, Property Law and Agency Juniper, Zoe and Manish are accountants who run an accounting firm together in a partnership arrangement. Each of them had settled their personal homes in a trust ten years ago when they set up the partnership. The trustees for each respective family home are accountants and each partner has only a beneficial interest in their respective homes. On the 12th of October, Manish enters into a contract with Star Software Ltd to purchase new accounting software for the partnership. The new software costs $40,000. As of the 14th of October, the debt has not been paid. Manish, unfortunately dies in a car accident that same day. The partnership is automatically dissolved upon Manish’sdeath. The joint bank account for the partnership had only $10,000 in it when Manish died. The partnership had no other assets. (Ignore any lawson succession (inheritance)). Which of the following statements is the most accurate? (a) Manish was not acting as an agent of the other partners when he entered into the contract with Star Software on the 12th of October. Thus, Juniper and Zoe are not bound to the contract. (b) Star Software Ltd can only get $10,000 as that is all the money the partnership has in the partnership joint bank account when Manish died. (c) Star Software Ltd has a personal right against Juniper and Zoe for the $40,000. (d) As Juniper and Zoe are the legal owners of their homes, Star Software Ltd can force Juniper and Zoe to sell their homes to payoff the total amount owing to it. (Total for question 6: 1.5 marks) QUESTION 7 - Module 7 (Balance Sheet) What are the effects on the balance sheet when a business buys a machine for $75,000 but pays a deposit of $20,000 now and promises to pay the supplier the balance in the coming 60 days?. (a) Increase non-current asset machinery by $75,000; increase current liability accounts payable by $75,000. (b) Increase non-current asset machinery by $20,000; decrease current asset bank by $20,000. (c) Increase non-current asset machinery by $75,000; decrease current asset bank by $20,000; increase current liability accounts payable by $55,000. (d) Increase non-current asset machinery by $75,000; decrease current asset bank by $20,000; increase non-current liability loan by $55,000. (Total for question 7: 1 mark) QUESTION 8 - Module 8 (Income Statement) At balance date, an amount of $2,400 for electricity was still owing and had not been recorded. This will result in an: (a) Understatement of liabilities and an overstatement of profit and equity. (b) Overstatement of liabilities and an understatement of profit and equity. (c) Overstatement of assets, profit, and equity. (d) Understatement of assets, profit and equity. (Total for question 8: 1 mark) QUESTION 9 - Ethical Dilemma Having a budget that directly links employee bonuses with sales targets may lead to a culture among sales staff where the sales targets are changed to build in budgetary slack. Which of the following statements is the most accurate? (a) Budgetary slack can be viewed as unethical behaviour as it is beneficial to other organisational units and to investors. (b) Budgetary slack can be viewed as unethical behaviour as it changes the focus of sales staff towards that of customer satisfaction. (c) Budgetary slack can be viewed as unethical behaviour due to the misrepresentation of the sales staff capabilities. (d) All of the options listed. (Total for question 9: 1 mark) SECTION B QUESTION 10 - Financial Statement Analysis (a) Identify two ratios a bank lender would be particularly interested in when evaluating whether to approve a loan and explain why these would be of interest to the bank lender. (4 marks) (b) Here are two extracts from the annual report of Burger Fuel Group Limited (BFG) : Burger Fuel Group Limited (BFG) Required: Using the extracts from Burger Fuel Group Limited's annual report, calculate the following ratios for 2022: • Return on equity; and • Current ratio. (2 marks) (c) Referring to the extracts from the financial statements given in part (b) of this question, analyse and comment on two possible reasons as to why the net profit attributable to shareholders is lower in 2022 than in 2021. (2 marks) (Total for question 10: 8 marks) QUESTION 11 - Cost Understanding Megatron Ltd manufactures handheld beaters. In July 2022, the company reported the following operating results: Sales revenue (4,000 units) $100,000 Cost of goods sold $60,000 Gross profit $40,000 Less: Operating expenses $30,000 Profit $10,000 Cost of goods sold was 80% variable and 20% fixed. Operating expenses were 40% variable and 60% fixed. Required: (a) (i) Calculate the monthly breakeven point (for July) in units and the margin of safety (MOS) as a percentage based on the above financial information of Megatron Ltd. (2 marks) (ii) Calculate the operating leverage of Megatron Ltd and explain what operating leverage means for the company. (Round your results to two decimal places). (2 marks) (b) (i) In September 2022, Megatron Ltd is considering a new production and marketing combination plan. The new plan decreases the selling price by 10% with a result of increasing sales volume by 30% from July. Meanwhile, variable cost per unit increases by $0.50 due to the adoption of higher quality materials. Both fixed parts of cost of goods sold and operating expenses will decrease by 8% and 5% respectively. Calculate the following based on the above financial information of Megatron Ltd (round your results to two decimal places): • New profit for September; • New monthly breakeven point in units; and • Margin of safety (MOS) as a percentage. (6 marks) (ii) Comment on the new production and marketing combination plan, considering the expected effects on profit, on the breakeven point, and on the margin of safety (MOS). State any assumptions you need to make. (4 marks, 150 words maximum) (c) The CEO estimates that the sales volume will increase by around 40% next year due to the growth of online shopping. Therefore, the production manager believes that the total costs will also increase by approximately 40% because only variable costs increase while fixed costs remain unchanged. Do you agree with the production manager’s statement? Explain by considering one assumption related to cost behaviour that was covered in the module. (2 marks, 75 words maximum) (Total for question 11: 16 marks) QUESTION 12 - Performance Measurement Minions Ltd specialises in producing Oodies, an oversized wearable blanket. Demand for Oodies has risen recently due its popularity on Tiktok so management is looking forward to an improvement on last year’s profit of $800,000. At the end of 2021, the manager of Minions Ltd provided you with the following budgeted information for the year ending 31 December 2022: • The expected selling price for an Oodie is 12% higher than last year’s price of $70. • Due to afavourable variance for last year’s direct variable costs, management expects 2022’s costs to be $5 below last year’s actual cost of $27 for an Oodie. • The variable overheads were slightly more adverse than expected so management has decided to increase the expected costs to $13 per Oodie. • Management was pleased with the accuracy of the budgeted figures for last year’sfixed overhead costs and has kept them at $142,860. • The number of Oodies expected to be sold for 2022 is 23,600 which is higher than last year’s budgeted volume of 19,400. Required: (a) Prepare the master budget for Minions Ltd for the year ending December 2022 using the template below. Master Budget for the year ending 31 December 2022 Budget Number of units Sales Less costs: Direct variable costs Variable overhead Fixed overhead Profit (3 marks) (b) Explain the need for preparing a master budget for management. (1 mark) (c) Prepare a flexed budget for Minions Ltd for the year ending 31 December 2022 using the template below and calculate the individual flexed budget variances, specifying whether they are favourable or adverse. (5 marks) Minions Ltd’s Performance Report for Oodies for the year ended 31 December 2022 Flexed Budget Actual Flexed Variances F/A Number of units 23,980 Sales $1,798,500 Less costs: Direct variable costs $599,500 Variable overhead $263,780 Fixed overhead $140,400 Profit $ 794,820 (d) Discuss the results obtained in Minions Ltd’s Performance Report based on part (c) of this question and the indication that management expected the results to bean improvement due to the increased media presence and demand for the Oodies. (4 marks, 150 words maximum) (e) Minions Ltd is considering developing a balanced scorecard. Management has decided that their focus will be on delivering consistently low prices to customers. Required: Provide one goal and one measure for Minion Ltd’s new balanced scorecard based on this strategy of low prices under the following perspectives: (i) Financial (1 mark for this subpart); (ii) Customer (1 mark for this subpart); and (iii) Internal Operations (1 mark for this subpart). Set out each of your answers using a table format as follows: Perspective Goal Measure (3 marks) (Total for question 12: 16 marks)
Template Matching with Cache Friendly Code COMP 273 Project Due: December 8, 2024 Template Matching In this project, you will use template matching to find Waldo in a pixel art image. Waldo is easily recognizable because of his glasses and his red and white striped shirt and hat. Template matching is the simplest of a family of algorithms that are used for optical character recognition in scanned documents, and automatic face detection in images. It will be indeed face detection you will be doing in this project, although with a very small template of only 8-by-8 pixels. Using such a small template will allow your project to run at a reasonable speed in the simulator, in contrast to the larger template shown at right. There are many ways to compute the error of a match, but a common choice is the sum of absolute differences of pixel intensities, The function e is the error for a given pixel location (x,y), and I and T are functions that provide the pixel intensities in the image and template, respectively. The double sum loops over the width w and height h of the template (in our case, w = h = 8). The better the match, the lower the error. If template and image intensities match exactly the error will be zero. While we could consider doing a comparison of colours, it is simpler to only work with intensities. Thus the image and template provided in this project will be gray-scale images. That is, when you load the bitmap image, the red, green, and blue components of the word corresponding to a pixel will all be the same value, and we only need to read one byte (lbu) to know the pixel’s brightness (a number between 0 and 255). This wastes memory, using four times what is required, but is convenient because it will allow use of the bitmap display for visualization and debugging. Provided Data and Code Useful functions are provided for you in the templatematch.asm file. You will implement two different versions of the template matching function by modifying and submitting this file. Be sure to enter your group number at the top of the file. In the provided file, the data section reserves space for the display buffer, an error buffer, and a template buffer. The image and error buffer regions areplaced at the beginning of the static data 0x10010000 such that you can easily visualize both in the memory mapped bitmap display. data displayBuffer: .space 0x40000 # space for 512x256 bitmap display errorBuffer: .space 0x40000 # space to store match function templateBuffer: .space 0x100 # space for 8x8 template imageFileName: .asciiz "pxlcon512x256cropgs.raw" templateFileName: .asciiz "template8x8gs.raw" # struct bufferInfo { int *buffer, int width, int height, char* filename } imageBufferInfo: .word displayBuffer 512 128 imageFileName errorBufferInfo: .word errorBuffer 512 128 0 templateBufferInfo: .word templateBuffer 8 8 templateFileName As you can see here, following the space for buffers, the provided code also sets up some simple data structures to store information relating to each buffer, specifically, the address in memory where it is found, the width, the height, and the filename if there is one. It is this buffer information structure that is used as an argument to the provided functions, and to the matchTemplate and matchTemplateFast functions that you will write. Thus, if $a0 contains the address imageBufferInfo, then structure members can be loaded with offsets: lw $t0 0($a0) % load address of displayBuffer (0x10010000) into $t0 lw $t1 4($a0) % load width of image (512) into $t1 lw $t2 8($a0) % load height of image (128) into $t2 lw $t3 12($a0) % load address of null terminated string imageFileName (0x10090100) into $t3 The following functions are provided. void loadImage( bufferInfo* imageBufferInfo ) Loads an image or template from file (and reads structure members much like the example above). (offset, score) = findBest( bufferInfo errorBufferInfo ) Finds the best match in the error buffer and returns the offset in bytes along with the score. void highlight( bufferInfo imageBufferInfo, int offset ) Highlights in green the area corresponding to the best match in the image. void processError( bufferInfo errorBufferInfo ) Processes the error into a score between 0 (bad match) and 255 (best match) for viewing in the bitmap display. The match error at each pixel will generally be much larger than 255, and when viewed in the memory mapped display, the unprocessed error will be broken up into fields for the red, green, and blue intensities in a manner which is difficult to interpret. This function will allow you to better visualize the quality of the match across the entire image, by re-scaling . A perfect match will show up as a bright green dot in the memory mapped display. The provided functions make the assumption that the template is always 8 by 8, and you can make the same assumption in your code too! However, do not assume that the image size is fixed at 512 by 128! Having a variable imagesize allows it to be reduced when measuring performance in the last part of the project. You might notice that the pxlcon512x256cropgs .raw is actually 512 by 256, but we are only loading the first half of the file. The image and template data files arestored in a raw binary format. This makes for a very simple loadImage function, which directly loads the contents of the file into memory. These files must be placed in the directory where you launch the MARS, otherwise they will not be found. Naive Implementation (30 marks) Complete the function matchTemplate in the templatematch .asm file. Assuming the sum of absolute differ- ences array is initialized to zero (which is how the memory is initialized in MARS), the following pseudo-code will naively compute the sum of absolute differences, i.e., the error. for ( int y = 0; y
Business Process Improvement – Tutorial 1 (2024) Question 1: Explain each step of the Business Process Lifecycle. Question 2: Discuss motivations for an organisation to invest in BPM. Question 3: With respect to the process walkthrough overleaf, consider the following questions: 1. What type of process is the above one: order-to-cash, procure-to-pay or issue-to- resolution? 2. Who are the actors in this process? 3. What value does the process deliver to its customer(s)? 4. What are the possible outcomes of this process? 5. Taking the perspective of the customer, what performance measures can be attached to this process? 6. What potential issues do you foresee this process might have? What information would you need to collect in order to analyse these issues? 7. What possible changes do you think could be made to this process to address the issues? Process walkthrough Customers drop off their prescriptions either in the drive-through counter or in the front counter of the pharmacy. Customers can request that their prescription be filled immediately. In this case, they have to wait between 15 minutes and one hour depending on the current workload. Most customers are not willing to wait that long, so they opt to nominate a pick- up time at a later point during the day. Generally, customers drop their prescriptions in the morning before going to work (or at lunchtime) and they come back to pick up the drugs after work, typically between 5pm and 6pm. When dropping their prescription, a technician asks the customer for the pick-up time and puts the prescription in a box labelled with the hour preceding the pick-up time. For example, if the customer asks to have the prescription be ready at 5pm, the technician will drop it in the box with the label “4pm” (there is one box for each hour of the day). Every hour, one of the pharmacy technicians picks up the prescriptions due to be filled in the current hour. The technician then enters the details of each prescription (e.g. doctor details, patient details and medication details) into the pharmacy system. As soon as the details of a prescription are entered, the pharmacy system performs an automated check called Drug Utilization Review (DUR). This check is meant to determine if the prescription contains any drugs that may be incompatible with other drugs that had been dispensed to the same customer in the past, or drugs that may be inappropriate for the customer taking into account the customer data maintained in the system (e.g. age). Any alarms raised during the automated DUR are reviewed by a pharmacist who performs a more thorough check. In some cases, the pharmacist even has to call the doctor who issued the prescription in order to confirm it. After the DUR, the system performs an insurance check in order to determine whether the customer’s insurance policy will pay for part or for the whole cost of the drugs. In most cases, the output of this check is that the insurance company would pay for a certain percentage of the costs, while the customer has to pay for the remaining part (also called the co-payment). The rules for determining how much the insurance company will pay and how much the customer has to pay are very complicated. Every insurance company has different rules. In some cases, the insurance policy does not cover one or several drugs in a prescription, but the drug in question can be replaced by another drug that is covered by the insurance policy. When such cases are detected, the pharmacist generally calls the doctor and/or the patient to determine if it is possible to perform. the drug replacement. Once the prescription passes the insurance check, it is assigned to a technician who collects the drugs from the shelves and puts them in a bag with the prescription stapled to it. After the technician has filled a given prescription, the bag is passed to the pharmacist who double- checks that the prescription has been filled correctly. After this quality check, the pharmacist seals the bag and puts it in the pick-up area. When a customer arrives to pick up a prescription, a technician retrieves the prescription and asks the customer for payment in case the drugs in the prescription are not (fully) covered by the customer’s insurance.
T3, Essay consultation CCST9050 Flesh, Machine & Intelligence Term Paper Topic “How will robots influence our lives in 10‐20 years?” • In terms of different fields: medicine, design, education, etc. • In terms of people’s daily lives: transport, living environment, etc. • In terms of the possibility of a specific robot: drones, exoskeletons, etc. Term Paper Details Prompt: How will robots influence our lives in 10-20 years? Form. Unlimited (academic paper, fictional work, illustration, video, animation, etc.) Length:
Electromagnetic Characterisation of a Short-Stroke Ferromagnetic Actuator: Part B Department of Electrical and Electronic Engineering Abstract This laboratory exercise is concerned with the electromechanical characterisation of a short-stroke ferromagnetic actuator. Students will work in pairs to study prescribed aspects of the actuator behaviour using analytical and numerical finite element analysis methods. Findings will be reported by means of an individual technical note conforming to an IEEE academic paper template. Students are expected to complete the tasks and address the questions raised in each section of this document in their technical note submission. Part A of the laboratory script. is associated with the first three-hour laboratory session and focuses on familiarising students with the steps necessary to model the ferromagnetic actuator using Finite Element Method Magnetics (FEMM) and Matlab software. Part B of the laboratory script. is associated with the second laboratory session and introduces the concepts necessary to analyse the behaviour of the actuator. Analytical modelling and analysis of results will be supported by lecture material as the unit progresses. I. INTRODUCTION In the previous laboratory session, [1], Matlab and FEMM software, [2], were used to construct a Finite Element (FE) model of a simple ferromagnetic linear actuator composed of a stator core, an armature (mover or plunger) and two independently connected electrical windings of N turns. An example of the pre- and post-processor of the FE model is given in Figs. 1 and 2. Note: If the flux density plot from your model does not closely resemble Fig. 2 then check the definition of your windings including the current (turns) direction. In this laboratory session, the FE model will be used alongside analytical methods taught in the lecture series, [3], to predict the behaviour of the actuator in the electrical, magnetic and mechanical domains. Findings will be reported by means of an individual technical note conforming to an IEEE academic paper template. Students are expected to complete the tasks and address the questions raised in each section of this document in their technical note submission. Details of the coursework requirements, submission format, means and deadline are given in Section VIII. Fig. 1: 2-d actuator geometry implemented in FEMM with an Improvised Asymptotic Boundary Condition. Fig. 2: Illustration of the FEM solution of the actuator. II. MESHING THE MODEL The actuator geometry and surrounding region must be discretised using an appropriate method, in this case, Delaunay triangulation. FEMM uses Triangle, [4], to automatically generate a suitable mesh. To begin with, turn Smartmesh off using smartmesh(0) or through the Problem menu, then generate the mesh using the mi_createmesh() command or by clicking Run mesh generator from the FEMM toolbar, Fig. 3. Mesh visibility can be toggled using mi_showmesh(). Notice the irregular triangle areas which are generated, the quality i.e. the regularity of triangle shapes and mesh density i.e. the number of triangles in a given region influence the accuracy of the numerical solution to the magnetic vector potential. The Smartmesh feature uses meshing heuristics to automatically improve the quality of the mesh within the problem geometry. Enable Smartmesh, smartmesh(1), and re-mesh the problem. Notice the change in geometric and area regularity and mesh density in the regions. However, the Smartmesh does not have an overarching understanding of the problem to be solved, hence, it is necessary to make manual adjustments to the mesh density. It is possible to assign a specific mesh spacing to line segments and arcs which influence local mesh density or to block labels which influences the mesh density over the whole region. It is important in this model to locally refine the mesh density in the variable air-gap. It is rec-ommended that this be achieved programmatically by selecting the appropriate line segment, of which there are two, Fig. 4, mi_selectsegment(x,y), applying a 0.5 mm element size, mi_setsegmentprop(’’, 0.5, 0, 0, group), and finally deselecting the line segment, mi_clearselected(). Fig. 3: Illustration of the main FEMM toolbar. Fig. 4: Line segment selection for mesh density refinement. Coursework Task 2: In your technical note, include a section on model meshing which documents the model mesh before and after the use of Smartmeshing and refinement along the designated line segments. Record the number of mesh elements in each mesh and qualitatively comment on the mesh quality in terms of edge length and area regularity along with mesh density in each region. III. ARMATURE MOTION In order to characterise the behaviour of the actuator, a magnetostatic analysis must be conducted at discrete armature positions at various applied winding current levels. The nodes and line segments of the model are assigned appropriate group numbers to facilitate the selection and geometric translation of the armature programmatically. To move the armature, use mi_selectgroup(n) to select the necessary group and mi_movetranslate(dx,dy) to translate the armature in the x-direction by dx millimetres, deselect the group using mi_clearselected(). Note that the armature position is initially at 5 mm which is the maximum travel, hence, the armature may move by up to -5 mm. However, the geometry of the armature and the stator core cannot interfere or overlap, as such, the maximum translation should be limited to 4.9 mm to maintain a minimum of 0.1 mm between the armature and stator core. Note: The script. must maintain a record of the armature position to enable movement back and forth without exceeding the travel end-stops of lag = 0.1 mm (limited by the FE model) and lag = 5 mm (limited physically). IV. WINDING RESISTANCE Coursework Task 3: In your technical note, include a section on the winding resistance which reports the findings of the analyses performed in this part of the laboratory, including appropriate numerical data, figures and interpretation. Ensure that 10 A is applied to each of the windings, winding_1 and winding_2 using the mi_setcurrent(’CircName’,i) command, see FEMM_programming_manual.pdf. Solve the model, mi_analyse() and load the solution in to the post-processor, mi_loadsolution(). Extract the circuit properties, CP, of each coil using CP = mo_getcircuitproperties(’circuit’). Where CP(1), CP(2) and CP(3) are the current, I, applied voltage, V , and flux linkage , ψ, respectively. Measure the cross-section, Aw, of a winding region, mo_groupselectblock(n), A = mo_blockintegral(5), mo_clearblock(). Measure the active length, lw, (depth in to the page) via the volume, Vw, mo_groupselectblock(n), V = mo_blockintegral(10), mo_clearblock(), and (1). Note: The reported dimensions are in metres. Calculate the resistance of each winding using (2), taking account of the number of turns, N, the electrical conductivity, σ = 58 MS/m, and the packing factor, kP F = 0.6, which relates to the available conductor area when insulation and geometric packing of the conductors is considered. Compare and comment on the analytical result and that reported from the FEM model using the measured voltage and current stored in CP. As the model is 2-d, the end-windings (those which run in the same plane as the page connecting the upper and lower winding sections) are not included in the prediction. Use (2) and the 3-d CAD model or otherwise to find the DC resistance of each winding. Plot the total winding power loss as a function of applied current from 0 to 10 A. V. WINDING INDUCTANCE Coursework Task 4: In your technical note, include a section on the winding inductance which reports the findings of the analyses performed in this part of the laboratory, including appropriate numerical data, figures and interpretation. In the steady state, (magnetostatic case), the winding resistance is independent of armature position. However, the inductance, L, is highly dependent upon the reluctance, R, of the magnetic circuit and as such on the armature position. Derive a magnetic equivalent circuit for the actuator under consideration and find an analytical expression for the inductance as a function of armature position, (3), assume that the air-gap fringing flux is negligible and that the core is linear, µr = 1000, as in core_linear. Find a second analytical expression for the inductance as a function of armature position, assuming that the core is linear, accounting for air-gap fringing flux using the effective air-gap area model, Eq B-5, given in [3]. Use the FEM model to predict the inductance of the actuator as a function of armature position for both the core_linear and core_nonlinear material cases. Plot the four inductance trends (analytical and numerical), compare and contrast their form. discussing the reasons for the differences. Note: The inductance can be calculated as L = ψ/I. Astute students may realise that the non-linearity of the core material could be incorporated in to a magnetic equivalent circuit using current controlled resistances to model the effective reluctance increase as the material begins to saturate i.e. the electrical resistance increases as a function of current flow in accordance with the BH curve. This could be modelled using Simulink or SPICE and is left as an extended exercise for those interested. VI. FORCE ON THE ARMATURE The force imparted on the armature as a result of applied winding current can be determined using an energy balance, (4), where, for an isolated system energy must be conserved. Hence, the electrical energy, sourced or sunk must be equal to the sum of the mechanical energy, work done and stored, the energy stored in the magnetic field and the system losses which in this case are composed of the Joule winding losses alone, [5], [6]. Winding AC loss, and core loss i.e. eddy current and hysteresis losses are neglected in this quasi-static analysis. Eelec = Emech + Emag + Eloss → ∆Eelec = ∆Emech + ∆Emag + ∆Eloss (4) First consider the case where the armature is fixed in the open position, i.e. lag = 5 mm such that the actuator behaves like an inductor. A winding current, I, is applied at time, t = 0, and ramped from 0 A to 10 A. The instantaneous flux linkage resulting from the applied current can be determined from (5) to form. a Ψ − I diagram, using analytical or numerical methods, as illustrated in Fig. 5. If there is no mechanical motion, Emech = 0, and the winding loss is assumed negligible, Eloss = 0, then the energy supplied from the electrical supply, Eelec is stored in the magnetic field, Emag, hence Eelec = Emag, (4). Ψ = LI (5) Fig. 5: Ψ − I diagram corresponding to the open armature position. The electrical energy supplied is determined from the time integral of the power, (6). In this case the applied voltage, V , is unknown, however, through Faraday’s law the back EMF and hence, V , resulting from the time changing current is equal to the time derivative of flux linkage, dΨ/dt, making the electrical energy the integral of the current with respect to the flux linkage, i.e. the area of the P si − I diagram between the y-axis and the Ψ − I curve. The area of the Ψ − I diagram between the x-axis and the Ψ − I curve is known as the co-energy, Eelec 0, which for linear Ψ − I curves is numerically equal to the energy, Eelec ≡ Eelec 0. Substituting the definition of flux linkage Ψ = NΦ and of MMF = NI, it is shown that the magnetic energy is given by the integral of the analogous electrical quantities, magnetic voltage, MMF, and magnetic current, Φ. In a linear magnetic system, in which no saturation occurs, the stored magnetic energy can be determined from Fig. 5 and (6) by substituting (5) to yield (7) which is a familiar result. Now consider the case where the armature is fixed in the closed position, i.e. lag = 0.1 mm such that the actuator behaves like an inductor. A winding current, I, is applied at time, t = 0, and ramped from 0 A to 10 A. In this case the variable air-gap is much smaller, hence, the induced flux becomes high enough to begin to saturate the core materials and the linear analytical expressions of inductance found in Section V no longer hold true. Instead, the instantaneous flux linkage, Ψ, is extracted from the circuit properties of winding_1 and winding_2 solved at appropriate winding current levels to form. the Ψ − I curve illustrated in Fig. 6. Fig. 6: Ψ − I diagram corresponding to the open armature position. If Ivec and PSIvec are Matlab current and flux linkage vectors respectively then the energy, Eelec = Emag, can be determined using numerical trapezoidal integration as Eelec = trapz(PSIvec,Ivec). Hence, in the armature open position 0.137 J are stored in the magnetic field, while in the armature closed position 0.456 J are stored, a difference of ∆E = 0.319 J. The energy exchange between the electrical supply and magnetic field has been studied for two cases, armature open and armature closed. It is clear that the armature closed position exhibits a smaller magnetic reluctance which results in a higher inductance, (3), and greater energy storage in the magnetic field than the armature open case, for equal applied winding current. It has been assumed that the armature moves instantaneously between the open and closed positions and no mechanical work is done, i.e. a quasi-static analysis. Now, the interaction of the electrical, magnetic and mechanical energy is studied to determine the static mechanical force acting upon the armature at a given applied winding current and armature position. The armature is assumed to move sufficiently slowly to allow highly dynamic effects to be neglected, thereby, simplifying the Ψ − I diagrams and analysis. Consider the case where the armature is in the fully open position, lag = 5 mm, with an applied winding current of, I = 10 A. From experience, an attractive magnetic force will act to draw the armature closer to the core. The armature is released and allowed to close under no external mechanical load and comes to rest in the closed position where lag = 0.1 ≈ 0 mm. The electrical energy supplied to the system is the time integral of voltage and current, however, the voltage is unknown and so Faraday’s law is used to give the voltage in terms of rate of change of flux linkage and change the subject of integration, (8). Now, the electrical energy supplied to the system, ∆Eelec, is given by the integral of applied current, I = 10 A, and flux linkage Ψ between limits of Ψo and Ψc representing the flux linkage in the open and closed positions respectively. From inspection of Fig. 7, the Eelec integral is equal to the area (A+B). Fig. 7: Ψ − I diagram corresponding to the open and closed armature positions. As described by (6) and (7), the change in stored magnetic field energy, ∆Emag, between the open and closed states is given by (9) which is equal to the area (A+C) with the area (C+D) subtracted to give (A+C)-(C+D)=(A-D). Neglecting the system losses, ∆Eloss = 0, the energy balance given in (4) becomes (10), hence, the change in mechanical energy, ∆Emech, when moving from the armature open to the armature closed position is given by the area (A+B)-(A-D)=(B+D), which is equal to the change in co-energy between the two states. ∆Eelec = ∆Emag + ∆Emech → ∆Emech = ∆Eelec − ∆Emag (10) The mechanical energy is defined as the integral of force, F, and displacement, x, (11), if the respective vectors are parallel and of the same sense. Hence, the numerical change in mechanical energy, derived from the Ψ − I diagram resulting from a change in armature position, ∆x, at a fixed winding current, I, can be used to determine a force-displacement curve of the actuator. Coursework Task 5: In your technical note, include a section on the force on the armature which reports the findings of the analyses performed in this part of the laboratory, including appropriate numerical data, figures and interpretation. Use the analytical expressions for inductance as a function of armature position derived in Section V to generate Ψ − I diagrams for the open armature, closed armature and at least four intermediate positions over a winding current range of I = 0 A to I = 10 A, Fig. 7. Determine the change in co-energy between armature position steps at I = 10 A from the resulting Ψ − I diagrams and find the force-displacement characteristic of the actuator, (11). Repeat this process using the FE numerical model for both core_linear and core_nonlinear materials. Compare and contrast the four Ψ − I diagrams and force-displacement curves. Tabulate and plot the change in co-energy between armature positions of the core_nonlinear model derived from the Ψ − I diagram, trapz(), and that measured from the FE model, mo_groupselectblock(), selects the entire computational domain, Ec = mo_blockintegral(17), calculates the co-energy, mo_clearblock(), clears the selection. VII. CONCLUSION Coursework Task 6: Consider the four modelling approaches used, i.e. analytical equivalent circuit without air-gap fringing, analytical equivalent circuit with air-gap fringing, FE with linear materials and FE with non-linear materials, discuss the limitations of each and explain which method produces the most accurate results. Describe the limitations of this method, considering the 2-d nature of the model. Discuss one or two real world examples where such an actuator may be used. Include other relevant conclusions drawn from the analyses conducted. VIII. TECHNICAL NOTE SUBMISSION Students are expected to submit a two-column individual technical note of no more than 8 pages excluding references conforming to an IEEE academic template which can be found on Blackboard in either Word or LATEX format along with instructions. Coursework tasks 2-6 should be addressed in the technical note. Examples of style, conventions, diagrams and figures can be found in published papers on IEEEXplore. Diagrams of the actuator may be derived from the CAD model. A high-level mark scheme is given in Fig. 8. The following sections are suggested as a guide. 1) Abstract 2) Introduction 3) Winding Resistance 4) Winding Inductance 5) Force on the Armature 6) Comparison of Modelling Methods 7) Conclusion
New York University Computer Science Department Courant Institute of Mathematical Sciences Course Title: Data Communications & Networks Course Number: CSCI-GA.2662-001 Franchitti Session: 11 Assignment 8: Final Project I. Due Friday December 20, 2024 by 11:59 pm EST. II. Objectives Software-defined networking (SDN) is a recent paradigm for running networks. As per the networking layer topics covered in the course, the network is divided into the control and data planes. The control plane provides a set of protocols and configurations that set up the forwarding elements (hosts, switches, and routers) so that they can forward packets. This includes, for example, ARP resolution, DNS, DHCP, the Spanning Tree Protocol, MAC learning, NAT and access control configuration, as well as all of the routing protocols. Usually, switches and routers have to run all of these protocols, detect topology changes, issue heartbeats, manage caches, timeouts, etc. Meanwhile, in many cases network administrators achieve desired goals with the network indirectly, by tweaking parameters in the routing protocols like link weights and local BGP preference. While the data plane is nicely organized in the familiar layered scheme, the aggregate structure of the control plane is a lot less clean. SDN is a radical departure from this organization. The main idea is a separation of the control plane from the forwarding elements. SDN switches and routers do not run control plane protocols and mostly only forward packets based on matching of packet predicates to a set of forwarding rules. They export a simple API to configure these rules, as well as some feedback about current and past packets. An accepted standard for this API is the OpenFlow protocol, which has been implemented by dozens of switch vendors and has fostered a rich software ecosystem. The intelligence of the control plane is (logically) centralized in a network controller. The controller decides which rules to install based on its configuration, and on a global view of the network topology and flows. In this project, you will implement the logic in such a controller to manage the following: III. 1. 2. 3. 4. 5. 6. 7. 8. IV. 1. 2. 3. 4. 5. 6. 1. A layer-3 routing application that installs rules in SDN switches to forward traffic to hosts using the shortest, valid path through the network. Your application logic will manage the efficient switching of packets among hosts in a large LAN with multiple switches and potential loops. You will write the code for a SDN controller application that will compute and install shortest path routes among all the hosts in your network. SDN as described is suitable for networks under a single administrative domain (e.g., the network in a single AS), but there are ongoing research projects to use its flexibility across domains, integrating with and perhaps even replacing BGP. 2. A distributed load balancer application that redirect new TCP connections to hosts in a round-robin order. As always, the NYU and class policy about plagiarism must be followed in this project. If you use ANY code in your project that is not of your own creation, then you MUST attribute that code to the author, even if you modify it (ANY modification). References Slides and handouts posted on the course Web site Textbook chapters as applicable Mininet network emulator documentation (http://mininet.org/) Openflow documentation (https://www.opennetworking.org/sdn-resources/onf- specifications/openflow) Open vSwitch switch software documentation (http://openvswitch.org) Floodlight Java-based SDN controller documentation (https://floodlight.atlassian.net/wiki/spaces/floodlightcontroller/overview) If you have additional questions about SDN, OpenFlow, or Floodlight you may want to consult: openflow-switch-v1.5.1.pdf (opennetworking.org) (sections 2, 3, and 5.1 - 5.4 are likely to be the most useful), and Floodlight-plus Javadoc Additional readings: Software Defined Networking Concepts The Road to SDN: An Intellectual History of Programmable Networks SDN Reading List Software Required Microsoft Word Win Zip as necessary Oracle VirtualBox Virtual Box Image with all necessary software provided Java Programming language, Eclipse, and other development tools installed in Virtual Box Image provided Additional code for Part 4 V. Assignment This is a final take-home project that can be completed individually or as a team (only two students per team). 1. Background: You will run the code for this project in an emulated network inside of a single Linux VM. You will use the Mininet network emulator, which is designed to emulate arbitrary topologies of emulated OpenFlow switches and Linux hosts. It uses container-based virtualization for very light-weight emulated nodes. The switches in your network run the open source Open vSwitch switch software, which implements the Openflow protocol. The switches connect to an Openflow network controller, and you will use Floodlight, a relatively mature Java-based controller. We will use OpenFlow version 1.0 for this project. Your SDN applications will be written in Java and run atop the Floodlight OpenFlow controller. You will use Mininet to emulate a variety of network topologies consisting of OpenFlow switches and hosts. Code you run on Mininet is ready to run with no changes in real networks. 2. Environment Setup: a. Install Oracle VirtualBox as necessary. b. Download the Virtual Box Image with all necessary software provided. It is a .ova image that will enable you to run the necessary software on your computer using the latest version of Oracle VirtualBox. To install the .ova file go to File and Import Appliance on VirtualBox. This VM uses “mininet” as username and password. c. To ssh into the VM from your host computer, log in first using the GUI, open a terminal, and type ifconfig. This will show you the IP addresses of the VM. You will be able to connect to one of them from your host computer via ssh. The VM also has Eclipse installed, which you can use inside the VirtualBox graphical console or remotely via X. Once you have ssh’d into the VM, you can go through the following steps to run your control applications. d. Optional (see acknowledgement in item 8 below): Refactoredu.brown.cs.sdn.apps.sps toedu.nyu.cs.sdn.apps.sps e. Compile Floodlight and your applications: $ cd ~/project3/ $ ant This will produce a jar file FloodlightWithApps.jar that includes the compiled code for Floodlight and your SDN applications. f. Start Floodlight and your SDN applications: $ java -jar FloodlightWithApps.jar -cf l3routing.prop The above command will start Floodlight and only your layer-3 routing application. The .prop file configures your application. Note: For future reference when working on part 4, you can start both your layer-3 routing and load balancer applications by using loadbalancer.prop for the -cf (configuration file) loadbalancer application code is provided separately. argument. The You should alwaysstart Floodlight and your SDN applications before starting Mininet. Also, we recommend that you restart Floodlight and your SDN applications whenever you restart Mininet. Note: In the VirtualBox image, it is possible that the system will start an openvswitch-controller process by default, which means your Floodlight controller will not be able to bind to port 6633. To prevent it from starting the next time you boot up, do: $ sudo update-rc.d -f openvswitch-controller remove When Floodlight starts, you should see output like the following: 23:18:45.874 INFO [n.f.c.m.FloodlightModuleLoader:main] Loading modules from file shortestPathSwitching.prop 23:18:46.277 INFO [n.f.c.i.Controller:main] Controller role set to MASTER 23:18:46.285 INFO [n.f.c.i.Controller:main] Flush switches on reconnect -- Disabled 23:18:46.302 INFO [ArpServer:main] Initializing ArpServer... 23:18:46.302 INFO [ShortestPathSwitching:main] Initializing ShortestPathSwitching... 23:18:48.533 INFO [n.f.l.i.LinkDiscoveryManager:main] Setting autoportfast feature to OFF 23:18:48.579 INFO [ArpServer:main] Starting ArpServer... 23:18:48.580 INFO [ShortestPathSwitching:main] Starting ShortestPathSwitching... 23:18:48.700 INFO [o.s.s.i.c.FallbackCCProvider:main] Cluster not yet configured; using fallback local configuration 23:18:48.701 INFO [o.s.s.i.SyncManager:main] [32767] Updating sync configuration ClusterConfig [allNodes={32767=Node [hostname=localhost, port=6642, nodeId=32767, domainId=32767]}, authScheme=NO_AUTH, keyStorePath=null, keyStorePassword is unset] 23:18:48.790 INFO [o.s.s.i.r.RPCService:main] Listening for internal floodlight RPC on localhost/127.0.0.1:6642 23:18:48.978 INFO [n.f.c.i.Controller:main] Listening for switch connections on 0.0.0.0/0.0.0.0:6633 Keep the terminal with Floodlight open, as you will need to see the output for debugging. Use another terminal for the next step. g. Start Mininet: $ sudo ./run_mininet.py single,3 The above command will create a topology with a single SDN switch (s1) and three hosts (h1 - h3) directly connected to the switch: You can change the number of hosts by changing the numeric value included in the arguments to the run_mininet.sh script. You can also start Mininet with four other topologies: linear,n: a chain of n switches with one host connected to each switch; for example, linear,3 produces the following topology: tree,n: a tree of depth n with a single root switch (s1) and two hosts connected to each leaf switch; for example tree,2 produces the following topology: assign1: creates the following topology (the name is this way for historical reasons): triangle: creates the following topology: mesh,n: a complete graph with n switches and one host attached to each switch; for example, mesh,5 produces the following topology: someloops: creates the following topology: Once mininet has started, you should see Floodlight produce output like the following: 23:24:10.304 INFO [n.f.c.i.OFChannelHandler:New I/O server worker #2-1] New switch connection from /127.0.0.1:58911 23:24:10.329 INFO [n.f.c.i.OFChannelHandler:New I/O server worker #2-1] Disconnected switch [/127.0.0.1:58911 DPID[?]] 23:24:11.016 INFO [n.f.c.i.OFChannelHandler:New I/O server worker #2-2] New switch connection from /127.0.0.1:58912 23:24:11.101 INFO [n.f.c.i.OFChannelHandler:New I/O server worker #2-2] Switch OFSwitchBase [/127.0.0.1:58912 DPID[00:00:00:00:00:00:00:01]] bound to class class net.floodlightcontroller.core.internal.OFSwitchImpl, writeThrottle=false, description OFDescriptionStatistics [Vendor: Nicira, Inc., Model: Open vSwitch, Make: None, Version: 2.0.2, S/N: None] 23:24:11.104 INFO [n.f.c.OFSwitchBase:New I/O server worker #2-2] Clearing all flows on switch OFSwitchBase [/127.0.0.1:58912 DPID[00:00:00:00:00:00:00:01]] 23:24:11.107 WARN [n.f.c.i.C.s.notification:main] Switch 00:00:00:00:00:00:00:01 connected. 23:24:11.108 INFO [ShortestPathSwitching:main] Switch s1 added 23:24:11.138 INFO [ShortestPathSwitching:Topology Updates] Link s1:0 -> host updated 23:24:11.211 INFO [ShortestPathSwitching:Topology Updates] Link s1:1 -> host updated 23:24:11.212 INFO [ShortestPathSwitching:Topology Updates] Link s1:3 -> host updated for debugging. Use another terminal for the next step. h. You can now run commands (e.g., ping) and the like in Mininet. Note that initially ping will not work, as your switches do not know how to do anything. After your controller installs the correct rules, things should work. 3. Layer-3 “Shortest-Path Switching” Routing Application Implementation: Your first SDN controller application consists of code that will run in an SDN controller to compute, install, and maintain shortest paths on a large local area subnet. Given a packet destined to an MAC address, your network will use a shortest path among the switches to deliver it to the host. The hosts in the project will not be changed in any way, it is only the switches in the network that will behave differently. While all the hosts in this project will be in the same subnet, we will not use any broadcasts, including for ARP. When a host wants to send a packet to the IP address of another host in the network, it will first, as it usually does, issue an ARP request. When this reaches the first switch, though, the switch will send the ARP request to the controller instead of flooding the request. The controller, who knows the topology, will respond to the ARP request, through the same switch, to the original sender, with the MAC address of the destination. The controller will also have installed rules on the switches for forwarding to each destination MAC. Your task is therefore to build a global shortest-path switching table and install forwarding rules on the switches to implement these paths. You will build this table on the controller based on global topology information the controller gathers. Your application will construct route tables based on a global view of the network topology. The appropriate route table will then be installed in each SDN switch, and each SDN switch will forward packets according to the route table installed by your application. Differently from regular L2 switches or L3 routers, SDN switches do not hold MAC learning tables or routing tables (used in traditional layer-3 routers). Rather, they use a more general flow table structure, which can replace these, as well as MAC learning tables (used in traditional layer-2 switches), and many other constructs. Each entry, or rule, in a flow table has match criteria that defines (on the basis of fields in Ethernet, IP, TCP, UDP, and other headers) which packets the rule applies to. Each entry also has one or more instructions/actions which should be taken for each packet that matches the rule. There is no concept of a “gateway” in SDN flow tables, but that is okay— your router only uses the gateway to determine how to rewrite a packet’s destination MAC address to ensure correct layer-2 forwarding, and we are not using traditional layer-2 forwarding in SDN. Your layer-3 “Shortest-Path Switching” routing application will install entries that match packets based on their destination IP address (and Ethernet type), and execute an output action to send the packet out a specific port on the SDN switch. (You will use other match criteria and additional instructions/actions for the other SDN application you will write, which is described in Part 4 of this project.) The match criteria serve the same purpose as the destination and mask fields in a traditional route table, and the output action servers the same purpose as the interface field in a traditional route table. In the aggregate, your network will resemble a network in which all switches have converged with the spanning tree protocol and MAC learning, with one important difference: your topology is not constrained to a tree, as you are installing paths individually and loops should not be a problem. In fact, you must test that your solution works on topologies with loops. After the IP packet a. b. c. d. e. f. rules are all installed, the process a host will go through to send an to a destination IP address is as follows: Host OS determines that the node is in the same subnet (will always be true in this assignment). This means the node will send the packet to the IP destination as an Ethernet frame destined to the MAC address of the destination (as opposed to the MAC address of a gateway or router). Host OS issues an ARP request to determine the destination MAC address (if not already cached at the OS). The first switch to see the ARP request, rather than broadcasting it, sends it to the controller as a PacketIn message. The Floodlight module ArpServer (which we provide, see the util package) will respond with the if this host has sent any Ethernet frames before. The host OS will send the IP packet to the destination’s MAC address. At each switch along the path to the destination (as determined previously by your code), the packet will match on the destination MAC address and be forwarded on the correct port. 3.1 Code Overview You will complete the implementation of a Floodlight module in the file ShortestPathSwitching.java in edu.brown.cs.sdn.apps.sps (or edu.nyu.cs.sdn.apps.sps if you refactored that package earlier). The file we provided already contains code to: Access host and topology information from other modules (or applications) included with Floodlight – see the getHosts(), getSwitches(), and getLinks()methods. Receive notifications about changes in the network: see the deviceAdded(), deviceRemoved(), deviceMoved(), switchAdded(), switchRemoved(), and linkDiscoveryUpdate() methods We have also provided code in the edu.brown.cs.sdn.apps.util package (or edu.nyu.cs.sdn.apps.util) if you refactored that package earlier) for: A Floodlight module that responds to ARP requests from hosts – see ArpServer.java Telling a switch to install a rule in the flow table, remove rules from the flow table, and send a packet – see SwitchCommands.java. In this project we will install rules to reach all hosts we know about. In the launch script for Mininet we have added instructions for all hosts to issue an arping, which allows the controller to learn about the hosts’ presence and populate its ARP cache. 3.2 To-Do’s You need to complete the To-Do’s in ShortestPathSwitching.java to install and remove flow table entries from SDN switches such that traffic is forwarded to a host using the shortest path. You should use either the Bellman-Ford or Djikstra algorithms to compute the shortest paths to reach a host h from every other host h’ ∈ H, h ≠ h’ (H is the set of all hosts). You can use the getHosts(), getSwitches(), and getLinks() methods to get the topology information that you need to provide as input to the Bellman-Ford algorithm. Once you have determined the shortest path to reach host h from h’, you must install a rule in the flow table in every switch in the path. The rule should match IP packets (i.e., Ethernet type is IPv4) whose destination MAC is the MAC address assigned to host h. You can specify this in Floodlight by creating a new OFMatch object and calling the set methods for the appropriate fields. The rule’s action should be to output packets on the appropriate port in order to reach the next switch in the path. You can specify this in Floodlight by creating an OFInstructionApplyActions object whose set of actions consists of a single OFActionOutput object with the appropriate port number. SDN switches have multiple flow tables (we discuss this more in Part 4 below). For now, you should install rules in the table specified in the table class variable in the ShortestPathSwitching class. Also, your rules should never timeout and have a default priority (both defined as constants in the SwitchCommands class). When the topology changes you will have to recompute a subset of the paths. For this assignment you may choose to recompute all of the topology or be more efficient and only remove and install the rules that need to change. Part 3 Extra Credit: Implement flooding without loops (essentially calculate and install a spanning tree for broadcasts). Implement ECMP on networks with multiple paths (determine the number of paths between two nodes) and install rules that match on, say, even and odd TCP ports! 3.3 Testing and Debugging You should test your code by sending traffic between various hosts in the network topology—Mininet’s built-in pingall command is very useful for this. While you MUST handle loops in the topology correctly, you can assume that the topology is connected (i.e., we will not test your code with topologies where a host is unreachable from other hosts.) To help you debug, you can view the contents of an SDN switchs flow tables by running the following command in your mininet VM (not in Mininet itself): $ sudo ovs-ofctl -O OpenFlow13 dump-flows s1 This will output the contents of s1’s flow tables. Change the last argument to output the flow tables from a different switch. Triggering Event Handlers: You can trigger the linkDiscoveryUpdate(...) event handler by running any of the following commands in Mininet (substituting switch and host names as desired): o link s1 s2 down — takes down the link between s1 and s2; you can assume the network is a connected graph, so you should never take down a link that would result in a disconnected graph o link s1 s2 up — brings up the link between s1 and s2 o link s1 h1 down — takes down the link between s1 and h1; this will also result in a deviceRemoved(...) event and the isAttachedToSwitch() method for the Host object for h1 will now return false o link s1 h1 up — brings up the link between s1 and h1; this will also result in a deviceMoved(...) event and the isAttachedToSwitch() method for the Host object for h1 will now return true You can trigger the deviceRemoved(...) event handler by taking down a link between a switch and a host, as described above You can trigger the deviceMoved(...) event handler by bringing up a link between a switch and a host, as described above You can trigger the switchRemoved(...) event handler by running the following command in a regular terminal window (not in mininet): $ sudo ovs-vsctl del-br s1 Note that once a switch is removed, you cannot easily add it back without restarting mininet. You can assume the network is a connected graph, so you should never remove a switch that would result in a disconnected graph. Known Issue: when you issue a link ... down command, sometimes we have seen mininet ressurect the link. This seems to be a problem with Mininet. In case this happens, bringing the link down a second time seems to kill it for good. 4. Distributed Load Balance Routing Application Implementation: Networks employ load balancingto distribute client requests among a collection of hosts running a specific service (e.g., a web server). In class, we briefly discussed how DNS could be used to implement load balancing. Load balancing is also commonly implemented using a special piece of hardware. A hardware load balancer is placed in the network and configured with an IP address (e.g., 10.0.100.1) and a set of hosts among which it should distribute requests (e.g., 10.0.0.2 and 10.0.0.3). Clients wanting to communicate with a service (e.g., a web server) running on those hosts are provided with the IP address of the load balancer, not the IP address of a specific host. Clients initiate a TCP connection to the IP address of the load balancer (10.0.100.1) and the TCP port associated with the service (e.g., port 80). For each new TCP connection, the load balancer selects one of the specified hosts (usually in round robin order). The load balancer maintains a mapping of active connections—identified by the client’s IP and TCP port—to the assigned hosts. For all packets sent from clients to the load balancer, the load balancer rewrites the destination IP and MAC addresses to the IP and MAC addresses of the selected host. The mapping information stored by the load balancer is used to determine the appropriate host IP and MAC addresses that should be written into a packet arriving from a client. For all packets sent from servers to clients, the load balancer rewrites the source IP and MAC addresses to the IP and MAC addresses of the load balancer. Your second SDN application will implement the same functionality as a set of hardware load balancers. Your application will be provided with a list of virtual IPs and a set of hosts among which connections to the virtual IPs should be load balanced. (We use the term virtual IP because the IP address is not actually assigned to any node in the network.) When clients initiate TCP connections with a specific virtual IP, SDN switches will send the TCP SYN packet to the SDN controller. Your SDN application will select a host from a pre-defined set, and install rules in an SDN switch to rewrite the IP and MAC addresses of packets associated with the connection. You will also instruct the SDN switch to match the modified packets against the flow rules installed by your layer-3 routing application and apply the appropriate actions (i.e., send the packets out the appropriate ports). 4.1 Code Overview The code for your load balancer application will reside in the LoadBalancer.javasource file provided in finalproject-part4- code.zip (see edu.wisc.cs.sdn.apps.loadbalancer package). The file provided already contains code to: • Receive a notification when a switch joins the network— switchAdded(...) • Receive a packet from a switch when the packet did not match any entries in the switch’s flow table—receive(...) The LoadBalancerInstance class represents a single distributed load balancer. (We use the term distributed because the load balancing is performed at many switches, rather than at a single hardware load balancer.) Each load balancer instance has a virtual IP address, virtual MAC address, and set of hosts among which TCP connections should be distributed. The instances class variable in the LoadBalancer class maps a virtual IP address to a specific load balancer instance. 4.2 To-Do’s It is recommended to refactor the package provided in finalproject-part4- code.zip to edu.nyu.cs.sdn.apps.loadbalancer (see acknowledgment in item 8). Also note that edu.wisc.cs.sdn.apps.l3routing is not used in this project. You need to complete the To-Do’s in LoadBalancer.java to: • Install rules in every switch to: o Notify the controller when a client initiates a TCP connection with a virtual IP—we cannot specify TCP flags in match criteria, so the SDN switch will notify the controller of each TCP packet sent to a virtual IP which did not match a connection-specific rule (described below) o Notify the controller when a client issues an ARP request for the MAC address associated with a virtual IP o Match all other packets against the rules in the next table in the switch (described below) These rules should be installed when a switch joins the network. • Install connection-specific rules for each new connection to a virtual IP to: o Rewrite the destination IP and MAC address of TCP packets sent from a client to the virtual IP o Rewrite the source IP and MAC address of TCP packets sent from server to client Connection-specific rules should match packets on the basis of Ethernet type, source IP address, destination IP address, protocol, TCP source port, and TCP destination port. Connection-specific rules should take precedence over the rules that send TCP packets to the controller, otherwise every TCP packet would be sent to the controller. Therefore, these rules should have a higher priority than the rules installed when a switch joins the network. Also, we want connection-specific rules to be removed when a TCP connection ends, so connection-specific rules should have an idle timeout of 20 seconds. • Construct and send an ARP reply packet when a client requests the MAC address associated with a virtual IP • Construct and send a TCP reset packet if the controller receives a TCP packet that is not a TCP SYN Multiple Tables Your load balancer application should work in tandem with your layer-3 “Shortest-Path Switching” routing application. To achieve this, you will need to leverage the multiple tables feature of OpenFlow switches. When packets first arrive at an OpenFlow switch, they are matched against the rules in table 0. The actions for these rules can specify that the packets be modified, output, sent to the controller, and/or matched against the rules in a different table. Your load balancer application should install rules in the table specified in the table class variable in the LoadBalancer class—set to table 0 in the loadbalancer.prop configuration file. The connection-specific rules that modify IP and MAC addresses should include an instruction (see Rule Instructions/Action paragraph below) to match the modified packets against the rules installed by your layer-3 routing application. Since your layer-3 routing application will install rules in the table class variable in the ShortestPathSwitching class, this instruction should direct packets to the table defined in this class variable. The modified packet will then be matched against these rules and forwarded out the appropriate port. All packets which are not TCP packets destined for a virtual IP, or packets associated with a connection that has already been assigned to a specific host, should be send directly the table used by your layer-3 routing application. Sending TCP Resets Once a particular connection has been assigned to a particular host, all packets for that connection should be directed to that host. However, if no packets are transmitted for more than 20 seconds (specified by the IDLE_TIMEOUT constant in the LoadBalancer class), then we want to remove the rules that perform the rewriting for that particular connection. Ideally, the 20 second idle period should only occur once a flow has ended. However, it’s possible that an active TCP flow could also go idle for some time. If this happens, an entry could timeout prematurely, and the SDN switch will receive TCP packets destined for the virtual IP for which it has no connection-specific flow table entry that matches. These packets will instead match the lower priority rule that sends any TCP packets destined for the virtual IP to the controller. When the controller receives these TCP packets, which are not TCP SYN packets, it should construct and send a TCP reset. You can construct the packet using the classes in the net.floodlightcontroller.packetpackage. You can use the sendPacket(...) method in the SwitchCommands class to send the packet. Sending ARP Packets When a client wants to initiate a connection with the virtual IP, it will need to determine the MAC address associated with the virtual IP using ARP. The client does not know the IP is virtual, and since it’s not actually assigned to any host, your SDN application must take responsibility for replying to these requests. You can construct an ARP reply packet using the classes in the net.floodlightcontroller.packet package. You can use the sendPacket(...) method in the SwitchCommands class to send the packet. Rule Instructions/Actions When a rule should send a packet to the controller, the rule should include an OFInstructionApplyActions whose set of actions consists of a single OFActionOutput with OFPort.OFPP_CONTROLLER as the port number. When a rule should rewrite the destination IP and MAC addresses of a packet, the rule should include an OFInstructionApplyActions whose set of actions consists of: • An OFActionSetFieldwith a field type of OFOXMFieldType.ETH_DSTand the desired MAC address as the value • An OFActionSetField with a field type of OFOXMFieldType.IPV4_DST and the desired IP address as the value The actions for rewriting the source IP and MAC addresses of a packet are similar. When a packet should be processed by the SDN switch based on the rules installed by your layer-3 routing application, a rule should include an OFInstructionGotoTable whose table number is the value specified in the table class variable in the ShortestPathSwitching class. 4.3 Testing and Debugging You should test your code by issuing web requests (using curl) from a client host to the virtual IPs. You can add or remove virtual IPs and hosts by modifying the loadbalancer.prop file. To see which packets a host is sending/recieving run: $ tcpdump -v -n -i hN-eth0 replacing N with the host’s number. 5. Evaluation: This project is worth 100 points (extra credit not included). You will be graded on both the completeness and accuracy of your program, as follows: • Part 3 functionality [70 points]. • Part 4 functionality [25 points] • Style [5 points]: 1. Coding Style: Well-structured, well documented, clean code, with well defined interfaces between components. Appropriate use of comme
Introduction: This assignment aims to test thestudent'sunderstanding of per unit calculation, steady-state analysis and modelling of synchronous generator.The assignment deadline is available on Canvas. Q1(Per Unit Calculation and Steady-State Analvsis) Consider a 2 polesynchronous generator rated at 500 MVA,20 kV,50 Hz and 0.88 power factor with 3 phase stator windings.The inductances andresistances associated with the stator and field windings are listed as follows: a. Please calculate the values forL ,L₄,L/and L in henrys. b. With the machine rated values as base values for stator quantities,please calculate the base values for other statorand rotor quantities. c. Using the calculated base values from b,calculatethe per unit values of the following according to the L -base per unit system: d. Consider damper windings on the d-and q-axes with their per unit inductances and resistances shown in(3)and assume that L is equal to L: If the generator is delivering rated MVA at 0.92 power factor (lag)and rated terminal voltage,please calculatetheinternal angleδ in degrees and the per unit values offollowing electrical variables: Q2 (dg0 transform) Consider the following three-phase positive sequence currentswith frequency of 60 Hz: a. Please calculate the corresponding values ofi,andi,if the rotating dqO frame's d-axis is aligned with phase A axis at time zero. b. Please implement dqO transformation of three-phase currents in(5)using SIMULINK and validate your answer in a. c. What are the values ofi,andi,if d-axis is leading the phase A axis by 90 degrees at time zero?Calculate the result using SIMULINK and explain it.
Applied Stats and Data Analysis EN.553.413-613 Practice Midterm 2 Question 1. Consider the linear model Y = Xβ + ε , where Y is an-by-1 vector of response variables, X is ann-by-p design matrix, β is a p-by-1 vector of coefficients, ε is a multivariate normal Nn (0,σ2In ). Denote by b the least-squares estimate of β . (a) Write down the formula for the least-squares estimate for the regression vector b in terms of matrices X, Y. You don’t need to derive it. (b) What is the distribution of b? Specify the corresponding mean and vari- ance covariance matrix. You don’t need to derive it. (c) Write down normal equations in the matrix form. You don’t need to de- rive them. (d) Write SSE , SSR, SSTo in the matrix form, using matrices Y , H, J. Specify degrees of freedom for each sum of squares. You don’t need to derive anything here. (e) What are the conditions on matrix X such that XTX is invertible? You don’t need to prove anything here. (f) Compute the covariance matrix Cov(b, Y(ˆ)). Show your steps and sim-plify. Your answer should be expressed in terms of X and σ 2 only. What are the dimensions of the matrix Cov(b, Y(ˆ))? Question 2. Consider the following plots of data points in the XY plane, where X is the predictor variable and Y is the response variable. Points in the parallelogram (slanted box) represent evenly distributed data points. The ‘o’ represent unusual observations. (i) For each of the plots (A), (B), (C) and (D) describe whether the unusual observation/s is an ‘outlier with respect to X ’, or an ‘outlier with respect to Y ’, or an ‘outlier with respect to X and Y ’, or none of the above. (ii) Internally studentized residuals (ISR), externally studentized residuals (ESR), and leverage are common diagnostic tools to idenify unusual observations. Which of the three tools are more likely to identify unusual observation in each of the four cases (A), (B), (C) and (D). List best two diagnostic tools for each case. Question 3. Suppose Yi follows the model Yi = β1Xi1 + β2Xi2 + εi where εi is independent, identically distributed and normal with mean zero and variance σ 2 . There is NO INTERCEPT TERM. The graph below shows the individual 95% CI for β1 (horizontal axis) and the 95% CI for β2 (vertical axis), and the 95% confidence region for the overall model fit F-test (the ellipse). Locations A, B and C are possible locations where the origin (0, 0) could be located. (a) For each of the points A, B, C state whether ● β1 is significant OR nonsignificant, ● β2 is significant OR nonsignificant, ● overall model fit is significant OR nonsignificant. You need to write three statements for each point A, B and C! (b) What should be the conditions on predictors X1 and X2 such that case B is much more common than case A. Briefly explain. Question 4. Suppose we wish to understand how blood pressure, Y , in a certain population depends on the patient age and patient asthma status (asthmatic or nonasthmatic). Let X1 be a patient’s age in years, and X2 the asthma status. Note that X2 is a qualitative variable, and X2 is 1 if the patient is asthmatic and X2 is 0 if the patient is nonasthmatic. Consider the second-order interaction model Y = β0 + β1X1 + β2X2 + β3X1(2) + β4X1X2 + β5X1(2)X2 + ε where, again, ε is a normally distributed random variable with mean 0 and constant variance σ 2 . (a) Compute the blood pressure for non-asthmatics in terms of X1 , the age in years, and some or all of the coefficients β0 ,β1 ,β2 ,β3 ,β4 and β5 . Your answer to this part should NOT have any numbers in it–it should be entirely in terms of X1 and the coefficients βi. (b) Suppose we are given the following regression output (note: x1 : x2 de- notes the product term X1X2 ; similarly (x1 )2 : x2 stands for X1(2)X2 ): Coefficients: Estimate Std. Error t value Pr(>|t|) (Intercept) 4.5094 42.2371 0.107 0.9155 x_1 6.3940 5.7774 1.107 0.2752 x_2 -50.8539 56.2080 -0.905 0.3712 x_1^2 0.1318 0.1687 0.781 0.4394 x_1:x_2 17.0645 7.1011 2.403 0.0211 (x_1)^2:x_2 -0.5025 0.1992 -2.522 0.0158 --- Residual standard error: 71 . 69 on 39 degrees of freedom Multiple R-squared: 0 .7682,Adjusted R-squared: 0 .7385 F-statistic: 25.85 on 5 and 39 DF, p-value: 0 . 0000 How many data points there? How many parameters are in the model? I.e., find n and p. (c) Based on this output, state hypotheses and conduct a level α = 0.05 test of whether or not the interaction term between asthma and the square of age is associated with the response. Find the t* and the p-value. Deter- mine your conclusion based on this data. (d) Based on this output, find the interval where the blood pressure in a 35- year-old asthmatic would be with 95% probability. (e) Based on the R output, can you conclude that the only appropriate model for the data is Y = β4X1X2 + β5X1(2)X2 + ε ? Explain why yes, or why no. (f) Do you think there is evidence of multicollinearity in the provided out- put? Briefly explain why yes or why no. Question 5. Consider the following data seton the calories (Ci ) and sodium level (Si ) of several types (Ti ) of sausages. The categorical (or qualitative) variable type (Ti ) can take on three values: “chicken”, “beef” or “pork” . First six rows of the dataset is as follows. There are n observations in total. type, Ti calories Ci sodium Si pork 172 496 chicken 87 359 chicken 143 581 chicken 132 375 pork 190 545 pork 173 458 Consider the following regression output. g1
Photo essay of a deciduous tree (Self-Graded Assignment) Forthisasignment,select adeciduous tree thatyougopastregulary e.g,near your home,clases,orwork.Selectalow branch of the treethat you can easily photograph Takeaphotofthebrancheveryone totwoweeks throughoutheterm,todocument changes inthetresapearance.The branchphotosmust be atleasta weekapart, and each should showatleastseveralleavesand buds and should showeither partof youfe.g,your hand)orasmallobjectofyour choice.Alsotakeaphotof thewholetre on thefirst and last date.Thetrephotoshould show mostorallof the crown.Yourphotosmust be yourown.fyoudonot haveaphone or camera,or have accessibility challenges that are bariers to completing this assignment,talk to the courseinstructor or head TAfor an alternate assignment. The photo essay should include: (1)Boththe scientifc and common name of the species of tree.If you need helpidentifying the tree,you can send yourfrst photostoaTA. (2)TwoPhotos of the entire tree on the firstand last date of observation. (2)Atleast six photos of the branch taken on different dates,with the date of each photo included. (3)Brief observations of the changes in appearance of the leavesand buds (if any)over the duration of observation. (4)Abrief explanation of why these changes haveoccurred,i.e.,why they are adaptive in our climate. The assgnmentis worth 10%of ourgrade.Youwilbe self-grading this assgnmentusing akey thatwilbe provided,and TAswilbereviewing your grading to ensure that it is a fair appraisal. Recommended species: You canchoose any deciduouspecies(thosethat dropalloftheirleaves infall,butwe suggesthefollowingspciesifyou want toobservea particularycolourfultree on campus or in Pacific Spirit Park: Japanese maple (Acer palmatum,bigleaf maple(/Acer macrophylum,vinemaple (Acercicinatum),red maple(Acerubrum),sweetgum(Liquidamborstyracilu),Ginkgo (Ginkgo biloba),larch (Larix sp.)
GPA Analyzer (GPA) Problem. Your friend has asked you to help them with a project. They are interested in analyzing one students’ grades. Create a program which will accept an unlimited number of grades and calculates the average score for all the grades. Assume each test is worth 100 points. Suggested letter grades scale of 90+ ’A’, 80+ ’B’, 70+ ’C’,60+ ’D’ , less than 60 are ’F’. Remember, your data structure must hold an unlimited amount of data. Requirements. · Your code must be readable inside Canvas (no garbage files). · Your code must compile under the gcc compiler (g++ compiler is an alias to gcc). · Your code must execute under Ubuntu 14.00 or greater. · Your output must be logically correct. · Create a numeric menu driven program. Figure 1 is an example of what this menu would look like. Add grade adds a student grade. Display all grades dumps all the scores to the console. Process all grades calculates the gpa for all the grades. The program continues to run until option 4 - quit, is selected. · You cannot use anything from the standard template library. · Use functions whenever possible to modularize your code. Use function prototypes and code the functions under main(). · Include a Source File Header. I’ll look for comments like this: // title.cpp // Pat Jones, CISP 413 // 12/34/56 · Include a ProgramGreeting function which runs at the very start of the program. You can display the same information as in your source file header on the terminal. Main Menu. 1. Add Grade. 2. Display All Grades. 3. Process All Grades. 4. Quit Program. Figure 1: Example of the main menu for this assignment. Specification Bundles. These are additional features for your program. Specifications are bundled into groups: "A", "B", and "C". These groups correspond to the highest grade you can get for your code (i.e. completing "C" specifications means I start evaluating your assignment from a C). This gives you some control over your potential grade. The more work you do, the better grade you can get. There is also a loose association with difficulty, "C" elements tend to be a bit easier than "A" elements. "C" Specification Bundle. // Specification C1 - Three Functions Include at least three functions in your program. Put this specification comment above your function prototype(s). // Specification C2 - Print Scores Print all scores entered to screen when menu selection 2 is chosen. Include the letter grades for each numeric score you print out. Either use a function or method called Grade2Lttr() which receives the numeric score and converts it to a letter grade. Return an ’X’ if the grade score is too high or too low - invalid grade. // Specification C3 - Compute GPA Compute the average for all grades for the client and display it when menu selection 3 is chosen. // Specification C4 - Function Activity to Disk Write a message when every function is called. Save this in a file called “log.txt”. Include a timestamp and a message string for each line you save in your log. Log when a function is called - at a minimum. If you also log the time the function ended, you can then compute the Elapsed Time (or have the program compute it!) for your Peer Review. It is also VERY helpful for debugging to log the incoming and outgoing parameter values. "B" Specification Bundle. // Specification B1 - Dynamic Array Create an array on the heap. Store student scores in it. This array should automatically resize itself - no pseudodynamic arrays! //Specification B2 - Add Elements Start your array at size 0 or 1 (your call) and increase it by one every time you add a new score with menu option 1. Use array pTmp to hold the address of the new memory location and then switch it with the main program data structure - like we did in Class. // Specification B3 - Menu Input Validation Only accept numbers in the range of valid inputs (1..4). Reject all other numeric menu input and re-prompt. Don’t worry about other potential types of errors. I suggest you put this in a function so you can move it to other homework assignments easily. // Specification B4 - Highlight Failing Grades Create a FancyText class which allows you to print a string to the console in a different colored text. The method you pass the string to can either emit a modified string with the ASCII color codes concatenated to it or you can just print to cout in the method. Either way, make failing grades appear in red text and be sure to reset it to normal when you are done. "A" Specification Bundle. // Specification A1 - Date class Put all the date code in class Date class. You will want a method to display the date in the proper format: mm/dd/yyyy. Have the object initialize itself by querying the system date. // Specification A2 - External date initialization Create a method for your Date class called SetDate which allows you to change the date for a particular instance. You call the method and pass in the new date. // Specification A3 - Component Test Method in Date Create a void CompTest method in the date class which performs self diagnostics. That is, it instantiates a date object with known data and then compares the results with expected, correct, answers. Use this to demonstrate your input routines are working. Prove month, day, and year are indeed set correctly by A2 and the resulting output is formatted as expected. // Specification A4 - Unit Test Add a void UnitTest function to your program. You can run A3 here, but also use this to verify your score to letter grade conversion function (C3) is working correctly. Prove each letter works right as well as error checking for too high and too low scores. This runs before your program greeting. It get’s turned off for production code, but I want to see it run and confirm the tests are working on your homework. The more tests, the more reliable, but I want to see at least 2. Due Date. This assignment is due by 11:59 PM on Sunday on the date on the calendar in Canvas. Example, if this assignment appears on the Canvas calendar during week 2, the assignment will be due that Sunday at 11:59 PM. All the assignments are open the first day of class and you can begin working on them immediately. I encourage you to start sooner rather than later with your homework, these always seem to take longer than you think. How to Turn in your Homework. Turn homework in by uploading to the appropriate Canvas Dropbox folder. Save your homework as a .cpp file. Then rename it to a .txt file. Upload this .txt file to Canvas. Don’t zip or otherwise compress your files. Do NOT split your file up into multiple files. I know that is a standard industry practice, but it just get’s in the way for this class. I ONLY accept homework through the Canvas Dropbox. Do not add it to the comments or email me - I will not accept it. If you are having trouble submitting the assignment, email me immediately. Make sure you upload it a few minutes before the assignment closes in Canvas. If you go over by just one second - you are late.
Comp 330 (Fall 2024): Assignment 3 1. (20 points) Let Gbe a context-free grammar (CFG) in a Chomsky Normal Form (CNF). S → AB A → BB | a B → AB | b Use the Cocke-Younger-Kasami (CYK) algorithm to decide if the string s = aabbb is a word of the language L(G). If yes, draw a derivation tree for s computed from your execution of the CYK algorithm. Highlight the symbols selected in the CYK tables. 2. (10 points) Using the pumping lemma for regular languages, show that the language L of words over the alphabet Σ = {a} whose length is a prime number is not a regular language. 3. (10 points) Describe a Turing machine that computer and writen + 1 for a input number n written binary notation on the input tape. Here, we assume that the binary number is written from left to right from the least significant bits to the most significant bits. 4. (30 points) Consider the following language L = {w#w : w ∈ {a, b}*} Show that this language is decidable by 1. Providing a high-level description of a deterministic infinite tape Turing machine M which decides it. 2. Providing the state transition diagram of M. You do not need to prove the correctness of your construction. 5. (30 points) Let Σ = {0} and consider the following function f : Σ+ → Σ+ f (x) = x · x · x. Show that fis a total computable function by 1. Providing a high-level description of a deterministic infinite tape Turing machine M which computes f. 2. Providing the state transition diagram of M. You do not need to prove the correctness of your construction.
PSTAT 160A Fall 2024 - Assignment-4 (Due by November 30 (Saturday), midnight 11:59 pm.) 1. Find the communication classes of a Markov chain with transition matrix Rewrite the transition matrix in canonical form. 2. Show that the stationary distribution for the modified Ehrenfest chain is binomial with param-eters N and 1/2. 3. Consider a Markov chain with transition matrix Identify the communication classes. Classify the states as recurrent or transient, and determine the period of each state. 4. Markov chains are used to model nucleotide substitutions and mutations in DNA sequences. Kimura gives the following transition matrix for such a model. Find a vector x that satisfies the detailed-balance equations. Show that the chain is reversible and find the stationary distribution. 5. Consider a Markov chain with transition matrix where 0 < α, β, γ < 1. Find the transition matrix of the time reversal chain. 6. Classify the states of a Markov chain, with S = {0, 1, 2, 3}, given by the transition probability matrix Write the matrix in the form. where PC = (pij )i,j∈C, Q = (pij )i∈T,j∈C, R = (pij )i,j∈T . Here T the set of transient states and by C the set of recurrent states such that S = C ∪ T. Compute the matrix U = (I1 − R) −1Q of absorption probabilities into the set of recurrent states.
