PHYS 1304: Extra credit essay guideline Purpose/Objectives With this project, you are trying to demonstrate that

you are familiar with physics concepts and terminology discussed in our course; that you can explain these concepts in your own words and in a way understandable to another person; and that you can efficiently support your arguments by mathematical equations and figures. Another goal is to introduce you to the structure and style of scientific and technical papers and management of bibliographical sources.
Contents and essential reading

You are invited to explore one of three subjects: Topic Gauss law Chapters in your textbook
Halliday, Resnick, Walker, Chapter 23; Jeffrey Schnick, Chs. 33-35 Halliday, Resnick, Walker, Chapter 25.5-25.7, 32.632.11 Halliday, Resnick, Walker, Chapter 31

Electricity and magnetism in matter

Time-dependent currents in RLC circuits: typical applications

While our textbook provides a basic overview of each subject, you are encouraged to explore it more broadly by consulting other publications and web resources. For example:

HippoCampus interactive lectures, http://www.hippocampus.org/Introductory%20Physics%20II Wikipedia David Griffiths, Introduction to electrodynamics, Prentice Hall, 1999 H. P. Schey: Div, grad, curl, and all that: An informal text on vector calculus -- useful to deepen understanding of Gauss and Ampere's laws and find their expressions in differential form Other references found by searching for Gauss law, etc. in Google

There are a few mandatory issues in each category that will be explicitly graded according to a grading rubric shown at the end of this file. These issues are essential for your understanding of the topic. Explain them in sufficient detail, as 50% of the grade will depend on it. At the same time, be inventive and think if other issues (not explicitly listed in the rubric) are interesting, relevant, and could be included in the essay. The grading will assign up to 6 bonus points for the discussion of such additional related aspects chosen by you.

Basic Requirements Your write-up should include 5 to 8 pages of typed double-spaced text. Please use 12-point font & 1 inch margins. The page limitation includes equations and graphics, but does not include the list of references, which can be added as a separate section if necessary. The text can be typed in any word processor program, such as Word or LyX/LaTeX. All variables in the equations must be explicitly defined and used consistently throughout the whole write-up. In Word 2007, equations can be inserted using the Insert->Object>Microsoft Equation 3.0 option. Alternatively, simple equations can be written by inserting special or Greek symbols and superscripts/subscripts accessible through the Home->Font menu. If your word processor does not support a convenient method to type equations, leave enough blank space at the appropriate locations in the text and write the equations in by hand. Include a few figures showing the layout of the physical systems you are discussing or graphs showing functional dependence of physical variables. A small number of carefully selected figures can be very helpful in delivering your message. Graphics can be included in the main text or placed at the end. In the case of the latter, be sure to clearly label the figures and identify in the text where each is referenced and/or relevant. Again, you are allowed to prepare graphics in any program, copy it from the Internet (with a reference to the original source), or draw it by hand. If it is necessary, you may include more figures in an appendix of no more than 10 pages. Any table or figure that is given in the appendix must be referenced in the text. Structure of the paper Most scientific papers follow a standard layout regardless of their content. An example of this layout is reproduced in the attached file paper_example_essay.pdf. Your paper should follow this layout and include 1. A title must be original, informative, and brief 2. Your name and student ID 3. Date when the paper was written 4. Abstract: a brief statement about the purpose and essential conclusions of the paper; can be omitted in this project 5. Introduction: one or two paragraphs briefly introducing your topic, commenting on its relevance and importance, and outlining the structure of the paper. 6. One or several main sections containing all relevant details, notably: an overview of the essential properties of physical laws and phenomena you are considering; examples of their applications; a remark on the history of their discovery, if applicable. 7. Conclusion: one or two paragraphs summarizing your findings and reiterating most essential observations of the main text.

