<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>BYU Computer Science Feature Stories</title>
  <link rel="alternate" type="text/html" href="http://cs.byu.edu/articles/feature_story/feed"/>
  <link rel="self" type="application/atom+xml" href="http://cs.byu.edu/articles/feature_story/feed"/>
  <id>http://cs.byu.edu/articles/feature_story/feed</id>
  <updated>2007-12-20T16:51:09-07:00</updated>
  <entry>
    <title>Alum pioneers in family history technology for the LDS Church</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-07-15-byu_cs_alum_pioneers_family_history_technology" />
    <id>http://cs.byu.edu/article/2008-07-15-byu_cs_alum_pioneers_family_history_technology</id>
    <published>2008-07-15T08:43:48-06:00</published>
    <updated>2008-07-17T08:31:18-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/granite_mountain.feature.jpg" title="granite_mountain.jpg" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Heath Nielson received his bachelors and masters degrees from the Computer Science Department at BYU, studying computer graphics and image processing under Dr. William A. Barrett. He is now a software engineer for the LDS Church's FamilySearch program. He is the developer of a new digitizing process, which makes it possible for FamilySearch technicians to digitize the Church's 2.4 million genealogical records in 8-10 years, a process which was originally estimated to take over a century to complete. 
    ]]></summary>
    <content type="html"><![CDATA[<p>
<strong class="byLine">By Jennifer Francis</strong><br />
<span class="byLine">Mormon Times</span><br />
<span class="published">Published: Tuesday, Jul. 15, 2008</span> 
</p>
<p>
<br />
The Family History Department faced a herculean task five years ago. Heath Nielson provided the answer.<br />
<br />
The challenge was digitizing the genealogical records kept in the Granite Mountain Records Vault, a process that would have taken more than a century. But Nielson, a FamilySearch software engineer, helped develop a technology that makes it possible to complete the project in about a decade.<br />
<br />
&quot;Under the old technology, we did not expect to see it in our lifetime,&quot; said Paul Nauta, manager of public affairs for FamilySearch. &quot;The time required to digitize the 2.4 million records that we have rights to digitize is (now) eight to 10 years.&quot;<br />
<br />
Before Nielson's solution, the process was complicated, with steps and substeps required just to start scanning. Each of the 1,200 images on an average roll were captured one at a time by a camera. The flood of images would then flash on a monitor, where the operator checked for errors. These errors easily sneaked past them.<br />
<br />
&quot;You might blink, yawn, close your eyes and might miss the document that wasn't correctly scanned,&quot; Nielson said.<br />
<br />
The operator, moreover, would never know if an image was not captured.<br />
<br />
&quot;To me that is an unacceptable situation, in particular when it comes to family history,&quot; Nielson said. &quot;The missing image could be your family member.&quot;<br />
<br />
With the new technology, scanning starts without delay at the click of a button. The microfilm scanner captures the whole roll of film, resulting in one long image that looks like a ribbon; hence, the pioneering technology implemented by Nielson is dubbed &quot;ribbon scanning.&quot;<br />
<br />
The digitized images will ultimately be accessible online, which will help push family history research forward.<br />
<br />
&quot;This makes it possible to reach out and touch our ancestors,&quot; Nielson said.<br />
<br />
Nielson's interest in family history started at an unconventional age. As a sixth-grader, he visited a local family history library one day. In the library, elderly people filled out long family group sheets in pencil. Nielson had no clue what to do, but he was happy to be there. 
</p>
<p>
&quot;The Spirit of Elijah is strong in this one,&quot; his mother, Alana Nielson, said to a family history librarian. 
</p>
Nielson, born in Portland, Ore., and raised in Vancouver, Wash., shared another childhood story in a voice that broke with embarrassment. Invited to a birthday party, he took out his colored pencils, making careful tracings on a piece of paper. At the party, his friend unwrapped the homemade gift, finding a hand-drawn chart of Nielson's six-generation family tree.<br />
<br />
Nielson also grew an appetite for computers. In fifth grade, he participated in an early morning computer lab, learning basic programming. One morning, Nielson was sick and throwing up. The thought of missing the lab, however, made him sicker than his flu. Nielson staggered to his class, typing on a keyboard with the school's bathroom nearby.<br />
<br />
Later, Nielson served in the Spain Malaga Mission, learning persistence from &quot;knocking, talking and not getting anywhere.&quot;<br />
<br />
After his mission, he went on to earn a bachelor's degree in computer science from Brigham Young University. While his peers were surfing the dot-com wave, he opted to take his passion in computer science to the next level -- a master's at his alma mater. Nielson did not graduate until four-and-a-half years later.<br />
<br />
He forged ahead through financial challenges and a grueling school workload that was more apt for a Ph.D. dissertation. All the while, he headed a budding family that grew to six, including three daughters and a son.<br />
<br />
&quot;There were moments to a young married father, I felt the weight of providing for my family very keenly,&quot; Nielson said. &quot;I'd wonder what the next move was.&quot;<br />
<br />
Nielson's research area was in computer vision under his adviser, Dr. William A. Barrett, former BYU computer science professor and current president of the Wisconsin Milwaukee Mission. Nielson's thesis was on &quot;zoning,&quot; which is a technique to get a computer, among other things, to identify the layout of a document. Through other course work, Nielson also looked at ways to enhance a scanned historical record. He said his adviser thought big, especially when it came to originating the idea of ribbon scanning.<br />
<br />
&quot;Barrett would say, 'Boy wouldn't it be nice if we could,'&quot; Nielson said. &quot;I never thought I'd be the one implementing it.&quot;<br />
<br />
Near the completion of his studies in 2003, Nielson took the only job offer he had -- at the LDS Church's Family History Department.<br />
<br />
&quot;I thought I'm either completely unemployable or I'm meant to work here,&quot; Nielson said.<br />
<br />
Initially, he was unsure if he wanted the job at the expense of trading his T-shirt attire for a suit and tie. A feeling, however, abated all doubts.<br />
<br />
&quot;After talking with my wife, we felt there was something for me to do here,&quot; Nielson said.<br />
<br />
He, indeed, had something to contribute.<br />
<br />
From the onset of the task, Nielson envisioned microfilms being scanned one after another, similar to the roll-off manner of a production line. He and a team of engineers, however, faced several limitations. One of them was the scanner's light bulb, which emits light through a lens, projecting the image onto the camera. The question facing the team was how to get the light bulb to adjust its light throughout the roll of film, accounting for differences in opacity.<br />
<br />
A series of tests failed, and moods dampened.<br />
<br />
Nielson continued focusing on the goal. One day, he abandoned his assigned work to follow &quot;a gut feeling.&quot;<br />
<br />
&quot;I said, 'I'm going to do a skunk work project, so don't ask,'&quot; Nielson said.<br />
<br />
He burrowed himself in a lab, where he set the light at a middle value. This produced a medium-quality ribbon, a digitized film. Nielson and his team then developed software to enhance the ribbon, using the techniques he learned from his time in Barrett's lab.<br />
<br />
&quot;Something might be a limit today, but technology is always moving forward and people can be ingenious,&quot; Nielson said.<br />
<br />
The delayed graduation and gameless job-hunt had launched a life-changing opportunity for Nielson.<br />
<br />
&quot;If I had graduated just several months earlier, there would have been no openings for me at the church,&quot; he said. &quot;I was led where I'm at today, working in the church, tying together two loves that I've had: computers and family.&quot;<br />
<br />
<hr />
<em><br />
E-mail: jfrancis@desnews.com</em> 
    ]]></content>
  </entry>
  <entry>
    <title>Brian Sanderson&#039;s Thesis Defense - &quot;Reducing Seed Load in the BitTorrent File Sharing System&quot;</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-06-20-brian_sandersons_thesis_defense_reducing_seed_load_bittorrent_file_sharing_system_0" />
    <id>http://cs.byu.edu/article/2008-06-20-brian_sandersons_thesis_defense_reducing_seed_load_bittorrent_file_sharing_system_0</id>
    <published>2008-06-13T10:43:18-06:00</published>
    <updated>2008-06-13T10:43:18-06:00</updated>
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[His advisor is Dr. Daniel Zappala
    ]]></summary>
    <content type="html"><![CDATA[An abstract of his defense in on the website's main page.
    ]]></content>
  </entry>
  <entry>
    <title>BYU Computer Science professor receives prestigious international award</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-06-16-byu_computer_science_professor_receives_prestigious_international_award" />
    <id>http://cs.byu.edu/article/2008-06-16-byu_computer_science_professor_receives_prestigious_international_award</id>
    <published>2008-06-16T13:56:18-06:00</published>
    <updated>2008-06-16T13:56:18-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/Sederberg_big_1.feature.jpg" title="Sederberg_big.jpg" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Dr. Tom Sederberg, professor in the BYU Computer Science Department and Associate Dean in the College of Physical and Mathematical Sciences has been awarded the prestigious 2008 John Gregory Memorial Award in Geometric Design.
    ]]></summary>
    <content type="html"><![CDATA[<p class="MsoNormal">
Dr. Tom Sederberg from the BYU Computer Science Department
was recently awarded the 2008 John Gregory Memorial Award in Geometric Design. <span> </span>Remarking on the honor, Dr. Sederberg said, “it
was an unexpected surprise; a very pleasant surprise.”<span>  </span>
</p>
<p class="MsoNormal">
The award presentation took place as part of the Geometric
Modeling seminar held at Germany’s Dagstuhl Castle in May.<span>  </span>The Schloss Dagstuhl - Leibniz Center for
Informatics is the world’s premier venue for informatics.<span>  </span>The Center was created to bring together
interdisciplinary researchers from around the globe.<span>  </span>Scientists in a number of fields relating to
informatics participate in the world-renowned, invitation-only Dagstuhl
Seminars and explore cutting-edge research in computer science.<span>  </span>Named after an early pioneer in the field of
Geometric Design, the John Gregory Memorial Award, given out only every three,
is the highest honor afforded at the Geometric Modeling Seminar and one of the
only awards of its kind in the world. 
</p>
<p class="MsoNormal">
Dr.
Sederberg received the award in recognition of significant contributions to the
field of computer-aided geometric design, where he has pursued cutting edge
research in polynomial and spline algorithms, root finding using Bernstein
polynomials, surface-surface intersection, freeform deformations and T-splines,
which allow artists and designers to add detail and merge models in previously
impossible ways.<span>  </span>His research at BYU led
him to the creation of <a href="http://www.tsplines.com/">T-Splines, Inc.</a>,
a company which makes T-splines available to the industry.<span>  </span>Dr. Sederberg is recognized worldwide for his
research in computer aided geometric design, computer graphics, computational
algebra, and algorithmic algebraic geometry.<span> 
</span>He has published prolifically; 11 of his papers have been accepted by
SIGGRAPH, the foremost computer graphics association in the United States.<span>  </span>In 2006, he received the ACM-SIGGRAPH <span>Computer Graphics Achievement Award in
recognition of his achievements in this field.<span> 
</span></span>
</p>
<p class="MsoNormal">
<span>Dr. Ron Goldman of Rice University, one of
Dr. Sederberg’s mentors during his time at Purdue, introduced Dr. Sederberg at
the Dagstuhl Conference.<span>  </span>In addition to
acknowledging Dr. Sederberg’s accomplishments in the field of computer science,
Dr. Goldman remarked, “Tom is one of the nicest people you will ever meet. He
is friendly, warmhearted, accessible, calm, and tireless, as well as a devoted
husband and father.”</span>
</p>
    ]]></content>
  </entry>
  <entry>
    <title>Dr. Parris Egbert named as new Computer Science Department chair</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-06-01-dr_parris_egbert_named_new_computer_science_department_chair" />
    <id>http://cs.byu.edu/article/2008-06-01-dr_parris_egbert_named_new_computer_science_department_chair</id>
    <published>2008-05-29T16:34:43-06:00</published>
    <updated>2008-06-02T10:22:23-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/Egbert_small.jpg" title="Egbert_small.jpg" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[After serving as chair of the Computer Science Department for nine years, Dr. Tony Martinez is stepping down to pursue other duties in the department and his research in the department's Neural Networks and Machine Learning Laboratory.  In a faculty meeting with the Dean and Assistant Deans from the College of Physical and Mathematical Sciences, Dr. Parris Egbert was named the new department chair, effective June 1, 2008.    
    ]]></summary>
    <content type="html"><![CDATA[<p>
After serving as chair of the Computer Science Department for nine years,
Dr. Tony Martinez is stepping down to pursue other duties in the department and
his research in the Neural Networks and Machine Learning Laboratory.  In a
faculty meeting with the dean and assistant deans from the College of Physical
and Mathematical Sciences, Dr. Parris Egbert was named the new department
chair, effective June 1, 2008. 
</p>
<p>
Dr. Egbert received bachelors degrees in computer science and mathematics
from Utah State University in 1986.  He later attended the University of
Illinois at Urbana-Champaign where he completed masters (1990) and doctoral
(1992) degrees in computer science. Upon completion of his Ph.D., Dr. Egbert
joined the BYU Computer Science faculty.
</p>
<p>
Dr. Egbert's research interests include real-time 3D computer graphics, global
illumination for computer graphics, object-oriented graphics, tools for computer
animation, and the creation and navigation of virtual environments.  As director
of the 3D Computer Graphics Lab in the BYU Computer Science Department, he is
currently conducting research in several areas related to interactive 3D
graphics and virtual environments. His work has been published in SIGGRAPH,
CVPR, Transactions on Graphics, Computational Intelligence, and other journals
and conferences; many of his students have gone on to graduate school or have
accepted prestigious positions at animation studios such as Pixar and
Industrial Light + Magic. Dr. Egbert is also a member of the executive
committee for the Center for Animation at BYU; he and his students have
contributed to several of BYU's award-winning animated shorts in the past few
years. 
</p>
<p>
Dr. Egbert and his wife, the former Lori Gurr, are the parents of nine
children.
</p>
<p>
Speaking of the changes in the department, Dean Sommerfeldt, of the College
of Physical and Mathematical Sciences said, &quot;[Dr. Martinez] has provided
strong and capable leadership to the department for many years.  He has
been an effective advocate for the department and has overseen significant
growth in the teaching and scholarship activities within the department. 
He has helped instill a positive vision throughout the department that promises
to yield continued growth even as he leaves his position as chair of the
department.&quot;  
</p>
<p>
Dean Sommerfeldt continued, &quot;[Dr. Egbert] brings strong leadership
skills to his new position that will help him to foster continued growth in the
department.  We look forward to working with him in this capacity, and we
are confident that he will oversee continued outstanding teaching in the
department, as well as increasingly strong scholarship.  The future
appears bright for the department.&quot;  
</p>
<p>
Other changes in the department include the appointment of a new associate
chair and graduate coordinator.  Christophe Giraud-Carrier has been
appointed to serve as the associate chair of the department, replacing Dr.
Bryan Morse, who previously held the position. In addition, Dr. Kent Seamons
has been selected to be the department’s graduate coordinator, replacing Dr.
Egbert in this position.
</p>
<p>
Dr. Giraud-Carrier is an associate professor and director of the Data Mining
Laboratory in the department. Prior to joining BYU in 2004, he was senior manager
at ELCA, a Swiss IT services company, where his responsibilities included the
capitalization of data mining expertise, responses to tenders, and the
management of various projects for companies, local governments and NGOs. Prior
to this, he was Senior Lecturer in the Department of Computer Science at the
University of Bristol, where he founded and led the Machine Learning Research
Group. Dr Giraud-Carrier received his bachelors, masters, and doctoral degrees
in computer science at BYU in 1991, 1993, and 1994, respectively.
</p>
<p>
Dr. Giraud-Carrier is married to the former Isabelle Mauclair, and they are
the parents of eight children.
</p>
<p>
Dr. Kent Seamons has been chosen to replace Dr. Egbert as the department's
graduate coordinator.  Dr. Seamons is an associate professor and the director
of the Internet Security Research Lab in the department. Prior to joining the
faculty at BYU in 2000, Dr. Seamons was the principal investigator on several
DARPA-sponsored research projects at the IBM Transarc Lab in Pittsburgh, PA. He
was a co-inventor of two patent applications filed in 21 countries by IBM in
the area of trust negotiation. He received his PhD in Computer Science from the
University of Illinois at Urbana-Champaign, where he conducted research in
parallel I/O.  Dr. Seamons' current research is the creation of convenient
and secure authentication techniques in open systems.<span>  </span>His research interests are in trust and
privacy in open systems, usable security, and trust negotiation.<span>  </span>Dr. Seamons has over 45 research publications
in the areas of trust and security, parallel I/O, distributed systems, and
information retrieval.
</p>
<p>
Dr. Seamons and his wife, the former Linda Knupp, are the parents of three
children.
</p>
    ]]></content>
  </entry>
  <entry>
    <title>Dr. Sean Warnick awarded prestigious national honor</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-05-19-dr_sean_warnick_awarded_prestitigious_national_honor" />
    <id>http://cs.byu.edu/article/2008-05-19-dr_sean_warnick_awarded_prestitigious_national_honor</id>
    <published>2008-05-19T10:54:18-06:00</published>
    <updated>2008-06-05T08:46:54-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/mentoring_pic.feature.JPG" title="mentoring_pic.JPG" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Dr. Sean Warnick, Assistant Professor in the Computer
