can eavesdrop on Chinese communications range to use of undersea platforms like submarines to a variety of antenna systems on the ground up to satellites up to 24,000 miles in space, says Jeffrey T. In fact, spying on the Peoples Republic of China has been one of the National Security Agencys top priorities since it was established in 1952. Yet with a worldwide electronic eavesdropping operation, American intelligence agencies have found it is not impossible. PENETRATING CHINA is a very different challenge from gathering information in the open and apparently porous environment in which flesh-and-blood spies operate. The key to understanding Americas ability to snoop on China is a 50-year-old treaty linking the espionage activities of the United States, United Kingdom and Canada, Australia and New Zealand. effort, say experts in and out of government, is extensive, intrusive and very effective. NEW YORK, June 1 With so much attention focused on how the Chinese government has been spying on the United States, it is easy to lose sight of the fact that Washington has its own insatiable appetite for Chinas secrets. "I remember learning most of multivariable calculus from a teaching assistant when I was an undergraduate, and it was fun to help students learn and interact with them.U.S., allies operate a ‘spying machine’ against Beijing "I enjoyed being a teaching assistant," says Doucette. I just took a complex final and thought I was done in the middle of it, but professor Andrey Nikolaev told me to take a breath and come back. "I’m happy with my experience at Stevens," says Muth. would be a big accomplishment." Doucette also wants to pursue her Ph.D., "so I can become a math professor."Īs excited as they are to move forward, Doucette and Muth are incredibly grateful for what Stevens has given them. "I’m one of the first people in my family to attend college, so getting a Ph.D. "My next big goal is getting my Ph.D.," says Muth. They are also using these successes as a springboard to pursue bigger dreams. "We're excited and very grateful that the GRC winnings allow us to have this opportunity," says Muth. As a result of winning the GRC award, Muth and Doucette will presenting their results at Mathematical Association of America’s MathFest in August. They will continue pursuing those applications in their research. "They gave us ideas for additional applications of our research that we hadn’t considered before." "The questions we got after the talk were helpful and insightful," Doucette says. But, they prepared well-and got a strong reception from their colleagues. "I was a little nervous." "I was very nervous," Doucette says.
"It was a conference all about math, and all about the subject of our paper," says Muth. That experience enabled them to have the strongest possible presentation at the International Southeastern Conference on Combinatorics, Graph Theory and Computing. "We had no expectations, but it was encouraging" Muth adds, "It was a good place to present for the first time, and a good warm up for our next conference." "We hadn’t been there before," Doucette says. "We’re excited about that, too."Īll that success is due in part to their experiences at the Stevens Graduate Research Conference. "We’re also submitting another paper on this research to a journal in a couple weeks," Doucette says. This research, building on domination theory, has a lot of applications for spy networks, computer networks-any type of network." "A lot of applications for higher level mathematics are often difficult to identify. "I’m excited to be involved in research, and I like the applications of it," says Muth. If k=3, we allow for isolates and pairs, but no groups of three or larger." If k=2, we're not concerned with isolated spies but pairs or larger groups, and we dismantle the graph until we're left with, at most, a group of spies who are isolated and don't know each other. "We consider all spies, including an isolated one, an issue and want to dismantle the entire network. "It’s related to network reliability," explaining the spy network scenario. "Our research is on k-component order neighbor connectivity," Muth explains. They’ve had two recent successes with their research: winning a best oral presentation award at the 2018 Stevens Graduate Research Conference, and receiving a request for their paper by graph theoretic domination expert Renu Lasker at the International Southeastern Conference on Combinatorics, Graph Theory and Computing. Doucette and Muth are graduate students in Stevens Department of Mathematical Sciences.
0 kommentar(er)
