@conference {19284, title = {Automated generation of an efficient MPEG-4 Reconfigurable Video Coding decoder implementation}, booktitle = {2010 Conference on Design and Architectures for Signal and Image Processing (DASIP)}, year = {2010}, month = {2010}, pages = {265 - 272}, abstract = {This paper proposes an automatic design flow from user-friendly design to efficient implementation of video processing systems. This design flow starts with the use of coarse-grain dataflow representations based on the CAL language, which is a complete language for dataflow programming of embedded systems. Our approach integrates previously developed techniques for detecting synchronous dataflow (SDF) regions within larger CAL networks, and exploiting the static structure of such regions using analysis tools in The Dataflow interchange format Package (TDP). Using a new XML format that we have developed to exchange dataflow information between different dataflow tools, we explore systematic implementation of signal processing systems using CAL, SDF-like region detection, TDP-based static scheduling, and CAL-to-C (CAL2C) translation. Our approach, which is a novel integration of three complementary dataflow tools - the CAL parser, TDP, and CAL2C - is demonstrated on an MPEG Reconfigurable Video Coding (RVC) decoder.}, keywords = {automated generation, automatic design flow, CAL language, CAL networks, CAL-to-C translation, CAL2C translation, coarse-grain dataflow representations, Computational modeling, data flow computing, dataflow information, Dataflow programming, decoding, Digital signal processing, Libraries, MPEG-4 reconfigurable video coding decoder implementation, parallel languages, SDF detection, synchronous dataflow detection, TDP, TDP-based static scheduling, The Dataflow interchange format Package, Transform coding, user-friendly design, video coding, video processing systems, XML, XML format}, author = {Gu, Ruirui and Piat, J. and Raulet, M. and Janneck, J.W. and Bhattacharyya, Shuvra S.} } @article {14734, title = {Serializing C intermediate representations for efficient and portable parsing}, journal = {Software: Practice and Experience}, volume = {40}, year = {2010}, month = {2010/03/01/}, pages = {225 - 238}, abstract = {C static analysis tools often use intermediate representations (IRs) that organize program data in a simple, well-structured manner. However, the C parsers that create IRs are slow, and because they are difficult to write, only a few implementations exist, limiting the languages in which a C static analysis can be written. To solve these problems, we investigate two language-independent, on-disk representations of C IRs: one using XML and the other using an Internet standard binary encoding called eXternal Data Representation (XDR). We benchmark the parsing speeds of both options, finding the XML to be about a factor of 2 slower than parsing C and the XDR over 6 times faster. Furthermore, we show that the XML files are far too large at 19 times the size of C source code, whereas XDR is only 2.2 times the C size. We also demonstrate the portability of our XDR system by presenting a C source code querying tool in Ruby. Our solution and the insights we gained from building it will be useful to analysis authors and other clients of C IRs. We have made our software freely available for download at http://www.cs.umd.edu/projects/PL/scil/. Copyright {\textcopyright} 2010 John Wiley\&Sons, Ltd.}, keywords = {C, intermediate representations, parsing, static analysis, XDR, XML}, isbn = {1097-024X}, doi = {10.1002/spe.954}, url = {http://onlinelibrary.wiley.com/doi/10.1002/spe.954/abstract}, author = {Meister,Jeffrey A and Foster, Jeffrey S. and Hicks, Michael W.} } @article {13421, title = {Amino acid quantitative structure property relationship database: a web-based platform for quantitative investigations of amino acids}, journal = {Protein Engineering Design and SelectionProtein Engineering, Design and Selection}, volume = {20}, year = {2007}, month = {2007/07/01/}, pages = {347 - 351}, abstract = {Here, we present the AA-QSPR Db (Amino Acid Quantitative Structure Property Relationship Database): a novel, freely available web-resource of data pertaining to amino acids, both engineered and naturally occurring. In addition to presenting fundamental molecular descriptors of size, charge and hydrophobicity, it also includes online visualization tools for users to perform instant, interactive analyses of amino acid sub-sets in which they are interested. The database has been designed with extensible markup language technology to provide a flexible structure, suitable for future development. In addition to providing easy access for queries by external computers, it also offers a user-friendly web-based interface that facilitates human interactions (submission, storage and retrieval of amino acid data) and an associated e-forum that encourages users to question and discuss current and future database contents.}, keywords = {Amino acids, database, QSPR, XML}, isbn = {1741-0126, 1741-0134}, doi = {10.1093/protein/gzm027}, url = {http://peds.oxfordjournals.org/content/20/7/347}, author = {Lu,Yi and Bulka,Blazej and desJardins, Marie and Freeland,Stephen J} } @article {14366, title = {Probabilistic interval XML}, journal = {ACM Transactions on Computational Logic (TOCL)}, volume = {8}, year = {2007}, month = {2007/08//}, abstract = {Interest in XML databases has been expanding rapidly over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose the Probabilistic Interval XML (PIXML for short) data model in this paper. Using this data model, users can express probabilistic information within XML markups. In addition, we provide two alternative formal model-theoretic semantics for PIXML data. The first semantics is a {\textquotedblleft}global{\textquotedblright} semantics which is relatively intuitive, but is not directly amenable to computation. The second semantics is a {\textquotedblleft}local{\textquotedblright} semantics which supports efficient computation. We prove several correspondence results between the two semantics. To our knowledge, this is the first formal model theoretic semantics for probabilistic interval XML. We then provide an operational semantics that may be used to compute answers to queries and that is correct for a large class of probabilistic instances.}, keywords = {Semistructured Databases, XML}, isbn = {1529-3785}, doi = {10.1145/1276920.1276926}, url = {http://doi.acm.org/10.1145/1276920.1276926}, author = {Hung,Edward and Getoor, Lise and V.S. Subrahmanian} } @conference {12078, title = {A secure service discovery protocol for MANET}, booktitle = {14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003}, volume = {1}, year = {2003}, month = {2003/09/07/10}, pages = {502- 506 Vol.1 - 502- 506 Vol.1}, publisher = {IEEE}, organization = {IEEE}, abstract = {Service discovery technologies are exploited to enable services to advertise their existence in a dynamic way, and can be discovered, configured and used by other devices with minimum manual efforts. It plays an essential role in future network scenarios especially with development of mobile ad hoc network (MANET) and emergence of pervasive computing. Because MANET allows these devices to communicate dynamically without fixed infrastructure and centralized administration, it gives rise to the challenges of the service discovery techniques. In this paper, we present a dynamic service discovery infrastructure that uses XML to describe services and match using the semantic content of service descriptions for MANET. We believe that the architecture we have designed is a necessary component of service discovery in non-infrastructure network by further exploring the secure and performance issues of this infrastructure.}, keywords = {ad hoc networks, centralized administration, Computer architecture, Computer science, dynamic service discovery infrastructure, Educational institutions, MANET, Manuals, mobile ad hoc network, Mobile ad hoc networks, Mobile computing, mobile radio, noninfrastructure network, Pervasive computing, Protocols, routing protocols, secure service discovery protocol, Security, service discovery techniques, service discovery technologies, telecommunication computing, telecommunication services, XML}, isbn = {0-7803-7822-9}, doi = {10.1109/PIMRC.2003.1264322}, author = {Yuan Yuan and Arbaugh, William A.} } @conference {16779, title = {Integrating distributed scientific data sources with MOCHA and XRoaster}, booktitle = {Thirteenth International Conference on Scientific and Statistical Database Management, 2001. SSDBM 2001. Proceedings}, year = {2001}, month = {2001///}, pages = {263 - 266}, publisher = {IEEE}, organization = {IEEE}, abstract = {MOCHA is a novel middleware system for integrating distributed data sources that we have developed at the University of Maryland. MOCHA is based on the idea that the code that implements user-defined types and functions should be automatically deployed to remote sites by the middleware system itself. To this end, we have developed an XML-based framework to specify metadata about data sites, data sets, and user-defined types and functions. XRoaster is a graphical tool that we have developed to help the user create all the XML metadata elements to be used in MOCHA}, keywords = {client-server systems, data sets, data sites, Databases, Distributed computing, distributed databases, distributed scientific data source integration, Educational institutions, graphical tool, hypermedia markup languages, IP networks, java, Large-scale systems, Maintenance engineering, meta data, metadata, Middleware, middleware system, MOCHA, Query processing, remote sites, scientific information systems, user-defined types, visual programming, XML, XML metadata elements, XML-based framework, XRoaster}, isbn = {0-7695-1218-6}, doi = {10.1109/SSDM.2001.938560}, author = {Rodriguez-Martinez,M. and Roussopoulos, Nick and McGann,J. M and Kelley,S. and Mokwa,J. and White,B. and Jala,J.} }