Science Department at Brigham Young University, was selected as the 2008
Distinguished Visiting Professor (DVP) by the National Security Agency (NSA)
this week.<span>  </span>The position, administered by
the NSA Enterprise Operations Research, Modeling, and Simulation (OR/M&amp;S)
Group, is highly competitive and is offered to a professor with a distinguished
record in both decision science applications and student mentoring.
    ]]></summary>
    <content type="html"><![CDATA[<p>
Brigham Young University News Release 
</p>
<p>
The National Security Agency has selected a 
Brigham Young University computer science professor to mentor top graduate-level 
interns working on key national security issues for the U.S. Department of 
Defense.
</p>
<p>
As this year's Distinguished Visiting Professor, 
Sean Warnick will mentor top-notch interns from the NSA's Summer Program for 
Operations Research Technology (SPORT) program, helping them create mathematical 
models, conduct decision analysis and employ sophisticated simulations on some 
of the most state-of-the-art computing facilities in the world.  
</p>
<p>
Warnick said he was &quot;quite surprised&quot; when the 
government called him last summer and asked him to apply for the program.
</p>
<p>
&quot;Apparently it's not just an any ordinary summer 
position, but an opportunity to work on a wide range of important projects,&quot; 
Warnick said. &quot;I am eager to spearhead a strong relationship between our 
students at BYU and the Department of Defense.&quot; 
</p>
<p>
Administered by the NSA Enterprise Operations 
Research, Modeling and Simulation Group, the position is highly competitive and 
is offered to a professor with a distinguished record in both decision science 
applications and student mentoring.
</p>
<p>
&quot;It is important that we connect to the best 
emerging talent when solving critical problems,&quot; said Francine Goode, director 
of the SPORT program. &quot;To help us with that, we conduct a national search and 
select a unique individual who not only understands the technical nature of the 
problems we are working on, but also has the ability to connect with students 
and bring out the best they have to offer.&quot;
</p>
<p>
Warnick's aptitude for connecting with students 
and the breadth of his research applications impressed Goode and other NSA 
representatives who visited his Information and Decision Algorithms Laboratories 
(IDeA Labs) at BYU last fall.
</p>
<p>
&quot;It is an amazing environment where students from 
various disciplines come together to work on decision problems arising in a 
variety of areas, from microbiology to economics,&quot; Goode said of the lab.
</p>
<p>
Warnick's work focuses on the feedback control of 
complex dynamical systems, with applications including proteomic network 
reconstruction, scheduling of batch manufacturing systems, and market power and 
valuation analyses in merger-and-acquisition studies.
</p>
<p>
He received his doctorate in electrical 
engineering and computer science from the Massachusetts Institute of Technology 
in 2003, was a visiting scholar in the Control Systems Group at Cambridge 
University during the summer of 2006 and is the founding director of IDeA Labs 
at BYU.
</p>
    ]]></content>
  </entry>
  <entry>
    <title>Nathaniel Price, CS Webmaster, given top student employee honor</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-04-01-cs_webmaster_nathaniel_price_given_top_student_employee_honor" />
    <id>http://cs.byu.edu/article/2008-04-01-cs_webmaster_nathaniel_price_given_top_student_employee_honor</id>
    <published>2008-04-01T12:31:49-06:00</published>
    <updated>2008-04-01T14:50:50-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/Nathaniel--Student+Employee+of+the+Year.feature.JPG" title="Nathaniel--Student Employee of the Year.JPG" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Nathaniel Price of Oregon City, Oregon has worked as the Computer Science Department&#39;s student webmaster for the past three years.&#160; In recognition of his skilled service and dedication, the University has named him BYU&#39;s Student Employee of the Year.     ]]></summary>
    <content type="html"><![CDATA[<p>A student employee committee recognized Nathaniel Price, one of the Computer Science Department&#39;s student webmasters, as the university&#39;s student employee of the year. </p><p>Out of the 13,000 students employed by the university, over 100 were nominated.&#160; Nathaniel was selected from among those nominees to be recognized for his service to the university and the Computer Science Department.&#160; </p><p>A senior in computer science, Nathaniel is from Oregon City, Oregon.&#160; In the three years that he has worked for the department, he has gone above and beyond the average student employee in his contributions. &#160; </p><p>One of Nathaniel&#39;s contributions has been to streamline the hiring process for students in the department.&#160; Nathaniel created a program in which professors can go online to request students who have applied for RA and TA positions.&#160; The requests are then sent to the department office and from there to the university employment office, allowing the entire hiring process to be paperless and online.&#160; </p><p>Gene Larson, operations and systems manager for the computer science department, said how much easier life is with this new program.</p><p>&quot;Students can apply and faculty can go through the selection process online,&quot; Larson said. &quot;We used to have full-time employees keeping track of these student employees. Nathaniel&#39;s system now takes care of all this.&quot;</p><p>Office manager Gordon Billings was also impressed with Price&#39;s adaption to situations.</p><p>&quot;He&#39;s very adept at taking requests from technical and non-technical people and deciphering what they want and need,&quot; Billings said.</p><p>More recently, Nathaniel upgraded the department&#39;s website to a Drupal system in which multiple users can take ownership over different parts of the website, managing and updating it themselves.&#160; <br /></p>The Computer Science Department wishes to congratulate Nathaniel for this much-deserved recognition and give him a heartfelt thank you for his hard work and dedicated service, which keeps us running smoothly!     ]]></content>
  </entry>
  <entry>
    <title>Graduate students present in Prague</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-03-19-graduate_students_present_in_prague" />
    <id>http://cs.byu.edu/article/2008-03-19-graduate_students_present_in_prague</id>
    <published>2008-03-19T15:42:53-06:00</published>
    <updated>2008-03-19T15:44:17-06:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/prague+3.feature.jpg" title="prague 3.jpg" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Robbie Haertel and James Carroll, two PhD candidates in the Computer Science Department presented their research at a conference in Prague.&#160; Their research on a Bayesian model for the annotation of ancient texts may help scholars unlock mysteries of the early Christian church. &#160;     ]]></summary>
    <content type="html"><![CDATA[  <p class="MsoNormal">In Prague, the traditional and contemporary collide.&#160; In this &#8220;city of a hundred spires,&#8221; telephone lines interlace before facades of centuries-old gothic cathedrals, while in the streets businessmen in suits pass Czech <em>babickas</em> on their way to market.&#160; This city, at once ancient and modern, was an ideal setting for the Conference on Electronic Corpora of Ancient Languages, held on November 16 and 17 of 2007.&#160; Two BYU Computer Science students, James Carroll and Robbie Haertel, traveled to the conference and presented papers.&#160; </p>  <p class="MsoNormal">James, a member of Dr. Kevin Seppi&#8217;s Applied Machine Learning Laboratory, is also a part-time faculty member in BYU&#8217;s Department of Ancient Religion.&#160; Robbie, who researches with Dr. Eric Ringger in the Natural Language Processing Laboratory, is a recent graduate of the masters program in BYU&#8217;s Linguistics Department.&#160; While in Prague, Robbie was able to present his master&#8217;s thesis, a paper on a Wikipedia-like interface for a database of Mayan hieroglyphs.<span>&#160; </span>Both James and Robbie are seeking PhDs in computer science as a means to combine their divergent interests in ancient languages and modern technology.&#160; </p>  <p class="MsoNormal">James was the primary author on the paper, entitled &#8220;Utility Issues with Active Learning for Annotation of Ancient Language Corpora.&#8221; Robbie, fellow student Peter McClanahan, and Drs. Ringger and Seppi are listed as co-authors.&#160; As the name indicates, corpora (singular: &#8220;corpus&#8221;) are large bodies of text.<span>&#160; </span>Corpora are often tagged with linguistic information, such as parts of speech.&#160; Tags on words allow researchers to quickly and efficiently search through the text for particular word usage in specific contexts.<span>&#160; </span>This enables the gleaning of important information and analysis from the writings.&#160; In recent years, scholars in BYU&#8217;s Center for the Preservation of Ancient Religious Texts (CPART) completed such a project involving the Dead Sea Scrolls.&#160; Current research is focused on bodies of writing in the Syriac language, which is a dialect of Aramaic, one of the languages spoken by Christ and His disciples in the meridian of time.&#160; A number of early Christian documents, including a huge body of work written by a man known as Ephrem the Syrian, were written in the Syriac language.&#160; Creating a corpus of these writings should unlock new insights into the life of Christ and His early followers as well as into the nature of early Christian churches in the Near East.</p>  <p class="MsoNormal">However, the act of tagging, or the process of actually annotating corpora, is arduous and costly when performed by humans.&#160; The costs of human annotation can be reduced through machine learning techniques; however computerized annotation can be less accurate.&#160; As a result, it is difficult for researchers to decide when to let computers do the work of annotation and when it is necessary for humans to take over.&#160; James&#8217; and Robbie&#8217;s paper analyzes the interactions between human and machine and creates a statistical model of the annotation process using a Bayesian approach.&#160; Their model shows when computers should shoulder the task of annotation, and when it&#8217;s best for humans to step in.&#160; The model also shows researchers places where humans should tag the text in order to most effectively teach computers to do the work in the future.&#160; By using this Bayesian approach, James and Robbie are able to minimize human annotation cost and better implement machine learning techniques.&#160; Their discoveries may act as a guide for researchers as they plan future corpus creation projects.&#160; </p>      ]]></content>
  </entry>
  <entry>
    <title>IDeA Labs Sends Two Students to the 46th Annual IEEE Conference</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-02-14-idea_labs_sends_two_students_to_the_46th_annual_ieee_conference" />
    <id>http://cs.byu.edu/article/2008-02-14-idea_labs_sends_two_students_to_the_46th_annual_ieee_conference</id>
    <published>2008-02-13T11:51:34-07:00</published>
    <updated>2008-02-14T13:20:53-07:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/New+Orleans.feature.JPG" title="New Orleans.JPG" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Sam Weyerman, a Ph.D. student, and Russell Howes, an undergraduate student, recently attended and presented at the 46<sup>th</sup> Annual IEEE Conference on Decision and Control (CDC). Sam and Russ are both currently members of IDeA Labs here at BYU.&#160; The conference, sponsored by IEEE (Institute of Electrical and Electronics Engineers, Inc.), SIAM (Society for Industrial and Applied Mathematics), and INFORMS (Institute for Operations Research and the Management Sciences), was held in New Orleans, LA from 12-14 December 2007.    ]]></summary>
    <content type="html"><![CDATA[<p>Sam Weyerman, a Ph.D. student, and Russell Howes, an undergraduate student, recently attended and presented at the 46<sup>th</sup> Annual IEEE Conference on Decision and Control (CDC). Sam and Russ are both currently members of IDeA Labs here at BYU.&#160; The conference, sponsored by IEEE (Institute of Electrical and Electronics Engineers, Inc.), SIAM (Society for Industrial and Applied Mathematics), and INFORMS (Institute for Operations Research and the Management Sciences), was held in New Orleans, LA from 12-14 December 2007.<br /><br />Sam Weyerman presented his paper &quot;Monotonically Improving Error Bounds for a Sequence of Approximations for Makespan Minimization of Batch Manufacturing Systems&quot; at the conference. This work, done in collaboration with his advisor, Dr. Sean Warnick, presents analysis on a sequence of approximations for a class of dynamic programming problems. They showed that the error due to the approximation is bounded and that these bounds monotonically improve as the approximation approaches the exact problem. This result allows decision makers to choose a level of approximation, and hence an amount of necessary computation to achieve a solution, with a guarantee of how good the solution will be.<br /><br />Russell Howes and advisor Dr. Sean Warnick presented their paper &quot;Dynamical Structure Functions for the Reverse Engineering of LTI Networks&quot; in the main poster session. Their work, in collaboration with Dr. Jorge Gon&#231;alves of Cambridge University, develops a method to represent the network structure of linear, time-invariant (LTI) systems. Dynamical structure functions contain information about both structure and dynamics of a system. This way of looking at network structure is especially useful in applications such as biochemical networks. Their main result uses dynamical structure to precisely characterize the additional information required to obtain network structure from the transfer function (input-output data) of the system.<br /><br />IDeA Labs is led by directors Jeffrey Humpherys and Sean Warnick, both professors here at BYU.&#160; IDeA Labs is an acronym for Information and Decision Algorithms Laboratories.&#160; The labs house an interdisciplinary research program dedicated to a computational mathematics education for students who are well rounded technical problem solvers.&#160; The program centers around the research application of Algorithmic Decision Processes, the study of the dynamics of systems that process data in making decisions. More information about current projects can be found online at <a href="http://idealabs.byu.edu/" target="_blank">idealabs.byu.edu</a> .</p><p>Article by Jake Mattinson, BYU IDeA Labs&#160;</p>    ]]></content>
  </entry>
  <entry>
    <title>IDeA Labs Continues Strong</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2008-01-29-idea_labs_head_into_second_year" />
    <id>http://cs.byu.edu/article/2008-01-29-idea_labs_head_into_second_year</id>
    <published>2008-01-29T12:04:50-07:00</published>
    <updated>2008-02-13T11:49:33-07:00</updated>
    <link rel="enclosure" type="image/jpeg" href="http://cs.byu.edu/files/images/26972.feature.jpg" title="26972.jpg" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[<p>With increased funding and student participation, the dynamic collaboration between the Computer Science, Mathematics, and Statistics departments heads into a new year.&#160;&#160;&#160;</p><p>Article by Autumn Buys, BYU NewsNet <br /></p>    ]]></summary>
    <content type="html"><![CDATA[<div class="articletext"> <p>With her blue dry erase marker and notes in hand, Hayley Mattson stepped up  to the whiteboard and began explaining the mathematics behind a bid-ask spread.  She had spent the last nine months researching this model - which determines the  winner in the stock market&#39;s version of survival of the fittest - and others.  </p><p>Mattson is one of 10 students to benefit from a $700,000 grant given to BYU&#39;s  Information and Decision Algorithms Laboratory (IDeA Labs) from the National  Science Foundation in 2006. Applications have already begun trickling in from  students hoping to take her and her peers&#39; places next year </p><p>In addition to the funding from NSF, the labs receive donations from  industrial partners and other groups they work closely with. </p><p>The NSF review panel chose IDeA Labs&#39; proposal over its competitors because  of its potential to function as a national model for how mentoring can be done  in the computational and mathematical sciences.  </p><p>Last year, IDeA Labs directors Jeffrey Humpherys and Sean Warnick received  about 15 applications, and they expect to double that number this year.  </p><p>&quot;The applicant pool is looking really strong this year,&quot; Humpherys said. &quot;We  took 10 really strong people last year. ... This year I think we are going to  have 12, maybe even 15 really strong students who are highly motivated and  extremely energetic. And we feed off of that energy as faculty.&quot;  </p><p>IDeA Labs&#39; NSF program takes up to 12 students, who each receive a $10,000  scholarship, and immediately immerses them in an intense summer workshop known  as the Computational Science Training for Undergraduates in the Mathematical  Sciences, where they learn the computational skills necessary to begin  developing their respective research projects. The following year, they continue  to pursue their research ideas, with the eventual submission of a final paper  for journal publication. </p><p>&quot;To take everybody in and have them learn together, to have a group that  feeds off each other and works in tandem, that structure could be something we  see more of,&quot; Humpherys said. </p><p>Students can apply online at idealabs.byu.edu by March 14.</p><p><em>Photo Courtesy of Autumn Buys</em></p><p>&#160;</p><p>&#160;</p><p>&#160;</p><p>&#160;</p><p>&#160;</p></div>    ]]></content>
  </entry>
  <entry>
    <title>Implicit Affinity Networks--new research from the BYU Computer Science Department</title>
    <link rel="alternate" type="text/html" href="http://cs.byu.edu/article/2007-12-20-implicit_affinity_networks_new_research_from_the_byu_computer_science_department" />
    <id>http://cs.byu.edu/article/2007-12-20-implicit_affinity_networks_new_research_from_the_byu_computer_science_department</id>
    <published>2007-12-20T11:06:47-07:00</published>
    <updated>2007-12-20T16:51:09-07:00</updated>
    <link rel="enclosure" type="image/png" href="http://cs.byu.edu/files/images/Examplesocialnetwork.feature.png" title="Examplesocialnetwork.png" />
    <author>
      <name>Computer Science Department</name>
    </author>
    <category term="Feature Story" />
    <summary type="html"><![CDATA[Matt Smith, a PhD candidate researching with Dr. Christophe Giraud-Carrier in the BYU Computer Science Department, presented a research paper at the Workshop on Information Technologies and Systems (WITS) in December. The Workshop, in its seventeenth year, is well-known and prestigious within a growing body of cross-disciplinary scholarship which incorporates computer science, business, and the social sciences to interrogate various social issues.     ]]></summary>
    <content type="html"><![CDATA[Matt Smith, a PhD candidate researching with Dr. Christophe Giraud-Carrier in the BYU Computer Science Department, presented a research paper at the Workshop on Information Technologies and Systems (WITS) in December. The Workshop, in its seventeenth year, is well-known and prestigious within a growing body of cross-disciplinary scholarship which incorporates computer science, business, and the social sciences to interrogate various social issues. <br /> <br />WITS had a 32% acceptance rate, publishing only 36 papers in its proceedings. Smith&#8217;s paper, Implicit Affinity Networks, was one of the few to be presented during the workshop as part of the social networking session. Smith was also one of only five presenters to be nominated for best paper award. <br /> <br />Smith, Dr. Giraud-Carrier, and the students researching in the Data Mining Laboratory pioneered the concept of implicit affinities, a method of making connections between individual entities that are not explicitly linked. Smith&#8217;s research involved a study of the blogosphere and focused on linking the blogs through the content in each posting. Using latent Dirichlet allocation (LDA), Smith extracted topics from over 19,000 blog entries authored by about 2,000 bloggers.&#160; For example, one topic was created from blog postings using the phrases &#8220;Rudy Giuliani,&#8221; &#8220;John McCain,&#8221; &#8220;White House,&#8221; &#8220;Mitt Romney,&#8221; &#8220;Homeland Security,&#8221; &#8220;Al Qaeda,&#8221; and &#8220;Hillary Clinton.&#8221; Another category was made up of postings which mentioned &#8220;fourth quarter,&#8221; &#8220;stock symbol,&#8221; &#8220;cash flow,&#8221; and &#8220;net income.&#8221; Using this information, Smith was able to create links between different bloggers who had no previous connections, solely based on the content of their blogs. <br /> <br />Smith&#8217;s research and the concept of implicit affinities allow social scientists to explore and compute social capital in a revolutionary way. With the influence and omnipresence of the internet, a multitude of social networking devices have been introduced, including, among others, LinkedIn, MySpace, and Facebook. However, these programs rely on explicit affinities&#8212;each user must manually connect himself or herself with other users to find &#8220;friends&#8221; and associates. The innovative concept of implicit affinities, however, automatically creates connections based on common interests, a phenomenon known as &#8220;bonding&#8221; in the social sciences. <br /> <br />This new method of calculating social capital within a community gives a sense of trends within a community and allows one to see how tightly knit a given community is. Implicit affinities allows for bonding as well as bridging&#8212;creating connections between people who have different, yet complementary, interests and skills. <br /> <br />Smith&#39;s research has the potential to influence a variety of fields. The concept of implicit affinities opens the door for viral marketing, allowing companies to craft their marketing campaigns to target specific groups of people. It also has the potential to affect political organizations and campaign strategies, and it may even hold influence in the medical domain. For example, Smith hopes that implicit affinities will allow people with medical diseases and disorders to join up with others to create support and information-sharing groups. <br /> <br />Matt Smith was raised in Provo. He and his wife Camille have a one-year old baby boy. Upon graduation, Smith hopes to spend a few years in industry, either at a well-known organization such as Google or at a smaller start-up. Eventually, he would like to follow in the footsteps of his father, a mechanical engineering professor at BYU, and enter the world of academia. <br /> <br />For more information on the Data Mining Laboratory&#8217;s research, please visit <a href="http://dml.cs.byu.edu/wiki/index.php/Main_Page">http://dml.cs.byu.edu/wiki/index.php/Main_Page</a>      ]]></content>
  </entry>
</feed>