8. List of references, or bibliography: the main part of the paper must state somewhere which books or websites (sources) you have read when preparing the write-up. If only a few sources were studied, you may acknowledge all of them in one sentence like The essay is based on the material in Chapter 23 of our textbook (Halliday, Resnick, Walker). Sometimes, the paper is not long enough to explain a particular feature in all detail. In this case, a good writing strategy is to summarize this feature in a few sentences and include a reference to another publication where further details can be found. Show this publication in a separate list and refer to it in the main text by its number enclosed in square brackets. For example: In the main text: The phenomenon of paramagnetism is similar to charge polarization in dielectrics, in the sense that reorientation of magnetic dipoles associated with microscopic currents in a paramagnetic material creates its own magnetic field that partially cancels the external magnetic field [5]. In the list of references: [5] J. D. Jackson, Classical Electrodynamics (Wiley: New York, 1999); http://en.wikipedia.org/wiki/Paramagnetism. Word-to-word citations from other sources should be kept to the minimum: at most two or three sentences in the whole paper, or better none at all. Such citations can be usually avoided by rephrasing them in your own language. If you cant avoid including a word-to-word citation, dont forget to enclose it in double quotes and insert a reference to its source in the bibliography. Submission procedure Submit a text file with the paper through an Extra Essay link available in the Assignments area of the PHYS 1304 website. This submission will be automatically compared against the SMU SafeSubmit database to help you identify and properly acknowledge the sources that the paper refers to. If you write equations by hand, submit the text file with blank spaces through the Extra Essay link and give me a hardcopy with all equations. Submission dates 1. Submit the skeleton of the paper to me after the semester break. I will review it and give further advice on how to improve it. 2. Submit the 90% complete version of the paper three weeks before the end of the semester. I will review it and advise on things to fix. 3. Submit the final verion one week before the end of the semester. Organization, style, and grammar You are definitely expected to write with clear prose and good organization. A couple of things to keep in mind: 1. Failing to proofread is intolerable at the college level. Even the best writers must write, check, and rewrite until they have edited themselves into a well-written essay. Three revisions of a completed draft seem to be a minimum to produce good work, but

you are certainly encouraged to do more! Please ask someone else to read your work once you have a working draft. Everyone has a tendency to become so familiar with his/her work that the mistakes can be missed, even after multiple re-readings. 2. Typographical errors are intolerable, especially with modern spelling and grammar checkers. Expect to be penalized if you leave more than a few of these in your essay. Be careful about the proper use of words like sever and severe, and to, too, and two, which would not be caught by a spell-checker. 3. Good organization means that (a) each paragraph is ordered logically with respect to both the one preceding it and the one following, and that (b) paragraphs should always begin with some form of a logical transition from the idea that precedes it. 4. Watch out for redundancy in both word usage (using the same word multiple times in the same or consecutive sentences) and in ideas (stating the same thing more than once or twice). Avoid just doing a list essay, or one where every paragraph and/or section is organized with First, Second, Third, etc., types of transitions.

Grading rubric
1. General considerations Structure and style (7 points) Is the report clear and concise? Was the title brief and informative? Did the report have sections? Were the introduction and conclusion concise and informative? Did paragraph transitions flow smoothly from one paragraph to the next? Were words overused? Were there excessive spelling or typographical errors? Use of mathematics (4 points) Were all mathematical variables identified in the text? Were all equations correct? Did the equations follow a consistent notation throughout the text? Graphics (3 points) Did the figure include graphics to clarify the layout of the physical systems or functional dependence of physical observables? Did the graphics have appropriate titles and labeling? Were figure captions appropriate? References (2 points) Were all literature sources correctly identified? Was the original work by other authors properly acknowledged? Were word-to-word citations used sparingly, enclosed in double quotes, and properly referred to in the bibliography list? Following Guidelines (3 points) Was the first draft turned in on time? Was the project turned in on time? Additional aspects (6 points) Did the paper discuss additional aspects of the subject, besides the mandatory aspects explicitly listed in the rubric? Was this discussion complete, clear, and correct? Total: _________ out of 25 points

2. Contents: Gauss law

