<node id="621211">
  <nid>621211</nid>
  <type>news</type>
  <uid>
    <user id="34540"><![CDATA[34540]]></user>
  </uid>
  <created>1556804905</created>
  <changed>1557163746</changed>
  <title><![CDATA[Meet CSE: Xiaojing An Explores the Boundaries of the Outdoors and of Graphs]]></title>
  <body><![CDATA[<p>At the intersection of computing and mathematics, lie graphs. Graphs are abstract data types meant to leverage graph and hypergraph concepts from mathematics, which are then used in&nbsp;<a href="https://www.cse.gatech.edu/content/high-performance-computing">high performance computing</a>&nbsp;(HPC) applications.&nbsp;</p>

<p>Graph computing is a primary research area at the heart of&nbsp;<a href="https://www.cse.gatech.edu/">the School of Computational Science and Engineering</a>&nbsp;(CSE), making it one of school&rsquo;s most identifiable and saught-after areas of study.</p>

<p>Today, we&rsquo;d like you to meet&nbsp;<a href="https://scholar.google.com/citations?user=3Xas7qcAAAAJ&amp;hl=en"><strong>Xiaojing An</strong></a>, a CSE Ph.D. student with a high performance graph algorithm focus indoors, and a love for all that is outdoors.</p>

<p><strong>Advisor:&nbsp;</strong>CSE Chair&nbsp;<a href="https://www.cc.gatech.edu/~bader/"><strong>David A. Bader</strong></a></p>

<p><strong>Research Focus Areas:&nbsp;</strong>High Performance Computing, Graph Algorithms</p>

<p><strong>Hometown:&nbsp;</strong>Luoyang, Henan, China</p>

<p><strong>High School:&nbsp;</strong>Luoyang No.2 High School</p>

<p><strong>Undergrad Degree:&nbsp;</strong>Software Engineering, Zhengzhou University</p>

<p><strong>Current Georgia Tech Degree Program:&nbsp;</strong>Ph.D. in Computational Science and Engineering</p>

<p><strong>Tell us about your research:</strong></p>

<p>My research is in high performance graph algorithms, with a focus on improving existing algorithms and their implementations, and developing new algorithms altogether. I am interested in using approximate approaches to reduce algorithmic complexity. I am also interested in graph learning, specifically, using deep learning to solve computationally intensive graph problems. I have worked on graphics processing units (GPUs) and heterogenous systems, along with shared memory systems.</p>

<p><strong>Where is one of your favorite places to hang out in Atlanta?</strong></p>

<p>I love the&nbsp;<a href="http://www.silvercometga.com/">Silver Comet Bike Trail</a>, which is an amazing biking trail, and&nbsp;<a href="https://www.piedmontpark.org/">Piedmont Park</a>!</p>

<p><strong>If you could create something, what would it be?&nbsp;</strong></p>

<p>I would like to create a sublinear approximate graph algorithm.&nbsp;These are algorithms that run in sublinear time, so they do not even read all of the data before returning an answer. They can be useful in the cases when graphs are so large that it takes a lot of time and energy to process, even just iterating through the whole graph and the associated computation is heavy. This seems almost impossible, and while such algorithms cannot give exact answers, in many real cases approximate results are enough.</p>

<p>Last winter break,&nbsp;I wrote a basic review system on top of the&nbsp;<a href="https://www.ethereum.org/">Ethereum</a>&nbsp;blockchain system. This review system supports voting and rewards. It also uses blockchains to ensure trustworthiness &ndash; in contrast to many existing e-commerce and food reviewing systems &ndash; and to support high-quality reviews. I never implemented the front-end to it, but developing the blockchain components and overall structure was a great learning experience!</p>

<p><strong>What are some of your hobbies?</strong></p>

<p>I have a number of different hobbies ranging from rock climbing, hiking, biking, skiing, badminton, handicraft to cooking, watching movies, and more!</p>

<p><strong>What is a favorite memory from your years at Georgia Tech?</strong></p>

<p>My favorite memory during my time at Georgia Tech is when I went to&nbsp;<a href="https://www.cse.gatech.edu/news/598659/georgia-tech-leads-way-supercomputing-17-hpc-experts">Supercomputing 2017</a>&nbsp;in Denver.&nbsp;I was able to establish connections with researchers, I gained a broader understanding of the field of HPC, and I was exposed to some very interesting presentations. Denver is also a beautiful city! Some labmates and I hiked in Rocky Mountain National Park while it snowed and had a great time.</p>
]]></body>
  <field_subtitle>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_subtitle>
  <field_dateline>
    <item>
      <value>2019-05-06T00:00:00-04:00</value>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_dateline>
  <field_summary_sentence>
    <item>
      <value><![CDATA[A Q&A with CSE Ph.D. Student Xiaojing An. ]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_media>
          <item>
        <nid>
          <node id="620925">
            <nid>620925</nid>
            <type>image</type>
            <title><![CDATA[Xiaojing An]]></title>
            <body><![CDATA[]]></body>
                          <field_image>
                <item>
                  <fid>236481</fid>
                  <filename><![CDATA[XiaojingAn.jpg]]></filename>
                  <filepath><![CDATA[/sites/default/files/images/XiaojingAn.jpg]]></filepath>
                  <file_full_path><![CDATA[http://www.tlwarc.hg.gatech.edu//sites/default/files/images/XiaojingAn.jpg]]></file_full_path>
                  <filemime>image/jpeg</filemime>
                  <image_740><![CDATA[]]></image_740>
                  <image_alt><![CDATA[CSE Ph.D. student Xiaojing An wearing a blue raincoat making peace signs during a hike.]]></image_alt>
                </item>
              </field_image>
            
                      </node>
        </nid>
      </item>
      </field_media>
  <field_contact_email>
    <item>
      <email><![CDATA[kristen.perez@cc.gatech.edu]]></email>
    </item>
  </field_contact_email>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_contact>
    <item>
      <value><![CDATA[<p>Kristen Perez</p>

<p>Communications Officer</p>
]]></value>
    </item>
  </field_contact>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <!--  TO DO: correct to not conflate categories and news room topics  -->
  <!--  Disquisition: it's funny how I write these TODOs and then never
         revisit them. It's as though the act of writing the thing down frees me
         from the responsibility to actually solve the problem. But what can I
         say? There are more problems than there's time to solve.  -->
  <links_related> </links_related>
  <files> </files>
  <og_groups>
          <item>50877</item>
      </og_groups>
  <og_groups_both>
      </og_groups_both>
  <field_categories>
      </field_categories>
  <core_research_areas>
      </core_research_areas>
  <field_news_room_topics>
      </field_news_room_topics>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>50877</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[School of Computational Science and Engineering]]></item>
      </og_groups_both>
  <field_keywords>
          <item>
        <tid>181217</tid>
        <value><![CDATA[cse-hpc]]></value>
      </item>
      </field_keywords>
  <field_userdata>
      <![CDATA[]]>
  </field_userdata>
</node>
