TY - CONF TI - TaintDroid: an information-flow tracking system for realtime privacy monitoring on smartphones AU - Enck, William AU - Gilbert, Peter AU - Chun, Byung-Gon AU - Cox, Landon P AU - Jung, Jaeyeon AU - McDaniel, Patrick AU - Sheth, Anmol N T2 - USENIX Association AB - Today’s smartphone operating systems frequently fail to provide users with visibility into how third-party applications collect and share their private data. We address these shortcomings with TaintDroid, an efficient, system-wide dynamic taint tracking and analysis system capable of simultaneously tracking multiple sources of sensitive data. TaintDroid enables realtime analysis by leveraging Android’s virtualized execution environment. TaintDroid incurs only 32% performance overhead on a CPU-bound microbenchmark and imposes negligible overhead on interactive third-party applications. Using TaintDroid to monitor the behavior of 30 popular third-party Android applications, in our 2010 study we found 20 applications potentially misused users’ private information; so did a similar fraction of the tested applications in our 2012 study. Monitoring the flow of privacy-sensitive data with TaintDroid provides valuable input for smartphone users and security service firms seeking to identify misbehaving applications. C2 - 2010/// C3 - Proceedings of the 9th USENIX conference on Operating systems design and implementation DA - 2010/// DO - 10.1145/2619091 SP - 1-6 ER - TY - JOUR TI - Not so great expectations: Why application markets haven't failed security AU - McDaniel, Patrick AU - Enck, William T2 - IEEE Security & Privacy DA - 2010/// PY - 2010/// VL - 8 IS - 5 SP - 76-78 ER - TY - CONF TI - Toward Using Dynamics of Facial Expressions and Gestures for Person Identification AU - Patterson, Eric AU - Gaweda, A. T2 - IASTED International Conference on Computational Intelligence C2 - 2010/// C3 - IASTED International Conference on Computational Intelligence DA - 2010/// PY - 2010/// ER - TY - JOUR TI - Software testing (CS1 & CS2) AU - Heckman, Sarah T2 - NC State University, August DA - 2010/// PY - 2010/// VL - 6 ER - TY - JOUR TI - Randomized constraint solvers: a comparative study AU - Takaki, Mitsuo AU - Cavalcanti, Diego AU - Gheyi, Rohit AU - Iyoda, Juliano AU - d’Amorim, Marcelo AU - Prudêncio, Ricardo Bastos Cavalcante T2 - ISSE DA - 2010/// PY - 2010/// DO - 10.1007/s11334-010-0124-1 VL - 6 IS - 3 SP - 243-253 UR - https://doi.org/10.1007/s11334-010-0124-1 ER - TY - JOUR TI - Assertion Checking in J-Sim Simulation Models of Network Protocols T2 - Simulation AB - Verification and validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation model for evaluating the performance of a network protocol but lack the capability to check the “correctness” of the simulation model being used. To address this problem, we have extended J-Sim—an open-source component-based network simulator written entirely in Java—with a state space exploration (SSE) capability that explores the state space created by a network simulation model, up to a configurable maximum depth, in order to find an execution (if any) that violates an assertion, i.e. a property specifying an invariant that must always hold true in all states. In this paper, we elaborate on the SSE framework in J-Sim and present one of our fairly complex case studies, namely verifying the simulation model of the Ad-hoc On-demand Distance Vector (AODV) routing protocol for wireless ad-hoc networks. The SSE framework makes use of protocol-specific properties along two orthogonal dimensions: state similarity and state ranking. State similarity determines whether a state is “similar to” another in order to enable the implementation of stateful search. State ranking determines whether a state is “better than” another in order to enable the implementation of best-first search (BeFS). Specifically, we develop protocol-specific search heuristics to guide SSE towards finding assertion violations in less time. We evaluate the efficiency of our SSE framework by comparing its performance with that of a state-of-the-art model checker for Java programs, namely Java PathFinder (JPF). The results of the comparison show that the time needed to find an assertion violation by our SSE framework in J-Sim can be significantly less than that in JPF unless a substantial amount of programming effort is spent in JPF to make its performance close to that of our SSE framework. DA - 2010/// PY - 2010/// DO - 10.1177/0037549709349326 VL - 86 IS - 11 SP - 651-673 UR - https://doi.org/10.1177/0037549709349326 ER - TY - CONF TI - Parametric Sensitivity and Scalability of k-Winners-Take-All Networks with a Single State Variable and Infinity-Gain Activation Functions AU - Wang, Jun AU - Guo, Zhishan T2 - 7th International Symposium on Neural Networks (ISNN) A2 - Zhang, L. A2 - Lu, BL A2 - Kwok, J. T3 - Lecture Notes in Computer Science C2 - 2010/5// C3 - Advances in Neural Networks - ISNN 2010 CY - Shanghai, China DA - 2010/5// PY - 2010/5// DO - 10.1007/978-3-642-13278-0_11 PB - Springer ER - TY - ER - TY - CONF TI - RoleModel: Towards a formal model of dramatic roles for story generation AU - Chen, S. AU - Smith, A.M. AU - Jhala, A. AU - Wardrip-Fruin, N. AU - Mateas, M. AB - RoleModel is a novel story generator organized around explicit formal models of character roles. RoleModel expands the expressiveness of stories generated from arbitrary partial domain specification by using a formal model of roles within an abductive logic programming framework. Authorial goals in the system can be fully or partially specified as constraints in an abductive logic program. In particular, the RoleModel system focuses on representing and satisfying role constraints of the story characters. This paper discusses the basic architecture for the RoleModel approach, demonstrates example output from the system through three use-cases, discusses the authorial expressiveness enabled by a stageless abductive logic approach to story generation, and proposes the current and future directions. C2 - 2010/// C3 - Proceedings of the Intelligent Narrative Technologies III Workshop, INT3 '10 DA - 2010/// DO - 10.1145/1822309.1822326 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77955114051&partnerID=MN8TOARS ER - TY - CONF TI - Reactive planning idioms for multi-scale game AI AU - Weber, B.G. AU - Mawhorter, P. AU - Mateas, M. AU - Jhala, A. AB - Many modern games provide environments in which agents perform decision making at several levels of granularity. In the domain of real-time strategy games, an effective agent must make high-level strategic decisions while simultaneously controlling individual units in battle. We advocate reactive planning as a powerful technique for building multi-scale game AI and demonstrate that it enables the specification of complex, real-time agents in a unified agent architecture. We present several idioms used to enable authoring of an agent that concurrently pursues strategic and tactical goals, and an agent for playing the real-time strategy game StarCraft that uses these design patterns. C2 - 2010/// C3 - Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games, CIG2010 DA - 2010/// DO - 10.1109/ITW.2010.5593363 SP - 115-122 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-80051922886&partnerID=MN8TOARS ER - TY - CONF TI - Preface AU - Michael Youngblood, G. AU - Bulitko, V. AU - Dill, K. AU - Jhala, A. AU - Schwab, B. AU - Riedl, M.O. C2 - 2010/// C3 - Proceedings of the 6th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2010 DA - 2010/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84883114702&partnerID=MN8TOARS ER - TY - CONF TI - Siren: Towards adaptive serious games for teaching conflict resolution AU - Yannakakis, G. AU - Togelius, J. AU - Khaled, R. AU - Jhala, A. AU - Karpouzis, K. AU - Paiva, A. AU - Vasalou, A. C2 - 2010/// C3 - 4th European Conference on Games Based Learning 2010, ECGBL 2010 DA - 2010/// SP - 412-417 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-80053103561&partnerID=MN8TOARS ER - TY - CONF TI - Applying goal-driven autonomy to starcraft AU - Weber, B.G. AU - Mateas, M. AU - Jhala, A. C2 - 2010/// C3 - Proceedings of the 6th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2010 DA - 2010/// SP - 101-106 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84867392807&partnerID=MN8TOARS ER - TY - CONF TI - Performance Evaluation of an OBS Network as a TandemNetwork of IPP/M/W/W Nodes AU - Battestilli, L. AU - Perros, H. T2 - 4th Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modelling(APARM) C2 - 2010/12/2/ C3 - Proceedings of the 4th Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modelling(APARM) CY - Wellington, New Zealand DA - 2010/12/2/ PY - 2010/12/2/ ER - TY - RPRT TI - The Role of Symbolic, Numeric and Algebraic Computation in Cyber-Enabled Discovery and Innovation (CDI) AU - Kaltofen, Erich L. A3 - University of Rhode Island DA - 2010/// PY - 2010/// PB - University of Rhode Island ER - TY - JOUR TI - Automatic hint generation for logic proof tutoring using historical data AU - Barnes, Tiffany AU - Stamper, John T2 - Journal of Educational Technology & Society DA - 2010/// PY - 2010/// VL - 13 IS - 1 SP - 3–12 ER - TY - CHAP TI - Idea: Using System Level Testing for Revealing SQL Injection-Related Error Message Information Leaks AU - Smith, Ben AU - Williams, Laurie AU - Austin, Andrew T2 - Engineering Secure Software and Systems. ESSoS 2010 A2 - Massacci, F. A2 - Wallach, D. A2 - Zannone, N. T3 - Lecture Notes in Computer Science AB - Completely handling SQL injection consists of two activities: properly protecting the system from malicious input, and preventing any resultant error messages caused by SQL injection from revealing sensitive information. The goal of this research is to assess the relative effectiveness of unit and system level testing of web applications to reveal both error message information leak and SQL injection vulnerabilities. To produce 100% test coverage of 176 SQL statements in four open source web applications, we augmented the original automated unit test cases with our own system level tests that use both normal input and 132 forms of malicious input. Although we discovered no SQL injection vulnerabilities, we exposed 17 error message information leak vulnerabilities associated with SQL statements using system level testing. Our results suggest that security testers who use an iterative, test-driven development process should compose system level rather than unit level tests. PY - 2010/// DO - 10.1007/978-3-642-11747-3_15 SP - 192–200 PB - Springer SN - 9783642117466 9783642117473 SV - 5965 UR - http://dx.doi.org/10.1007/978-3-642-11747-3_15 ER - TY - CONF TI - Online vs. on-paper exams AU - Gehringer, Edward F. T2 - 2010 American Society for Engineering Education Annual Conference and Exposition C2 - 2010/// C3 - Proceedings of the 2010 ASEE Annual Conference and Exposition CY - Louisville, KY DA - 2010/// PY - 2010/6/20/ ER - TY - CONF TI - Daily course evaluation with Google forms AU - Gehringer, Edward F. T2 - 2010 American Society for Engineering Education Annual Conference and Exposition C2 - 2010/// C3 - Proceedings of the 2010 ASEE Annual Conference and Exposition CY - Louisville, KY DA - 2010/// PY - 2010/6/20/ ER - TY - CONF TI - Teaching interactively with Google docs AU - Gehringer, Edward F. T2 - 2010 American Society for Engineering Education Annual Conference and Exposition C2 - 2010/// C3 - Proceedings of the 2010 ASEE Annual Conference and Exposition CY - Louisville, KY DA - 2010/// PY - 2010/6/20/ ER - TY - CONF TI - Motivating effective peer review with extra credit and leaderboards AU - Gehringer, Edward F. AU - Gummadi, Abhishek AU - Kadanjoth, Reejesh AU - Andrés, Yvonne Marie T2 - 2010 American Society for Engineering Education Annual Conference and Exposition C2 - 2010/// C3 - Proceedings of the 2010 ASEE Annual Conference and Exposition CY - Louisville, KY DA - 2010/// PY - 2010/6/20/ ER - TY - CONF TI - Experience with a student-written wiki textbook supplement AU - Gehringer, Edward F. AU - Navalakha, Karishma AU - Kadanjoth, Reejesh T2 - Kaplan University Village Online C2 - 2010/9/23/ C3 - KU Village Online DA - 2010/9/23/ PY - 2010/8/23/ ER - TY - CONF TI - Challenges for Protecting the Privacy of Health Information: Required Certification Can Leave Common Vulnerabilities Undetected AU - Smith, Ben AU - Austin, Andrew AU - Brown, Matt AU - King, Jason T. AU - Lankford, Jerrod AU - Meneely, Andrew AU - Williams, Laurie AB - The use of electronic health record (EHR) systems by medical professionals enables the electronic exchange of patient data, yielding cost and quality of care benefits. The United States American Recovery and Reinvestment Act (ARRA) of 2009 provides up to $34 billion for meaningful use of certified EHR systems. But, will these certified EHR systems provide the infrastructure for secure patient data exchange? As a window into the ability of current and emerging certification criteria to expose security vulnerabilities, we performed exploratory security analysis on a proprietary and an open source EHR. We were able to exploit a range of common code-level and design-level vulnerabilities. These common vulnerabilities would have remained undetected by the 2011 security certification test scripts from the Certification Commission for Health Information Technology, the most widely used certification process for EHR systems. The consequences of these exploits included, but were not limited to: exposing all users' login information, the ability of any user to view or edit health records for any patient, and creating a denial of service for all users. Based upon our results, we suggest that an enhanced set of security test scripts be used as entry criteria to the EHR certification process. Before certification bodies spend the time to certify that an EHR application is functionally complete, they should have confidence that the software system meets a basic level of security competence. C2 - 2010/// C3 - Proceedings of the Second Annual Workshop on Security and Privacy in Medical and Home-care Systems CY - New York, NY, USA DA - 2010/// DO - 10.1145/1866914.1866916 SP - 1-12 PB - ACM UR - http://doi.acm.org/10.1145/1866914.1866916 ER - TY - RPRT TI - Experiences in Porting the Hubbard Model in Computational Materials Science to GPU AU - Albert, Chase AU - Paloski, Aaron AU - Shen, Xipeng AU - Walter, Eric J. AU - Zhang, Shiwei A3 - Computer Science Department, The College of William and Mary DA - 2010/// PY - 2010/// M1 - WM-CS-2010-04 M3 - Technical report PB - Computer Science Department, The College of William and Mary SN - WM-CS-2010-04 ER - TY - RPRT TI - Implementing the Dslash Operator in OpenCL AU - Kowalski, Andy AU - Shen, Xipeng A3 - Computer Science Department, The College of William and Mary DA - 2010/// PY - 2010/// M1 - WM-CS-2010-03 M3 - Technical Report PB - Computer Science Department, The College of William and Mary SN - WM-CS-2010-03 ER - TY - CONF TI - BeadLoom Game: using game elements to increase motivation and learning AU - Boyce, Acey AU - Barnes, Tiffany T2 - the Fifth International Conference AB - The Virtual Bead Loom (VBL) was designed to teach mathematical concepts such as Cartesian coordinates, symmetry, and iteration to middle and high school math students through the design of Native American-inspired bead loom art. In our outreach programs using the VBL, we noted that the students avoid using complex functions such as iteration, instead creating designs one point or line at a time. To motivate students to learn the advanced concepts, we created the BeadLoom Game by adding game elements to the VBL. We have tested the BeadLoom Game with two summer camps and found that the game motivates students, exposes them to more complex computing-related math concepts, and increases the chance that students will continue using the tool beyond assigned class time. C2 - 2010/// C3 - Proceedings of the Fifth International Conference on the Foundations of Digital Games (FDG '10) DA - 2010/// DO - 10.1145/1822348.1822352 SP - 25–31 PB - ACM Press SN - 9781605589374 UR - http://dx.doi.org/10.1145/1822348.1822352 ER - TY - CONF TI - SNAG: social networking games to facilitate interaction AU - Powell, Eve M. AU - Finkelstein, Samantha AU - Hicks, Andrew AU - Phifer, Thomas AU - Charugulla, Sandhya AU - Thornton, Christie AU - Barnes, Tiffany AU - Dahlberg, Teresa T2 - the 28th of the international conference extended abstracts AB - Because professional relationships and a sense of community are so important for career mobility and satisfaction, it is important to foster and support these relationships early. However, research has shown that women and underrepresented minorities approach these relationships differently and may need help to develop networking skills. To combat both of these problems, we present SNAG, (Social Networking and Games), a suite of mobile and Internet games to facilitate social networking within a professional community. We present Snag'em, a game that helps conference attendees build meet one another and track their new contacts. C2 - 2010/// C3 - Extended abstracts on Human factors in computing systems - (CHI EA '10) DA - 2010/// DO - 10.1145/1753846.1754134 SP - 4249–4254 PB - ACM Press SN - 9781605589305 UR - http://dx.doi.org/10.1145/1753846.1754134 ER - TY - CONF TI - SNAG: using social networking games to increase student retention in computer science AU - Finkelstein, Samantha L. AU - Powell, Eve AU - Hicks, Andrew AU - Doran, Katelyn AU - Charugulla, Sandhya Rani AU - Barnes, Tiffany T2 - the fifteenth annual conference AB - One of the primary goals of attending academic conferences is professional networking, yet even though this interaction can increase one's feeling of community within a field, conference attendees are not interacting as much as they could be. Similarly, it's known that students who do not feel as if they are part of a larger academic community are less likely to participate in extracurricular activities and organizations, lowering retention rates. To combat both of these problems, we present SNAG (Social Networking and Games). SNAG is a suite of mobile and Internet games which aim to facilitate social networking between members of a group, and can be used in either a conference setting or within a university. This paper focuses on one specific game, Snag'em, and discusses our evaluation for our SNAG games. C2 - 2010/// C3 - Proceedings of the fifteenth annual conference on Innovation and technology in computer science education - ITiCSE '10 DA - 2010/// DO - 10.1145/1822090.1822131 SP - 142–146 PB - ACM Press SN - 9781605587295 UR - http://dx.doi.org/10.1145/1822090.1822131 ER - TY - JOUR TI - Sharing experiments using open-source software AU - Nelson, Adam AU - Menzies, Tim AU - Gay, Gregory T2 - Software: Practice and Experience AB - When researchers want to repeat, improve or refute prior conclusions, it is useful to have a complete and operational description of prior experiments. If those descriptions are overly long or complex, then sharing their details may not be informative. OURMINE is a scripting environment for the development and deployment of data mining experiments. Using OURMINE, data mining novices can specify and execute intricate experiments, while researchers can publish their complete experimental rig alongside their conclusions. This is achievable because of OURMINE's succinctness. For example, this paper presents two experiments documented in the OURMINE syntax. Thus, the brevity and simplicity of OURMINE recommends it as a better tool for documenting, executing, and sharing data mining experiments. Copyright © 2010 John Wiley & Sons, Ltd. DA - 2010/9/24/ PY - 2010/9/24/ DO - 10.1002/spe.1004 VL - 41 IS - 3 SP - 283-305 J2 - Softw: Pract. Exper. LA - en OP - SN - 0038-0644 UR - http://dx.doi.org/10.1002/spe.1004 DB - Crossref KW - open source KW - data mining ER - TY - CONF TI - Protocol Refinement: Formalization and Verification AU - Gerard, Scott N. AU - Singh, Munindar P. C2 - 2010/// C3 - Proceedings of the AAMAS Workshop on Agent Communication (AC) DA - 2010/// SP - 19–36 ER - TY - CONF TI - Governance of Services: A Natural Function for Agents AU - Brazier, Frances AU - Dignum, Frank AU - Dignum, Virginia AU - Huhns, Michael N. AU - Lessner, Tim AU - Padget, Julian AU - Quillinan, Thomas AU - Singh, Munindar P. C2 - 2010/// C3 - Proceedings of the 8th AAMAS Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering (SOCASE) DA - 2010/// SP - 8–22 ER - TY - CONF TI - Abstracting Business Modeling Patterns from Rosetta-Net AU - Telang, Pankaj R. AU - Singh, Munindar P. C2 - 2010/// C3 - Proceedings of the 8th AAMAS Workshop on Service-Oriented Computing: Agents, Semantics, and Engineering (SOCASE) DA - 2010/// SP - 83–96 ER - TY - CONF TI - An Architectural Approach to Combining Trust and Reputation AU - Hazard, Christopher J. AU - Singh, Munindar P. T2 - 9th Autonomous Agents and Multiagent Systems, the 13th International Workshop on Trust in Agent Societies A2 - van der Hoek, Wiebe A2 - Kaminka, Gal A. A2 - Lesperance, Yves A2 - Luck, Michael A2 - Sen, Sandip C2 - 2010/// C3 - Proceedings of the 9th Autonomous Agents and Multiagent Systems, the 13th International Workshop on Trust in Agent Societies CY - Toronto, Canada DA - 2010/// PY - 2010/5/19/ SP - 83–93 PB - AAMAS ER - TY - CONF TI - Trust-based Recommendation Based on Graph Similarity AU - Hang, Chung-Wei AU - Singh, Munindar P. T2 - 9th Autonomous Agents and Multi-Agent Systems, 13th International Workshop on Trust in Agent Societies A2 - van der Hoek, Wiebe A2 - Kaminka, Gal A. A2 - Lesperance, Yves A2 - Luck, Michael A2 - Sen, Sandip C2 - 2010/// C3 - Proceedings of the 9th Autonomous Agents and Multi-Agent Systems, 13th International Workshop on Trust in Agent Societies CY - Toronto, Canada DA - 2010/// PY - 2010/5/10/ SP - 71–81 PB - AAMAS ER - TY - CHAP TI - EI2N’10 & SeDeS’10 - PC Co-chairs Message AU - Li, Qing AU - Panetto, Hervé AU - Berio, Giuseppe AU - Anyanwu, Kemafor T2 - On the Move to Meaningful Internet Systems: OTM 2010 Workshops A2 - Meersman, R. A2 - Dillon, T. A2 - Herrero, P. T3 - Lecture Notes in Computer Science AB - After the successful fourth edition in 2009, the fifth edition of the Enterprise Integration, Interoperability and Networking workshop (EI2N’2010) has been organised as part of the OTM’2010 Federated Conferences and is supported by the IFAC Technical Committee 5.3 ”Enterprise Integration and Networking”, the IFIP TC 8 WG 8.1 ”Design and Evaluation of Information Systems”, the SIG INTEROP Grande-Région on ”Enterprise Systems Interoperability” and the French CNRS National Research Group GDR MACS. Collaboration is necessary for enterprises to prosper in the current extreme dynamic and heterogeneous business environment. Enterprise integration, interoperability and networking are the major disciplines that have studied how to do companies to collaborate and communicate in the most effective way. These disciplines are well-established and are supported by international conferences, initiatives, groups, task forces and governmental projects all over the world where different domains of knowledge have been considered from different points of views and a variety of objectives (e.g., technological or managerial). Enterprise Integration involves breaking down organizational barriers to improve synergy within the enterprise so that business goals are achieved in a more productive and efficient way. The past decade of enterprise integration research and industrial implementation has seen the emergence of important new areas, such as research into interoperability and networking, which involve breaking down organizational barriers to improve synergy within the enterprise and among enterprises. The ambition to achieve dynamic, efficient and effective cooperation of enterprises within networks of companies, or in an entire industry sector, requires the improvement of existing, or the development of new, theories and technologies. Enterprise Modelling, Architecture, and semantic techniques are the pillars supporting the achievement of Enterprise Integration and Interoperability. Internet of Things and Cloud Computing now present new opportunities to realize inter enterprise and intra enterprise integration. For these reasons, the workshop’s objective is to foster discussions among representatives of these neighbouring disciplines and to discover new research paths within the enterprise integration community. After peer reviews, 6 papers have been accepted out of 12 submissions to this workshop. Prof. Michael Sobolewski (Polish-Japanese Institute of IT, Poland) has been invited as EI2N plenary keynote on ”Exerted Enterprise Computing: from Protocol-oriented Networking to Exertion-oriented Networking”. In addition to the presentations of the accepted papers, groups have been organised into what E2IN traditionally calls ”workshop cafés”, to discuss and debate the presented topics. This year discussion enabled putting forward new research related to ”interoperability issues in collaborative information systems”. These groups reported the results of the respective discussions during a plenary session that was jointly organised with the CoopIS’2010 conference, in order to share the vision for future research on this top domain. The papers published in this volume of proceedings present samples of current research in the enterprise modelling, systems interoperability, services management, cloud integration and, more globally, systems engineering and enterprise architecture domains. Some new architecting principles that has gained currency in the recent past is semantic technique, service oriented architecture and cloud computing with their principles, reference models and technology, and if applied correctly can be an important contributor to the future of interoperable, networked and collaborative enterprises. The success of this complex field also depends on the maturity and coherency of the management of the involved enterprises, a topic covered by the second workshop café. As a special track of EI2N’2010, SeDeS’2010 is the first international workshop on Semantics & Decision Support. The call for papers saw 12 submissions, among which the Programme Committee has selected 4 papers to be presented at EI2N’2010. The selected papers cover the topics of ontology-based decision making applications in the fields of eGovernment, eLearning, business rule management and Human Resource Management. PY - 2010/// DO - 10.1007/978-3-642-16961-8_79 SP - 563–564 PB - Springer SN - 9783642169601 9783642169618 SV - 6428 UR - http://dx.doi.org/10.1007/978-3-642-16961-8_79 ER - TY - CHAP TI - EI2N’10 & SeDeS’10 - PC Co-chairs Message AU - Li, Qing AU - Panetto, Hervé AU - Berio, Giuseppe AU - Anyanwu, Kemafor T2 - On the Move to Meaningful Internet Systems: OTM 2010 Workshops A2 - Meersman, R. A2 - Dillon, T. A2 - Herrero, P. T3 - Lecture Notes in Computer Science AB - After the successful fourth edition in 2009, the fifth edition of the Enterprise Integration, Interoperability and Networking workshop (EI2N’2010) has been organized as part of the OTM’2010 Federated Conferences and is supported by the IFAC Technical Committee 5.3 ”Enterprise Integration and Networking”, the IFIP TC 8 WG 8.1 ”Design and Evaluation of Information Systems”, the SIG INTEROP Grande-Région on ”Enterprise Systems Interoperability” and the French CNRS National Research Group GDR MACS. PY - 2010/// DO - 10.1007/978-3-642-16961-8_35 SP - 180–181 PB - Springer SN - 9783642169601 9783642169618 SV - 6428 UR - http://dx.doi.org/10.1007/978-3-642-16961-8_35 ER - TY - JOUR TI - Developmental surface and phonological dysgraphia in German 3rd graders AU - Cholewa, Jürgen AU - Mantey, Stefanie AU - Heber, Stefanie AU - Hollweg, Wibke T2 - Reading and Writing DA - 2010/1// PY - 2010/1// DO - 10.1007/S11145-008-9153-7 VL - 23 IS - 1 SP - 97–127 SN - 0922-4777 1573-0905 UR - http://dx.doi.org/10.1007/S11145-008-9153-7 KW - Developmental dysgraphia KW - Spelling disorders KW - Developmental cognitive neuropsychology ER - TY - JOUR TI - Detection of Alternative Splice Variants at the Proteome Level in Aspergillus flavus AU - Chang, Kung-Yen AU - Georgianna, D. Ryan AU - Heber, Steffen AU - Payne, Gary A. AU - Muddiman, David C. T2 - Journal of Proteome Research AB - Identification of proteins from proteolytic peptides or intact proteins plays an essential role in proteomics. Researchers use search engines to match the acquired peptide sequences to the target proteins. However, search engines depend on protein databases to provide candidates for consideration. Alternative splicing (AS), the mechanism where the exon of pre-mRNAs can be spliced and rearranged to generate distinct mRNA and therefore protein variants, enable higher eukaryotic organisms, with only a limited number of genes, to have the requisite complexity and diversity at the proteome level. Multiple alternative isoforms from one gene often share common segments of sequences. However, many protein databases only include a limited number of isoforms to keep minimal redundancy. As a result, the database search might not identify a target protein even with high quality tandem MS data and accurate intact precursor ion mass. We computationally predicted an exhaustive list of putative isoforms of Aspergillus flavus proteins from 20 371 expressed sequence tags to investigate whether an alternative splicing protein database can assign a greater proportion of mass spectrometry data. The newly constructed AS database provided 9807 new alternatively spliced variants in addition to 12 832 previously annotated proteins. The searches of the existing tandem MS spectra data set using the AS database identified 29 new proteins encoded by 26 genes. Nine fungal genes appeared to have multiple protein isoforms. In addition to the discovery of splice variants, AS database also showed potential to improve genome annotation. In summary, the introduction of an alternative splicing database helps identify more proteins and unveils more information about a proteome. DA - 2010/3/5/ PY - 2010/3/5/ DO - 10.1021/pr900602d VL - 9 IS - 3 SP - 1209–1217 SN - 1535-3893 1535-3907 UR - http://dx.doi.org/10.1021/pr900602d KW - mass spectrometry KW - proteomics KW - alternative splicing KW - database KW - Aspergillus flavus ER - TY - JOUR TI - Differential capacity p-Cycles: A p-Cycle variant with increased capacity efficiency AU - Jaikumar, Prashant AU - Dutta, Rudra T2 - Optical Switching and Networking AB - In this paper we introduce the concept of Differential Capacity p-Cycles as an enhancement to span protecting p-Cycles. DC cycles provide increased capacity efficiency by reducing the amount of spare capacity that needs to be reserved on each link of a cycle. Our results show a small reduction in spare capacity requirement over traditional p-Cycles. We also present a joint spare and working capacity allocation formulation, as well as DC formulations for flow and Failure Independent Path Protecting cycles, that give further improved capacity efficiency at the cost of a more complicated ILP. Results of ILP formulations of DC p-Cycles are compared to regular p-Cycles. DA - 2010/12// PY - 2010/12// DO - 10.1016/j.osn.2010.05.002 VL - 7 IS - 4 SP - 185-195 J2 - Optical Switching and Networking LA - en OP - SN - 1573-4277 UR - http://dx.doi.org/10.1016/j.osn.2010.05.002 DB - Crossref KW - Survivability KW - Fault tolerance KW - Self-healing rings KW - p-Cycle KW - Optimization ER - TY - CHAP TI - LU Decomposition on Cell Broadband Engine: An Empirical Study to Exploit Heterogeneous Chip Multiprocessors AU - Mao, Feng AU - Shen, Xipeng T2 - Lecture Notes in Computer Science AB - To meet the needs of high performance computing, the Cell Broadband Engine owns many features that differ from traditional processors, such as the large number of synergistic processor elements, large register files, the ability to hide main-storage latency with concurrent computation and DMA transfers. The exploitation of those features requires the programmer to carefully tailor programs and simutaneously deal with various performance factors, including locality, load balance, communication overhead, and multi-level parallelism. These factors, unfortunately, are dependent on each other; an optimization that enhances one factor may degrade another. This paper presents our experience on optimizing LU decomposition, one of the commonly used algebra kernels in scientific computing, on Cell Broadband Engine. The optimizations exploit task-level, data-level, and communication-level parallelism. We study the effects of different task distribution strategies, prefetch, and software cache, and explore the tradeoff among different performance factors, stressing the interactions between different optimizations. This work offers some insights in the optimizations on heterogenous multi-core processors, including the selection of programming models, considerations in task distribution, and the holistic perspective required in optimizations. PY - 2010/// DO - 10.1007/978-3-642-15672-4_7 SP - 61-75 OP - PB - Springer Berlin Heidelberg SN - 9783642156717 9783642156724 UR - http://dx.doi.org/10.1007/978-3-642-15672-4_7 DB - Crossref ER - TY - CHAP TI - Combining Locality Analysis with Online Proactive Job Co-scheduling in Chip Multiprocessors AU - Jiang, Yunlian AU - Tian, Kai AU - Shen, Xipeng T2 - High Performance Embedded Architectures and Compilers AB - The shared-cache contention on Chip Multiprocessors causes performance degradation to applications and hurts system fairness. Many previously proposed solutions schedule programs according to runtime sampled cache performance to reduce cache contention. The strong dependence on runtime sampling inherently limits the scalability and effectiveness of those techniques. This work explores the combination of program locality analysis with job co-scheduling. The rationale is that program locality analysis typically offers a large-scope view of various facets of an application including data access patterns and cache requirement. That knowledge complements the local behaviors sampled by runtime systems. The combination offers the key to overcoming the limitations of prior co-scheduling techniques.Specifically, this work develops a lightweight locality model that enables efficient, proactive prediction of the performance of co-running processes, offering the potential for an integration in online scheduling systems. Compared to existing multicore scheduling systems, the technique reduces performance degradation by 34% (7% performance improvement) and unfairness by 47%. Its proactivity makes it resilient to the scalability issues that constraints the applicability of previous techniques. PY - 2010/// DO - 10.1007/978-3-642-11515-8_16 SP - 201-215 OP - PB - Springer Berlin Heidelberg SN - 9783642115141 9783642115158 UR - http://dx.doi.org/10.1007/978-3-642-11515-8_16 DB - Crossref ER - TY - CONF TI - Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? AU - Zhang, Eddy Z. AU - Jiang, Yunlian AU - Shen, Xipeng T2 - the 15th ACM SIGPLAN symposium AB - Most modern Chip Multiprocessors (CMP) feature shared cache on chip. For multithreaded applications, the sharing reduces communication latency among co-running threads, but also results in cache contention. C2 - 2010/// C3 - Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10 DA - 2010/// DO - 10.1145/1693453.1693482 PB - ACM Press SN - 9781605587080 UR - http://dx.doi.org/10.1145/1693453.1693482 DB - Crossref KW - Shared Cache KW - Thread Scheduling KW - Parallel Program Optimizations KW - Chip Multiprocessors ER - TY - CHAP TI - Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors? AU - Jiang, Yunlian AU - Zhang, Eddy Z. AU - Tian, Kai AU - Shen, Xipeng T2 - Lecture Notes in Computer Science AB - On Chip Multiprocessors (CMP), it is common that multiple cores share certain levels of cache. The sharing increases the contention in cache and memory-to-chip bandwidth, further highlighting the importance of data locality analysis. As a rigorous and hardware-independent locality metric, reuse distance has served for a variety of locality analysis, program transformations, and performance prediction. However, previous studies have concentrated on sequential programs running on unicore processors. On CMP, accesses by different threads (or jobs) interact in the shared cache. How reuse distance applies to the new architecture remains an open question—particularly, how the interactions in shared cache affect the collection and application of reuse distance, and how reuse-distance–based locality analysis should adapt to such architecture changes. This paper presents our explorations towards answering those questions. It first introduces the concept of concurrent reuse distance, a direct extension of the traditional concept of reuse distance with data references by all co-running threads (or jobs) considered. It then discusses the properties of concurrent reuse distance, revealing the special challenges facing the collection and application of concurrent reuse distance on CMP platforms. Finally, it presents the solutions to those challenges for a class of multithreading applications. The solutions center on a probabilistic model that connects concurrent reuse distance with the data locality of each individual thread. Experiments demonstrate the effectiveness of the proposed techniques in facilitating the uses of concurrent reuse distance for CMP computing. PY - 2010/// DO - 10.1007/978-3-642-11970-5_15 SP - 264-282 OP - PB - Springer Berlin Heidelberg SN - 9783642119699 9783642119705 UR - http://dx.doi.org/10.1007/978-3-642-11970-5_15 DB - Crossref ER - TY - CONF TI - Exploiting statistical correlations for proactive prediction of program behaviors AU - Jiang, Yunlian AU - Zhang, Eddy Z. AU - Tian, Kai AU - Mao, Feng AU - Gethers, Malcom AU - Shen, Xipeng AU - Gao, Yaoqing T2 - the 8th annual IEEE/ ACM international symposium AB - This paper presents a finding and a technique on program behavior prediction. The finding is that surprisingly strong statistical correlations exist among the behaviors of different program components (e.g., loops) and among different types of program level behaviors (e.g., loop trip-counts versus data values). Furthermore, the correlations can be beneficially exploited: They help resolve the proactivity-adaptivity dilemma faced by existing program behavior predictions, making it possible to gain the strengths of both approaches--the large scope and earliness of offline-profiling--based predictions, and the cross-input adaptivity of runtime sampling-based predictions. C2 - 2010/// C3 - Proceedings of the 8th annual IEEE/ ACM international symposium on Code generation and optimization - CGO '10 DA - 2010/// DO - 10.1145/1772954.1772989 PB - ACM Press SN - 9781605586359 UR - http://dx.doi.org/10.1145/1772954.1772989 DB - Crossref ER - TY - CONF TI - Streamlining GPU applications on the fly AU - Zhang, Eddy Z. AU - Jiang, Yunlian AU - Guo, Ziyu AU - Shen, Xipeng T2 - the 24th ACM International Conference AB - Because of their tremendous computing power and remarkable cost efficiency, GPUs (graphic processing unit) have quickly emerged as a kind of influential platform for high performance computing. However, as GPUs are designed for massive data-parallel computing, their performance is subject to the presence of condition statements in a GPU application. On a conditional branch where threads diverge in which path to take, the threads taking different paths have to run serially. Such divergences often cause serious performance degradations, impairing the adoption of GPU for many applications that contain non-trivial branches or certain types of loops. C2 - 2010/// C3 - Proceedings of the 24th ACM International Conference on Supercomputing - ICS '10 DA - 2010/// DO - 10.1145/1810085.1810104 PB - ACM Press SN - 9781450300186 UR - http://dx.doi.org/10.1145/1810085.1810104 DB - Crossref ER - TY - CONF TI - An input-centric paradigm for program dynamic optimizations AU - Tian, Kai AU - Jiang, Yunlian AU - Zhang, Eddy Z. AU - Shen, Xipeng T2 - the ACM international conference AB - Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of remarkable progress, prior studies have not systematically exploited program inputs, a deciding factor for program behaviors.Triggered by the strong and predictive correlations between program inputs and behaviors that recent studies have uncovered, this work proposes to include program inputs into the focus of program behavior analysis, cultivating a new paradigm named input-centric program behavior analysis. This new approach consists of three components, forming a three-layer pyramid. At the base is program input characterization, a component for resolving the complexity in program raw inputs and the extraction of important features. In the middle is input-behavior modeling, a component for recognizing and modeling the correlations between characterized input features and program behaviors. These two components constitute input-centric program behavior analysis, which (ideally) is able to predict the large-scope behaviors of a program's execution as soon as the execution starts. The top layer of the pyramid is input-centric adaptation, which capitalizes on the novel opportunities that the first two components create to facilitate proactive adaptation for program optimizations.By centering on program inputs, the new approach resolves a proactivity-adaptivity dilemma inherent in previous techniques. Its benefits are demonstrated through proactive dynamic optimizations and version selection, yielding significant performance improvement on a set of Java and C programs. C2 - 2010/// C3 - Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10 DA - 2010/// DO - 10.1145/1869459.1869471 PB - ACM Press SN - 9781450302036 UR - http://dx.doi.org/10.1145/1869459.1869471 DB - Crossref ER - TY - JOUR TI - Cinematic Visual Discourse: Representation, Generation, and Evaluation AU - Jhala, Arnav AU - Young, R Michael T2 - IEEE Transactions on Computational Intelligence and AI in Games AB - In this paper, we present the design, implementation, and evaluation of an end-to-end camera planning system called Darshak. Darshak automatically constructs cinematic narrative discourse of a given story in a 3-D virtual environment. It utilizes a hierarchical partial-order causal link (POCL) planning algorithm to generate narrative plans that contain story events and camera directives for filming them. Dramatic situation patterns, commonly used by writers of fictional narratives, are formalized as communicative plan operators that provide a basis for structuring the cinematic content of the story's visualization. The dramatic patterns are realized through abstract communicative operators that represent operations on a viewer's beliefs about the story and its telling. Camera shot compositions and transitions are defined in this plan-based framework as execution primitives. Darshak's performance is evaluated through a novel user study based on techniques used to evaluate existing cognitive models of narrative comprehension. Initial study reveals significant effect of the choice of visualization strategies on measured viewer comprehension. It further shows significant effect of Darshak's choice of visualization strategy on comprehension. DA - 2010/6// PY - 2010/6// DO - 10.1109/tciaig.2010.2046486 VL - 2 IS - 2 SP - 69-81 J2 - IEEE Trans. Comput. Intell. AI Games OP - SN - 1943-068X 1943-0698 UR - http://dx.doi.org/10.1109/tciaig.2010.2046486 DB - Crossref KW - Discourse generation KW - machinima generation KW - planning ER - TY - CHAP TI - Impossibility Results for RFID Privacy Notions AU - Armknecht, Frederik AU - Sadeghi, Ahmad-Reza AU - Scafuro, Alessandra AU - Visconti, Ivan AU - Wachsmann, Christian T2 - Transactions on Computational Science XI AB - RFID systems have become increasingly popular and are already used in many real-life applications. Although very useful, RFIDs introduce privacy risks since they carry identifying information that can be traced. Hence, several RFID privacy models have been proposed. However, they are often incomparable and in part do not reflect the capabilities of real-world adversaries. Recently, Paise and Vaudenay presented a general RFID security and privacy model that abstracts and unifies most previous approaches. This model defines mutual authentication (between RFID tags and readers) and several privacy notions that capture adversaries with different tag corruption behavior and capabilities. In this paper, we revisit the model proposed by Paise and Vaudenay and investigate some subtle issues such as tag corruption aspects. We show that in their formal definitions tag corruption discloses the temporary memory of tags and leads to the impossibility of achieving both mutual authentication and any reasonable notion of RFID privacy in their model. Moreover, we show that the strongest privacy notion (narrow-strong privacy) cannot be achieved simultaneously with reader authentication even under the strong assumption that tag corruption does not disclose temporary tag states. Further, we show other impossibility results that hold if the adversary can manipulate an RFID tag such that it resets its state or when tags are stateless. Although our results are shown on the privacy definition by Paise and Vaudenay, they give insight to the difficulties of setting up a mature security and privacy model for RFID systems that aims at fulfilling the sophisticated requirements of real-life applications. PY - 2010/// DO - 10.1007/978-3-642-17697-5_3 SP - 39-63 OP - PB - Springer Berlin Heidelberg SN - 9783642176968 9783642176975 UR - http://dx.doi.org/10.1007/978-3-642-17697-5_3 DB - Crossref ER - TY - CHAP TI - D(e|i)aling with VoIP: Robust Prevention of DIAL Attacks AU - Kapravelos, Alexandros AU - Polakis, Iasonas AU - Athanasopoulos, Elias AU - Ioannidis, Sotiris AU - Markatos, Evangelos P. T2 - Computer Security – ESORICS 2010 AB - We carry out attacks using Internet services that aim to keep telephone devices busy, hindering legitimate callers from gaining access. We use the term DIAL (Digitally Initiated Abuse of teLephones), or, in the simple form, Dial attack, to refer to this behavior. We develop a simulation environment for modeling a Dial attack in order to quantify its full potential and measure the effect of attack parameters. Based on the simulation’s results we perform the attack in the real-world. By using a Voice over IP (VoIP) provider as the attack medium, we manage to hold an existing landline device busy for 85% of the attack duration by issuing only 3 calls per second and, thus, render the device unusable. The attack has zero financial cost, requires negligible computational resources and cannot be traced back to the attacker. Furthermore, the nature of the attack is such that anyone can launch a Dial attack towards any telephone device.Our investigation of existing countermeasures in VoIP providers shows that they follow an all-or-nothing approach, but most importantly, that their anomaly detection systems react slowly against our attacks, as we managed to issue tens of thousands of calls before getting spotted. To cope with this, we propose a flexible anomaly detection system for VoIP calls, which promotes fairness for callers. With our system in place it is hard for an adversary to keep the device busy for more than 5% of the duration of the attack. PY - 2010/// DO - 10.1007/978-3-642-15497-3_40 SP - 663-678 OP - PB - Springer Berlin Heidelberg SN - 9783642154966 9783642154973 UR - http://dx.doi.org/10.1007/978-3-642-15497-3_40 DB - Crossref ER - TY - JOUR TI - Practical considerations in deploying statistical methods for defect prediction: A case study within the Turkish telecommunications industry AU - Tosun, Ayşe AU - Bener, Ayşe AU - Turhan, Burak AU - Menzies, Tim T2 - Information and Software Technology AB - Building defect prediction models in large organizations has many challenges due to limited resources and tight schedules in the software development lifecycle. It is not easy to collect data, utilize any type of algorithm and build a permanent model at once. We have conducted a study in a large telecommunications company in Turkey to employ a software measurement program and to predict pre-release defects. Based on our prior publication, we have shared our experience in terms of the project steps (i.e. challenges and opportunities). We have further introduced new techniques that improve our earlier results. In our previous work, we have built similar predictors using data representative for US software development. Our task here was to check if those predictors were specific solely to US organizations or to a broader class of software. We have presented our approach and results in the form of an experience report. Specifically, we have made use of different techniques for improving the information content of the software data and the performance of a Naïve Bayes classifier in the prediction model that is locally tuned for the company. We have increased the information content of the software data by using module dependency data and improved the performance by adjusting the hyper-parameter (decision threshold) of the Naïve Bayes classifier. We have reported and discussed our results in terms of defect detection rates and false alarms. We also carried out a cost–benefit analysis to show that our approach can be efficiently put into practice. Our general result is that general defect predictors, which exist across a wide range of software (in both US and Turkish organizations), are present. Our specific results indicate that concerning the organization subject to this study, the use of version history information along with code metrics decreased false alarms by 22%, the use of dependencies between modules further reduced false alarms by 8%, and the decision threshold optimization for the Naïve Bayes classifier using code metrics and version history information further improved false alarms by 30% in comparison to a prediction using only code metrics and a default decision threshold. Implementing statistical techniques and machine learning on a real life scenario is a difficult yet possible task. Using simple statistical and algorithmic techniques produces an average detection rate of 88%. Although using dependency data improves our results, it is difficult to collect and analyze such data in general. Therefore, we would recommend optimizing the hyper-parameter of the proposed technique, Naïve Bayes, to calibrate the defect prediction model rather than employing more complex classifiers. We also recommend that researchers who explore statistical and algorithmic methods for defect prediction should spend less time on their algorithms and more time on studying the pragmatic considerations of large organizations. DA - 2010/11// PY - 2010/11// DO - 10.1016/j.infsof.2010.06.006 VL - 52 IS - 11 SP - 1242-1257 J2 - Information and Software Technology LA - en OP - SN - 0950-5849 UR - http://dx.doi.org/10.1016/j.infsof.2010.06.006 DB - Crossref KW - Software defect prediction KW - Experience report KW - Naive Bayes KW - Static code attributes ER - TY - JOUR TI - A second look at Faster, Better, Cheaper AU - El-Rawas, Oussama AU - Menzies, Tim T2 - Innovations in Systems and Software Engineering DA - 2010/10/21/ PY - 2010/10/21/ DO - 10.1007/S11334-010-0137-9 VL - 6 IS - 4 SP - 319-335 J2 - Innovations Syst Softw Eng LA - en OP - SN - 1614-5046 1614-5054 UR - http://dx.doi.org/10.1007/S11334-010-0137-9 DB - Crossref KW - Software engineering KW - Predictor models KW - COCOMO KW - Faster Better Cheaper KW - Simulated annealing KW - Software processes ER - TY - JOUR TI - Automatically finding the control variables for complex system behavior AU - Gay, Gregory AU - Menzies, Tim AU - Davies, Misty AU - Gundy-Burlet, Karen T2 - Automated Software Engineering AB - Testing large-scale systems is expensive in terms of both time and money. Running simulations early in the process is a proven method of finding the design faults likely to lead to critical system failures, but determining the exact cause of those errors is still time-consuming and requires access to a limited number of domain experts. It is desirable to find an automated method that explores the large number of combinations and is able to isolate likely fault points. Treatment learning is a subset of minimal contrast-set learning that, rather than classifying data into distinct categories, focuses on finding the unique factors that lead to a particular classification. That is, they find the smallest change to the data that causes the largest change in the class distribution. These treatments, when imposed, are able to identify the factors most likely to cause a mission-critical failure. The goal of this research is to comparatively assess treatment learning against state-of-the-art numerical optimization techniques. To achieve this, this paper benchmarks the TAR3 and TAR4.1 treatment learners against optimization techniques across three complex systems, including two projects from the Robust Software Engineering (RSE) group within the National Aeronautics and Space Administration (NASA) Ames Research Center. The results clearly show that treatment learning is both faster and more accurate than traditional optimization methods. DA - 2010/5/29/ PY - 2010/5/29/ DO - 10.1007/s10515-010-0072-x VL - 17 IS - 4 SP - 439-468 J2 - Autom Softw Eng LA - en OP - SN - 0928-8910 1573-7535 UR - http://dx.doi.org/10.1007/s10515-010-0072-x DB - Crossref KW - Contrast-set learning KW - Search-based software engineering KW - Simulation KW - Optimization KW - Monte Carlo filtering ER - TY - JOUR TI - Stable rankings for different effort models AU - Menzies, Tim AU - Jalali, Omid AU - Hihn, Jairus AU - Baker, Dan AU - Lum, Karen T2 - Automated Software Engineering DA - 2010/5/26/ PY - 2010/5/26/ DO - 10.1007/s10515-010-0070-z VL - 17 IS - 4 SP - 409-437 J2 - Autom Softw Eng LA - en OP - SN - 0928-8910 1573-7535 UR - http://dx.doi.org/10.1007/s10515-010-0070-z DB - Crossref KW - COCOMO KW - Effort estimation KW - Data mining KW - Evaluation ER - TY - JOUR TI - Defect prediction from static code features: current results, limitations, new approaches AU - Menzies, Tim AU - Milton, Zach AU - Turhan, Burak AU - Cukic, Bojan AU - Jiang, Yue AU - Bener, Ayşe T2 - Automated Software Engineering DA - 2010/5/20/ PY - 2010/5/20/ DO - 10.1007/s10515-010-0069-5 VL - 17 IS - 4 SP - 375-407 J2 - Autom Softw Eng LA - en OP - SN - 0928-8910 1573-7535 UR - http://dx.doi.org/10.1007/s10515-010-0069-5 DB - Crossref KW - Defect prediction KW - Static code features KW - WHICH ER - TY - CHAP TI - Regularities in Learning Defect Predictors AU - Turhan, Burak AU - Bener, Ayse AU - Menzies, Tim T2 - Product-Focused Software Process Improvement PY - 2010/// DO - 10.1007/978-3-642-13792-1_11 SP - 116-130 OP - PB - Springer Berlin Heidelberg SN - 9783642137914 9783642137921 UR - http://dx.doi.org/10.1007/978-3-642-13792-1_11 DB - Crossref ER - TY - CHAP TI - Inducing Effective Pedagogical Strategies Using Learning Context Features AU - Chi, Min AU - VanLehn, Kurt AU - Litman, Diane AU - Jordan, Pamela T2 - User Modeling, Adaptation, and Personalization AB - Effective pedagogical strategies are important for e-learning environments. While it is assumed that an effective learning environment should craft and adapt its actions to the user’s needs, it is often not clear how to do so. In this paper, we used a Natural Language Tutoring System named Cordillera and applied Reinforcement Learning (RL) to induce pedagogical strategies directly from pre-existing human user interaction corpora. 50 features were explored to model the learning context. Of these features, domain-oriented and system performance features were the most influential while user performance and background features were rarely selected. The induced pedagogical strategies were then evaluated on real users and results were compared with pre-existing human user interaction corpora. Overall, our results show that RL is a feasible approach to induce effective, adaptive pedagogical strategies by using a relatively small training corpus. Moreover, we believe that our approach can be used to develop other adaptive and personalized learning environments. PY - 2010/// DO - 10.1007/978-3-642-13470-8_15 SP - 147-158 OP - PB - Springer Berlin Heidelberg SN - 9783642134692 9783642134708 UR - http://dx.doi.org/10.1007/978-3-642-13470-8_15 DB - Crossref ER - TY - CHAP TI - Do Micro-Level Tutorial Decisions Matter: Applying Reinforcement Learning to Induce Pedagogical Tutorial Tactics AU - Chi, Min AU - VanLehn, Kurt AU - Litman, Diane T2 - Intelligent Tutoring Systems AB - Pedagogical tutorial tactics are policies for a tutor to decide the next action when there are multiple actions available. When the contents were controlled so as to be the same, little evidence has shown that tutorial decisions would impact students’ learning. In this paper, we applied Reinforcement Learning (RL) to induce two sets of tutorial tactics from pre-existing human interaction data. The NormGain set was derived with the goal of enhancing tutorial decisions that contribute to learning while the InvNormGain set was derived with the goal of enhancing those decisions that contribute less or even nothing to learning. The two sets were then compared with human students. Our results showed that when the contents were controlled so as to be the same, different pedagogical tutorial tactics would make a difference in learning and more specifically, the NormGain students outperformed their peers. PY - 2010/// DO - 10.1007/978-3-642-13388-6_27 SP - 224-234 OP - PB - Springer Berlin Heidelberg SN - 9783642133879 9783642133886 UR - http://dx.doi.org/10.1007/978-3-642-13388-6_27 DB - Crossref ER - TY - JOUR TI - Towards affective camera control in games AU - Yannakakis, Georgios N. AU - Martínez, Héctor P. AU - Jhala, Arnav T2 - User Modeling and User-Adapted Interaction AB - Information about interactive virtual environments, such as games, is perceived by users through a virtual camera. While most interactive applications let users control the camera, in complex navigation tasks within 3D environments users often get frustrated with the interaction. In this paper, we propose inclusion of camera control as a vital component of affective adaptive interaction in games. We investigate the impact of camera viewpoints on psychophysiology of players through preference surveys collected from a test game. Data is collected from players of a 3D prey/predator game in which player experience is directly linked to camera settings. Computational models of discrete affective states of fun, challenge, boredom, frustration, excitement, anxiety and relaxation are built on biosignal (heart rate, blood volume pulse and skin conductance) features to predict the pairwise self-reported emotional preferences of the players. For this purpose, automatic feature selection and neuro-evolutionary preference learning are combined providing highly accurate affective models. The performance of the artificial neural network models on unseen data reveals accuracies of above 80% for the majority of discrete affective states examined. The generality of the obtained models is tested in different test-bed game environments and the use of the generated models for creating adaptive affect-driven camera control in games is discussed. DA - 2010/10// PY - 2010/10// DO - 10.1007/s11257-010-9078-0 VL - 20 IS - 4 SP - 313-340 J2 - User Model User-Adap Inter LA - en OP - SN - 0924-1868 1573-1391 UR - http://dx.doi.org/10.1007/s11257-010-9078-0 DB - Crossref ER - TY - CHAP TI - Integrating Learning and Engagement in Narrative-Centered Learning Environments AU - Rowe, Jonathan P. AU - Shores, Lucy R. AU - Mott, Bradford W. AU - Lester, James C. T2 - Intelligent Tutoring Systems AB - A key promise of narrative-centered learning environments is the ability to make learning engaging. However, there is concern that learning and engagement may be at odds in these game-based learning environments and traditional learning systems. This view suggests that, on the one hand, students interacting with a game-based learning environment may be engaged but unlikely to learn, while on the other hand, traditional learning technologies may promote deep learning but provide limited engagement. This paper presents findings from a study with human participants that challenges the view that engagement and learning need be opposed. A study was conducted with 153 middle school students interacting with a narrative-centered learning environment. Rather than finding an oppositional relationship between learning and engagement, the study found a strong positive relationship between learning outcomes and increased engagement. Furthermore, the relationship between learning outcomes and engagement held even when controlling for students’ background knowledge and game-playing experience. PY - 2010/// DO - 10.1007/978-3-642-13437-1_17 SP - 166-177 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_17 DB - Crossref ER - TY - CHAP TI - Optimizing Story-Based Learning: An Investigation of Student Narrative Profiles AU - Lee, Seung Y. AU - Mott, Bradford W. AU - Lester, James C. T2 - Intelligent Tutoring Systems AB - Narrative-centered learning environments offer significant potential for creating effective learning experiences in which students actively participate in engaging story-based problem solving. As the capabilities of narrative-centered learning environments expand, a key challenge is identifying experiential factors that contribute to the most effective story-based learning. To investigate the impact of students’ narrative experiences on learning outcomes, a Wizard of Oz (WOZ) study was conducted with middle school students interacting with a narrative-centered learning environment. Students’ experiences were examined using narrative profiles representing their type of story interaction. With narrative planning, tutorial planning, and natural language dialogue functionalities provided by wizards, the WOZ study revealed that in interactive story-based learning supported by beyond-state-of-the-art ITS capabilities, 1) students exhibit a range of learning outcomes, 2) students exhibit a range of narrative profiles, and 3) certain student narrative profiles are strongly associated with desirable learning outcomes. The study suggests design decisions for optimizing story-based learning. PY - 2010/// DO - 10.1007/978-3-642-13437-1_16 SP - 155-165 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_16 DB - Crossref ER - TY - CHAP TI - Developing Empirically Based Student Personality Profiles for Affective Feedback Models AU - Robison, Jennifer AU - McQuiggan, Scott AU - Lester, James T2 - Intelligent Tutoring Systems AB - The impact of affect on learning has been the subject of increasing attention. Because of the differential effects of students’ affective states on learning outcomes, there is a growing recognition of the important role that intelligent tutoring systems can play in providing affective feedback to students. Although we are only beginning to understand the complex interactions between affect, feedback, and learning, it is evident that affective interventions can both positively and negatively influence learning experiences. To investigate how student personality traits can be used to predict responses to affective feedback, this paper presents an analysis of a large student affect corpus collected from three separate studies. Student personality profiles augmented with goal orientation and empathetic tendency information were analyzed with respect to affect state transitions. The results indicate that student personality profiles can serve as a powerful tool for informing affective feedback models. PY - 2010/// DO - 10.1007/978-3-642-13388-6_33 SP - 285-295 OP - PB - Springer Berlin Heidelberg SN - 9783642133879 9783642133886 UR - http://dx.doi.org/10.1007/978-3-642-13388-6_33 DB - Crossref ER - TY - CHAP TI - How the Public Views Strategies Designed to Reduce the Threat of Botnets AU - Rowe, Brent AU - Wood, Dallas AU - Reeves, Douglas T2 - Trust and Trustworthy Computing AB - Botnets pose a growing threat to the nation’s critical digital infrastructure and general level of cybersecurity. Several strategies for reducing the threat of botnets have been outlined in the cyber security literature. These strategies typically call for both Internet Service Providers (ISPs) and home Internet users to adopt a greater share of the responsibility for overall security. However, to date no study has attempted to determine how accepting the public would be of these strategies. This study takes the first step in filling that gap. The results of this pilot survey suggest that, in general, individuals would be willing to spend additional time each month meeting security requirements set by their ISPs. The results also suggest that although only 50% of respondents would be willing to pay their ISP more per month to protect themselves from cyber threats, more people would be willing to do so if they perceived ISPs as being effective or very effective at reducing such threats. The findings provide important guidance for policy makers and ISPs seeking to gain support for such strategies. PY - 2010/// DO - 10.1007/978-3-642-13869-0_25 SP - 337-351 OP - PB - Springer Berlin Heidelberg SN - 9783642138683 9783642138690 UR - http://dx.doi.org/10.1007/978-3-642-13869-0_25 DB - Crossref ER - TY - JOUR TI - malnets: large-scale malicious networks via compromised wireless access points AU - Traynor, Patrick AU - Butler, Kevin AU - Enck, William AU - McDaniel, Patrick AU - Borders, Kevin T2 - Security and Communication Networks AB - Abstract Densely populated areas are increasingly filled with vulnerable wireless routers set up by unsophisticated users. In isolation, such routers appear to represent only a minor threat, but in aggregate, the threat can be much greater. We introduce the notion of malnets : networks of adversary‐controlled wireless routers targeted to a physical geography. Similar to Internet worms such as Slammer and Code‐Red, malnets are created by the recursive compromise of targeted devices. However, unlike their traditionally wired counterparts, malnet worms exploit only other routers that are within their transmission range. The malnet thus creates a parallel wireless infrastructure that is ( a ) completely under control of the adversary, and ( b ) spans a targeted physical area, creating a valuable infrastructure for a variety of virtual and physical attacks. We initially study the propagation characteristics of commercial routers and model inter‐router connectivity using publicly available war‐driving data. The resulting characterization is applied to well‐known epidemiological models to explore the success rates and speeds of malnet creation across cities such as New York, Atlanta, and Los Angles. Finally, we use a sampling of available exploits to demonstrate the construction of multi‐vector, multi‐platform worms capable of targeting wireless routers. Our analysis show that an adversary can potentially deploy a malnet of over 24,000 routers in Manhattan in less than 2,h. Through this work we show that malnets are not only feasible but can be efficiently deployed. Copyright © 2009 John Wiley & Sons, Ltd. DA - 2010/3// PY - 2010/3// DO - 10.1002/sec.149 VL - 3 IS - 2-3 SP - 102–113 SN - 1939-0114 1939-0122 UR - http://dx.doi.org/10.1002/sec.149 KW - malware KW - routing KW - security ER - TY - CONF TI - Disambiguating Keyword Queries on RDF Databases Using "Deep" Segmentation AU - Fu, H. AU - Gao, S. AU - Anyanwu, K. AB - Keyword search on (semi)structured databases is an increasingly popular research topic. But existing techniques do not deal well with the problems presented by the queries that are ambiguous. Recent approaches for RDF databases try to improve the quality of results by introducing an explicit top-k “interpretation” phase in which queries are translated into an ordered list of “most likely intended” structured (SPARQL) queries before query execution. However, even these recent techniques only address keyword query ambiguity in a limited fashion by identifying fine-grained semantic units or segments of a query. This enables some reduction in the space of interpretations, pruning away incorrect interpretations, but the reduction in interpretation space is not as aggressive as it could be. In this paper, we propose a “deep segmentation” technique for keyword queries issued against an RDF database. This approach achieves a more aggressive pruning of irrelevant interpretations from the space of interpretations considered and therefore produces better quality query interpretations even in the presence of significant query ambiguity. We present results for a comprehensive human-based evaluation that is based on a metric that we introduce called degree of ambiguity (DOTA) that has not been considered by previous efforts. The experimental results show that our approach outperforms existing techniques in terms of quality even when queries are very ambiguous. C2 - 2010/// C3 - 2010 IEEE Fourth International Conference on Semantic Computing DA - 2010/// DO - 10.1109/ICSC.2010.90 VL - SP - 236-243 M1 - KW - Segmentation KW - Keyword Query KW - Interpretation KW - RDF ER - TY - CONF TI - An agglomerative query model for discovery in linked data AB - Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response paradigm, these tasks involve a multistage search process in which bits of information are accumulated over a series of related queries. The ability and effectiveness of users to connect the dots between these pieces of information are crucial to enable discovery. In this paper, we introduce the notion of agglomerative querying for supporting "search processes" and present its motivation, challenges and formalization. We focus on a specific class of agglomerative querying called association agglomerative querying which is very natural for linked data models such as RDF. We present a preliminary implementation approach for processing such queries and discuss its relationship with SPARQL query processing. Finally, we present empirical results for proving the effectiveness of our approach on the DBLP dataset and future directions. C2 - 2010/// C3 - Procceedings of the 13th International Workshop on the Web and Databases - WebDB '10 DA - 2010/// DO - 10.1145/1859127.1859131 UR - http://dx.doi.org/10.1145/1859127.1859131 ER - TY - CHAP TI - Enhancing the Automatic Generation of Hints with Expert Seeding AU - Stamper, John AU - Barnes, Tiffany AU - Croy, Marvin T2 - Intelligent Tutoring Systems AB - The Hint Factory is an implementation of our novel method to automatically generate hints using past student data for a logic tutor. One disadvantage of the Hint Factory is the time needed to gather enough data on new problems in order to provide hints. In this paper we describe the use of expert sample solutions to “seed” the hint generation process. We show that just a few expert solutions give significant coverage (over 50%) for hints. This seeding method greatly speeds up the time needed to reliably generate hints. We discuss how this feature can be integrated into the Hint Factory and some potential pedagogical issues that the expert solutions introduce. PY - 2010/// DO - 10.1007/978-3-642-13437-1_4 SP - 31-40 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_4 DB - Crossref ER - TY - CHAP TI - Towards the Creation of a Data-Driven Programming Tutor AU - Mostafavi, Behrooz AU - Barnes, Tiffany T2 - Intelligent Tutoring Systems AB - Educational data mining methods are being used to automatically generate hints to students in intelligent tutoring systems. Using these methods, we hope to create a system that can give individualized instruction. By analyzing time snapshot data from exams in an introductory programming course, we will write a program to construct state graphs for each student’s performance, eventually resulting in a Markov decision process that represents different approaches to writing the target program, and providing feedback to students. Once this system is sufficiently tested and refined, it will then be applied to subsequent semesters students in the programming course. PY - 2010/// DO - 10.1007/978-3-642-13437-1_31 SP - 239-241 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_31 DB - Crossref ER - TY - CHAP TI - Visualizing Educational Data from Logic Tutors AU - Johnson, Matthew AU - Barnes, Tiffany T2 - Intelligent Tutoring Systems AB - We propose a data visualization tool that offers insights into the way students solve procedural domain problems. The tool uses nodes and edges to represent states and actions which students have generated using an intelligent tutoring system or computer aided instruction tool, ultimately showing the way a student has solved a problem. We use the example of logic tutor data and suggest two methods of evaluation for ensuring the tool is effective at aiding educators to better understand student learning. PY - 2010/// DO - 10.1007/978-3-642-13437-1_29 SP - 233-235 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_29 DB - Crossref ER - TY - CHAP TI - Intelligent Tutoring Systems, Educational Data Mining, and the Design and Evaluation of Video Games AU - Eagle, Michael AU - Barnes, Tiffany T2 - Intelligent Tutoring Systems AB - Technological support for personalized learning has the potential to transform the educational system in the United States. There is a growing interest in educational games and their potential for motivating learners. Techniques from the educational data mining and intelligent tutoring systems communities can be leveraged to better understand, design, and evaluate educational games for both learning effectiveness and learner engagement. This work explores the use of intelligent feedback in games as well as the potential pitfalls; it concludes with a proposed study designed to explore the differences between intelligent tutoring systems and educational video games. PY - 2010/// DO - 10.1007/978-3-642-13437-1_23 SP - 215-217 OP - PB - Springer Berlin Heidelberg SN - 9783642134364 9783642134371 UR - http://dx.doi.org/10.1007/978-3-642-13437-1_23 DB - Crossref ER - TY - CHAP TI - A Fault-Tolerance Architecture for Kepler-Based Distributed Scientific Workflows AU - Mouallem, Pierre AU - Crawl, Daniel AU - Altintas, Ilkay AU - Vouk, Mladen AU - Yildiz, Ustun T2 - Lecture Notes in Computer Science AB - Fault-tolerance and failure recovery in scientific workflows is still a relatively young topic. The work done in the domain so far mostly applies classic fault-tolerance mechanisms, such as "alternative versions" and "checkpointing", to scientific workflows. Often scientific workflow systems simply rely on the fault-tolerance capabilities provided by their third party subcomponents such as schedulers, Grid resources, or the underlying operating systems. When failures occur at the underlying layers, a workflow system typically sees them only as failed steps in the process without additional detail and the ability of the system to recover from those failures may be limited. In this paper, we present an architecture that tries to address this for Kepler-based scientific workflows by providing more information about failures and faults we have observed, and through a supporting implementation of more comprehensive failure coverage and recovery options. We discuss our framework in the context of the failures observed in two production-level Kepler-based workflows, specifically XGC and S3D. The framework is divided into three major components: (i) a general contingency Kepler actor that provides a recovery block functionality at the workflow level, (ii) an external monitoring module that tracks the underlying workflow components, and monitors the overall health of the workflow execution, and (iii) a checkpointing mechanism that provides smart resume capabilities for cases in which an unrecoverable error occurs. This framework takes advantage of the provenance data collected by the Kepler-based workflows to detect failures and help in fault-tolerance decision making. PY - 2010/// DO - 10.1007/978-3-642-13818-8_31 SP - 452-460 OP - PB - Springer Berlin Heidelberg SN - 9783642138171 9783642138188 UR - http://dx.doi.org/10.1007/978-3-642-13818-8_31 DB - Crossref ER - TY - CHAP TI - Characterizing the Effectiveness of Tutorial Dialogue with Hidden Markov Models AU - Boyer, Kristy Elizabeth AU - Phillips, Robert AU - Ingram, Amy AU - Ha, Eun Young AU - Wallis, Michael AU - Vouk, Mladen AU - Lester, James T2 - Intelligent Tutoring Systems AB - Identifying effective tutorial dialogue strategies is a key issue for intelligent tutoring systems research. Human-human tutoring offers a valuable model for identifying effective tutorial strategies, but extracting them is a challenge because of the richness of human dialogue. This paper addresses that challenge through a machine learning approach that 1) learns tutorial strategies from a corpus of human tutoring, and 2) identifies the statistical relationships between student outcomes and the learned strategies. We have applied hidden Markov modeling to a corpus of annotated task-oriented tutorial dialogue to learn one model for each of two effective human tutors. We have identified significant correlations between the automatically extracted tutoring modes and student learning outcomes. This work has direct applications in authoring data-driven tutorial dialogue system behavior and in investigating the effectiveness of human tutoring. PY - 2010/// DO - 10.1007/978-3-642-13388-6_10 SP - 55-64 OP - PB - Springer Berlin Heidelberg SN - 9783642133879 9783642133886 UR - http://dx.doi.org/10.1007/978-3-642-13388-6_10 DB - Crossref ER - TY - CONF TI - Tuning cognitive tutors into a platform for learning-by-teaching with SimStudent technology AU - Matsuda, N. AU - Cohen, W.W. AU - Koedinger, K.R. AU - Stylianides, G. AU - Keiser, V. AU - Raizada, R. C2 - 2010/// C3 - CEUR Workshop Proceedings DA - 2010/// VL - 587 SP - 20-25 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84888214372&partnerID=MN8TOARS ER - TY - CONF TI - Towards a computational model of why some students learn faster than others AU - Li, N. AU - Matsuda, N. AU - Cohen, W.W. AU - Koedinger, K.R. C2 - 2010/// C3 - AAAI Fall Symposium - Technical Report DA - 2010/// VL - FS-10-01 SP - 40-46 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79960149222&partnerID=MN8TOARS ER - TY - BOOK TI - Learning by teaching SimStudent: Technical accomplishments and an initial use with students AU - Matsuda, N. AU - Keiser, V. AU - Raizada, R. AU - Tu, A. AU - Stylianides, G. AU - Cohen, W.W. AU - Koedinger, K.R. AB - The purpose of the current study is to test whether we could create a system where students can learn by teaching a live machine-learning agent, called SimStudent. SimStudent is a computer agent that interactively learns cognitive skills through its own tutored-problem solving experience. We have developed a game-like learning environment where students learn algebra equations by tutoring SimStudent. While Simulated Students, Teachable Agents and Learning Companion systems have been created, our study is unique that it genuinely learns skills from student input. This paper describes the overview of the learning environment and some results from an evaluation study. The study showed that after tutoring SimStudent, the students improved their performance on equation solving. The number of correct answers on the error detection items was also significantly improved. On average students spent 70.0 minutes on tutoring SimStudent and used an average of 15 problems for tutoring. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-13388-6_36 VL - 6094 LNCS SE - 317-326 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-79957441827&partnerID=MN8TOARS ER - TY - BOOK TI - Learning by teaching SimStudent AU - Matsuda, N. AU - Keiser, V. AU - Raizada, R. AU - Stylianides, G. AU - Cohen, W.W. AU - Koedinger, K. AB - The effect of tutor learning has been studied in various contexts, providing ample evidence to suggest that students learn when they teach others. Yet, the cognitive and social factors that facilitate or inhibit tutor learning are still not well understood. One factor that prohibited research progress in this area is that studying the tutor learning effect could often be done only at the cost of tutees’ learning. To address this problem, we built an on-line learning environment where students learn by teaching a computer agent, called SimStudent, rather than their peers [1]. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-13437-1_106 VL - 6095 LNCS SE - 449 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77955899194&partnerID=MN8TOARS ER - TY - JOUR TI - Counting paths in digraphs AU - Seymour, Paul AU - Sullivan, Blair D. T2 - European Journal of Combinatorics AB - Say a digraph is k-free if it has no directed cycles of length at most k, for positive integers k. Thomasse conjectured that the number of induced 3-vertex directed paths in a simple 2-free digraph on n vertices is at most (n-1)n(n+1)/15. We present an unpublished result of Bondy proving that there are at most 2n^3/25 such paths, and prove that for the class of circular interval digraphs, an upper bound of n^3/16 holds. We also study the problem of bounding the number of (non-induced) 4-vertex paths in 3-free digraphs. We show an upper bound of 4n^4/75 using Bondy's result for Thomasse's conjecture. DA - 2010/4// PY - 2010/4// DO - 10.1016/j.ejc.2009.05.008 VL - 31 IS - 3 SP - 961-975 J2 - European Journal of Combinatorics LA - en OP - SN - 0195-6698 UR - http://dx.doi.org/10.1016/j.ejc.2009.05.008 DB - Crossref ER - TY - CONF TI - Astrojumper: motivating children with autism to exercise using a VR game AU - Finkelstein, Samantha AU - Nickel, Andrea AU - Barnes, Tiffany AU - Suma, Evan A. T2 - the 28th of the international conference extended abstracts AB - Children with autism have shown substantial benefits from rigorous physical activity, however, it is often difficult to motivate these children to exercise due to their usually sedentary lifestyles. To address the problem of motivation, we have developed Astrojumper, a stereoscopic virtual reality exergame which was designed to fit the needs of children with autism. We use electromagnetic trackers and a 3-sided CAVE to present virtual space-themed stimuli to the user, who must use physical movements to avoid collisions and gain points. We can use Astrojumper not only to motivate exercise, but to evaluate the different ways people with and without autism interact with an exercise tool. Preliminary playtesting of Astrojumper has been positive, and we plan to run an extensive evaluation assessing the effectiveness of this system on children with and without autism. C2 - 2010/// C3 - Proceedings of the 28th of the international conference extended abstracts on Human factors in computing systems - CHI EA '10 DA - 2010/// DO - 10.1145/1753846.1754124 PB - ACM Press SN - 9781605589305 UR - http://dx.doi.org/10.1145/1753846.1754124 ER - TY - CONF TI - Lessons from a course on serious games research and prototyping AU - Chaffin, Amanda AU - Barnes, Tiffany T2 - the Fifth International Conference AB - Serious games are an exciting new research area that combines expertise across a wide range of computing skills, from programming and software engineering to algorithms, problem solving, and networking with design skills. Teaching computing students to create effective games with a serious purpose within a semester can be quite challenging, even on a one on one basis. We present the structure, format, and outcomes from an experimental course in serious games research and prototyping conducted at the University of North Carolina at Charlotte. C2 - 2010/// C3 - Proceedings of the Fifth International Conference on the Foundations of Digital Games - FDG '10 DA - 2010/// DO - 10.1145/1822348.1822353 PB - ACM Press SN - 9781605589374 UR - http://dx.doi.org/10.1145/1822348.1822353 DB - Crossref ER - TY - JOUR TI - Applying service learning to computer science: attracting and engaging under-represented students AU - Dahlberg, Teresa AU - Barnes, Tiffany AU - Buch, Kim AU - Bean, Karen T2 - Computer Science Education AB - This article describes a computer science course that uses service learning as a vehicle to accomplish a range of pedagogical and BPC (broadening participation in computing) goals: (1) to attract a diverse group of students and engage them in outreach to younger students to help build a diverse computer science pipeline, (2) to develop leadership and team skills using experiential techniques, and (3) to develop student attitudes associated with success and retention in computer science. First, we describe the course and how it was designed to incorporate good practice in service learning. We then report preliminary results showing a positive impact of the course on all pedagogical goals and discuss the implications of the results for broadening participation in computing. DA - 2010/9// PY - 2010/9// DO - 10.1080/08993408.2010.492164 VL - 20 IS - 3 SP - 169-180 J2 - Computer Science Education LA - en OP - SN - 0899-3408 1744-5175 UR - http://dx.doi.org/10.1080/08993408.2010.492164 DB - Crossref KW - broadening participation KW - diversity KW - computing efficacy KW - computing identity ER - TY - CHAP TI - Novel Derivation and Application of Skill Matrices AU - Barnes, Tiffany T2 - Handbook of Educational Data Mining PY - 2010/10/25/ DO - 10.1201/b10274-14 SP - 159-172 OP - PB - CRC Press SN - 9781439804575 9781439804582 UR - http://dx.doi.org/10.1201/b10274-14 DB - Crossref ER - TY - CHAP TI - Using Markov Decision Processes for Automatic Hint AU - Barnes, Tiffany AU - Stamper, John AU - Croy, Marvin T2 - Handbook of Educational Data Mining AB - The ASSISTment online tutoring system was used by over 600 students during the school year 2004-2005. Each student used the system as part of their math classes 1-2 times a month, doing on average over 100+ state-test items, and getting tutored on the ones they got incorrect. The ASSISTment system has 4 different skill models, each at different grain-size involving 1, 5, 39 or 106 skills. Our goal in the paper is to develop a model that will predict whether a student will get correct a given item. We compared the performance of these models on their ability to predict a student state test score, after the state test was tagged with skills for the 4 models. The best fitting model was the 39 skill model, suggesting that using finer-grained skills models is useful to a point. This result is pretty much the same as that which was achieved by Feng, Heffernan, Mani, & Heffernan (in press), who were working simultaneously, but using mized-effect models instead of Bayes networks. We discuss reasons why the finest-grained model might not have been able to predict the data the best. Implications for large scale testing are discussed. PY - 2010/10/25/ DO - 10.1201/b10274-36 SP - 467-480 OP - PB - CRC Press SN - 9781439804575 9781439804582 UR - http://dx.doi.org/10.1201/b10274-36 DB - Crossref ER - TY - JOUR TI - Approximate centerpoints with proofs AU - Miller, Gary L. AU - Sheehy, Donald R. T2 - Computational Geometry AB - We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S⊂Rd with running time sub-exponential in d. The algorithm is a derandomization of the IteratedRadon algorithm of Clarkson et al. (International Journal of Computational Geometry and Applications 6 (3) (1996) 357–377) and is guaranteed to terminate with an Ω(1/d2)-center. Moreover, it returns a polynomial-time checkable proof of the approximation guarantee, despite the coNP-completeness of testing centerpoints in general. We also explore the use of higher order Tverberg partitions to improve the running time of the deterministic algorithm and improve the approximation guarantee for the randomized algorithm. In particular, we show how to improve the Ω(1/d2)-center of the IteratedRadon algorithm to Ω(1/drr−1) for a cost of O((rd)d) in time for any integer r>1. DA - 2010/10// PY - 2010/10// DO - 10.1016/j.comgeo.2010.04.006 VL - 43 IS - 8 SP - 647-654 J2 - Computational Geometry LA - en OP - SN - 0925-7721 UR - http://dx.doi.org/10.1016/j.comgeo.2010.04.006 DB - Crossref ER - TY - CONF TI - Topological inference via meshing AU - Hudson, Benoit AU - Miller, Gary L. AU - Oudot, Steve Y. AU - Sheehy, Donald R. T2 - the 2010 annual symposium AB - We apply ideas from mesh generation to improve the time and space complexities of computing the full persistent homological information associated with a point cloud P in Euclidean space ℜd. Classical approaches rely on the Cech, Rips, ±-complex, or witness complex filtrations of P, whose complexities scale up very badly with d. For instance, the ±-complex filtration incurs the n Ω(d) size of the Delaunay triangulation, where n is the size of P. The common alternative is to truncate the filtrations when the sizes of the complexes become prohibitive, possibly before discovering the most relevant topological features. In this paper we propose a new collection of filtrations, based on the Delaunay triangulation of a carefully-chosen superset of P, whose sizes are reduced to 2O(d2)n. Our filtrations interleave multiplicatively with the family of offsets of P, so that the persistence diagram of P can be approximated in 2O(d2)n3 time in theory, with a near-linear observed running time in practice. Thus, our approach remains tractable in medium dimensions, say 4 to 10. C2 - 2010/// C3 - Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10 DA - 2010/// DO - 10.1145/1810959.1811006 PB - ACM Press SN - 9781450300162 UR - http://dx.doi.org/10.1145/1810959.1811006 DB - Crossref KW - topological inference KW - persistent homology KW - mesh generation KW - sparse Voronoi refinement ER - TY - JOUR TI - Programming Multiagent Systems without Programming Agents T2 - Lecture Notes in Computer Science AB - Due to increased adoption of cloud computing, there is a growing need of addressing the data privacy during mining. On the other hand, knowledge sharing is a key to survive many business organizations. Several attempts have been made to mine the data in distributed environment however, maintaining the privacy while mining the data over cloud is a challenging task. In this paper, we present an efficient and practical cryptographic based scheme that preserves privacy and mine the cloud data which is distributed in nature. In order to address the classification task, our approach uses k-NN classifier. We extend the Jaccard measure to find the similarity between two encrypted and distributed records by conducting an equality test. In addition, our approach accelerates mining by finding nearest neighbours at local and then at global level. The proposed approach avoids transmitting the original data and sharing of the key that is required in traditional crypto based privacy preserving data mining solutions. DA - 2010/// PY - 2010/// DO - 10.1145/1754288.1754302 UR - https://publons.com/publon/21294446/ ER - TY - JOUR TI - Multidisciplinary Views of Business Contracts T2 - Lecture Notes in Computer Science AB - Several major trends in the services industry drive toward an increasing importance of contracts. These include the formalization of business processes across the client and the provider organizations; resource administration in cloud computing environments; service-level agreements as they arise in infrastructure and networking services; and services viewed from the perspective of real-life engagements. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-17358-5_76 UR - https://publons.com/publon/21294445/ ER - TY - BOOK TI - Requirements as goals and commitments too AU - Chopra, A.K. AU - Mylopoulos, J. AU - Dalpiaz, F. AU - Giorgini, P. AU - Singh, M.P. AB - In traditional software engineering research and practice, requirements are classified either as functional or non-functional. Functional requirements consist of all functions the system-to-be ought to support, and have been modeled in terms of box-and-arrow diagrams in the spirit of SADT. Non-functional requirements include desired software qualities for the system-to-be and have been described either in natural language or in terms of metrics. This orthodoxy was challenged in the mid-90 s by a host of proposals that had a common theme: all requirements are initially stakeholder goals and ought to be elicited, modeled and analyzed as such. Through systematic processes, these goals can be refined into specifications of functions the system-to-be needs to deliver, while actions assigned to external actors need to be executed. This view is dominating Requirements Engineering (RE) research and is beginning to have an impact on RE practice. We propose a next step along this line of research, by adopting the concept of conditional commitment as companion concept to that of goal. Goals are intentional entities that capture the needs and wants of stakeholders. Commitments, on the other hand, are social concepts that define the willingness and capability of an actor A to fulfill a predicate ϕ for the benefit of actor B, provided B (in return) fulfills predicate ψ for the benefit of actor A. In our conceptualization, goals are mapped to collections of commitments rather than functions, qualities, or actor assignments. We motivate the importance of the concept of commitment for RE through examples and discussion. We also contrast our proposal with state-of-the-art requirements modeling and analysis frameworks, such as KAOS, MAP, i * and Tropos. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-12544-7_8 SE - 137-153 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84880532675&partnerID=MN8TOARS ER - TY - BOOK TI - Programming multiagent systems without programming agents AU - Singh, M.P. AU - Chopra, A.K. AB - We consider the programming of multiagent systems from an architectural perspective. Our perspective emphasizes the autonomy and heterogeneity of agents, the components of multiagent systems, and focuses on how to specify their interconnections in terms of high-level protocols. In this manner, we show how to treat the programming of a multiagent system as an architectural endeavor, leaving aside the programming of individual agents who might feature in a multiagent system as a secondary concern. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-14843-9_1 VL - 5919 LNAI SE - 1-14 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78649853140&partnerID=MN8TOARS ER - TY - CONF TI - Governance of services: A natural function for agents AU - Brazier, F.M. AU - Dignum, F. AU - Dignum, V. AU - Huhns, M.H. AU - Lessner, T. AU - Padget, J. AU - Quillinan, T. AU - Singh, M.P. C2 - 2010/// C3 - Belgian/Netherlands Artificial Intelligence Conference DA - 2010/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84873828353&partnerID=MN8TOARS ER - TY - BOOK TI - From quality to utility: Adaptive service selection framework AU - Hang, C.-W. AU - Singh, M.P. AB - We consider an approach to service selection wherein service consumers choose services with desired nonfunctional properties to maximize their utility. A consumer’s utility from using a service clearly depends upon the qualities offered by the service. Many existing service selection approaches support agents estimating trustworthiness of services based on their quality of service. However, existing approaches do not emphasize the relationship between a consumer’s interests and the utility the consumer draws from a service. Further, they do not properly support consumers being able to compose services with desired quality (and utility) profiles.We propose an adaptive service selection framework that offers three major benefits. First, our approach enables consumers to select services based on their individual utility functions, which reflect their preferences, and learn the providers’ quality distributions. Second, our approach guides consumers to construct service compositions that satisfy their quality requirements. Third, an extension of our approach with contracts approximates Pareto optimality without the use of a market mechanism. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-17358-5_31 VL - 6470 LNCS SE - 456-470 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78650799447&partnerID=MN8TOARS ER - TY - CHAP TI - Elements of a Business-Level Architecture for Multiagent Systems AU - Chopra, Amit K. AU - Singh, Munindar P. T2 - Lecture Notes in Computer Science AB - Existing architectures for multiagent systems emphasize low-level messaging-related considerations. As a result, the programming abstractions they provide are also low level. In recent years, commitments have been applied to support flexible interactions among autonomous agents. We present a layered multiagent system architecture based on commitments. In this architecture, agents are the components, and the interconnections between the agents are specified in terms of commitments, thus abstracting away from low level details. A crucial layer in this architecture is a commitment-based middleware that plays a vital role in ensuring interoperation and provides commitment-related abstractions to the application programmer. Interoperation itself is defined in terms of commitment alignment. This paper details various aspects of this architecture, and shows how a programmer would write applications to such an architecture. PY - 2010/// DO - 10.1007/978-3-642-14843-9_2 VL - 5919 LNAI SP - 15-30 OP - PB - Springer Berlin Heidelberg SN - 9783642148422 9783642148439 UR - http://dx.doi.org/10.1007/978-3-642-14843-9_2 DB - Crossref ER - TY - BOOK TI - Information sharing among autonomous agents in referral networks AU - Udupi, Y.B. AU - Singh, M.P. AB - Referral networks are a kind of P2P system consisting of autonomous agents who seek and provide services, or refer other service providers. Key applications include service discovery and selection, and knowledge sharing. An agent seeking a service contacts other agents to discover suitable service providers. An agent who is contacted may autonomously ignore the request or respond by providing the desired service or giving a referral. This use of referrals is inspired by human interactions, where referrals are a key basis for judging the trustworthiness of a given service. The use of referrals differentiates such networks from traditional P2P information sharing systems, which are based on request flooding. Not only does the use of referrals enable an agent to control how its request is processed, it also provides an architectural basis for four kinds of interaction policies. InterPol is a language and framework supporting such policies. InterPol provides an ability to specify requests with hard and soft constraints as well as a vocabulary of application-independent terms based on interaction concepts. Using these, InterPol enables agents to reveal private information and accept others’ information based on subtle relationships. In this manner, InterPol goes beyond traditional referral and other P2P systems in supporting practical applications. InterPol has been implemented using a Datalog-based policy engine for each agent. It has been applied on scenarios from a (multinational) health care project. The contribution of this paper is in a general referrals-based architecture for information sharing among autonomous agents, which is shown to effectively capture a variety of privacy and trust requirements of autonomous users. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-11368-0_2 VL - 5319 LNAI SE - 13-26 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-76249097437&partnerID=MN8TOARS ER - TY - BOOK TI - Incorporating expectations as a basis for business service selection AU - ElMessiry, A.M. AU - Gao, X. AU - Singh, M.P. AB - The collaborative creation of value is the central tenet of services science. In particular, then, the quality of a service encounter would depend on the mutual expectations of the participants. Specifically, the quality of experience that a consumer derives from a service encounter would depend on how the consumer’s expectations are refined and how well they are met by the provider during the encounter. We postulate that incorporating expectations ought therefore be a crucial element of business service selection. Unfortunately, today’s technical approaches to service selection disregard the above. They emphasize reputation measured via numeric ratings that consumers provide about service providers. Such ratings are easy to process computationally, but beg the question as to what the raters’ frames of reference, i.e., expectations. When the frames of reference are not modeled, the resulting reputation scores are often not sufficiently predictive of a consumer’s satisfaction. We investigate the notion of expectations from a computational perspective. We claim that (1) expectations, despite being subjective, are a well-formed, reliably computable notion and (2) we can compute expectations and use them as a basis for improving the effectiveness of service selection. Our approach is as follows. First, we mine textual assessments of service encounters given by consumers to build a model of each consumer’s expectations along with a model of each provider’s ability to satisfy such expectations. Second, we apply expectations to predict a consumer’s satisfaction for engaging a particular provider. We validate our claims based on real data obtained from eBay. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-17358-5_33 VL - 6470 LNCS SE - 486-500 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78650792928&partnerID=MN8TOARS ER - TY - BOOK TI - Correctness properties for multiagent systems AU - Singh, M.P. AU - Chopra, A.K. DA - 2010/// PY - 2010/// DO - 10.1007/978-3-642-11355-0_12 VL - 5948 LNAI SE - 192-207 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77949868106&partnerID=MN8TOARS ER - TY - CHAP TI - Abstracting and Applying Business Modeling Patterns from RosettaNet AU - Telang, Pankaj R. AU - Singh, Munindar P. T2 - Service-Oriented Computing AB - RosettaNet is a leading industry effort that creates standards for business interactions among the participants in a supply chain. The RosettaNet standard defines over 100 Partner Interface Processes (PIPs) through which the participants can exchange business documents necessary to enact a supply chain. However, each PIP specifies the business interactions at a syntactic level, but fails to capture the business meaning of the interactions to which they apply. In contrast, this paper takes as its point of departure a commitment-based approach for business modeling that gives central position to interactions captured in terms of their meaning. This paper defines commitment-based business patterns abstracted from RosettaNet PIPs. Doing so yields models that are clearer, more flexible to changing requirements, and potentially enacted through multiple operationalizations. This paper validates the patterns by applying them to model the Order-to-Cash business process from the RosettaNet eBusiness Process Scenario Library. PY - 2010/// DO - 10.1007/978-3-642-17358-5_29 VL - 6470 LNCS SP - 426-440 OP - PB - Springer Berlin Heidelberg SN - 9783642173578 9783642173585 UR - http://dx.doi.org/10.1007/978-3-642-17358-5_29 DB - Crossref ER - TY - RPRT TI - Bottleneck crossing minimization in layered graphs AU - Stallmann, Matthias F AU - Gupta, Saurabh A3 - Dept of Computer Science, North Carolina State University DA - 2010/// PY - 2010/// M1 - TR-2010-13 PB - Dept of Computer Science, North Carolina State University SN - TR-2010-13 ER - TY - RPRT TI - High-contrast algorithm behavior: Observation, conjecture, and experimental design AU - Stallmann, Matthias F AU - Brglez, Franc A3 - North Carolina State University. Dept. of Computer Science DA - 2010/// PY - 2010/// PB - North Carolina State University. Dept. of Computer Science ER - TY - CONF TI - Towards knowledge assisted agile requirements evolution AU - Kumar, Manish AU - Ajmeri, Nirav AU - Ghaisas, Smita A2 - Holmes, Reid A2 - Robillard, Martin P. A2 - Walker, Robert J. A2 - Zimmermann, Thomas AB - This paper presents work on a recommendation system for Knowledge assisted Agile Requirements Evolution (K-gileRE). We treat requirements engineering as a special case of knowledge engineering and emphasize the fact that providing a domain knowledge edge can impart agility to the requirements definition exercise. The approach differs from existing agile methods in that it seamlessly incorporates a domain knowledge base into an agile requirements definition framework and explicitly provides to requirement analysts, relevant online domain specific recommendations based on underlying ontologies. The framework presents a 'domain knowledge seed' to requirement analysts. The seed provides a view of core features in a given domain and associated knowledge elements such as business processes, rules, policies, partial data models, use cases and test cases,. These in turn are mapped with agile requirements elements such as user stories, features, tasks, product backlog, sprints and prototype plans. The requirement analyst can evolve the seed to suit her specific project needs. As she modifies and evolves the seed specification, she receives domain-specific online recommendations to improve the correctness, consistency and completeness of her requirement specification documents and executable models. Using the domain knowledge seed as a point of departure provides a jump-start to her project. Each exercise of requirements definition thus becomes an evolution from the seed instead of the traditional 'clean slate' Requirements Engineering (RE) that typically starts from the scratch. Hence, the term K-gileRE. We elaborate how K-gileRE helps in practicing the essence of agile doctrines while defining software requirements by providing just-in-time recommendations. C2 - 2010/// C3 - Proceedings - International Conference on Software Engineering CY - United States DA - 2010/// DO - 10.1145/1808920.1808924 SP - 16-20 PB - Association for Computing Machinery (ACM) UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77954974537&partnerID=MN8TOARS ER - TY - CONF TI - A semantic and collaborative platform for agile requirements evolution AU - Ajmeri, Nirav AU - Sejpal, Riddhima AU - Ghaisas, Smita AB - The characteristics of web-based and community-oriented social software are very useful in the context of software engineering in general and requirements engineering in particular. Their ease of use, transparency of communication, user orientation, self organization and emergent nature resulting from a continual social feedback are particularly relevant to an agile requirements definition exercise. The reason is that agile requirements are inherently meant to be collaboration-intensive. However, while the benefits of social platforms are valuable, they are necessary and not sufficient in themselves for making the exercise effective. The emerging social software engineering discipline is about enabling community-driven creation, management and deployment of software by applying methods, processes and tools in online environments. In this paper, we report our work on a semantic and collaborative platform that combines the virtues of social software principles and the semantic web concepts to enable knowledge-assisted agile requirements definition. C2 - 2010/// C3 - 2010 3rd International Workshop on Managing Requirements Knowledge, MaRK'10 DA - 2010/// DO - 10.1109/MARK.2010.5623810 SP - 32-40 PB - IEEE UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78650508595&partnerID=MN8TOARS ER - TY - CONF TI - Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method AU - Hutton, Sharon AU - Kaltofen, Erich L. AU - Zhi, Lihong T2 - the 2010 International Symposium AB - We give a stability criterion for real polynomial inequalities with floating point or inexact scalars by estimating from below or computing the radius of semidefiniteness. That radius is the maximum deformation of the polynomial coefficient vector measured in a weighted Euclidean vector norm within which the inequality remains true. A large radius means that the inequalities may be considered numerically valid. C2 - 2010/// C3 - Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation - ISSAC '10 DA - 2010/// DO - 10.1145/1837934.1837979 PB - ACM Press SN - 9781450301503 UR - http://dx.doi.org/10.1145/1837934.1837979 DB - Crossref ER - TY - CONF TI - Fifteen years after DSC and WLSS2 what parallel computations I do today AU - Kaltofen, Erich L. T2 - the 4th International Workshop AB - A second wave of parallel and distributed computing research is rolling in. Today's multicore/multiprocessor computers facilitate everyone's parallel execution. In the mid 1990s, manufactures of expensive main-frame parallel computers faltered and computer science focused on the Internet and the computing grid. After a ten year hiatus, the Parallel Symbolic Computation Conference (PASCO) is awakening with new vigor. C2 - 2010/// C3 - Proceedings of the 4th International Workshop on Parallel and Symbolic Computation - PASCO '10 DA - 2010/// DO - 10.1145/1837210.1837213 PB - ACM Press SN - 9781450300674 UR - http://dx.doi.org/10.1145/1837210.1837213 DB - Crossref ER - TY - CONF TI - Automated metareviewing AU - Ramachandran, Lakshmi AU - Gehringer, Edward F. T2 - Intelligent Tutoring Systems 2010: Workshop on Computer-Supported Peer Review in Education C2 - 2010/// C3 - Proceedings of Intelligent Tutoring Systems 2010: Workshop on Computer-Supported Peer Review in Education CY - Pittsburgh, PA DA - 2010/// PY - 2010/6/14/ ER - TY - CONF TI - Software support for peer-reviewing wiki textbooks and other large projects AU - Gehringer, Edward F. AU - Kadanjoth, Reejesh AU - Kidd, Jennifer T2 - Intelligent Tutoring Systems 2010: Workshop on Computer-Supported Peer Review in Education C2 - 2010/// C3 - Proceedings of Intelligent Tutoring Systems 2010: Workshop on Computer-Supported Peer Review in Education CY - Pittsburgh, PA DA - 2010/// PY - 2010/6/14/ ER - TY - CHAP TI - Expertiza AU - Gehringer, Edward F. T2 - Monitoring and Assessment in Online Collaborative Environments AB - Educators and accrediting agencies demonstrate a growing awareness that students learn better when they work in groups, and on projects that are more similar to those encountered on the job, where their contributions are used by others to add value to the operations of the enterprise. However, it is very time consuming to assess project work; the only scalable way to accomplish this is to have students assist in the assessment. Expertiza is a system for managing all kinds of communication that is involved in assessment: double-blind communications between authors and reviewers, assessment of teammate contributions, evaluations by course staff, and surveys of students to assess the assignment and the peer-review process. This chapter places Expertiza in context among other electronic peer-review systems, algorithms, and methodologies. It relates the results of three experiments showing that through the peer-review process, students are capable of producing work that can be used as teaching materials in later classes. PY - 2010/// DO - 10.4018/978-1-60566-786-7.ch005 SP - 75-96 OP - PB - IGI Global SN - 9781605667867 9781605667874 UR - http://dx.doi.org/10.4018/978-1-60566-786-7.ch005 DB - Crossref ER - TY - CONF TI - Software support for writing wiki textbooks AU - Gehringer, Edward F. AU - Kadanjoth, Reejesh AU - Kidd, Jennifer T2 - 2010 IEEE Frontiers in Education Conference (FIE) AB - Emerging information technologies are enabling new forms of content delivery. Recent research shows that students are capable of writing a peer-reviewed textbook for their own course. The pedagogical advantages are numerous. Peer review is essential for managing the process in a timely matter. There are many administrative tasks, e.g., assigning topics, assigning reviewers, getting feedback to authors, calculating grades. Performing them without a specialized software system is a big burden on the course staff. The Expertiza project is building a software system to manage creation and peer review of a wiki textbook, automating features such as double-blind feedback between author and reviewer, and support for flow management to allow different chapters of the text to be written and reviewed at different times during the course. It promises to bring wiki textbook-writing to a much wider audience. C2 - 2010/10// C3 - 2010 IEEE Frontiers in Education Conference (FIE) DA - 2010/10// DO - 10.1109/fie.2010.5673120 PB - IEEE SN - 9781424462612 UR - http://dx.doi.org/10.1109/fie.2010.5673120 DB - Crossref ER - TY - JOUR TI - Annie: Automated Generation of Adaptive Learner Guidance for Fun Serious Games AU - Thomas, J M AU - Young, R M T2 - IEEE Transactions on Learning Technologies AB - This paper describes some of the difficulties inherent in building intelligent educational games, specifically the challenge of integrating pedagogy with core game play. We introduce a plan-based knowledge representation that provides a novel framework for infusing the core mechanics of a game with pedagogical content. We describe, in detail, a system that leverages this framework to dynamically adapt a game to individual learners at runtime. DA - 2010/10// PY - 2010/10// DO - 10.1109/tlt.2010.32 VL - 3 IS - 4 SP - 329-343 J2 - IEEE Trans. Learning Technol. OP - SN - 1939-1382 UR - http://dx.doi.org/10.1109/tlt.2010.32 DB - Crossref KW - Artificial intelligence KW - intelligent tutoring KW - plan generation KW - games KW - computer-managed instruction ER - TY - CONF TI - Programming multiagent systems without programming agents AU - Singh, M. P. AU - Chopra, A. K. C2 - 2010/// C3 - Programming multi-agent systems DA - 2010/// VL - 5919 SP - 1-14 ER - TY - JOUR TI - 3D FACE RECOGNITION BASED ON EVOLUTION OF ISO-GEODESIC DISTANCE CURVES AU - Miao, Shun AU - Krim, Hamid T2 - 2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING AB - This paper presents a novel 3D face recognition method by means of the evolution of iso-geodesic distance curves. Specifically, the proposed method compares two neighboring iso-geodesic distance curves, and formalizes the evolution between them as a one-dimensional function, named evolution angle function, which is Euclidean invariant. The novelty of this paper consists in formalizing 3D face by an evolution angle functions, and in computing the distance between two faces by that of two functions. Experiments on Face Recognition Grand Challenge (FRGC) ver2.0 shows that our approach works very well on both neutral faces and non-neutral faces. By introducing a weight function, we also show a very promising result on non-neutral face database. DA - 2010/// PY - 2010/// DO - 10.1109/icassp.2010.5495363 SP - 1134-1137 SN - 1520-6149 KW - Face recognition KW - Geometric modeling KW - Image registration KW - Pattern classification ER - TY - CONF TI - Using centrality-based power control for hot-spot mitigation in wireless networks AU - Pathak, P. H. AU - Dutta, Rudra AB - When shortest path routing is employed in large scale multi-hop wireless networks, nodes located near the center of the network have to perform disproportionate amount of relaying for others. To solve the problem, various divergent routing schemes are used which route the data on center-avoiding divergent routing paths. Though they achieve better load balancing, overall relaying is increased significantly due to their longer routing paths. In this paper, we propose power control as a way for balancing relay load and mitigating hot-spots in wireless networks. Using a heuristic based on the concept of centrality, we show that if we increase the power levels of only the nodes which are expected to relay more packets, significant relay load balancing can be achieved even with shortest path routing. Different from divergent routing schemes, such load balancing strategy is applicable to any arbitrary topology. Also, it is shown that centrality based power control results into better throughput capacity in many different topologies. C2 - 2010/// C3 - 2010 ieee global telecommunications conference globecom 2010 DA - 2010/// DO - 10.1109/glocom.2010.5683097 ER - TY - CONF TI - Randomized differential DSSS: Jamming-resistant wireless broadcast communication AU - Liu, Y. AU - Ning, P. AU - Dai, H. Y. AU - Liu, A. AB - Jamming resistance is crucial for applications where reliable wireless communication is required. Spread spectrum techniques such as Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS) have been used as countermeasures against jamming attacks. Traditional anti-jamming techniques require that senders and receivers share a secret key in order to communicate with each other. However, such a requirement prevents these techniques from being effective for anti-jamming broadcast communication, where a jammer may learn the shared key from a compromised or malicious receiver and disrupt the reception at normal receivers. In this paper, we propose a Randomized Differential DSSS (RD-DSSS) scheme to achieve anti-jamming broadcast communication without shared keys. RD-DSSS encodes each bit of data using the correlation of unpredictable spreading codes. Specifically, bit ``0'' is encoded using two different spreading codes, which have low correlation with each other, while bit ``1'' is encoded using two identical spreading codes, which have high correlation. To defeat reactive jamming attacks, RD-DSSS uses multiple spreading code sequences to spread each message and rearranges the spread output before transmitting it. Our theoretical analysis and simulation results show that RD-DSSS can effectively defeat jamming attacks for anti-jamming broadcast communication without shared keys. C2 - 2010/// C3 - 2010 proceedings ieee infocom DA - 2010/// DO - 10.1109/infcom.2010.5462156 ER - TY - JOUR TI - Assessment of air quality benefits from national air pollution control policies in China. Part I: Background, emission scenarios and evaluation of meteorological predictions AU - Wang, Litao AU - Jang, Carey AU - Zhang, Yang AU - Wang, Kai AU - Zhang, Qiang AU - Streets, David AU - Fu, Joshua AU - Lei, Yu AU - Schreifels, Jeremy AU - He, Kebin AU - Hao, Jiming AU - Lam, Yun-Fat AU - Lin, Jerry AU - Meskhidze, Nicholas AU - Voorhees, Scott AU - Evarts, Dale AU - Phillips, Sharon T2 - ATMOSPHERIC ENVIRONMENT AB - Under the 11th Five Year Plan (FYP, 2006–2010) for national environmental protection by the Chinese government, the overarching goal for sulfur dioxide (SO2) controls is to achieve a total national emissions level of SO2 in 2010 10% lower than the level in 2005. A similar nitrogen oxides (NOx) emissions control plan is currently under development and could be enforced during the 12th FYP (2011–2015). In this study, the U.S. Environmental Protection Agency (U.S.EPA)’s Community Multi-Scale Air Quality (Models-3/CMAQ) modeling system was applied to assess the air quality improvement that would result from the targeted SO2 and NOx emission controls in China. Four emission scenarios — the base year 2005, the 2010 Business-As-Usual (BAU) scenario, the 2010 SO2 control scenario, and the 2010 NOx control scenario—were constructed and simulated to assess the air quality change from the national control plan. The Fifth-Generation NCAR/Penn State Mesoscale Model (MM5) was applied to generate the meteorological fields for the CMAQ simulations. In this Part I paper, the model performance for the simulated meteorology was evaluated against observations for the base case in terms of temperature, wind speed, wind direction, and precipitation. It is shown that MM5 model gives an overall good performance for these meteorological variables. The generated meteorological fields are acceptable for using in the CMAQ modeling. DA - 2010/9// PY - 2010/9// DO - 10.1016/j.atmosenv.2010.05.051 VL - 44 IS - 28 SP - 3442-3448 SN - 1873-2844 KW - Air pollution in China KW - Air quality modeling KW - Emission control KW - MM5/CMAQ KW - 11th FYP ER - TY - CONF TI - Multidisciplinary views of business contracts AU - Singh, M. P. AU - Desai, N. C2 - 2010/// C3 - Service-oriented computing DA - 2010/// VL - 6470 SP - 730-730 ER - TY - CONF TI - Incorporating expectations as a basis for business service selection AU - ElMessiry, A. M. AU - Gao, X. B. AU - Singh, M. P. C2 - 2010/// C3 - Service-oriented computing DA - 2010/// VL - 6470 SP - 486-500 ER - TY - CONF TI - From quality to utility: Adaptive service selection framework AU - Hang, C. W. AU - Singh, M. P. C2 - 2010/// C3 - Service-oriented computing DA - 2010/// VL - 6470 SP - 456-470 ER - TY - CONF TI - Detecting and Tracking Community Dynamics in Evolutionary Networks AU - Chen, Z AU - Wilson, K.A. AU - Jin, Y. AU - Samatova, N.F. AB - Community structure or clustering is ubiquitous in many evolutionary networks including social networks, biological networks and financial market networks. Detecting and tracking community deviations in evolutionary networks can uncover important and interesting behaviors that are latent if we ignore the dynamic information. In biological networks, for example, a small variation in a gene community may indicate an event, such as gene fusion, gene fission, or gene decay. In contrast to the previous work on detecting communities in static graphs or tracking conserved communities in time-varying graphs, this paper first introduces the concept of community dynamics, and then shows that the baseline approach by enumerating all communities in each graph and comparing all pairs of communities between consecutive graphs is infeasible and impractical. We propose an efficient method for detecting and tracking community dynamics in evolutionary networks by introducing graph representatives and community representatives to avoid generating redundant communities and limit the search space. We measure the performance of the representative-based algorithm by comparison to the baseline algorithm on synthetic networks, and our experiments show that our algorithm achieves a runtime speedup of 11-46. The method has also been applied to two real-world evolutionary networks including Food Web and Enron Email. Significant and informative community dynamics have been detected in both cases. C2 - 2010/// C3 - The 10th IEEE International Conference on Data Mining Workshops DA - 2010/// DO - 10.1109/icdmw.2010.32 SP - 318-327 PB - Los Alamitos, Calif. : IEEE Computer Society ER - TY - CONF TI - Simplified self-adapting skip lists AU - Pittard, J. J. AU - Tharp, A. L. AB - The Simplified Self-Adapting Skip List, a practical new extension of the Skip List data structure, is designed for use with data that exhibit bias, that is, a nonuniform distribution of queries to set elements. The structure observes an initially unknown degree of bias in queries to a data set and adapts itself to a consistently nearly-optimal configuration, improving search efficiency and speed. By modifying the original Skip List design in intuitive ways, self-optimization is achieved while maintaining an extreme simplicity of description, implementation, and operation unmatched by previous dynamic Skip Lists. The additional memory, time, and conceptual overheads introduced by this structure over the original Skip List are considerably less than in previous dynamic designs, but search speed is comparable or superior, making the SSASL better suited than its predecessors for operations in which time or memory efficiency is critical. C2 - 2010/// C3 - Intelligent data engineering and automated learning - ideal 2010 DA - 2010/// DO - 10.1007/978-3-642-15381-5_16 VL - 6283 SP - 126-136 ER - TY - CONF TI - SIP overload control: A backpressure-based approach AU - Wang, Y. G. C2 - 2010/// C3 - Computer Communication Review DA - 2010/// VL - 40 SP - 399-400 M1 - 4 ER - TY - JOUR TI - QoS Control for NGN: A Survey of Techniques AU - Yun, Changho AU - Perros, Harry T2 - JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT DA - 2010/12// PY - 2010/12// DO - 10.1007/s10922-010-9157-x VL - 18 IS - 4 SP - 447-461 SN - 1064-7570 KW - IMS KW - NGN KW - QoS control KW - RACF KW - RACS KW - Service ER - TY - CONF TI - Mobile data offloading: How much can WiFi deliver? AU - Lee, K. AU - Rhee, I. AU - Lee, J. AU - Yi, Y. AU - Chong, S. C2 - 2010/// C3 - Computer Communication Review DA - 2010/// VL - 40 SP - 425-426 M1 - 4 ER - TY - JOUR TI - Efficiently Certifying Non-Integer Powers AU - Kaltofen, Erich AU - Lavin, Mark T2 - COMPUTATIONAL COMPLEXITY DA - 2010/9// PY - 2010/9// DO - 10.1007/s00037-010-0297-x VL - 19 IS - 3 SP - 355-366 SN - 1420-8954 KW - Integer roots KW - integer powers KW - linear-time algorithm KW - bit complexity KW - Chebotarev density theorem ER - TY - CONF TI - Contrabass: Concurrent transmissions without coordination AU - Yoon, S. R. C2 - 2010/// C3 - Computer Communication Review DA - 2010/// VL - 40 SP - 403-404 M1 - 4 ER - TY - JOUR TI - Global optimization by adapted diffusion AU - Poliannikov, O. V. AU - Zhizhina, E. AU - Krim, H. T2 - IEEE Transactions on Signal Processing AB - In this paper, we study a diffusion stochastic dynamics with a general diffusion coefficient. The main result is that adapting the diffusion coefficient to the Hamiltonian allows to escape local wide minima and to speed up the convergence of the dynamics to the global minima. We prove the convergence of the invariant measure of the modified dynamics to a measure concentrated on the set of global minima and show how to choose a diffusion coefficient for a certain class of Hamiltonians. DA - 2010/// PY - 2010/// DO - 10.1109/tsp.2010.2071867 VL - 58 IS - 12 SP - 6119-6125 ER - TY - JOUR TI - Feedback-directed page placement for ccNUMA via hardware-generated memory traces AU - Marathe, Jaydeep AU - Thakkar, Vivek AU - Mueller, Frank T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of multi-core architectures. Under ccNUMA, data placement may influence overall application performance significantly as references resolved locally to a processor/core impose lower latencies than remote ones. This work develops a novel hardware-assisted page placement paradigm based on automated tracing of the memory references made by application threads. Two placement schemes, modeling both single-level and multi-level latencies, allocate pages near processors that most frequently access that memory page. These schemes leverage performance monitoring capabilities of contemporary microprocessors to efficiently extract an approximate trace of memory accesses. This information is used to decide page affinity, i.e., the node to which the page is bound. The method operates entirely in user space, is widely automated, and handles not only static but also dynamic memory allocation. Experiments show that this method, although based on lossy tracing, can efficiently and effectively improve page placement, leading to an average wall-clock execution time saving of over 20% for the tested benchmarks on the SGI Altix with a 2x remote access penalty and 12% on AMD Opterons with a 1.3–2.0x access penalty. This is accompanied by a one-time tracing overhead of 2.7% over the overall original program wallclock time. DA - 2010/12// PY - 2010/12// DO - 10.1016/j.jpdc.2010.08.015 VL - 70 IS - 12 SP - 1204-1219 SN - 1096-0848 KW - Hardware performance monitoring KW - NUMA KW - Trace guided optimization KW - Page placement ER - TY - JOUR TI - Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks AU - Chen, Bensong AU - Rouskas, George N. AU - Dutta, Rudra T2 - JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING AB - We consider a hierarchical approach for traffic grooming in large multiwavelength networks of a general topology. Inspired by similar concepts in the airline industry, we decompose the network into clusters, and select a hub node in each cluster to groom traffic originating and terminating locally. At the second level of the hierarchy, the hub nodes form a virtual cluster for the purpose of grooming intra-cluster traffic. Clustering and hierarchical grooming enables us to cope with large network sizes and facilitates the control and management of traffic and network resources. Yet, determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired trade-off among various goals. We also obtain lower bounds on two important objectives in traffic grooming: the number of lightpaths and wavelengths needed to carry the subwavelength traffic. We demonstrate the effectiveness of clustering and hierarchical grooming by presenting the results of experiments on two network topologies that are substantially larger than those considered in previous traffic grooming studies. DA - 2010/8/1/ PY - 2010/8/1/ DO - 10.1364/jocn.2.000502 VL - 2 IS - 8 SP - 502-514 SN - 1943-0639 KW - Optical networking KW - Traffic grooming KW - Network design KW - Resource provisioning KW - Hierarchical grooming KW - Routing KW - Control plane algorithms KW - Large networks ER - TY - CONF TI - hypersafe: A lightweight approach to provide lifetime hypervisor control-flow integrity AU - Wang, Z. AU - Jiang, X. X. C2 - 2010/// C3 - 2010 IEEE symposium on security and privacy DA - 2010/// SP - 380-395 ER - TY - JOUR TI - Tightening the Bounds on Feasible Preemptions AU - Ramaprasad, Harini AU - Mueller, Frank T2 - ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS AB - Data caches are an increasingly important architectural feature in most modern computer systems. They help bridge the gap between processor speeds and memory access times. One inherent difficulty of using data caches in a real-time system is the unpredictability of memory accesses, which makes it difficult to calculate worst-case execution times (WCETs) of real-time tasks. While cache analysis for single real-time tasks has been the focus of much research in the past, bounding the preemption delay in a multitask preemptive environment is a challenging problem, particularly for data caches. This article makes multiple contributions in the context of independent, periodic tasks with deadlines less than or equal to their periods executing on a single processor. 1) For every task, we derive data cache reference patterns for all scalar and nonscalar references. These patterns are used to derive an upper bound on the WCET of real-time tasks. 2) We show that, when considering cache preemption effects, the critical instant does not occur upon simultaneous release of all tasks. We provide results for task sets with phase differences to prove our claim. 3) We develop a method to calculate tight upper bounds on the maximum number of possible preemptions for each job of a task and, considering the worst-case placement of these preemption points, derive a much tighter bound on its WCET. We provide results using both static-and dynamic-priority schemes. Our results show significant improvements in the bounds derived. We achieve up to an order of magnitude improvement over two prior methods and up to half an order of magnitude over a third prior method for the number of preemptions , the WCET and the response time of a task. Consideration of the best-case and worst-case execution times of higher-priority jobs enables these improvements. DA - 2010/12// PY - 2010/12// DO - 10.1145/1880050.1880063 VL - 10 IS - 2 SP - SN - 1558-3465 KW - Algorithms KW - Experimentation KW - Real-time systems KW - preemptions KW - worst-case execution time KW - timing analysis KW - data caches KW - cache-related preemption delay ER - TY - JOUR TI - Parametric Timing Analysis and Its Application to Dynamic Voltage Scaling AU - Mohan, Sibin AU - Mueller, Frank AU - Root, Michael AU - Hawkins, William AU - Healy, Christopher AU - Whalley, David AU - Vivancos, Emilio T2 - ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS AB - Embedded systems with real-time constraints depend on a priori knowledge of worst-case execution times (WCETs) to determine if tasks meet deadlines. Static timing analysis derives bounds on WCETs but requires statically known loop bounds. This work removes the constraint on known loop bounds through parametric analysis expressing WCETs as functions. Tighter WCETs are dynamically discovered to exploit slack by dynamic voltage scaling (DVS) saving 60% to 82% energy over DVS-oblivious techniques and showing savings close to more costly dynamic-priority DVS algorithms. Overall, parametric analysis expands the class of real-time applications to programs with loop-invariant dynamic loop bounds while retaining tight WCET bounds. DA - 2010/12// PY - 2010/12// DO - 10.1145/1880050.1880061 VL - 10 IS - 2 SP - SN - 1558-3465 KW - Algorithms KW - Experimentation KW - Real-time systems KW - worst-case execution time KW - timing analysis KW - dynamic voltage scaling ER - TY - JOUR TI - Authenticating Primary Users' Signals in Cognitive Radio Networks via Integrated Cryptographic and Wireless Link Signatures AU - Liu, Yao AU - Ning, Peng AU - Dai, Huaiyu T2 - 2010 IEEE SYMPOSIUM ON SECURITY AND PRIVACY AB - To address the increasing demand for wireless bandwidth, cognitive radio networks (CRNs) have been proposed to increase the efficiency of channel utilization; they enable the sharing of channels among secondary (unlicensed) and primary (licensed) users on a non-interference basis. A secondary user in a CRN should constantly monitor for the presence of a primary user's signal to avoid interfering with the primary user. However, to gain unfair share of radio channels, an attacker (e.g., a selfish secondary user) may mimic a primary user's signal to evict other secondary users. Therefore, a secure primary user detection method that can distinguish a primary user's signal from an attacker's signal is needed. A unique challenge in addressing this problem is that Federal Communications Commission (FCC) prohibits any modification to primary users. Consequently, existing cryptographic techniques cannot be used directly. In this paper, we develop a novel approach for authenticating primary users' signals in CRNs, which conforms to FCC's requirement. Our approach integrates cryptographic signatures and wireless link signatures (derived from physical radio channel characteristics) to enable primary user detection in the presence of attackers. Essential to our approach is a {\em helper node} placed physically close to a primary user. The helper node serves as a "bridge" to enable a secondary user to verify cryptographic signatures carried by the helper node's signals and then obtain the helper node's authentic link signatures to verify the primary user's signals. A key contribution in our paper is a novel physical layer authentication technique that enables the helper node to authenticate signals from its associated primary user. Unlike previous techniques for link signatures, our approach explores the geographical proximity of the helper node to the primary user, and thus does not require any training process. DA - 2010/// PY - 2010/// DO - 10.1109/sp.2010.24 SP - 286-301 SN - 1081-6011 KW - cognitive radio networks KW - primary user detection KW - link signatures ER - TY - JOUR TI - Adaptive System Anomaly Prediction for Large-Scale Hosting Infrastructures AU - Tan, Yongmin AU - Gu, Xiaohui AU - Wang, Haixun T2 - PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING AB - Large-scale hosting infrastructures require automatic system anomaly management to achieve continuous system operation. In this paper, we present a novel adaptive runtime anomaly prediction system, called ALERT, to achieve robust hosting infrastructures. In contrast to traditional anomaly detection schemes, ALERT aims at raising advance anomaly alerts to achieve just-in-time anomaly prevention. We propose a novel context-aware anomaly prediction scheme to improve prediction accuracy in dynamic hosting infrastructures. We have implemented the ALERT system and deployed it on several production hosting infrastructures such as IBM System S stream processing cluster and PlanetLab. Our experiments show that ALERT can achieve high prediction accuracy for a range of system anomalies and impose low overhead to the hosting infrastructure. DA - 2010/// PY - 2010/// DO - 10.1145/1835698.1835741 SP - 173-182 KW - Anomaly Prediction KW - Context-aware Prediction Model ER - TY - JOUR TI - A new framework for GLIF Interdomain Resource Reservation Architecture (GIRRA) AU - Karmous-Edwards, Gigi AU - Polito, Silvana Greco AU - Jukan, Admela AU - Rouskas, George T2 - ANNALS OF TELECOMMUNICATIONS DA - 2010/// PY - 2010/// DO - 10.1007/s12243-010-0186-y VL - 65 IS - 11-12 SP - 723-737 SN - 1958-9395 KW - Inter-domain networking KW - Security KW - Path computation KW - GLIF KW - Middleware ER - TY - CONF TI - A fault-tolerance architecture for kepler-based distributed scientific workflows AU - Mouallem, P. AU - Crawl, D. AU - Altintas, I. AU - Vouk, M. AU - Yildiz, U. C2 - 2010/// C3 - Scientific and statistical database management DA - 2010/// VL - 6187 SP - 452-460 ER - TY - JOUR TI - Toward a Visualization of DNA Sequences AU - Cox, David N. AU - Tharp, Alan L. T2 - ADVANCES IN COMPUTATIONAL BIOLOGY AB - Most biologists associate pattern discovery in DNA with finding repetitive sequences or commonalities across several sequences. However, pattern discovery is not limited to finding repetitions and commonalities. Pattern discovery also involves identifying objects and distinguishing objects from one another. Human vision is unmatched in its ability to identify and distinguish objects. Considerable research into human vision has revealed to a fair degree the visual cues that our brains use to segment an image into separate regions and entities. In this paper, we consider some of these visual cues to construct a novel graphical representation of a DNA sequence. We exploit one of these cues, proximity, to segment DNA into visibly distinct regions and structures. We also demonstrate how to manipulate proximity to identify motifs visually. Lastly, we demonstrate how an additional cue, color, can be used to visualize the Shannon entropy associated with different structures. The presence of large numbers of such regions and structures in DNA suggests that they likely play some important biological role and would be interesting targets for further research. DA - 2010/// PY - 2010/// DO - 10.1007/978-1-4419-5913-3_48 VL - 680 SP - 419-435 SN - 2214-8019 KW - DNA KW - Visualization KW - Repeats KW - Patterns KW - Sequence Analysis ER - TY - JOUR TI - Tanh cascode cell amplifier - an arbitrary transfer characteristics amplifier AU - Ding, M. AU - Gard, K. G. T2 - Electronics Letters DA - 2010/// PY - 2010/// VL - 46 IS - 22 SP - 1495-1496 ER - TY - JOUR TI - TanGeoMS: Tangible Geospatial Modeling System AU - Tateosian, Laura G. AU - Mitasova, Helena AU - Harmon, Brendan A. AU - Fogleman, Brent AU - Weaver, Katherine AU - Harmon, Russel S. T2 - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS AB - We present TanGeoMS, a tangible geospatial modeling visualization system that couples a laser scanner, projector, and a flexible physical three-dimensional model with a standard geospatial information system (GIS) to create a tangible user interface for terrain data. TanGeoMS projects an image of real-world data onto a physical terrain model. Users can alter the topography of the model by modifying the clay surface or placing additional objects on the surface. The modified model is captured by an overhead laser scanner then imported into a GIS for analysis and simulation of real-world processes. The results are projected back onto the surface of the model providing feedback on the impact of the modifications on terrain parameters and simulated processes. Interaction with a physical model is highly intuitive, allowing users to base initial design decisions on geospatial data, test the impact of these decisions in GIS simulations, and use the feedback to improve their design. We demonstrate the system on three applications: investigating runoff management within a watershed, assessing the impact of storm surge on barrier islands, and exploring landscape rehabilitation in military training areas. DA - 2010/// PY - 2010/// DO - 10.1109/tvcg.2010.202 VL - 16 IS - 6 SP - 1605-1612 SN - 1941-0506 KW - Visualization system KW - geographic/geospatial visualization KW - terrain visualization KW - tangible user interface KW - collaborative visualization KW - human-computer interaction ER - TY - JOUR TI - Special Issue: Selected Papers from the Third International Symposium on Advanced Networks and Telecommunication Systems (ANTS 2009) AU - Mukherjee, Biswanath AU - Subramaniam, Suresh AU - Sivalingam, Krishna AU - Dutta, Rudra AU - Datta, Debasish AU - Mohan, Seshadri T2 - OPTICAL SWITCHING AND NETWORKING DA - 2010/12// PY - 2010/12// DO - 10.1016/j.osn.2010.08.001 VL - 7 IS - 4 SP - 139-140 SN - 1573-4277 ER - TY - JOUR TI - Perturbation-based user-input-validation testing of web applications AU - Li, Nuo AU - Xie, Tao AU - Jin, Maozhong AU - Liu, Chao T2 - JOURNAL OF SYSTEMS AND SOFTWARE AB - User-input-validation (UIV) is the first barricade that protects web applications from application-level attacks. Most UIV test tools cannot detect semantics-related vulnerabilities in validators, such as filling a five-digit number to a field that accepts a year. To address this issue, we propose a new approach to generate test inputs for UIV based on the analysis of client-side information. In particular, we use input-field information to generate valid inputs, and then perturb valid inputs to generate invalid test inputs. We conducted an empirical study to evaluate our approach. The empirical result shows that, in comparison to existing vulnerability scanners, our approach is more effective than existing vulnerability scanners in finding semantics-related vulnerabilities of UIV for web applications. DA - 2010/11// PY - 2010/11// DO - 10.1016/j.jss.2010.07.007 VL - 83 IS - 11 SP - 2263-2274 SN - 1873-1228 KW - Software testing KW - Web-application testing KW - User-input-validation testing ER - TY - JOUR TI - GeneaQuilts: A System for Exploring Large Genealogies AU - Bezerianos, Anastasia AU - Dragicevic, Pierre AU - Fekete, Jean-Daniel AU - Bae, Juhee AU - Watson, Ben T2 - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS AB - GeneaQuilts is a new visualization technique for representing large genealogies of up to several thousand individuals. The visualization takes the form of a diagonally-filled matrix, where rows are individuals and columns are nuclear families. After identifying the major tasks performed in genealogical research and the limits of current software, we present an interactive genealogy exploration system based on GeneaQuilts. The system includes an overview, a timeline, search and filtering components, and a new interaction technique called Bring & Slide that allows fluid navigation in very large genealogies. We report on preliminary feedback from domain experts and show how our system supports a number of their tasks. DA - 2010/// PY - 2010/// DO - 10.1109/tvcg.2010.159 VL - 16 IS - 6 SP - 1073-1081 SN - 1941-0506 KW - Genealogy visualization KW - interaction ER - TY - JOUR TI - Evidence-Based Trust: A Mathematical Model Geared for Multiagent Systems AU - Wang, Yonghong AU - Singh, Munindar P. T2 - ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS AB - An evidence-based account of trust is essential for an appropriate treatment of application-level interactions among autonomous and adaptive parties. Key examples include social networks and service-oriented computing. Existing approaches either ignore evidence or only partially address the twin challenges of mapping evidence to trustworthiness and combining trust reports from imperfectly trusted sources. This article develops a mathematically well-formulated approach that naturally supports discounting and combining evidence-based trust reports. This article understands an agent Alice's trust in an agent Bob in terms of Alice's certainty in her belief that Bob is trustworthy. Unlike previous approaches, this article formulates certainty in terms of evidence based on a statistical measure defined over a probability distribution of the probability of positive outcomes. This definition supports important mathematical properties ensuring correct results despite conflicting evidence: (1) for a fixed amount of evidence, certainty increases as conflict in the evidence decreases and (2) for a fixed level of conflict, certainty increases as the amount of evidence increases. Moreover, despite a subtle definition of certainty, this work (3) establishes a bijection between evidence and trust spaces, enabling robust combination of trust reports and (4) provides an efficient algorithm for computing this bijection. DA - 2010/11// PY - 2010/11// DO - 10.1145/1867713.1867715 VL - 5 IS - 4 SP - SN - 1556-4703 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-78649705255&partnerID=MN8TOARS KW - Theory KW - Algorithms KW - Application-level trust KW - evidence-based trust ER - TY - CONF TI - Differential capacity p-Cycles: A p-Cycle variant with increased capacity efficiency AU - Jaikumar, P. AU - Dutta, R. C2 - 2010/// C3 - Optical Switching and Networking DA - 2010/// VL - 7 SP - 185-195 M1 - 4 ER - TY - CONF TI - DKSM: Subverting virtual machine introspection for fun and profit AU - Bahram, S. AU - Jiang, X. X. AU - Wang, Z. AU - Grace, M. AU - Li, J. K. AU - Srinivasan, D. AU - Rhee, J. AU - Xu, D. Y. C2 - 2010/// C3 - 2010 29th ieee international symposium on reliable distributed systems srds 2010 DA - 2010/// SP - 82-91 ER - TY - JOUR TI - An Architectural Approach to Preventing Code Injection Attacks AU - Riley, Ryan AU - Jiang, Xuxian AU - Xu, Dongyan T2 - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING AB - Code injection attacks, despite being well researched, continue to be a problem today. Modern architectural solutions such as the execute-disable bit and PaX have been useful in limiting the attacks; however, they enforce program layout restrictions and can oftentimes still be circumvented by a determined attacker. We propose a change to the memory architecture of modern processors that addresses the code injection problem at its very root by virtually splitting memory into code memory and data memory such that a processor will never be able to fetch injected code for execution. This virtual split memory system can be implemented as a software-only patch to an operating system and can be used to supplement existing schemes for improved protection. Furthermore, our system is able to accommodate a number of response modes when a code injection attack occurs. Our experiments with both benchmarks and real-world attacks show the system is effective in preventing a wide range of code injection attacks while incurring reasonable overhead. DA - 2010/// PY - 2010/// DO - 10.1109/tdsc.2010.1 VL - 7 IS - 4 SP - 351-365 SN - 1941-0018 KW - Code injection KW - secure memory architecture ER - TY - JOUR TI - Symmetrically constrained compositions AU - Beck, Matthias AU - Gessel, Ira M. AU - Lee, Sunyoung AU - Savage, Carla D. T2 - RAMANUJAN JOURNAL AB - Given integers a 1,a 2,…,a n , with a 1+a 2+⋅⋅⋅+a n ≥1, a symmetrically constrained composition λ 1+λ 2+⋅⋅⋅+λ n =M of M into n nonnegative parts is one that satisfies each of the n! constraints $\{\sum_{i=1}^{n}a_{i}\lambda_{\pi(i)}\geq 0:\pi \in S_{n}\}$ . We show how to compute the generating function of these compositions, combining methods from partition theory, permutation statistics, and lattice-point enumeration. DA - 2010/12// PY - 2010/12// DO - 10.1007/s11139-010-9232-7 VL - 23 IS - 1-3 SP - 355-369 SN - 1572-9303 KW - Symmetrically constrained composition KW - Partition analysis KW - Permutation statistics KW - Generating function KW - Lattice-point enumeration ER - TY - JOUR TI - RaPTEX: Rapid Prototyping Tool for Embedded Communication Systems AU - Lim, Jun Bum AU - Jang, Beakcheol AU - Yoon, Suyoung AU - Sichitiu, Mihail L. AU - Dean, Alexander G. T2 - ACM TRANSACTIONS ON SENSOR NETWORKS AB - Advances in microprocessors, memory, and radio technology have enabled the emergence of embedded systems that rely on communication systems to exchange information and coordinate their activities in spatially distributed applications. However, developing embedded communication systems that satisfy specific application requirements is a challenge due to the many tradeoffs imposed by different choices of underlying protocols and their parameters. Furthermore, evaluating the correctness and performance of the design and implementation before deploying it is a nontrivial task due to the complexity of the resulting system. This article presents the design and implementation of RaPTEX, a rapid prototyping tool for embedded communication systems, especially well suited for wireless sensor networks (WSNs), consisting of three major subsystems: a toolbox, an analytical performance estimation framework, and an emulation environment. We use a hierarchical approach in the design of the toolbox to facilitate the composition of the network stack. For fast exploration of the tradeoff space at design time, we build an analytical performance estimation model for energy consumption, delay, and throughput. For realistic performance evaluation, we design and implement a hybrid, accurate, yet scalable, emulation environment. Through three use cases, we study the tradeoff space for different protocols and topologies, and highlight the benefits of using RaPTEX for designing and evaluating embedded communication systems for WSNs. DA - 2010/8// PY - 2010/8// DO - 10.1145/1806895.1806902 VL - 7 IS - 1 SP - SN - 1550-4859 KW - Design KW - Verification KW - Experimentation KW - Wireless sensor networks KW - rapid prototyping tool KW - analytical performance modeling KW - real code simulation KW - RaPTEX KW - TinyOS ER - TY - JOUR TI - Methods for computing color anaglyphs AU - McAllister, David F. AU - Zhou, Ya AU - Sullivan, Sophia T2 - STEREOSCOPIC DISPLAYS AND APPLICATIONS XXI AB - A new computation technique is presented for calculating pixel colors in anaglyph images. The method depends upon knowing the RGB spectral distributions of the display device and the transmission functions of the filters in the viewing glasses. It requires the solution of a nonlinear least-squares program for each pixel in a stereo pair and is based on minimizing color distances in the CIEL*a*b* uniform color space. The method is compared with several techniques for computing anaglyphs including approximation in CIE space using the Euclidean and Uniform metrics, the Photoshop method and its variants, and a method proposed by Peter Wimmer. We also discuss the methods of desaturation and gamma correction for reducing retinal rivalry. DA - 2010/// PY - 2010/// DO - 10.1117/12.837163 VL - 7524 SP - SN - 1996-756X ER - TY - CONF TI - Guided test generation for coverage criteria AU - Pandita, R. AU - Xie, T. AU - Tillmann, N. AU - Halleux, J. AB - Test coverage criteria including boundary-value and logical coverage such as Modified Condition/Decision Coverage (MC/DC) have been increasingly used in safety-critical or mission-critical domains, complementing those more popularly used structural coverage criteria such as block or branch coverage. However, existing automated test-generation approaches often target at block or branch coverage for test generation and selection, and therefore do not support testing against boundary-value coverage or logical coverage. To address this issue, we propose a general approach that uses instrumentation to guide existing test-generation approaches to generate test inputs that achieve boundary-value and logical coverage for the program under test. Our preliminary evaluation shows that our approach effectively helps an approach based on Dynamic Symbolic Execution (DSE) to improve boundary-value and logical coverage of generated test inputs. The evaluation results show 30.5% maximum (23% average) increase in boundary-value coverage and 26% maximum (21.5% average) increase in logical coverage of the subject programs under test using our approach over without using our approach. In addition, our approach improves the fault-detection capability of generated test inputs by 12.5% maximum (11% average) compared to the test inputs generated without using our approach. C2 - 2010/// C3 - 2010 ieee international conference on software maintenance DA - 2010/// DO - 10.1109/icsm.2010.5609565 ER - TY - JOUR TI - Guest editorial: Special issue on software reliability engineering AU - Williams, Laurie T2 - EMPIRICAL SOFTWARE ENGINEERING DA - 2010/8// PY - 2010/8// DO - 10.1007/s10664-010-9129-5 VL - 15 IS - 4 SP - 321-322 SN - 1382-3256 ER - TY - JOUR TI - Contact degradation in hot/cold operation of direct contact micro-switches AU - Yang, Z. AU - Lichtenwalner, D. AU - Morris, A. AU - Krim, J. AU - Kingon, A. I. T2 - JOURNAL OF MICROMECHANICS AND MICROENGINEERING AB - Degradation of gold contacts in micro-switches was studied under an extensive range of operation conditions including high-electric-field ac/dc hot switching, low-electric-field hot switching and cold switching. Tests were conducted in a unique experimental switching operation set-up. Gold micro-contacts were characterized by an atomic force microscope. It was found that a unique material transfer/distribution feature was correlated with specific switching operations. New insights into contact degradation mechanisms of micro-switches were achieved by analyzing contact degradation features under varied operation conditions. Our results indicate that for high-electric-field hot switching, gold atoms are transferred from the 'anode' contact to the 'cathode' contact via field evaporation; for low-electric-field hot switching, material transfer is induced by transient heat; and for cold switching, contact resistance can be jeopardized by surface contamination and surface roughness if contact force is low. DA - 2010/10// PY - 2010/10// DO - 10.1088/0960-1317/20/10/105028 VL - 20 IS - 10 SP - SN - 1361-6439 ER - TY - CONF TI - An interactive ambient visualization for code smells AU - Murphy-Hill, E. AU - Black, A. P. AB - Code smells are characteristics of software that indicate that code may have a design problem. Code smells have been proposed as a way for programmers to recognize the need for restructuring their software. Because code smells can go unnoticed while programmers are working, tools called smell detectors have been developed to alert programmers to the presence of smells in their code, and to help them understand the cause of those smells. In this paper, we propose a novel smell detector called Stench Blossom that provides an interactive ambient visualization designed to first give programmers a quick, high-level overview of the smells in their code, and then, if they wish, to help in understanding the sources of those code smells. We also describe a laboratory experiment with 12 programmers that tests several hypotheses about our tool. Our findings suggest that programmers can use our tool effectively to identify smells and to make refactoring judgements. This is partly because the tool serves as a memory aid, and partly because it is more reliable and easier to use than heuristics for analyzing smells. C2 - 2010/// C3 - Softvis 2010: Proceedings of the 2010 International Symposium on Software Visualization DA - 2010/// DO - 10.1145/1879211.1879216 SP - 5-14 ER - TY - CONF TI - A suite of Google services for daily course evaluation AU - Gehringer, Edward AU - Cross, W. T. AB - In almost all institutions, students are asked to evaluate the quality of instruction on end-of-semester surveys. Unfortunately, these come too late to affect the quality of instruction in the current semester. They are essentially summative-evaluating what has already happened, mostly for the benefit of third parties, rather than formative-providing information that an instructor can use to improve teaching in the current class. Now, with the advent of freely accessible tools for taking Web surveys, it is easy to obtain formative feedback. This paper reports on a suite of Google forms and Google spreadsheets, along with a Google app for visualizing the results. These Google tools can be used to solicit feedback daily from a set of students in the class. This helps the instructor to keep tabs on how the students react to each class session, and compare the results with the feedback from previous class sessions. C2 - 2010/// C3 - 2010 IEEE frontiers in education conference (FIE) DA - 2010/// DO - 10.1109/fie.2010.5673187 ER - TY - CONF TI - 3D surface reconstruction using structured circular light patterns AU - Lee, D. AU - Krim, H. AB - Reconstructing a 3D surface in ℝ3 from a 2D image in ℝ2 has been a widely studied issue as well as one of the most important problems in image processing. In this paper, we propose a novel approach to reconstructing 3D coordinates of a surface from a 2D image taken by a camera using projected circular light patterns. Known information (i.e. intrinsic and extrinsic parameters of the camera, the structure of the circular patterns, a fixed optical center of the camera and the location of the reference plane of the surface) provides a mathematical model for surface reconstruction. The reconstruction is based on a geometrical relationship between a given pattern projected onto a 3D surface and a pattern captured in a 2D image plane from a viewpoint. This paper chiefly deals with a mathematical proof of concept for the reconstruction problem. C2 - 2010/// C3 - Advanced concepts for intelligent vision systems, pt i DA - 2010/// DO - 10.1007/978-3-642-17688-3_27 VL - 6474 SP - 279-289 ER - TY - JOUR TI - Thermoelectric properties of graphene nanoribbons, junctions and superlattices AU - Chen, Y. AU - Jayasekera, T. AU - Calzolari, A. AU - Kim, K. W. AU - Nardelli, M. Buongiorno T2 - JOURNAL OF PHYSICS-CONDENSED MATTER AB - Using model interaction Hamiltonians for both electrons and phonons and Green's function formalism for ballistic transport, we have studied the thermal conductance and the thermoelectric properties of graphene nanoribbons (GNR), GNR junctions and periodic superlattices. Among our findings we have established the role that interfaces play in determining the thermoelectric response of GNR systems both across single junctions and in periodic superlattices. In general, increasing the number of interfaces in a single GNR system increases the peak ZT values that are thus maximized in a periodic superlattice. Moreover, we proved that the thermoelectric behavior is largely controlled by the width of the narrower component of the junction. Finally, we have demonstrated that chevron-type GNRs recently synthesized should display superior thermoelectric properties. DA - 2010/9/22/ PY - 2010/9/22/ DO - 10.1088/0953-8984/22/37/372202 VL - 22 IS - 37 SP - SN - 0953-8984 ER - TY - CONF TI - Idea: Using system level testing for revealing SQL injection-related error message information leaks AU - Smith, B. AU - Williams, L. AU - Austin, A. C2 - 2010/// C3 - Engineering secure software and systems, proceedings DA - 2010/// VL - 5965 SP - 192-200 ER - TY - CONF TI - Grammatical evolution decision trees for detecting gene-gene interactions AU - Deodhar, S. AU - Motsinger-Reif, A. C2 - 2010/// C3 - Evolutionary computation, machine learning and data mining in bioinformatics, proceedings DA - 2010/// VL - 6023 SP - 98-109 ER - TY - JOUR TI - An economic model for pricing tiered network services AU - Lv, Qian AU - Rouskas, George N. T2 - ANNALS OF TELECOMMUNICATIONS DA - 2010/4// PY - 2010/4// DO - 10.1007/s12243-009-0149-3 VL - 65 IS - 3-4 SP - 147-161 SN - 1958-9395 KW - Tiered services KW - Price structure KW - Economic model ER - TY - JOUR TI - Towards reliable isoform quantification using RNA-SEQ data AU - Howard, Brian E. AU - Heber, Steffen T2 - BMC BIOINFORMATICS AB - In eukaryotes, alternative splicing often generates multiple splice variants from a single gene. Here we explore the use of RNA sequencing (RNA-Seq) datasets to address the isoform quantification problem. Given a set of known splice variants, the goal is to estimate the relative abundance of the individual variants.Our method employs a linear models framework to estimate the ratios of known isoforms in a sample. A key feature of our method is that it takes into account the non-uniformity of RNA-Seq read positions along the targeted transcripts.Preliminary tests indicate that the model performs well on both simulated and real data. In two publicly available RNA-Seq datasets, we identified several alternatively-spliced genes with switch-like, on/off expression properties, as well as a number of other genes that varied more subtly in isoform expression. In many cases, genes exhibiting differential expression of alternatively spliced transcripts were not differentially expressed at the gene level.Given that changes in isoform expression level frequently involve a continuum of isoform ratios, rather than all-or-nothing expression, and that they are often independent of general gene expression changes, we anticipate that our research will contribute to revealing a so far uninvestigated layer of the transcriptome. We believe that, in the future, researchers will prioritize genes for functional analysis based not only on observed changes in gene expression levels, but also on changes in alternative splicing. DA - 2010/// PY - 2010/// DO - 10.1186/1471-2105-11-s3-s6 VL - 11 SP - SN - 1471-2105 ER - TY - JOUR TI - DMP: Detouring using multiple paths against jamming attack for ubiquitous networking system AU - Kim, M. AU - Chae, K. T2 - Sensors (Basel, Switzerland) DA - 2010/// PY - 2010/// VL - 10 IS - 4 SP - 3626-3640 ER - TY - JOUR TI - Agile software development methodologies and practices AU - Williams, L. T2 - Advances in computers, vol 80 DA - 2010/// PY - 2010/// VL - 80 SP - 1-44 ER - TY - JOUR TI - Narrative Planning: Balancing Plot and Character AU - Riedl, M. O. AU - Young, R. M. T2 - Journal of Artificial Intelligence Research AB - Narrative, and in particular storytelling, is an important part of the human experience. Consequently, computational systems that can reason about narrative can be more effective communicators, entertainers, educators, and trainers. One of the central challenges in computational narrative reasoning is narrative generation, the automated creation of meaningful event sequences. There are many factors -- logical and aesthetic -- that contribute to the success of a narrative artifact. Central to this success is its understandability. We argue that the following two attributes of narratives are universal: (a) the logical causal progression of plot, and (b) character believability. Character believability is the perception by the audience that the actions performed by characters do not negatively impact the audiences suspension of disbelief. Specifically, characters must be perceived by the audience to be intentional agents. In this article, we explore the use of refinement search as a technique for solving the narrative generation problem -- to find a sound and believable sequence of character actions that transforms an initial world state into a world state in which goal propositions hold. We describe a novel refinement search planning algorithm -- the Intent-based Partial Order Causal Link (IPOCL) planner -- that, in addition to creating causally sound plot progression, reasons about character intentionality by identifying possible character goals that explain their actions and creating plan structures that explain why those characters commit to their goals. We present the results of an empirical evaluation that demonstrates that narrative plans generated by the IPOCL algorithm support audience comprehension of character intentions better than plans generated by conventional partial-order planners. DA - 2010/9/29/ PY - 2010/9/29/ DO - 10.1613/jair.2989 VL - 39 SP - 217-268 J2 - jair OP - SN - 1076-9757 UR - http://dx.doi.org/10.1613/jair.2989 DB - Crossref ER - TY - CONF TI - Dygen: Automatic generation of high-coverage tests via mining gigabytes of dynamic traces AU - Thummalapenta, S. AU - Halleux, J. AU - Tillmann, N. AU - Wadsworth, S. C2 - 2010/// C3 - Test and proofs, proceedings DA - 2010/// VL - 6143 SP - 77-93 ER - TY - JOUR TI - Theoretical underpinnings for maximal clique enumeration on perturbed graphs AU - Hendrix, William AU - Schmidt, Matthew C. AU - Breimyer, Paul AU - Samatova, Nagiza F. T2 - THEORETICAL COMPUTER SCIENCE AB - The problem of enumerating the maximal cliques of a graph is a computationally expensive problem with applications in a number of different domains. Sometimes the benefit of knowing the maximal clique enumeration (MCE) of a single graph is worth investing the initial computation time. However, when graphs are abstractions of noisy or uncertain data, the MCE of several closely related graphs may need to be found, and the computational cost of doing so becomes prohibitively expensive. Here, we present a method by which the cost of enumerating the set of maximal cliques for related graphs can be reduced. By using the MCE for some baseline graph, the MCE for a modified, or perturbed, graph may be obtained by enumerating only the maximal cliques that are created or destroyed by the perturbation. When the baseline and perturbed graphs are relatively similar, the difference set between the two MCEs can be overshadowed by the maximal cliques common to both. Thus, by enumerating only the difference set between the baseline and perturbed graphs’ MCEs, the computational cost of enumerating the maximal cliques of the perturbed graph can be reduced. We present necessary and sufficient conditions for enumerating difference sets when the perturbed graph is formed by several different types of perturbations. We also present results of an algorithm based on these conditions that demonstrate a speedup over traditional calculations of the MCE of perturbed, real biological networks. DA - 2010/6/6/ PY - 2010/6/6/ DO - 10.1016/j.tcs.2010.03.011 VL - 411 IS - 26-28 SP - 2520-2536 SN - 1879-2294 KW - Graph perturbation theory KW - Maximal clique enumeration KW - Graph algorithms KW - Uncertain and noisy data ER - TY - JOUR TI - Protection Poker: The New Software Security "Game" AU - Williams, Laurie AU - Meneely, Andrew AU - Shipley, Grant T2 - IEEE SECURITY & PRIVACY AB - Without infinite resources, software development teams must prioritize security fortification efforts to prevent the most damaging attacks. The Protection Poker "game" is a collaborative means for guiding this prioritization and has the potential to improve software security practices and team software security knowledge. DA - 2010/// PY - 2010/// DO - 10.1109/msp.2010.58 VL - 8 IS - 3 SP - 14-20 SN - 1540-7993 ER - TY - JOUR TI - On the billing vulnerabilities of SIP-based VoIP systems AU - Zhang, Ruishan AU - Wang, Xinyuan AU - Yang, Xiaohui AU - Jiang, Xuxian T2 - COMPUTER NETWORKS AB - For commercial VoIP services, billing is crucial to both service providers and their subscribers. One of the most basic requirements of any billing function is that it must be accurate and trustworthy. A reliable VoIP billing mechanism should only charge VoIP subscribers for the calls they have really made and for the durations they have called. Existing VoIP billing is based on the underlying VoIP signaling and media transport protocols. Hence, vulnerabilities in VoIP signaling and media transports can be exploited to compromise the trustworthiness of the billing of VoIP systems. In this paper, we analyze several deployed SIP-based VoIP systems, and present three types of billing attacks: call establishment hijacking, call termination hijacking and call forward hijacking. These billing attacks can result in charges on the calls the subscribers have not made or overcharges on the VoIP calls the subscribers have made. Such billing attacks essentially cause inconsistencies between what the VoIP subscribers have received and what the VoIP service provider has provided, which would create hard to resolve disputes between the VoIP subscribers and service providers. Our empirical results show that VoIP subscribers of Vonage, AT&T and Gizmo are vulnerable to these billing attacks. DA - 2010/8/2/ PY - 2010/8/2/ DO - 10.1016/j.comnet.2010.02.007 VL - 54 IS - 11 SP - 1837-1847 SN - 1872-7069 KW - VoIP security KW - Man-in-the-middle attacks KW - SIP KW - Billing vulnerabilities ER - TY - JOUR TI - Multiphase Joint Segmentation-Registration and Object Tracking for Layered Images AU - Chen, Ping-Feng AU - Krim, Hamid AU - Mendoza, Olga L. T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - In this paper we propose to jointly segment and register objects of interest in layered images. Layered imaging refers to imageries taken from different perspectives and possibly by different sensors. Registration and segmentation are therefore the two main tasks which contribute to the bottom level, data alignment, of the multisensor data fusion hierarchical structures. Most exploitations of two layered images assumed that scanners are at very high altitudes and that only one transformation ties the two images. Our data are however taken at mid-range and therefore requires segmentation to assist us examining different object regions in a divide-and-conquer fashion. Our approach is a combination of multiphase active contour method with a joint segmentation-registration technique (which we called MPJSR) carried out in a local moving window prior to a global optimization. To further address layered video sequences and tracking objects in frames, we propose a simple adaptation of optical flow calculations along the active contours in a pair of layered image sequences. The experimental results show that the whole integrated algorithm is able to delineate the objects of interest, align them for a pair of layered frames and keep track of the objects over time. DA - 2010/7// PY - 2010/7// DO - 10.1109/tip.2010.2045164 VL - 19 IS - 7 SP - 1706-1719 SN - 1941-0042 KW - Active contour KW - joint segmentation registration KW - layered sensing KW - multiphase active contour KW - optical flow KW - visual motion ER - TY - CONF TI - Information sharing among autonomous agents in referral networks AU - Udupi, Y. B. AU - Singh, M. P. C2 - 2010/// C3 - Agents and peer-to-peer computing DA - 2010/// VL - 5319 SP - 13-26 ER - TY - JOUR TI - Inapproximability results for equations over infinite groups AU - Chen, W. B. AU - Yin, D. P. AU - Chen, Z. Z. T2 - Theoretical Computer Science DA - 2010/// PY - 2010/// VL - 411 IS - 26-28 SP - 2513-2519 ER - TY - JOUR TI - Deadline-based connection setup in wavelength-routed WDM networks AU - Fawaz, Wissam AU - Ouaiss, Iyad AU - Chen, Ken AU - Perros, Harry T2 - COMPUTER NETWORKS AB - This article addresses the ubiquitous topic of quality of service (QoS) aware connection provisioning in wavelength-routed WDM optical networks. The impact of the connection setup time of an optical connection has not been adequately addressed in the open literature. As such, this paper presents a novel approach that uses the optical connection setup time as a service differentiator during connection provisioning. The proposed approach utilizes the Earliest Deadline First (EDF) queueing algorithm to achieve deadline-based connection setup management with the deadline being the setup time requirement of an optical connection. The proposed EDF-based approach would allow the network operator to improve the QoS perceived by the end clients. Performance of this novel scheme is analyzed by accurately calculating various parameters, such as the fraction of connections provisioned on-time (i.e. prior to deadline expiration) and the average time it takes to successfully setup a connection. In addition, the presented approach is validated by a simulation that analyzes the performance of the proposed connection setup scheme in the specific context of the National Science Foundation Network (NSFNET). The obtained results show that a deadline-based setup strategy can minimize blocking probability while achieving QoS differentiation. DA - 2010/8/2/ PY - 2010/8/2/ DO - 10.1016/j.comnet.2010.02.008 VL - 54 IS - 11 SP - 1792-1804 SN - 1872-7069 KW - Optical networks KW - Connection setup management KW - Earliest Deadline First scheduling KW - Performance analysis ER - TY - JOUR TI - Towards a Systems Approach for Lignin Biosynthesis in Populus trichocarpa: Transcript Abundance and Specificity of the Monolignol Biosynthetic Genes AU - Shi, Rui AU - Sun, Ying-Hsuan AU - Li, Quanzi AU - Heber, Steffen AU - Sederoff, Ronald AU - Chiang, Vincent L. T2 - PLANT AND CELL PHYSIOLOGY AB - As a step toward a comprehensive description of lignin biosynthesis in Populus trichocarpa, we identified from the genome sequence 95 phenylpropanoid gene models in 10 protein families encoding enzymes for monolignol biosynthesis. Transcript abundance was determined for all 95 genes in xylem, leaf, shoot and phloem using quantitative real-time PCR (qRT-PCR). We identified 23 genes that most probably encode monolignol biosynthesis enzymes during wood formation. Transcripts for 18 of the 23 are abundant and specific to differentiating xylem. We found evidence suggesting functional redundancy at the transcript level for phenylalanine ammonia-lyase (PAL), cinnamate 4-hydroxylase (C4H), 4-coumarate:CoA ligase (4CL), p-hydroxycinnamoyl-CoA:quinate shikimate p-hydroxycinnamoyltransferase (HCT), caffeoyl-CoA O-methyltransferase (CCoAOMT) and coniferyl aldehyde 5-hydroxylase (CAld5H). We carried out an enumeration-based motif identification and discriminant analysis on the promoters of all 95 genes. Five core motifs correctly discriminate the 18 xylem-specific genes from the 77 non-xylem genes. These motifs are similar to promoter elements known to regulate phenylpropanoid gene expression. This work suggests that genes in monolignol biosynthesis are regulated by multiple motifs, often related in sequence. DA - 2010/1// PY - 2010/1// DO - 10.1093/pcp/pcp175 VL - 51 IS - 1 SP - 144-163 SN - 1471-9053 KW - Lignin systems biology KW - Monolignol biosynthesis KW - Populus trichocarpa KW - Promoter motifs KW - Transcript abundance KW - Xylem-specific expression ER - TY - JOUR TI - Squigraphs for Fine and Compact Modeling of 3-D Shapes AU - Aouada, Djamila AU - Krim, Hamid T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - We propose to superpose global topological and local geometric 3-D shape descriptors in order to define one compact and discriminative representation for a 3-D object. While a number of available 3-D shape modeling techniques yield satisfactory object classification rates, there is still a need for a refined and efficient identification/recognition of objects among the same class. In this paper, we use Morse theory in a two-phase approach. To ensure the invariance of the final representation to isometric transforms, we choose the Morse function to be a simple and intrinsic global geodesic function defined on the surface of a 3-D object. The first phase is a coarse representation through a reduced topological Reeb graph. We use it for a meaningful decomposition of shapes into primitives. During the second phase, we add detailed geometric information by tracking the evolution of Morse function's level curves along each primitive. We then embed the manifold of these curves into ¿ 3 , and obtain a single curve. By combining phase one and two, we build new graphs rich in topological and geometric information that we refer to as squigraphs. Our experiments show that squigraphs are more general than existing techniques. They achieve similar classification rates to those achieved by classical shape descriptors. Their performance, however, becomes clearly superior when finer classification and identification operations are targeted. Indeed, while other techniques see their performances dropping, squigraphs maintain a performance rate of the order of 97%. DA - 2010/2// PY - 2010/2// DO - 10.1109/TIP.2009.2034693 VL - 19 IS - 2 SP - 306-321 SN - 1941-0042 KW - Iso-geodesic curves KW - object matching KW - Reeb graph KW - shape geometry KW - topo-geometric modeling KW - Whitney embedding ER - TY - JOUR TI - Implementation and experimental evaluation of multi-channel MAC protocols for 802.11 networks AU - Le, Long AU - Rhee, Injong T2 - AD HOC NETWORKS AB - Multi-channel MAC protocols have recently obtained considerable attention in wireless networking research because they promise to increase capacity of wireless networks significantly by exploiting multiple frequency bands. However, most of these protocols remain as pure academic interest since they only exist on paper and in simulation code but have no practical implementation. In this paper, we report lessons learned from our endeavor in which we implement three representative multi-channel MAC protocols: Asynchronous Multi-channel Coordination Protocol (AMCP), Multi-channel MAC (MMAC), and Slotted Seeded Channel Hopping (SSCH) on off-the-shelf IEEE 802.11 hardware. We explore practical impacts of these multi-channel MAC protocols and present results of our experimental performance evaluation. The major findings of our performance evaluation are: (1) all multi-channel MAC protocols underperform the original 802.11 MAC at low load, (2) all multi-channel MAC protocols give better performance than the original 802.11 MAC at medium and high load, (3) AMCP performs worst among all multi-channel MACs in one-hop and multi-hop 802.11b scenario but delivers the best performance in multi-hop 802.11a scenario, and (4) SSCH attains the best results in one-hop scenarios or at low loads but loses its effectiveness at high loads in multi-hop scenarios. DA - 2010/8// PY - 2010/8// DO - 10.1016/j.adhoc.2009.12.004 VL - 8 IS - 6 SP - 626-639 SN - 1570-8713 KW - CSMA/CA KW - IEEE 802.11 KW - Multi-channel MAC KW - Experimentation KW - Performance evaluation ER - TY - JOUR TI - The dynamic genome of Hydra AU - Chapman, J. A. AU - Kirkness, E. F. AU - Simakov, O. AU - Hampson, S. E. AU - Mitros, T. AU - Weinmaier, T. AU - Rattei, T. AU - Balasubramanian, P. G. AU - Borman, J. AU - Busam, D. AU - Disbennett, K. AU - Pfannkoch, C. AU - Sumin, N. AU - Sutton, G. G. AU - Viswanathan, L. D. AU - Walenz, B. T2 - Nature DA - 2010/// PY - 2010/// VL - 464 IS - 7288 SP - 592-596 ER - TY - JOUR TI - Test input reduction for result inspection to facilitate fault localization AU - Hao, Dan AU - Xie, Tao AU - Zhang, Lu AU - Wang, Xiaoyin AU - Sun, Jiasu AU - Mei, Hong T2 - AUTOMATED SOFTWARE ENGINEERING DA - 2010/3// PY - 2010/3// DO - 10.1007/s10515-009-0056-x VL - 17 IS - 1 SP - 5-31 SN - 1573-7535 KW - Test suite reduction KW - Testing KW - Debugging KW - Fault localization ER - TY - JOUR TI - Performance impact of large file transfer on web proxy caching: A case study in a high bandwidth campus network environment AU - Kim, H. C. AU - Lee, D. AU - Chon, K. AU - Jang, B. AU - Kwon, T. AU - Choi, Y. T2 - Journal of Communications and Networks DA - 2010/// PY - 2010/// VL - 12 IS - 1 SP - 52-66 ER - TY - JOUR TI - Object Recognition Through Topo-Geometric Shape Models Using Error-Tolerant Subgraph Isomorphisms AU - Baloch, Sajjad AU - Krim, Hamid T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - We propose a method for 3-D shape recognition based on inexact subgraph isomorphisms, by extracting topological and geometric properties of a shape in the form of a shape model, referred to as topo-geometric shape model (TGSM). In a nutshell, TGSM captures topological information through a rigid transformation invariant skeletal graph that is constructed in a Morse theoretic framework with distance function as the Morse function. Geometric information is then retained by analyzing the geometric profile as viewed through the distance function. Modeling the geometric profile through elastic yields a weighted skeletal representation, which leads to a complete shape signature. Shape recognition is carried out through inexact subgraph isomorphisms by determining a sequence of graph edit operations on model graphs to establish subgraph isomorphisms with a test graph. Test graph is recognized as a shape that yields the largest subgraph isomorphism with minimal cost of edit operations. In this paper, we propose various cost assignments for graph edit operations for error correction that takes into account any shape variations arising from noise and measurement errors. DA - 2010/5// PY - 2010/5// DO - 10.1109/tip.2009.2039372 VL - 19 IS - 5 SP - 1191-1200 SN - 1941-0042 KW - Morse theory KW - Reeb graph KW - shape recognition KW - skeletal graph KW - 3-D shape modeling ER - TY - JOUR TI - Classification of Curves in 2D and 3D via Affine Integral Signatures AU - Feng, Shuo AU - Kogan, Irina AU - Krim, Hamid T2 - ACTA APPLICANDAE MATHEMATICAE AB - We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognition. To each planar or spatial curve, we assign a planar signature curve. Curves, equivalent under an affine transformation, have the same signature. The signatures are based on integral invariants, which are significantly less sensitive to small perturbations of curves and noise than classically known differential invariants. Affine invariants are derived in terms of Euclidean invariants. We present two types of signatures: the global and the local signature. Both signatures are independent of curve parameterization. The global signature depends on a choice of the initial point and, therefore, cannot be used for local comparison. The local signature, albeit being slightly more sensitive to noise, is independent of the choice of the initial point and can be used to solve local equivalence problem. An experiment that illustrates robustness of the proposed signatures is presented. DA - 2010/3// PY - 2010/3// DO - 10.1007/s10440-008-9353-9 VL - 109 IS - 3 SP - 903-937 SN - 1572-9036 KW - Euclidean and affine transformations KW - Equivalence problem for curves KW - Integral invariants KW - Signatures KW - Image recognition ER - TY - JOUR TI - Anonymizing bipartite graph data using safe groupings AU - Cormode, Graham AU - Srivastava, Divesh AU - Yu, Ting AU - Zhang, Qing T2 - VLDB JOURNAL DA - 2010/2// PY - 2010/2// DO - 10.1007/s00778-009-0167-9 VL - 19 IS - 1 SP - 115-139 SN - 0949-877X KW - Privacy KW - Microdata KW - Graph KW - Query answering ER - TY - JOUR TI - The play's the thing AU - Young, R. M. T2 - IEEE Internet Computing DA - 2010/// PY - 2010/// VL - 14 IS - 1 SP - 16-18 ER - TY - JOUR TI - Stealthy Malware Detection and Monitoring through VMM-Based "Out-of-the-Box" Semantic View Reconstruction AU - Jiang, Xuxian AU - Wang, Xinyuan AU - Xu, Dongyan T2 - ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY AB - An alarming trend in recent malware incidents is that they are armed with stealthy techniques to detect, evade, and subvert malware detection facilities of the victim. On the defensive side, a fundamental limitation of traditional host-based antimalware systems is that they run inside the very hosts they are protecting (“in-the-box”), making them vulnerable to counter detection and subversion by malware. To address this limitation, recent solutions based on virtual machine (VM) technologies advocate placing the malware detection facilities outside of the protected VM (“out-of-the-box”). However, they gain tamper resistance at the cost of losing the internal semantic view of the host, which is enjoyed by “in-the-box” approaches. This poses a technical challenge known as the semantic gap. In this article, we present the design, implementation, and evaluation of VMwatcher —an “out-of-the-box” approach that overcomes the semantic gap challenge. A new technique called guest view casting is developed to reconstruct internal semantic views (e.g., files, processes, and kernel modules) of a VM nonintrusively from the outside. More specifically, the new technique casts semantic definitions of guest OS data structures and functions on virtual machine monitor (VMM)-level VM states, so that the semantic view can be reconstructed. Furthermore, we extend guest view casting to reconstruct details of system call events (e.g., the process that makes the system call as well as the system call number, parameters, and return value) in the VM, enriching the semantic view. With the semantic gap effectively narrowed, we identify three unique malware detection and monitoring capabilities: (i) view comparison-based malware detection and its demonstration in rootkit detection; (ii) “out-of-the-box” deployment of off-the-shelf anti malware software with improved detection accuracy and tamper-resistance; and (iii) nonintrusive system call monitoring for malware and intrusion behavior observation. We have implemented a proof-of-concept VMwatcher prototype on a number of VMM platforms. Our evaluation experiments with real-world malware, including elusive kernel-level rootkits, demonstrate VMwatcher's practicality and effectiveness. DA - 2010/2// PY - 2010/2// DO - 10.1145/1698750.1698752 VL - 13 IS - 2 SP - SN - 1557-7406 KW - Security KW - Malware detection KW - rootkits KW - virtual machines ER - TY - JOUR TI - Internet Predictions AU - Cerf, Vinton G. AU - Singh, Munindar P. T2 - IEEE INTERNET COMPUTING AB - More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future. DA - 2010/// PY - 2010/// DO - 10.1109/mic.2010.11 VL - 14 IS - 1 SP - 10-11 SN - 1089-7801 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-75449105653&partnerID=MN8TOARS KW - space technology KW - Internet predictions KW - participatory sensing KW - Internet KW - personal data vault KW - ubiquitous data capture KW - data processing KW - data protection KW - tussle KW - socio-technical systems KW - broadband KW - global networks KW - interactive entertainment KW - cloud computing KW - procedural content generation KW - climate KW - carbon emissions KW - green KW - Internet evolution KW - wireless KW - technology forecasting KW - prognosticators KW - vision KW - tussle KW - socio-technical systems KW - broadband KW - global networks KW - information society KW - future ICT for sustainable growth KW - Internet of Things KW - open machine translation KW - intercultural collaboration KW - services computing KW - language grid KW - cloud computing KW - bottom of the pyramid KW - quant revolution KW - multinationals KW - knowledge-worker KW - profit-center KW - creation net KW - Software engineering KW - telecommunications ER - TY - JOUR TI - Individual variation in pheromone response correlates with reproductive traits and brain gene expression in worker honey bees AU - Kocher, S. D. AU - Ayroles, J. F. AU - Stone, E. A. AU - Grozinger, C. M. T2 - PLoS One DA - 2010/// PY - 2010/// VL - 5 IS - 2 ER - TY - JOUR TI - How internet users' privacy concerns have evolved since 2002 AU - Anton, A.I. AU - Earp, J.B. AU - Young, J.D. T2 - IEEE Security & Privacy Magazine AB - Internet privacy was the topic in this paper. A 2008 survey revealed that US Internet users' top three privacy concerns haven't changed since 2002, but privacy-related events might have influenced their level of concern within certain categories. The authors describe their results as well as the differences in privacy concerns between US and international respondents. They also mentioned that individuals have become more concerned about personalization in customized browsing experiences, monitored purchasing patterns, and targeted marketing and research. DA - 2010/1// PY - 2010/1// DO - 10.1109/msp.2010.38 VL - 8 IS - 1 SP - 21-27 J2 - IEEE Secur. Privacy Mag. OP - SN - 1540-7993 UR - http://dx.doi.org/10.1109/msp.2010.38 DB - Crossref ER - TY - JOUR TI - Global registration of overlapping images using accumulative image features AU - Krish, Karthik AU - Heinrich, Stuart AU - Snyder, Wesley E. AU - Cakir, Halil AU - Khorram, Siamak T2 - PATTERN RECOGNITION LETTERS AB - This paper introduces a new feature-based image registration technique which registers images by finding rotation- and scale-invariant features and matching them using a novel feature matching algorithm based on an evidence accumulation process reminiscent of the generalized Hough transform. Once feature correspondence has been established, the transformation parameters are then estimated using non-linear least squares (NLLS) and the standard RANSAC (random sample consensus) algorithm. The technique is evaluated under similarity transforms – translation, rotation and scale (zoom) and also under illumination changes. DA - 2010/1/15/ PY - 2010/1/15/ DO - 10.1016/j.patrec.2009.09.016 VL - 31 IS - 2 SP - 112-118 SN - 1872-7344 KW - Image registration KW - Feature matching KW - Accumulator-based methods KW - Feature correspondence KW - Evidence accumulation ER - TY - JOUR TI - Evaluating existing security and privacy requirements for legal compliance AU - Massey, Aaron K. AU - Otto, Paul N. AU - Hayward, Lauren J. AU - Anton, Annie I. T2 - REQUIREMENTS ENGINEERING DA - 2010/3// PY - 2010/3// DO - 10.1007/s00766-009-0089-5 VL - 15 IS - 1 SP - 119-137 SN - 1432-010X KW - Security requirements KW - Privacy requirements KW - Legal compliance KW - Refactoring requirements ER - TY - JOUR TI - A new multi-tier adaptive military MANET security protocol using hybrid cryptography and signcryption AU - Yavuz, A. A. AU - Alagoz, F. AU - Anarim, E. T2 - Turkish Journal of Electrical Engineering and Computer Sciences DA - 2010/// PY - 2010/// VL - 18 IS - 1 SP - 1-21 ER - TY - JOUR TI - A high-throughput de novo sequencing approach for shotgun proteomics using high-resolution tandem mass spectrometry AU - Pan, C. AU - Park, B. H. AU - McDonald, W. H. AU - Carey, P. A. AU - Banfield, J. F. AU - VerBerkmoes, N. C. AU - Hettich, R. L. AU - Samatova, N. F. T2 - BMC Bioinformatics DA - 2010/// PY - 2010/// VL - 11 ER - TY - JOUR TI - The effect of marine isoprene emissions on secondary organic aerosol and ozone formation in the coastal United States AU - Gantt, B. AU - Meskhidze, N. AU - Zhang, Y. AU - Xu, J. T2 - Atmospheric Environment AB - The impact of marine isoprene emissions on summertime surface concentrations of isoprene, secondary organic aerosols (SOA), and ozone (O3) in the coastal areas of the continental United States is studied using the U.S. Environmental Protection Agency regional-scale Community Multiscale Air Quality (CMAQ) modeling system. Marine isoprene emission rates are based on the following five parameters: laboratory measurements of isoprene production from phytoplankton under a range of light conditions, remotely-sensed chlorophyll-a concentration ([Chl–a]), incoming solar radiation, surface wind speed, and sea-water optical properties. Model simulations show that marine isoprene emissions are sensitive to meteorology and ocean ecosystem productivity, with the highest rates simulated over the Gulf of Mexico. Simulated offshore surface layer marine isoprene concentration is less than 10 ppt and significantly dwarfed by terrestrial emissions over the continental United States. With the isoprene reactions included in this study, the average contribution of marine isoprene to SOA and O3 concentrations is predicted to be small, up to 0.004 μg m−3 for SOA and 0.2 ppb for O3 in coastal urban areas. The light-sensitivity of isoprene production from phytoplankton results in a midday maximum for marine isoprene emissions and a corresponding daytime increase in isoprene and O3 concentrations in coastal locations. The potential impact of the daily variability in [Chl-a] on O3 and SOA concentrations is simulated in a sensitivity study with [Chl-a] increased and decreased by a factor of five. Our results indicate that marine emissions of isoprene cause minor changes to coastal SOA and O3 concentrations. Comparison of model simulations with few available measurements shows that the model underestimates marine boundary layer isoprene concentration. This underestimation is likely due to the limitations in current treatment of marine isoprene emission and a coarse spatial resolution used in the model simulations. DA - 2010/// PY - 2010/// DO - 10.1016/j.atmosenv.2009.08.027 VL - 44 IS - 1 SP - 115-121 ER - TY - JOUR TI - Modelling the Appearance and Behaviour of Urban Spaces AU - Vanegas, C. A. AU - Aliaga, D. G. AU - Wonka, P. AU - Mueller, P. AU - Waddell, P. AU - Watson, B. T2 - COMPUTER GRAPHICS FORUM AB - Abstract Urban spaces consist of a complex collection of buildings, parcels, blocks and neighbourhoods interconnected by streets. Accurately modelling both the appearance and the behaviour of dense urban spaces is a significant challenge. The recent surge in urban data and its availability via the Internet has fomented a significant amount of research in computer graphics and in a number of applications in urban planning, emergency management and visualization. In this paper, we seek to provide an overview of methods spanning computer graphics and related fields involved in this goal. Our paper reports the most prominent methods in urban modelling and rendering, urban visualization and urban simulation models. A reader will be well versed in the key problems and current solution methods. DA - 2010/// PY - 2010/// DO - 10.1111/j.1467-8659.2009.01535.x VL - 29 IS - 1 SP - 25-42 SN - 1467-8659 KW - urban modelling KW - procedural modelling KW - visualization KW - computer graphics ER - TY - JOUR TI - An empirical study on the maintenance of source code clones AU - Thummalapenta, S. AU - Cerulo, L. AU - Aversano, L. AU - Di Penta, M. T2 - Empirical Software Engineering DA - 2010/// PY - 2010/// VL - 15 IS - 1 SP - 1-34 ER - TY - JOUR TI - Normative Multiagent Systems: Guest Editors' Introduction AU - Boella, Guido AU - Pigozzi, Gabriella AU - Singh, Munindar P. AU - Verhagen, Harko T2 - LOGIC JOURNAL OF THE IGPL AB - Journal Article Normative Multiagent Systems: Guest Editors’ Introduction Get access Guido Boella, Guido Boella Dipartimento di Informatica, Universita' degli Studi di Torino, Corso Svizzera, 185I-10149 Torino, Italy Search for other works by this author on: Oxford Academic Google Scholar Gabriella Pigozzi, Gabriella Pigozzi Indvidual and Collective Reasoning, Computer Science and Communication (CSC), University of Luxembourg 6, rue R. Coudenhove Kalergi, L-1359 Luxembourg, Luxembourg Search for other works by this author on: Oxford Academic Google Scholar Munindar P. Singh, Munindar P. Singh Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, USA Search for other works by this author on: Oxford Academic Google Scholar Harko Verhagen Harko Verhagen Department of Computer and Systems Sciences, Stockholm University, Forum 100 SE-16440, SwedenE-mail: verhagen@dsv.su.se Search for other works by this author on: Oxford Academic Google Scholar Logic Journal of the IGPL, Volume 18, Issue 1, February 2010, Pages 1–3, https://doi.org/10.1093/jigpal/jzp079 Published: 29 January 2010 DA - 2010/2// PY - 2010/2// DO - 10.1093/jigpal/jzp079 VL - 18 IS - 1 SP - 1-3 SN - 1367-0751 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-77957233460&partnerID=MN8TOARS ER -