Vector of an area: definition (1 pts) electric flux: definition, value for an open, closed surface (3 pts) Gauss law in the integral form (6) Gauss law: two examples of the computation of the electric field for symmetric charge distributions (e.g., charged sphere, charged long cylinder, charged plane) (6) Gauss law: explanation of properties of the electric field inside and on the surface of a conducting body (6) Ampere's law for the magnetic field: equation; analogies with, and differences from, Gauss law (3)
Total: _________ out of 25 points

3. Contents: Electricity and magnetism in matter

atomic description of dielectrics; reaction of dielectrics to the external electric field at the atomic/molecular level; dielectric polarization (4 pts) electric field of an electric dipole and electric dipole in an external electric field (4) macroscopic description of dielectric polarization effects in terms of the dielectric constant (4) dielectrics in capacitors (1) reaction of materials to external magnetic fields; paramagnetism, ferromagnetism, diamagnetism (4) microscopic currents and magnetic dipoles; behavior of a magnetic dipole in an external magnetic field (4) residual magnetisation in ferromagnets; qualitative description of ferromagnetism at the atomic level (3) examples of ferromagnetic materials and their applications (1)
Total: _________ out of 25 points

4. Contents: Time-dependent currents in RLC circuits: typical applications Kirchhoff's rules for time-dependent circuits (4) Differential equations for the current in generic R,L,C circuits; their solutions (4) Exponentially decaying currents in RL and RC circuits (4) Harmonic oscillations in an LC circuit (4) Current, voltage, charge in AC circuits (=circuits with an oscillating e.m.f. source); amplitude and phase of an oscillating current, voltage (6) Energy flow in RLC circuits (3)
Total: _________ out of 25 points

Decoupling Journaling File Systems from Superblocks in Boolean Logic

Pavel Nadolsky March 22, 2010

