SELECT SQL_CALC_FOUND_ROWS posting_id, rw1.node_name AS subject, rw2.node_name AS topic FROM posting, rewrite_sol_bm AS rw1, rewrite_sol_bm AS rw2 WHERE ota_id=104146 AND type=1 AND library_status=1 AND posting.subject_id=rw1.subject_id AND posting.topic_id=rw2.topic_id AND rw1.node_type=1 AND rw2.node_type=2 ORDER BY library_downloads DESC LIMIT 0, 20 Online TA Profiles - Homework Help from BrainMass
Online TA Profiles
Georgia Martin, PhD
OTA ID#: 104146

Education Experience: AB, Mathematics, Hood College, 1969
PhD, Physics, The Catholic University of America, 1977
PhD, Mathematics, The University of Maryland at College Park, 1993
Focus of Study: Area of specialization for PhD in mathematics: recursion theory; thesis title: Cantor Singletons, Rank-Faithful Trees, and Other Topics in Recursion Theory.

Area of specialization for PhD in physics: solid-state physics; thesis title: Calculation of Energy Levels of the Ground Configuration of Triply Ionized Rare Earths in a Crystalline Electric Field; Application to Triply Ionized Neodymium in the Bromate Crystal.
Awards: Received the following awards from the National Bureau of Standards, U.S. Department of Commerce:
1. Department of Commerce Bronze Medal Award, 1984.
2. Sustained Superior Performance Award, 1980.
3. Superior Accomplishment Award, 1977.

Graduated from Hood College magna cum laude with Departmental Honors in Mathematics.

Publications: GEORGIA A. MARTIN

LIST OF PUBLICATIONS

1. With M. W. Smith and W. L. Wiese:
Systematic Trends and Atomic
Oscillator Strengths. Nucl.
Instrum. Methods, 110:219-226,
1973.

2. With J. R. Fuhr and B. J. Specht:
Bibliography on Atomic Line
Shapes and Shifts (July 1973
through May 1975). Nat. Bur.
Stand. (U.S.), Spec. Publ. 366,
Suppl. 2. U.S. Government
Printing Office, Washington,
D.C., 1975.

3. With W. L. Wiese: Tables of
Critically Evaluated Oscillator
Strengths for the Lithium
Isoelectronic Sequence. J.
Phys. Chem. Ref. Data,
5:537-570, 1976.

4. With W. L. Wiese: Atomic
Oscillator Strength Distributions
in Spectral Series of the Lithium
Isoelectronic Sequence. Phys.
Rev. A, 13:699-714, 1976.

5. With J. R. Fuhr and B. J. Miller:
Bibliography on Atomic Transition
Probabilities (1914 through
October 1977). Nat. Bur. Stand.
(U.S.), Spec. Publ. 505. U.S.
Government Printing Office,
Washington, D.C., 1978.

6. With S. M. Younger, J. R. Fuhr,
and W. L. Wiese: Atomic
Transition Probabilities for
Vanadium, Chromium, and Manganese
(A Critical Data Compilation of
Allowed Lines). J. Phys. Chem.
Ref. Data, 7:495-630, 1978.

7. With J. R. Fuhr and B. J. Miller:
Bibliography on Atomic Line
Shapes and Shifts (June 1975
through June 1978). Nat. Bur.
Stand. (U.S.), Spec. Publ. 366,
Suppl. 3. U.S. Government
Printing Office, Washington,
D.C., 1978.

8. With B. J. Miller and J. R. Fuhr:
Bibliography on Atomic Transition
Probabilities (November 1977
through March 1980). Nat. Bur.
Stand. (U.S.), Spec. Pub. 505,
Suppl. 1. U.S. Government
Printing Office, Washington,
D.C., 1980.

9. With W. L. Wiese: Transition
Probabilities. Pt. 2 of
Wavelengths and Transition
Probabilities for Atoms and
Atomic Ions. Nat. Stand. Ref.
Data Ser., Nat. Bur. Stand.
(U.S.), No. 68, pages 359-406.
U.S. Government Printing Office,
Washington, D.C., 1980.

10. With J. R. Fuhr, W. L. Wiese,
and S. M. Younger: Atomic
Transition Probabilities for
Iron, Cobalt, and Nickel (A
Critical Data Compilation of
Allowed Lines). J. Phys. Chem.
Ref. Data, 10:305-565, 1981.

11. With W. L. Wiese: Atomic
Spectroscopy. Chap. 5 of A
Physicist's Desk Reference,
edited by Herbert L. Anderson,
pages 92-102. American
Institute of Physics, New York,
1989. Originally published as
chap. 5 of AIP 50th Anniversary
Physics Vade Mecum, edited by
Herbert L. Anderson, pages
96-106. American Institute of
Physics, New York, 1981.

12. With W. L. Wiese: Atomic
Transition Probabilities. In
several issues of CRC Handbook
of Chemistry and Physics. (See,
for example, 66th Edition,
edited by Robert C. Weast, pages
E325-E360. CRC Press, Inc., Boca
Raton, Florida, 1985.)

