<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DRUM Community: UMIACS Technical Reports</title>
    <link>http://hdl.handle.net/1903/2277</link>
    <description />
    <pubDate>Wed, 19 Jun 2013 08:51:48 GMT</pubDate>
    <dc:date>2013-06-19T08:51:48Z</dc:date>
    <item>
      <title>Hierarchical O(N) Computation of Small-Angle Scattering Profiles and their Associated Derivatives</title>
      <link>http://hdl.handle.net/1903/13941</link>
      <description>Title: Hierarchical O(N) Computation of Small-Angle Scattering Profiles and their Associated Derivatives
Authors: Berlin, Konstantin; Gumerov, Nail A.; Fushman, David; Duraiswami, Ramani
Abstract: Fast algorithms for Debye summation, which arises in computations performed in crystallography, small/wide-angle X-ray scattering (SAXS/WAXS) and small-angle neutron scattering (SANS), were recently presented in Gumerov et al. (J. Comput. Chem., 2012, 33:1981). The use of these algorithms can speed up computation of scattering profiles in macromolecular structure refinement protocols. However, these protocols often employ an iterative gradient-based optimization procedure, which then requires derivatives of the profile with respect to atomic coordinates. An extension to one of the algorithms is presented which allows accurate, O(N) cost computation of the derivatives along with the scattering profile. Computational results show orders of magnitude improvement in computational efficiency, while maintaining prescribed accuracy. This opens the possibility to efficiently integrate small-angle scattering data into structure determination and refinement of macromolecular systems.</description>
      <pubDate>Sat, 25 May 2013 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/1903/13941</guid>
      <dc:date>2013-05-25T00:00:00Z</dc:date>
    </item>
    <item>
      <title>The compiler for the XMTC parallel language: Lessons for compiler developers and in-depth description</title>
      <link>http://hdl.handle.net/1903/13688</link>
      <description>Title: The compiler for the XMTC parallel language: Lessons for compiler developers and in-depth description
Authors: Tzannes, Alexandros; Caragea, George C.; Vishkin, Uzi; Barua, Rajeev
Abstract: In this technical report, we present information on the XMTC compiler&#xD;
and language. We start by presenting the XMTC Memory Model and the&#xD;
issues we encountered when using GCC, the popular GNU compiler for C and&#xD;
other sequential languages, as the basis for a compiler for XMTC, a&#xD;
parallel language. These topics, along with some information on XMT&#xD;
specific optimizations were presented in [10]. Then, we proceed to give&#xD;
some more details on how outer spawn statements (i.e., parallel loops)&#xD;
are compiled to take advantage of XMT’s unique hardware primitives for&#xD;
scheduling flat parallelism and how we incremented this basic compiler&#xD;
to support nested parallelism.</description>
      <pubDate>Fri, 18 Feb 2011 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/1903/13688</guid>
      <dc:date>2011-02-18T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Learning to Detect Carried Objects with Minimal Supervision</title>
      <link>http://hdl.handle.net/1903/13339</link>
      <description>Title: Learning to Detect Carried Objects with Minimal Supervision
Authors: Dondera, Radu; Morariu, Vlad I.; Davis, Larry S.
Abstract: We propose a learning-based method for detecting carried objects that&#xD;
generates candidate image regions from protrusion, color contrast and&#xD;
occlusion boundary cues, and uses a classifier to filter out the regions&#xD;
unlikely to be carried objects. The method achieves higher accuracy than&#xD;
state of the art, which can only detect protrusions from the human&#xD;
shape, and the discriminative model it builds for the silhouette&#xD;
context-based region features generalizes well. To reduce annotation&#xD;
effort, we investigate training the model in a Multiple Instance&#xD;
Learning framework where the only available supervision is "walk" and&#xD;
"carry" labels associated with intervals of human tracks, i.e., the&#xD;
spatial extent of carried objects is not annotated. We present an&#xD;
extension to the miSVM algorithm that uses knowledge of the fraction of&#xD;
positive instances in positive bags and that scales to training sets of&#xD;
hundreds of thousands of instances.</description>
      <pubDate>Fri, 21 Dec 2012 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/1903/13339</guid>
      <dc:date>2012-12-21T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Clashes in the Infosphere, General Intelligence, and Metacognition: Final project report</title>
      <link>http://hdl.handle.net/1903/13333</link>
      <description>Title: Clashes in the Infosphere, General Intelligence, and Metacognition: Final project report
Authors: Perlis, Don; Cox, Michael. T.
Abstract: Humans confront the unexpected every day, deal with it, and often learn&#xD;
from it. AI agents, on the other hand, are typically brittle—they tend&#xD;
to break down as soon as something happens for which their creators did&#xD;
not explicitly anticipate. The central focus of our research project is&#xD;
this problem of brittleness which may also be the single most important&#xD;
problem facing AI research. Our approach to brittleness is to model a&#xD;
common method that humans use to deal with the unexpected, namely to&#xD;
note occurrences of the unexpected (i.e., anomalies), to assess any&#xD;
problem signaled by the anomaly, and then to guide a response or&#xD;
solution that resolves it. The result is the Note-Assess-Guide procedure&#xD;
of what we call the Metacognitive Loop or MCL. To do this, we have&#xD;
implemented MCL-based systems that enable agents to help themselves;&#xD;
they must establish expectations and monitor them, note failed&#xD;
expectations, assess their causes, and then choose appropriate&#xD;
responses. Activities for this project have developed and refined a&#xD;
human-dialog agent and a robot navigation system to test the generality&#xD;
of this approach.</description>
      <pubDate>Wed, 12 Dec 2012 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/1903/13333</guid>
      <dc:date>2012-12-12T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