Abstract
Many physicists would agree that, had it not been for e-commerce, the renement of Moores Law might never have occurred. In fact, few scholars would disagree with the investigation of online courseware algorithms. In our research we verify that the foremost ecient algorithm for the deployment of Lamport clocks is impossible. This article is generated by SCIGen, an Automatic Computer Science Paper Generator (http://pdos.csail.mit.edu/scigen/). It makes absolutely no sense, but provides a good example of the layout and style expected from a scientic paper.

Introduction

In recent years, much research has been devoted to the synthesis of DNS; on the other hand, few have studied the deployment of courseware. A technical quandary in steganography is the improvement of permutable congurations. Similarly, after years of essential research into scatter/gather I/O, we disprove the analysis of interrupts. To what extent can linked lists be developed to surmount this obstacle? We motivate a stable tool for enabling forward-error correction, which we call Taha. Unfortunately, this method is time-limited. Continuing with this rationale, for example, many solutions learn compact models. This is an important point to understand. urgently enough, it should be noted that our heuristic is derived from the development of online algorithms. Neverthe1

less, the synthesis of superblocks might not be the panacea that statisticians expected. Thusly, Taha is in Co-NP. Our contributions are as follows. We validate not only that symmetric encryption can be made cooperative, semantic, and secure, but that the same is true for multi-processors [12, 12, 12]. Second, we concentrate our eorts on validating that public-private key pairs and Web services can connect to answer this grand challenge [8]. Third, we use scalable modalities to prove that semaphores and 802.11b are continuously incompatible. The rest of this paper is organized as follows. First, we motivate the need for Internet QoS. On a similar note, we demonstrate the construction of thin clients. It might seem perverse but is supported by prior work in the eld. We place our work in context with the previous work in this area. Along these same lines, we place our work in context with the existing work in this area. Ultimately, we conclude.

Model

The properties of Taha depend greatly on the assumptions inherent in our model; in this section, we outline those assumptions. Any structured construction of encrypted communication will clearly require that information retrieval systems can be made concurrent, Bayesian, and extensible; our heuristic is no dierent. Despite the results by James Gray et al., we can disconrm that sux trees and SCSI disks are regularly incompatible. This may or may not actually hold in reality. We use our previously emulated re-

Remote firewall
work factor (percentile)

1 0.5 0 -0.5 -1 -1.5 -10

Client A

CDN cache Server A Client B

Gateway

10

20

30

40

50

work factor (# CPUs)

NAT

VPN

Figure 2: The median seek time of our application,

compared with the other systems.
Remote server

Evaluation

Figure 1: Our algorithm stores replicated technology in the manner detailed above.

sults as a basis for all of these assumptions [8].

On a similar note, we ran a year-long trace arguing that our framework is solidly grounded in reality. Rather than learning the study of 802.11b, Taha chooses to observe operating systems. This is a compelling property of our application. Furthermore, our framework does not require such an unproven allowance to run correctly, but it doesnt hurt. See our prior technical 4.1 report [8] for details.

How would our system behave in a real-world scenario? We desire to prove that our ideas have merit, despite their costs in complexity. Our overall evaluation seeks to prove three hypotheses: (1) that expert systems no longer adjust performance; (2) that median time since 1967 is a bad way to measure throughput; and nally (3) that DHCP has actually shown improved mean latency over time. Our performance analysis holds suprising results for patient reader.

Hardware and Software Conguration

Implementation

In this section, we present version 3.5.0 of Taha, the culmination of weeks of coding. The handoptimized compiler contains about 6272 instructions of PHP. since Taha turns the constant-time theory sledgehammer into a scalpel, architecting the hacked operating system was relatively straightforward. The codebase of 32 Simula-67 les contains about 969 lines of ML. it was necessary to cap the complexity used by our system to 230 GHz. Despite the fact that we have not yet optimized for usability, this should be simple once we nish coding the server daemon. 2

One must understand our network conguration to grasp the genesis of our results. We carried out a packet-level emulation on our underwater testbed to prove collectively metamorphic communications impact on the work of French chemist L. Kobayashi. First, physicists added 2kB/s of Internet access to the KGBs 1000-node testbed [12]. We removed 2MB of ROM from our XBox network. Congurations without this modication showed weakened 10th-percentile bandwidth. Along these same lines, we added 3MB/s of Wi-Fi throughput to our sensor-net overlay network. Had we deployed our mobile telephones, as opposed to simulating it in middleware, we would have seen improved results. Next, we quadrupled the oppy disk speed of our mobile telephones to consider modalities. Con-

200 180 160 140 120 100 80 60 40 20 0 -20 -10

popularity of gigabit switches (celcius)

collectively optimal information randomized algorithms independently mobile algorithms probabilistic epistemologies

7000 6000 5000 4000 3000 2000 1000 0 -1000 -60 -40 -20

DHCP planetary-scale

PDF

10 20 30 40 50 60 70 80 90 sampling rate (celcius)

20

40

60

80

power (# CPUs)

Figure 3: The expected bandwidth of our solution, Figure 5: The median signal-to-noise ratio of Taha,
as a function of distance.
-0.88 -0.9 sampling rate (teraflops) -0.92 -0.94 -0.96 -0.98 -1 -1.02 -1.04 -1.06 -1.08 40 50 60 70 80 90 100 interrupt rate (cylinders)

compared with the other methodologies.

4.2

Testing Taha

Figure 4: The eective energy of our framework, as

a function of latency.

tinuing with this rationale, American computational biologists removed 150MB of ROM from MITs desktop machines. In the end, we removed 100MB/s of Internet access from UC Berkeleys mobile telephones to examine the NSAs replicated testbed. When B. Taylor refactored FreeBSDs code complexity in 1977, he could not have anticipated the impact; our work here follows suit. All software components were compiled using GCC 7.5 linked against interposable libraries for constructing gigabit switches. Our experiments soon proved that reprogramming our noisy Commodore 64s was more eective than interposing on them, as previous work suggested. On a similar note, we made all of our software is available under a Microsofts Shared Source License license. 3

Is it possible to justify the great pains we took in our implementation? The answer is yes. Seizing upon this approximate conguration, we ran four novel experiments: (1) we ran 19 trials with a simulated instant messenger workload, and compared results to our hardware emulation; (2) we ran 00 trials with a simulated Web server workload, and compared results to our hardware deployment; (3) we tested our system on our own desktop machines, paying particular attention to eective hard disk space; and (4) we ran 44 trials with a simulated DNS workload, and compared results to our earlier deployment. We discarded the results of some earlier experiments, notably when we ran RPCs on 12 nodes spread throughout the underwater network, and compared them against randomized algorithms running locally. We rst shed light on the second half of our experiments as shown in Figure 5. The results come from only 5 trial runs, and were not reproducible. The many discontinuities in the graphs point to amplied expected throughput introduced with our hardware upgrades. Along these same lines, Gaussian electromagnetic disturbances in our human test subjects caused unstable experimental results. We have seen one type of behavior in Figures 5 and 2; our other experiments (shown in Figure 3) paint a dierent picture. Gaussian electromagnetic disturbances in our network caused unstable experimental results. Despite the fact that

such a hypothesis at rst glance seems counterintuitive, it has ample historical precedence. The data in Figure 3, in particular, proves that four years of hard work were wasted on this project. Similarly, operator error alone cannot account for these results [8]. Lastly, we discuss experiments (1) and (4) enumerated above. Operator error alone cannot account for these results. The key to Figure 4 is closing the feedback loop; Figure 5 shows how our frameworks oppy disk throughput does not converge otherwise. Third, the data in Figure 3, in particular, proves that four years of hard work were wasted on this project.

this area, our method is clearly the algorithm of choice among end-users. A number of related methodologies have harnessed online algorithms, either for the evaluation of expert systems [19, 6, 14] or for the exploration of Markov models [23]. Further, a litany of previous work supports our use of the emulation of Web services. Continuing with this rationale, instead of investigating real-time epistemologies [3, 16, 7], we fulll this aim simply by constructing the development of RAID. we plan to adopt many of the ideas from this existing work in future versions of Taha.

5.2

Telephony

Related Work

The concept of cacheable congurations has been constructed before in the literature [9, 15]. The seminal method by Smith et al. [21] does not simulate Scheme as well as our method [5, 19]. The original approach to this obstacle [20] was excellent; contrarily, this discussion did not completely address this quandary. The original approach to this quagmire by Zheng et al. [11] was well-received; however, this did not completely surmount this quandary. On a similar note, recent work by K. Harris et al. suggests an application for learning Boolean logic, but does not oer an implementation. Though we have nothing against the prior method by Lee, we do not believe that solution is applicable to theory.

The concept of linear-time communication has been improved before in the literature. Continuing with this rationale, a recent unpublished undergraduate dissertation [10] presented a similar idea for the development of 802.11 mesh networks [10, 17, 18]. Furthermore, Harris et al. [4] developed a similar framework, however we veried that our methodology runs in (n2 ) time [7, 1]. In general, our method outperformed all related solutions in this area [2].

Conclusion

5.1

Active Networks

We now compare our method to related cooperative modalities methods [24]. Without using electronic models, it is hard to imagine that the lookaside buer and checksums can interact to solve this issue. Williams and Nehru and Fernando Corbato described the rst known instance of DHTs [13]. A litany of prior work supports our use of information retrieval systems [22]. Along these same lines, the much-touted framework by Zhou et al. does not construct the development of architecture as well as our approach. Thusly, despite substantial work in 4

In conclusion, in this paper we explored Taha, an analysis of Internet QoS. The characteristics of Taha, in relation to those of more well-known methodologies, are famously more compelling. We proved that simplicity in Taha is not an obstacle. We also constructed an analysis of A* search. Therefore, our vision for the future of operating systems certainly includes Taha. We veried in our research that the wellknown decentralized algorithm for the synthesis of kernels by Ito et al. follows a Zipf-like distribution, and our methodology is no exception to that rule. We explored an empathic tool for evaluating RAID (Taha), verifying that checksums and redundancy can collude to achieve this aim. Further, the characteristics of our methodology, in relation to those of more much-touted frameworks, are daringly more robust. We conrmed that DHCP and object-oriented languages can

agree to accomplish this objective. We plan to [16] Rivest, R. The relationship between superpages and the memory bus using Ouphe. In Proceedings of explore more problems related to these issues in OSDI (Dec. 2005). future work.

References
[1] Agarwal, R., Chomsky, N., Sutherland, I., Wilson, Z., Kumar, L., and Maruyama, U. On the simulation of superpages. In Proceedings of the Symposium on Distributed Modalities (July 2000). [2] Feigenbaum, E., Zhao, D., and Gray, J. Amphibious, wearable congurations for DNS. Journal of Pseudorandom, Stable Algorithms 88 (Sept. 1990), 5568. [3] Karp, R., and Hoare, C. A. R. Deconstructing XML using JoyousSax. In Proceedings of FPCA (May 2004). [4] Knuth, D., Wilkes, M. V., and Taylor, C. A development of congestion control. In Proceedings of NOSSDAV (Oct. 2003). [5] Kobayashi, G. The impact of interposable archetypes on cyberinformatics. NTT Technical Review 64 (Aug. 1997), 159195. [6] Kobayashi, R. Towards the analysis of write-back caches. In Proceedings of NDSS (Feb. 1998). [7] Lee, R. The relationship between gigabit switches and B-Trees using MYXA. In Proceedings of the USENIX Technical Conference (June 2005). [8] Maruyama, E., Wu, J., Ullman, J., Martinez, D., and Brooks, R. Improving context-free grammar and simulated annealing. In Proceedings of the USENIX Technical Conference (Jan. 1953). [9] Miller, S., and Welsh, M. A methodology for the emulation of local-area networks. IEEE JSAC 59 (Oct. 1998), 88104. [10] Milner, R., Bose, R., Raman, Q., and Jackson, a. The inuence of interactive algorithms on cryptoanalysis. Tech. Rep. 5970/508, MIT CSAIL, June 1994. [11] Nadolsky, P., and Darwin, C. Optimal, amphibious symmetries. In Proceedings of the Workshop on Psychoacoustic, Wearable Modalities (Apr. 2001). [12] Needham, R., Feigenbaum, E., and Pnueli, A. Collaborative, smart information for semaphores. In Proceedings of SOSP (June 2002). [13] Needham, R., and Watanabe, Q. Pervasive, cacheable symmetries. Journal of Pseudorandom, Smart Technology 1 (Apr. 2002), 7285. [14] Perlis, A., and Ullman, J. Burgoo: Psychoacoustic modalities. In Proceedings of the Workshop on Mobile Modalities (Aug. 2001). [15] Ramasubramanian, V. Renement of the UNIVAC computer. In Proceedings of the USENIX Technical Conference (Nov. 1967).

[17] Robinson, W., and Smith, J. Web services considered harmful. In Proceedings of the USENIX Security Conference (Oct. 2005).

[18] Sasaki, W., Tarjan, R., Hartmanis, J., Brooks, R., and Jacobson, V. A visualization of wide-area networks using MatelessEpitasis. Journal of Concurrent, Reliable Algorithms 3 (Sept. 2004), 154192. [19] Smith, F. Online algorithms no longer considered harmful. In Proceedings of MICRO (Oct. 2001). [20] Thomas, D., Ramasubramanian, V., and Simon, H. Improvement of object-oriented languages. In Proceedings of MICRO (Aug. 2000). [21] Wilkes, M. V. Constructing Web services using empathic archetypes. In Proceedings of MICRO (Nov. 2003). [22] Yao, A. A deployment of Smalltalk. In Proceedings of FPCA (Mar. 2002). [23] Zhao, K. Z., Tarjan, R., and Smith, H. Constructing e-business and kernels. OSR 13 (Nov. 1999), 5864. [24] Zhao, R. Dulcite: A methodology for the study of digital-to-analog converters. In Proceedings of WMSCI (July 2003).