13. With J. R. Fuhr and W. L. Wiese:
Atomic Transition Probabilities:
Scandium through Manganese. J.
Phys. Chem. Ref. Data, Vol. 17,
Suppl. 3, 512 pages, 1988.

14. With J. R. Fuhr and W. L. Wiese:
Atomic Transition Probabilities:
Iron through Nickel. J. Phys.
Chem. Ref. Data, Vol. 17, Suppl.
4, 493 pages, 1988.

15. With W. Gasarch: Index Sets in
Recursive Combinatorics. In
Logical Methods, edited by J. N.
Crossley, J. B. Remmel, R. A.
Shore, and M. E. Sweedler, pages
352-385. Birkhauser, Boston,
1993.

16. With W. I. Gasarch: Bounded
Queries in Recursion Theory.
Progress in Computer Science and
Applied Logic, Vol. 16.
Birkhauser, Boston, 1999.

17. With R. Beigel, W. Gasarch, M.
Kummer, T. McNicholl, and F.
Stephan: The Complexity of
ODDAn. Journal of Symbolic
Logic, 65:1-18, 2000.

18. With J. Owings and W. Gasarch:
Max and Min Limiters. Archive
for Mathematical Logic,
41:483-495, 2002.
Work Experience: Georgia A. Martin
2000-Present
I am self-employed as a writer, editor, and proofreader (specializing in writing, editing, and proofreading of mathematical and scientific works), and a tutor of math and physics on all levels (elementary school through college and graduate school). [I did quite a bit of editing and proofreading for colleagues while I was in graduate school studying for my Ph.D. in math, and I was a tutor of math, physics, and other subjects from 1973-1999.]

Language, ETC
1993-Present
I teach English as a Second Language to working-class immigrants (adults).

National Bureau of Standards
1969-1986
I evaluated data on atomic transition probabilities and prepared compilations of recommended values. I also devised automated schemes for sorting literature references and publishing annotated bibliographies. One of my regular duties consisted of critically reviewing and editing scientific manuscripts authored by others, both in house and elsewhere.
Skills & Achievements: Enhanced scientific accuracy of numerous manuscripts in mathematics, computer science, physics, and engineering.

Co-authored book on recursion theory for use by professionals, graduate students, and advanced undergraduates in the fields of mathematics and computer science.

Co-authored research articles in mathematics and physics, complex scientific data compilations, and annotated bibliographies.

Improved clarity, precision, and style of numerous mathematical, scientific, and other written communications.

Assisted authors not of English-language origin in writing acceptable prose.

In the course of my self-employment, I have written step-by-step solutions to thousands of math problems, as well as some math lessons, and I have done quite a bit of online tutoring.

The mechanics of the English language (grammar, spelling, punctuation, syntax, and usage) are one of my strong suits.

My study of foreign languages (Spanish, German, French, and Italian) has greatly increased my sense of language in general.
Career Interests: My current plans are to continue as a self-employed writer, editor, proofreader, and tutor.

I set very high standards for myself, I edit for content as well as mechanics, and I do my utmost to provide top-notch service to my clients.
Outside Interests: I like reading, studying languages, helping people, engaging in conversation with intellectuals, thinking about mathematics, and going to museums.
Message to Students
and/or Parents:		 I provide step-by-step solutions, complete with explanations, to questions posed by students, and I try to engage students in understanding the material, not simply in copying solutions.

I recognize the importance of learning a topic thoroughly, so I take great patience with students, and I ensure that they understand one step before going on to the next, and I review prerequisite material whenever appropriate.

If one approach to helping a student doesn't seem to be working, I try approaching the question from a different angle.
Postings Answered: 76
Cumulative OTA Rating: 4.8/5  What is OTA Rating?
Top Solutions Downloads
1-20  21-40  41-60
  1. A binary relation R is defined in terms of a given matrix. Define what it means for a relation to be (a) reflexive, (b), antisymmetric, and (c) transitive. Also, determine which of these are properties of R. - For the set A = {a, b, c}, let R be the relation on A which is defined by the following 3 by 3 matrix M_R: ---------------------------------------- Row 1: 1 0 1 Row 2: 1 1 0 Row 3: 0 1 1 ...
  2. Evaluate the given line integral and the given surface integral. - Do the following: (1) Evaluate Int(P(x, y) dx + Q(x, y) dy) over the curve C, where P(x, y) = y^2, Q(x, y) = 3x, and C is the portion of the graph of the function y = 3x^2 from (-1, 3) to (2, 12). ...
  3. A binary relation R is defined in terms of a given matrix. Determine whether R is a partial order. If it is, draw its Hasse diagram. - For the set A = {a, b, c}, let R be the relation on A which is defined by the following 3 by 3 matrix M_R: ---------------------------------------- Row 1: 1 0 1 Row 2: 1 1 0 Row 3: 0 1 1 ...
  4. Solving Inequalities, and Comparison to Solving Equations - How do you know if a given choice of values of the variables in a given inequality is a solution of that inequality? How is this different from determining if a given choice of values of the variables ...
  5. A binary relation R is defined in terms of a given matrix. Determine the transitive closure of R. - For the set A = {a, b, c}, let R be the relation on A which is defined by the following 3 by 3 matrix M_R: ---------------------------------------- Row 1: 1 0 1 Row 2: 1 1 0 Row 3: 0 1 1 ...
  6. Do the following: (a) Show that the graph G = ({a, b, c, d}, {ab, bc, cd}) is self-complementary. (b) Find a self-complementary graph with five vertices. (c) Prove that if a self-complementary graph has n vertices, then either n is congruent to 0 (mod 4) or n is congruent to 1 (mod 4). - Let G be a graph. Then G = (V, E), where V and E are the vertex set and edge set, respectively, of G. The complement of G, which we will refer to as "G bar," is the graph (V, E bar), where V is the ...
  7. Real analysis: For every real number y, there is a convergent sequence of rational numbers with limit y. - Show that, for every real number y, there is a sequence of rational numbers which converges to y.
  8. Prove that graphs that are isomorphic have the same number of vertices and the same number of edges, and that the degree of a vertex of a graph is equal to the degree of the image of that vertex under a graph isomorphism. Also, give an example of a pair of non-isomorphic graphs that have the same number of vertices and the same number of edges. - What does it mean for two graphs to be the same? Let G and H be graphs. We say that G is isomorphic to H provided that there is a bijection f:V(G) -> V(H) so that for all a, b, in V(G) there is an edg ...
  9. Show that the given type of function on a compact metric space has a unique fixed point. - Assume that (X, d) is a compact metric space, and let f: X -> X be a function such that the inequality d(f(x), f(y)) < d(x, y) holds for all distinct elements x, y in X. Show that f has a unique fixe ...
  10. Determine which of the given strings are recognized by the given deterministic finite-state automaton. - Determine whether each of these strings is recognized by the given deterministic finite-state automaton (which is displayed in an attached .doc file): (a) 010 (b) 1101 (c) 1111110 (d) 010101010
  11. Relation on the set of ordered pairs of positive integers - Let S be the set of ordered pairs of positive integers, let z = (5,8), and define R so that (x1, x2) R (y1, y2) means that x1 + y2 = y1 + x2. Show that the given relation R is an equivalence relat ...
  12. Proof of existence of a one-to-one correspondence between the open interval (0, 1) and the half-open interval (0, 1] - Prove that there is a bijection from the open interval (0, 1) to the half-open interval (0, 1].
  13. Using the given Turing-machine model, create a program for a Turing machine that computes the function f(n) = 2n + 3. - Consider the following Turing-machine model (which is used in one of the standard textbooks in recursion theory, a branch of mathematical logic: Recursively Enumerable Sets and Degrees, by Robert I. S ...
  14. Given the pay structures for two different babysitters, determine the number of hours of babysitting at which the two babysitters charge the same amount of money. - A parent is deciding which babysitter to use in the neighborhood. Babysitter A charges $20 per hour and a base rate of $60 per day. Babysitter B charges a base rate of $50 per day and $25 per hour. Fo ...
  15. Prove that there is a one-to-one correspondence between the power set of a countably infinite set A and the set S of all countably infinite sequences of 0's and 1's, and that the power set of A is an uncountable set. - For any set B, let P(B) denote the power set of B (the collection of all subsets of B): P(B) = {E: E is a subset of B} Let A be a countably infinite set (an infinite set which is countable), and ...
  16. Count the graphs that have vertex set V = {1, 2, 3, ..., n}. - The problem is to let V = {1, 2, 3, ..., n}, and to determine the number of different graphs that can be formed with V as vertex set. See attached file for full problem description.
  17. Let G, H be graphs such that G is a subgraph of H. Prove or disprove each of the following: (a) alpha(G) <= alpha(H) (b) alpha(G) >= alpha(H) (c) omega(G) <= omega(H) (d) omega(G) >= omega(H) - The stability number, alpha(G), of a graph G is the cardinality of the largest subset S of V(G), the vertex set of G, such that no two of the vertices in S are connected by an edge of G. The cliqu ...
  18. Identify the graph of the given polar equation. - Inspect the four given graphs, which are plotted in polar coordinates (and shown in an attached .doc file), and choose the graph that corresponds to the polar equation r = 6 - (cos theta).
  19. Give an example of a binary relation R such that R is irreflexive but R^2 (R squared) is not irreflexive, and give an example of a binary relation R such that R is antisymmetric but R^2 is not antisymmetric. - For each of the following properties, find a binary relation R such that R has that property but R^2 (R squared) does not: (a) irreflexive (b) antisymmetric
  20. Prove that a subgroup is expressible as the union of conjugacy classes if and only if it is a normal subgroup. - Let G be a group, and let H be a subgroup of G. Prove that H is a normal subgroup if and only if H can be expressed as the union of conjugacy classes of G.
1-20  21-40  41-60