TY - CONF TI - UiRef: analysis of sensitive user inputs in Android applications AU - Andow, Benjamin AU - Acharya, Akhil AU - Li, Dengfeng AU - Enck, William AU - Singh, Kapil AU - Xie, Tao T2 - ACM C2 - 2017/// C3 - Proceedings of the 10th ACM Conference on Security and Privacy in Wireless and Mobile Networks DA - 2017/// SP - 23-34 ER - TY - CHAP TI - Reliable Ad Hoc Smartphone Application Creation for End Users AU - Nadkarni, Adwait AU - Verma, Akash AU - Tendulkar, Vasant AU - Enck, William T2 - Intrusion Detection and Prevention for Mobile Ecosystems PY - 2017/// SP - 65-98 PB - CRC Press Taylor & Francis Group, 6000 Broken Sound Parkway NW, Suite 300 … ER - TY - JOUR TI - Phonion: Practical Protection of Metadata in Telephony Networks AU - Heuser, Stephan AU - Reaves, Bradley AU - Pendyala, Praveen Kumar AU - Carter, Henry AU - Dmitrienko, Alexandra AU - Enck, William AU - Kiyavash, Negar AU - Sadeghi, Ahmad-Reza AU - Traynor, Patrick T2 - Proceedings on Privacy Enhancing Technologies DA - 2017/// PY - 2017/// VL - 2017 IS - 1 SP - 170-187 ER - TY - CONF TI - Analysis of SEAndroid Policies: Combining MAC and DAC in Android AU - Chen, Haining AU - Li, Ninghui AU - Enck, William AU - Aafer, Yousra AU - Zhang, Xiangyu T2 - ACM C2 - 2017/// C3 - Proceedings of the 33rd Annual Computer Security Applications Conference DA - 2017/// SP - 553-565 ER - TY - CONF TI - SPOKE: Scalable Knowledge Collection and Attack Surface Analysis of Access Control Policy for Security Enhanced Android AU - Wang, Ruowen AU - Azab, Ahmed M AU - Enck, William AU - Li, Ninghui AU - Ning, Peng AU - Chen, Xun AU - Shen, Wenbo AU - Cheng, Yueqiang T2 - ACM C2 - 2017/// C3 - Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security DA - 2017/// SP - 612-624 ER - TY - JOUR TI - Policy by Example: An Approach for Security Policy Specification AU - Nadkarni, Adwait AU - Enck, William AU - Jha, Somesh AU - Staddon, Jessica T2 - arXiv preprint arXiv:1707.03967 DA - 2017/// PY - 2017/// ER - TY - CONF TI - A Study of Security Vulnerabilities on Docker Hub AU - Shu, Rui AU - Gu, Xiaohui AU - Enck, William T2 - ACM C2 - 2017/// C3 - Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy DA - 2017/// SP - 269-280 ER - TY - CONF TI - Security developer studies with github users: Exploring a convenience sample AU - Acar, Yasemin AU - Stransky, Christian AU - Wermke, Dominik AU - Mazurek, Michelle AU - Fahl, Sascha T2 - USENIX Association C2 - 2017/// C3 - USENIX Symposium on Usable Privacy and Security (SOUPS) 2017 DA - 2017/// SP - 81-95 ER - TY - CONF TI - Lessons learned from using an online platform to conduct large-scale, online controlled security experiments with software developers AU - Stransky, Christian AU - Acar, Yasemin AU - Nguyen, Duc Cuong AU - Wermke, Dominik AU - Kim, Doowon AU - Redmiles, Elissa M AU - Backes, Michael AU - Garfinkel, Simson AU - Mazurek, Michelle L AU - Fahl, Sascha C2 - 2017/// C3 - 10th USENIX Workshop on Cyber Security Experimentation and Test (CSET 17) DA - 2017/// ER - TY - CONF TI - Developers need support, too: A survey of security advice for software developers AU - Acar, Yasemin AU - Stransky, Christian AU - Wermke, Dominik AU - Weir, Charles AU - Mazurek, Michelle L AU - Fahl, Sascha T2 - IEEE C2 - 2017/// C3 - 2017 IEEE Cybersecurity Development (SecDev) DA - 2017/// SP - 22-26 ER - TY - CONF TI - A stitch in time: Supporting android developers in writing secure code AU - Nguyen, Duc Cuong AU - Wermke, Dominik AU - Acar, Yasemin AU - Backes, Michael AU - Weir, Charles AU - Fahl, Sascha T2 - ACM C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security DA - 2017/// SP - 1065-1077 ER - TY - JOUR TI - Identifying Student Communities in Blended Courses AU - Gitinabard, Niki AU - Lynch, Collin F AU - Heckman, Sarah AU - Barnes, Tiffany T2 - arXiv preprint arXiv:1710.04129 DA - 2017/// PY - 2017/// ER - TY - CONF TI - Deconstructing the Discussion Forum: Student Questions and Computer Science Learning AU - Vellukunnel, Mickey AU - Buffum, Philip AU - Boyer, Kristy Elizabeth AU - Forbes, Jeffrey AU - Heckman, Sarah AU - Mayer-Patel, Ketan T2 - ACM C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education DA - 2017/// SP - 603-608 ER - TY - JOUR TI - Conversations (oral history interviews) with members of North Carolina State University Computer Science Department by Carol Lee and Carolyn Miller AU - Bahler, Dennis AU - Battestilli, Lina AU - DeMaria, Mark AU - Healey, Christopher AU - Heckman, Sarah AU - Heil, Margaret AU - Lester, James AU - Mott, Bradford AU - Mealin, Sean AU - Novitsky, Melissa AU - others DA - 2017/// PY - 2017/// ER - TY - CONF TI - My Digital Hand: A Tool for Scaling Up One-to-One Peer Teaching in Support of Computer Science Learning AU - Smith, Aaron J AU - Boyer, Kristy Elizabeth AU - Forbes, Jeffrey AU - Heckman, Sarah AU - Mayer-Patel, Ketan T2 - ACM C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education DA - 2017/// SP - 549-554 ER - TY - CONF TI - Designing Empirical Education Research Studies (DEERS): Creating an Answerable Research Question AU - Heckman, Sarah AU - Carver, Jeffrey C AU - Sherriff, Mark T2 - ACM C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education DA - 2017/// SP - 737-737 ER - TY - JOUR TI - A Social Network Analysis on Blended Courses AU - Gitinabard, Niki AU - Xue, Linting AU - Lynch, Collin F AU - Heckman, Sarah AU - Barnes, Tiffany T2 - arXiv preprint arXiv:1709.10215 DA - 2017/// PY - 2017/// ER - TY - CONF TI - Test suite parallelization in open-source projects: a study on its usage and impact AB - Dealing with high testing costs remains an important problem in Software Engineering. Test suite parallelization is an important approach to address this problem. This paper reports our findings on the usage and impact of test suite parallelization in open-source projects. It provides recommendations to practitioners and tool developers to speed up test execution. Considering a set of 468 popular Java projects we analyzed, we found that 24% of the projects contain costly test suites but parallelization features still seem underutilized in practice - only 19.1% of costly projects use parallelization. The main reported reason for adoption resistance was the concern to deal with concurrency issues. Results suggest that, on average, developers prefer high predictability than high performance in running tests. C2 - 2017/// C3 - Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, ASE 2017, Urbana, IL, USA, October 30 - November 03, 2017 DA - 2017/// DO - 10.1109/ASE.2017.8115695 SP - 838-848 UR - https://doi.org/10.1109/ASE.2017.8115695 ER - TY - CONF TI - Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, ASE 2017, Urbana, IL, USA, October 30 - November 03, 2017 A2 - Rosu, Grigore A2 - Penta, Massimiliano Di A2 - Nguyen, Tien N. C2 - 2017/// DA - 2017/// PB - IEEE Computer Society UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8106906 ER - TY - CONF TI - Balancing soundness and efficiency for practical testing of configurable systems AU - Souto, Sabrina AU - d’Amorim, Marcelo AU - Gheyi, Rohit AB - Testing configurable systems is important and challenging due to the enormous space of configurations where errors can hide. Existing approaches to test these systems are often costly or unreliable. This paper proposes S-SPLat, a technique that combines heuristic sampling with symbolic search to obtain both breadth and depth in the exploration of the configuration space. S-SPLat builds on SPLat, our previously developed technique, that explores all reachable configurations from tests. In contrast to its predecessor, S-SPLat sacrifices soundness in favor of efficiency. We evaluated our technique on eight software product lines of various sizes and on a large configurable system - GCC. Considering the results for GCC, S-SPLat was able to reproduce all five bugs that we previously found in a previous study with SPLat but much faster and it was able to find two new bugs in a recent release of GCC. Results suggest that it is preferable to use a combination of simple heuristics to drive the symbolic search as opposed to a single heuristic. S-SPLat and our experimental infrastructure are publicly available. C2 - 2017/// C3 - Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, Buenos Aires, Argentina, May 20-28, 2017 DA - 2017/// DO - 10.1109/ICSE.2017.64 SP - 632-642 UR - https://doi.org/10.1109/ICSE.2017.64 ER - TY - JOUR TI - Time-Space Efficient Regression Testing for Configurable Systems AU - Souto, Sabrina AU - d’Amorim, Marcelo T2 - CoRR DA - 2017/// PY - 2017/// VL - abs/1702.03457 UR - http://arxiv.org/abs/1702.03457 ER - TY - CONF TI - Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, Buenos Aires, Argentina, May 20-28, 2017 A2 - Sebasti\’a C2 - 2017/// DA - 2017/// PB - IEEE / ACM UR - http://dl.acm.org/citation.cfm?id=3097368 ER - TY - CONF TI - Prevalence of Single-Fault Fixes and Its Impact on Fault Localization AU - Perez, Alexandre AU - Abreu, Rui AU - d’Amorim, Marcelo AB - Several fault predictors were proposed in the context of Spectrum-based Fault Localization approaches to rank software components in order of suspiciousness of being the root-cause of observed failures. Previous work has also shown that some of the fault predictors (near-)optimally rank software components, provided that there is one fault in the system. Despite this, further work is being spent on creating more complex, computationally expensive, model-based techniques that can handle multiple-faulted scenarios accurately. However, our hypothesis is that when software is being developed, bugs arise one-at-a-time and therefore can be considered as single-faulted scenarios. We describe an approach to mine repositories, find bug-fixes, and catalog them according to the number of faults they fix, to assess the prevalence of single-fault fixes. Our empirical study using 279 open-source projects reveals that there is a prevalence of single-fault fixes, with over 82% of all fixes only eliminating one bug from the system, enabling the use of simpler, (near-)optimal, fault predictors. Moreover, we draw on the practical implications of our findings to influence and set direction for future research. C2 - 2017/// C3 - 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, March 13-17, 2017 DA - 2017/// DO - 10.1109/ICST.2017.9 SP - 12-22 UR - https://doi.org/10.1109/ICST.2017.9 ER - TY - JOUR TI - Preface AU - Xie, Tao AU - Cai, Yuanfang AU - Liu, Xuanzhe AU - Wang, Xiaoyin AU - Acharya, Mithun P. AU - d’Amorim, Marcelo AU - Ma, Xiaoxing T2 - J. Comput. Sci. Technol. DA - 2017/// PY - 2017/// DO - 10.1007/s11390-017-1782-3 VL - 32 IS - 6 SP - 1057-1059 UR - https://doi.org/10.1007/s11390-017-1782-3 ER - TY - CONF TI - 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, March 13-17, 2017 C2 - 2017/// DA - 2017/// PB - IEEE Computer Society UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7922464 ER - TY - CONF TI - Energy-Efficient Multi-Core Scheduling for Real-Time DAG Tasks AU - Guo, Zhishan AU - Bhuiyan, Ashikahmed AU - Saifullah, Abusayeed AU - Guan, Nan AU - Xiong, Haoyi T2 - 29th Euromicro Conference on Real-Time Systems (ECRTS) C2 - 2017/6// C3 - Proceedings of the 29th Euromicro Conference on Real-Time Systems (ECRTS) CY - Dubrovnik, Croatia DA - 2017/6// PY - 2017/6// ER - TY - RPRT TI - Regarding the Optimality of Speedup Bounds of Mixed-Criticality Schedulability Tests AU - Guo, Zhishan DA - 2017/3// PY - 2017/3// M1 - 17131 M3 - Dagstuhl Seminar SN - 17131 ER - TY - RPRT TI - Guaranteeing some service upon mode switch in mixed-criticality systems AU - Guo, Zhishan DA - 2017/3// PY - 2017/3// M1 - 17131 M3 - Dagstuhl Seminar SN - 17131 UR - https://www.ece.ucf.edu/~zsguo/pubs/conference_workshop/Dagstuhl17131.pdf ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - ER - TY - JOUR TI - Near-Optimal Incentive Allocation for Piggyback Crowdsensing AU - Xiong, Haoyi AU - Zhang, Daqing AU - Guo, Zhishan AU - Chen, Guanling AU - Barnes, Laura E. T2 - IEEE Communications Magazine AB - Piggyback crowdsensing (PCS) is a novel energy-efficient mobile crowdsensing paradigm that reduces the energy consumption of crowdsensing tasks by leveraging smartphone app opportunities (SAOs). This article, based on several fundamental assumptions of incentive payment for PCS task participation and spatial-temporal coverage assessment for collected sensor data, first proposes two alternating data collection goals. Goal 1 is maximizing overall spatial-temporal coverage under a predefined incentive budget constraint; goal 2 is minimizing total incentive payment while ensuring predefined spatial-temporal coverage for collected sensor data, all on top of the PCS task model. With all of the above assumptions, settings, and models, we introduce CrowdMind - a generic incentive allocation framework for the two optimal data collection goals, on top of the PCS model. We evaluated CrowdMind extensively using a large-scale real-world SAO dataset for the two incentive allocation problems. The results demonstrate that compared to baseline algorithms, CrowdMind achieves better spatial-temporal coverage under the same incentive budget constraint, while costing less in total incentive payments and ensuring the same spatial-temporal coverage, under various coverage/incentive settings. Further, a short theoretical analysis is presented to analyze the performance of CrowdMind in terms of the optimization with total incentive cost and overall spatial-temporal coverage objectives/constraints. DA - 2017/// PY - 2017/// DO - 10.1109/mcom.2017.1600748 VL - 55 IS - 6 SP - 120-125 J2 - IEEE Commun. Mag. OP - SN - 0163-6804 UR - http://dx.doi.org/10.1109/mcom.2017.1600748 DB - Crossref ER - TY - JOUR TI - General principles for a Generalized Idea Garden AU - Jernigan, William AU - Horvath, Amber AU - Lee, Michael AU - Burnett, Margaret AU - Cuilty, Taylor AU - Kuttal, Sandeep AU - Peters, Anicia AU - Kwan, Irwin AU - Bahmani, Faezeh AU - Ko, Amy AU - Mendez, Christopher J. AU - Oleson, Alannah T2 - Journal of Visual Languages & Computing AB - Many systems are designed to help novices who want to learn programming, but few support those who are not necessarily interested in learning programming. This paper targets the subset of end-user programmers (EUPs) in this category. We present a set of principles on how to help EUPs like this learn just a little when they need to overcome a barrier. We then instantiate the principles in a prototype and empirically investigate them in three studies: a formative think-aloud study, a pair of summer camps attended by 42 teens, and a third summer camp study featuring a different environment attended by 48 teens. Finally, we present a generalized architecture to facilitate the inclusion of Idea Gardens into other systems, illustrating with examples from Idea Garden prototypes. Results have been very encouraging. For example, under our principles, Study #2’s camp participants required significantly less in-person help than in a previous camp to learn the same amount of material in the same amount of time. DA - 2017/4// PY - 2017/4// DO - 10.1016/j.jvlc.2017.04.005 VL - 39 SP - 51-65 J2 - Journal of Visual Languages & Computing LA - en OP - SN - 1045-926X UR - http://dx.doi.org/10.1016/j.jvlc.2017.04.005 DB - Crossref ER - TY - JOUR TI - Publicly verifiable boolean query over outsourced encrypted data AU - Jiang, Shunrong AU - Zhu, Xiaoyan AU - Guo, Linke AU - Liu, Jianqing T2 - IEEE Transactions on Cloud Computing DA - 2017/// PY - 2017/// VL - 7 IS - 3 SP - 799-813 ER - TY - CONF TI - Communication through symbol silence: Towards free control messages in indoor wlans AU - Feng, Bing AU - Liu, Jianqing AU - Zhang, Chi AU - Fang, Yuguang T2 - IEEE C2 - 2017/// C3 - 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) DA - 2017/// SP - 880-888 ER - TY - CONF TI - An anonymous and accountable authentication scheme for Wi-Fi hotspot access with the Bitcoin blockchain AU - Niu, Yukun AU - Wei, Lingbo AU - Zhang, Chi AU - Liu, Jianqing AU - Fang, Yuguang T2 - IEEE C2 - 2017/// C3 - 2017 IEEE/CIC International Conference on Communications in China (ICCC) DA - 2017/// SP - 1-6 ER - TY - CONF TI - Being even slightly shallow makes life hard AU - Muzi, I. AU - O’Brien, M.P. AU - Reidl, F. AU - Sullivan, B.D. AB - We study the computational complexity of identifying dense substructures, namely r/2-shallow topological minors and r-subdivisions. Of particular interest is the case r = 1, when these substructures correspond to very localized relaxations of subgraphs. Since Densest Subgraph can be solved in polynomial time, we ask whether these slight relaxations also admit efficient algorithms. In the following, we provide a negative answer: Dense r/2-Shallow Topological Minor and Dense r-Subdivsion are already NP-hard for r = 1 in very sparse graphs. Further, they do not admit algorithms with running time 2^(o(tw^2)) n^O(1) when parameterized by the treewidth of the input graph for r > 2 unless ETH fails. C2 - 2017/// C3 - Leibniz International Proceedings in Informatics, LIPIcs DA - 2017/// DO - 10.4230/LIPIcs.MFCS.2017.79 VL - 83 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85038445465&partnerID=MN8TOARS ER - TY - CONF TI - A fast parameterized algorithm for Co-Path Set AU - Sullivan, B.D. AU - Van Der Poel, A. AB - The k-CO-PATH SET problem asks, given a graph G and a positive integer k, whether one can delete k edges from G so that the remainder is a collection of disjoint paths. We give a linear-time, randomized fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET, significantly improving the previously best known O^*(2.17^k) of Feng, Zhou, and Wang (2015). Our main tool is a new O^*(4^{tw(G)}) algorithm for CO-PATH SET using the Cut&Count framework, where tw(G) denotes treewidth. In general graphs, we combine this with a branching algorithm which refines a 6k-kernel into reduced instances, which we prove have bounded treewidth. C2 - 2017/// C3 - Leibniz International Proceedings in Informatics, LIPIcs DA - 2017/// DO - 10.4230/LIPIcs.IPEC.2016.28 VL - 63 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85014712605&partnerID=MN8TOARS ER - TY - CONF TI - Asymptotic analysis of equivalences and core-structures in kronecker-style graph models C2 - 2017/// C3 - Proceedings - IEEE International Conference on Data Mining, ICDM DA - 2017/// DO - 10.1109/ICDM.2016.81 SP - 829-834 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85014525949&partnerID=MN8TOARS ER - TY - JOUR TI - Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework AU - Goodrich, T.D. AU - Sullivan, B.D. AU - Humble, T.S. T2 - arXiv DA - 2017/// PY - 2017/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85095056109&partnerID=MN8TOARS ER - TY - JOUR TI - Being even slightly shallow makes life hard AU - Muzi, I. AU - O’Brien, M.P. AU - Reidl, F. AU - Sullivan, B.D. T2 - arXiv DA - 2017/// PY - 2017/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85094429786&partnerID=MN8TOARS ER - TY - JOUR TI - An experimental evaluation of a bounded expansion algorithmic pipeline AU - O’Brien, M.P. AU - Sullivan, B.D. T2 - arXiv DA - 2017/// PY - 2017/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85092949285&partnerID=MN8TOARS ER - TY - JOUR TI - A practical fpt algorithm for flow decomposition and transcript assembly AU - Kloster, K. AU - Kuinke, P. AU - O’Brien, M.P. AU - Reidl, F. AU - Villaamil, F.S. AU - Sullivan, B.D. AU - Van Der Poel, A. T2 - arXiv DA - 2017/// PY - 2017/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85094353595&partnerID=MN8TOARS ER - TY - JOUR TI - Walk entropy and walk-regularity AU - Kloster, K. AU - Král, D. AU - Sullivan, B.D. T2 - arXiv DA - 2017/// PY - 2017/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85094268676&partnerID=MN8TOARS ER - TY - CONF TI - What does that ?-Block do? Learning latent causal affordances from mario play traces AU - Summeryille, A. AU - Behrooz, M. AU - Mateas, M. AU - Jhala, A. C2 - 2017/// C3 - AAAI Workshop - Technical Report DA - 2017/// VL - WS-17-01 - WS-17-15 SP - 991-998 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85031928570&partnerID=MN8TOARS ER - TY - CONF TI - Modeling social interestingness in conversational stories AU - Behrooz, M. AU - Jhala, A. AB - Telling stories about our daily lives is one of the most ubiquitous, consequential and seamless ways in which we socialize. Current narrative generation methods mostly require specification of a priori knowledge or comprehensive domain models, which are not generalizable across contexts. Hence, such approaches do not lend themselves well to new and unpredictable domains of observation and interaction, in which social stories usually occur. In this paper, we describe a methodology for categorizing event descriptions as being socially interesting. The event sequences are drawn from crowd-sourced Plot Graphs. The models include low-level natural language and higher-level features. The results from classification and regression tasks look promising overall, indicating that general metrics of social interestingness of stories could be modeled for sociable agents. C2 - 2017/// C3 - ACM International Conference Proceeding Series DA - 2017/// DO - 10.1145/3014812.3014880 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85014951330&partnerID=MN8TOARS ER - TY - CONF TI - Prom week meets Skyrim AU - Guimaraes, M. AU - Santos, P. AU - Jhala, A. C2 - 2017/// C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS DA - 2017/// VL - 3 SP - 1790-1792 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85046476949&partnerID=MN8TOARS ER - TY - CONF TI - CiF-CK: An architecture for social NPCS in commercial games AU - Guimaraes, M. AU - Santos, P. AU - Jhala, A. AB - We present and describe CiF-CK - a social agent architecture that models reasoning about persistent social interactions to improve narrative engagement and play experience for human interactors. The architecture is inspired by McCoy et al's Comme il-Faut (CiF) architecture that represented rich social interactions between agents that included emotions, social and relationship contexts, and longer term mood. The key contribution of this work is in adapting the richness of social interactions from CiF to a first-person interaction experience and a released distribution of its implementation on the Skyrim game engine. The released modification has been successful in the player community for the popular game. C2 - 2017/// C3 - 2017 IEEE Conference on Computational Intelligence and Games, CIG 2017 DA - 2017/// DO - 10.1109/CIG.2017.8080425 SP - 126-133 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85040013410&partnerID=MN8TOARS ER - TY - CONF TI - Prom week meets skyrim: Developing a social agent architecture in a commercial game AU - Guimaraes, M. AU - Santos, P. AU - Jhala, A. C2 - 2017/// C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS DA - 2017/// VL - 3 SP - 1562-1564 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85046418617&partnerID=MN8TOARS ER - TY - JOUR TI - An exploratory study of reliability of ranking vs. rating in peer assessment AU - Song, Yang AU - Guo, Yifan AU - Gehringer, Edward F. T2 - International Journal of Educational and Pedagogical Sciences DA - 2017/// PY - 2017/// DO - doi.org/10.5281/zenodo.1132399 VL - 11 IS - 10 ER - TY - RPRT TI - Two-stage Programming Projects: Individual Work Followed by Peer Collaboration AU - Battestilli, L. AU - Awasthi, A. A3 - North Carolina State University DA - 2017/// PY - 2017/// M1 - TR-2017-3 M3 - Technical report PB - North Carolina State University SN - TR-2017-3 ER - TY - CONF TI - The Value of Organized Study Groups in Large Classes AU - Battestilli, L. AU - Le, T. T2 - NCSU Teaching and Learning Symposium C2 - 2017/4/3/ CY - McKimmon Conference and Training Center, NC State University, Raleigh, NC DA - 2017/4/3/ PY - 2017/4/3/ ER - TY - SOUND TI - Complexity Classes and NP-Completeness AU - Yedida, R. DA - 2017/// PY - 2017/// ER - TY - JOUR TI - Automatically constructing training sets for electronic sentiment analysis AU - Devarajan, Ravinder AU - Benson, Jordan Riley AU - Caira, David James AU - Sethi, Saratendu AU - Cox, James Allen AU - Healey, Christopher G AU - Dinakaran, Gowtham AU - Padia, Kalpesh DA - 2017/7// PY - 2017/7// N1 - US Patent 9,704,097 RN - US Patent 9,704,097 ER - TY - JOUR TI - 3D face recognition in the Fourier domain using deformed circular curves AU - Lee, Deokwoo AU - Krim, Hamid T2 - Multidimensional Systems and Signal Processing DA - 2017/1// PY - 2017/1// DO - 10.1007/S11045-015-0334-7 VL - 28 IS - 1 SP - 105–127 SN - 0923-6082 1573-0824 UR - http://dx.doi.org/10.1007/S11045-015-0334-7 KW - Face recognition KW - Classification KW - Deformed circular curves KW - Geodesic distance KW - Fourier Transform KW - Dimensionality reduction ER - TY - CHAP TI - Efficient Outlier Detection in Hyperedge Streams Using MinHash and Locality-Sensitive Hashing AU - Ranshous, Stephen AU - Chaudhary, Mandar AU - Samatova, Nagiza F. T2 - Complex Networks & Their Applications VI. COMPLEX NETWORKS 2017 A2 - Cherifi, C. A2 - Cherifi, H. A2 - Karsai, M. A2 - Musolesi, M. T3 - Studies in Computational Intelligence AB - Mining outliers in graph data is a rapidly growing area of research. Traditional methods focus either on static graphs, or restrict relationships to be pairwise. In this work we address both of these limitations directly, and propose the first approach for mining outliers in hyperedge streams. Hyperedges, which generalize edges, faithfully capture higher order relationships that naturally occur in complex systems. Our model annotates every incoming hyperedge with an outlier score, which is based on the incident vertices and the historical relationships among them. Additionally, we describe an approximation scheme that ensures our model is suitable for being run in streaming environments. Experimental results on several real-world datasets show our model effectively identifies outliers, and that our approximation provides speedups between 33–775x. PY - 2017/11/27/ DO - 10.1007/978-3-319-72150-7_9 SP - 105–116 PB - Springer International Publishing SN - 9783319721491 9783319721507 SV - 689 UR - http://dx.doi.org/10.1007/978-3-319-72150-7_9 ER - TY - CHAP TI - A Community-Driven Graph Partitioning Method for Constraint-Based Causal Discovery AU - Chaudhary, Mandar S. AU - Ranshous, Stephen AU - Samatova, Nagiza F. T2 - Complex Networks & Their Applications VI. COMPLEX NETWORKS 2017 A2 - Cherifi, C. A2 - Cherifi, H. A2 - Karsai, M. A2 - Musolesi, M. T3 - Studies in Computational Intelligence AB - Constraint-based (CB) methods are widely used for discovering causal relationships in observational data. The PC-stable algorithm is a prominent example of CB methods. A critical component of the PC-stable algorithm is to find d-separators and perform conditional independence (CI) tests to eliminate spurious causal relationships. While the pairwise CI tests are necessary for identifying causal relationships, the error rate, where true causal relationships are erroneously removed, increases with the number of tests performed. Efficiently searching for the true d-separator set is thus a critical component to increase the accuracy of the causal graph. To this end, we propose a novel recursive algorithm for constructing causal graphs, based on a two-phase divide and conquer strategy. In phase one, we recursively partition the undirected graph using community detection, and subsequently construct partial skeletons from each partition. Phase two uses a bottom-up approach to merge the subgraph skeletons, ultimately yielding the full causal graph. Simulations on several real-world data sets show that our approach effectively finds the d-separators, leading to a significant improvement in the quality of causal graphs. PY - 2017/11/27/ DO - 10.1007/978-3-319-72150-7_21 SP - 253–264 PB - Springer International Publishing SN - 9783319721491 9783319721507 SV - 689 UR - http://dx.doi.org/10.1007/978-3-319-72150-7_21 ER - TY - CONF TI - Blending tools for a Smooth Introduction to 3D Geovisualization AU - Tateosian, L. AU - Tabrizian, P. T2 - IEEE VIS: Visualization & Visual Analytics C2 - 2017/10// C3 - Pedagogy of Data Visualization Workshop (PDVW) CY - Phoenix, AZ DA - 2017/10// PY - 2017/10/1/ ER - TY - CHAP TI - Software-level task scheduling on GPUs AU - Wu, B. AU - Shen, X. T2 - Advances in GPU Research and Practice AB - Task scheduling is critical for exploiting the full power of multicore processors such as graphics processing units (GPUs). Unlike central processing units, GPUs do not provide necessary APIs for the programmers or compilers to use to control scheduling. On the contrary, the hardware scheduler on modern GPUs makes flexible task scheduling difficult. This chapter presents a compiler and runtime framework with the capability to automatically transform and optimize GPU programs to enable controllable task scheduling to the streaming multiprocessors (SMs). At the center of the framework is SM-centric transformation, which addresses the complexities of the hardware scheduler and provides the scheduling capability. The framework presents many opportunities for new optimizations, of which this chapter presents three: parallelism, locality, and processor partitioning. We show in extensive experiments that the optimizations can substantially improve the performance of a set of GPU programs in multiple scenarios. PY - 2017/// DO - 10.1016/b978-0-12-803738-6.00004-5 SP - 83-103 OP - PB - Elsevier SN - 9780128037386 UR - http://dx.doi.org/10.1016/b978-0-12-803738-6.00004-5 DB - Crossref ER - TY - CHAP TI - Data placement on GPUs AU - Shen, X. AU - Wu, B. T2 - Advances in GPU Research and Practice AB - Modern graphics processing unit (GPU) memory systems consist of a number of components with different properties. How data are placed on the various memory components often causes a significant difference in a program’s performance. This chapter discusses the complexity of GPU memory systems and describes a software framework named PORPLE to show how to automatically resolve the complexity for a given GPU program. PY - 2017/// DO - 10.1016/b978-0-12-803738-6.00005-7 SP - 105-123 OP - PB - Elsevier SN - 9780128037386 UR - http://dx.doi.org/10.1016/b978-0-12-803738-6.00005-7 DB - Crossref ER - TY - CONF TI - The Antecedents of and Associations with Elective Replay in An Educational Game: Is Replay Worth It? AU - Liu, Zhongxiu AU - Cody, Christa AU - Barnes, Tiffany AU - Lynch, Collin AU - Rutherford, Teomara T2 - International Conference on Educational Data Mining (EDM) C2 - 2017/// C3 - Educational Data Mining (EDM2017) CY - Wuhan, China DA - 2017/// PY - 2017/6/25/ ER - TY - CHAP TI - Intelligent Pedagogical Agents AU - Matsuda, N. T2 - Encyclopedia of Artificial Intelligence A2 - Matsubara, Hitoshi PY - 2017/// SP - 1152-1153 PB - Japan Society of Artificial Intelligence ER - TY - CHAP TI - Instructional Strategy AU - Matsuda, N. T2 - Encyclopedia of Artificial Intelligence A2 - Matsubara, Hitoshi PY - 2017/// SP - 1157-1159 PB - Japan Society of Artificial Intelligence ER - TY - CHAP TI - Natural language processing in educational systems AU - Matsuda, N. T2 - Encyclopedia of Artificial Intelligence A2 - Matsubara, Hitoshi PY - 2017/// SP - 1101 PB - Society of Artificial Intelligence ER - TY - CONF TI - Supporting Ruled Polygons AU - Cavanna, Nicholas J. AU - Khoury, Marc AU - Sheehy, Donald R. T2 - Canadian Conference in Computational Geometry C2 - 2017/// C3 - CCCG: The Canadian Conference in Computational Geometry CY - Ottawa, Ontario DA - 2017/// PY - 2017/7/26/ ER - TY - CONF TI - Engineering Socially Intelligent Personal Agents via Norms AU - Ajmeri, Nirav A2 - Larson, Kate A2 - Winikoff, Michael A2 - Das, Sanmay A2 - Durfee, Edmund H. C2 - 2017/5/1/ C3 - Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS) DA - 2017/5/1/ SP - 1822-1823 PB - International Foundation for Autonomous Agents and MultiAgent Systems UR - https://research-information.bris.ac.uk/en/publications/a57d9424-afc0-4e03-a80f-991adf4697c5 N1 - Doctoral Consortium RN - Doctoral Consortium ER - TY - CONF TI - Arnor: Modeling Social Intelligence via Norms to Engineer Privacy-Aware Personal Agents AU - Ajmeri, Nirav AU - Guo, Hui AU - Murukannaiah, Pradeep K. AU - Singh, Munindar P. C2 - 2017/5/1/ C3 - Proceedings of the 16th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS) DA - 2017/5/1/ SP - 230-238 PB - International Foundation for Autonomous Agents and MultiAgent Systems UR - https://research-information.bris.ac.uk/en/publications/1abb3707-460c-4cf4-aba0-fefca322f6d8 ER - TY - CONF TI - Evaluation of a Data-driven Feedback Algorithm for Open-ended Programming AU - Price, Thomas AU - Zhi, Rui AU - Barnes, Tiffany T2 - International Conference on Educational Data Mining (EDM) C2 - 2017/// C3 - Educational Data Mining (EDM2017) CY - Wuhan, China DA - 2017/// PY - 2017/6/25/ ER - TY - CONF TI - Interactive narrative personalization with deep reinforcement learning AU - Wang, P. AU - Rowe, J. AU - Min, W. AU - Mott, B. AU - Lester, J. C2 - 2017/// C3 - IJCAI International Joint Conference on Artificial Intelligence DA - 2017/// SP - 3852-3858 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85031928990&partnerID=MN8TOARS ER - TY - CONF TI - Simulating player behavior for data-driven interactive narrative personalization AU - Wang, P. AU - Rowe, J. AU - Min, W. AU - Mott, B. AU - Lester, J. C2 - 2017/// C3 - Proceedings of the 13th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2017 DA - 2017/// SP - 255-261 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85055706729&partnerID=MN8TOARS ER - TY - CONF TI - Multimodal goal recognition in open-world digital games AU - Min, W. AU - Mott, B. AU - Rowe, J. AU - Taylor, R. AU - Wiebe, E. AU - Boyer, K.E. AU - Lester, J. C2 - 2017/// C3 - Proceedings of the 13th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2017 DA - 2017/// SP - 80-86 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85051737443&partnerID=MN8TOARS ER - TY - CONF TI - Deep LSTM-based goal recognition models for open-world digital games AU - Min, W. AU - Mott, B. AU - Rowe, J. AU - Lester, J. C2 - 2017/// C3 - AAAI Workshop - Technical Report DA - 2017/// VL - WS-17-01 - WS-17-15 SP - 851-858 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85046086839&partnerID=MN8TOARS ER - TY - CONF TI - A pathway to strengthening support for Beauty and Joy of Computing teachers AU - Subramaniam, Meghana AU - Cateté, Veronica AB - Computer science education in high school is fundamental for increasing the diversity in computing majors at a university level. However, computer science is not often taught in America before university, and usually, the professionals who teach it are not trained experts in computer science concepts and terminology. In this paper, we introduce a new style of coding rubric, which allows teachers to better understand the fundamentals of the course being taught. In the scope of this research, we focus solely on the Beauty and Joy of Computing, an AP Computer Science Principles course. Coding assignments were collected from two groups of students, and assignments were graded and compiled by raters. After being rated, the rubrics were modified to be better adapted to teachers' expectations. C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education DA - 2017/// DO - 10.1145/3017680.3022458 SP - 779-780 PB - ACM UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85018296964&partnerID=MN8TOARS ER - TY - THES TI - A Framework for the Rapid Creation of Quality-Assured Programming Rubrics for New K-12 Computer Science Teachers. AU - Catete, Veronica Meredith DA - 2017/// PY - 2017/// PB - North Carolina State University ER - TY - CONF TI - Type-based Semantic Optimization for Scalable RDF Graph Pattern Matching AB - Scalable query processing relies on early and aggressive determination and pruning of query-irrelevant data. Besides the traditional space-pruning techniques such as indexing, type-based optimizations that exploit integrity constraints defined on the types can be used to rewrite queries into more efficient ones. However, such optimizations are only applicable in strongly-typed data and query models which make it a challenge for semi-structured models such as RDF. Consequently, developing techniques for enabling typebased query optimizations will contribute new insight to improving the scalability of RDF processing systems. C2 - 2017/4/3/ C3 - Proceedings of the 26th International Conference on World Wide Web DA - 2017/4/3/ DO - 10.1145/3038912.3052655 UR - http://dx.doi.org/10.1145/3038912.3052655 ER - TY - JOUR TI - QoS-Aware and Reliable Traffic Steering for Service Function Chaining in Mobile Networks T2 - IEEE Journal on Selected Areas in Communications AB - The ever-increasing mobile traffic has inspired deployment of capacity and performance enhancing network services within mobile networks. Owing to recent advances in network function virtualization, such network services can be flexibly and cost-efficiently deployed in the mobile network as software components, avoiding the need for costly hardware deployment. Nevertheless, this complicates network planning by bringing the need for service function chaining. In this paper, we study mobile network planning through a software-defined approach, considering both quality-of-service and reliability of different classes of traffic. We define and formulate the traffic steering problem for service function chaining in mobile networks, which turns out to be NP-hard. We then develop a fast approximation scheme for the problem, and evaluate its performance via extensive simulation experiments. The results show that our algorithm is near-optimal, and achieves much better performance compared with baseline algorithms. DA - 2017/11// PY - 2017/11// DO - 10.1109/jsac.2017.2760158 UR - http://dx.doi.org/10.1109/jsac.2017.2760158 KW - Software-defined networking KW - mobile networks KW - service function chaining KW - quality-of-service KW - reliability ER - TY - JOUR TI - Countermeasures Against False-Name Attacks on Truthful Incentive Mechanisms for Crowdsourcing T2 - IEEE Journal on Selected Areas in Communications AB - The proliferation of crowdsourcing brings both opportunities and challenges in various fields, such as environmental monitoring, healthcare, and so on. Often, the collaborative efforts from a large crowd of users are needed in order to complete crowdsourcing jobs. In recent years, the design of crowdsourcing incentive mechanisms has drawn much interest from the research community, where auction is one of the commonly adopted mechanisms. However, few of these auctions consider the robustness against false-name attacks (a.k.a. sybil attacks), where dishonest users generate fake identities to increase their utilities without devoting more efforts. To provide countermeasures against such attacks, we have designed a Truthful Auction with countermeasures against False-name Attacks (TAFA) as an auction-based incentive mechanism for crowdsourcing. We prove that TAFA is truthful, individually rational, budget-balanced, and computationally efficient. We also prove that TAFA provides countermeasures against false-name attacks, such that each user is better off not generating any false name. Extensive performance evaluations are conducted and the results further confirm our theoretical analysis. DA - 2017/2// PY - 2017/2// DO - 10.1109/jsac.2017.2659229 UR - http://dx.doi.org/10.1109/jsac.2017.2659229 KW - Game theory KW - crowdsourcing KW - incentive mechanism KW - false-name proofness KW - truthfulness ER - TY - CONF TI - Survivable and bandwidth-guaranteed embedding of virtual clusters in cloud data centers AB - Cloud computing has emerged as a powerful and elastic platform for internet service hosting, yet it also draws concerns of the unpredictable performance of cloud-based services due to network congestion. To offer predictable performance, the virtual cluster abstraction of cloud services has been proposed, which enables allocation and performance isolation regarding both computing resources and network bandwidth in a simplified virtual network model. One issue arisen in virtual cluster allocation is the survivability of tenant services against physical failures. Existing works have studied virtual cluster backup provisioning with fixed primary embeddings, but have not considered the impact of primary embeddings on backup resource consumption. To address this issue, in this paper we study how to embed virtual clusters survivably in the cloud data center, by jointly optimizing primary and backup embeddings of the virtual clusters. We formally define the survivable virtual cluster embedding problem. We then propose a novel algorithm, which computes the most resource-efficient embedding given a tenant request. Since the optimal algorithm has high time complexity, we further propose a faster heuristic algorithm, which is several orders faster than the optimal solution, yet able to achieve similar performance. Besides theoretical analysis, we evaluate our algorithms via extensive simulations. C2 - 2017/5// C3 - IEEE INFOCOM 2017 - IEEE Conference on Computer Communications DA - 2017/5// DO - 10.1109/infocom.2017.8056945 UR - http://dx.doi.org/10.1109/infocom.2017.8056945 ER - TY - CONF TI - Robust Incentive Tree Design for Mobile Crowdsensing AB - With the proliferation of smart mobile devices (smart phone, tablet, and wearable), mobile crowdsensing becomes a powerful sensing and computation paradigm. It has been put into application in many fields, such as spectrum sensing, environmental monitoring, healthcare, and so on. Driven by promising incentives, the power of the crowd grants crowdsensing an advantage in mobilizing users who perform sensing tasks with the embedded sensors on the smart devices. Auction is one of the commonly adopted crowdsensing incentive mechanisms to incentivize users for participation. However, it does not consider the incentive for user solicitation, where in crowdsensing, such incentive would ease the tension when there is a lack of crowdsensing users. To deal with this issue, we aim to design an auction-based incentive tree to offer rewards to users for both participation and solicitation. Meanwhile, we want the incentive mechanism to be robust against dishonest behavior such as untruthful bidding and sybil attacks, to eliminate malicious price manipulations. We design RIT as a Robust Incentive Tree mechanism for mobile crowdsensing which combines the advantages of auctions and incentive trees. We prove that RIT is truthful and sybil-proof with probability at least H, for any given H in (0,1). We also prove that RIT satisfies individual rationality, computational efficiency, and solicitation incentive. Simulation results of RIT further confirm our analysis. C2 - 2017/6// C3 - 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) DA - 2017/6// DO - 10.1109/icdcs.2017.145 UR - http://dx.doi.org/10.1109/icdcs.2017.145 KW - Crowdsensing KW - Mobile Networks KW - Wireless Networks KW - Incentive Mechanism KW - Sybil-proofness KW - Truthfulness ER - TY - CONF TI - An Approach to QoS-based Task Distribution in Edge Computing Networks for IoT Applications AB - Internet of Things (IoT) is emerging as part of thn infrastructures for advancing a large variety of applications involving connection of many intelligent devices, leading to smart communities. Due to the severe limitation on the computing resources of IoT devices, it is common to off load tasks of various applications requiring substantial computing resources to computing systems with sufficient computing resources, such as servers, cloud systems, and/or data centers for processing. However, the off loading method suffers from the difficulties of high latency and network congestion in the IoT infrastructures. Recently edge computing has emerged to reduce the negative impacts of these difficulties. Yet, edge computing has its drawbacks, such as the limited computing resources of some edge computing devices and the unbalanced load among these devices. In order to effectively explore the potential of edge computing to support IoT applications,it is necessary to have efficient task management in edge computing networks. In this paper, an approach is presented to periodically distributing incoming tasks in the edge computing network so that the number of tasks, which can be processed in the edge computing network, is increased, and the quality of-service (QoS) requirements of the tasks completed in the edge computing network are satisfied. Simulation results are presented to show the improvement of using this approach on the increase of the number of tasks to be completed in the edge computing network. C2 - 2017/6// C3 - 2017 IEEE International Conference on Edge Computing (EDGE) DA - 2017/6// DO - 10.1109/ieee.edge.2017.50 UR - http://dx.doi.org/10.1109/ieee.edge.2017.50 KW - computing KW - task distribution KW - quality-of-service KW - IoT applications ER - TY - JOUR TI - The Critical Network Flow Problem: Migratability and Survivability T2 - IEEE/ACM Transactions on Networking AB - We propose a new network abstraction, termed critical network flow, which models the bandwidth requirement of modern Internet applications and services. A critical network flow defines a conventional flow in a network with explicit requirement on its aggregate bandwidth, or the flow value as commonly termed. Unlike common bandwidth-guaranteed connections whose bandwidth is only guaranteed during normal operations, a critical network flow demands strictly enforced bandwidth guarantee during various transient network states, such as network reconfiguration or network failures. Such a demand is called the bandwidth criticality of a critical network flow, which is characterized both by its flow value and capability to satisfy bandwidth guarantee in the transient states.We study algorithmic solutions to the accommodation of critical network flows with different bandwidth criticalities, including the basic case with no transient network state considered, the case with network reconfiguration, and the case with survivability against link failures. We present a polynomial-time optimal algorithm for each case. For the survivable case, we further present a faster heuristic algorithm. We have conducted extensive experiments to evaluate our model and validate our algorithms. DA - 2017/12// PY - 2017/12// DO - 10.1109/tnet.2017.2747588 UR - http://dx.doi.org/10.1109/tnet.2017.2747588 KW - Critical network flow KW - traffic engineering KW - bandwidth guarantee KW - flow migration KW - survivability ER - TY - CHAP TI - Adaptively Indistinguishable Garbled Circuits AU - Jafargholi, Zahra AU - Scafuro, Alessandra AU - Wichs, Daniel T2 - Theory of Cryptography AB - A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. An adaptively secure scheme allows the adversary to specify the input x after seeing the garbled circuit. Applebaum et al. (CRYPTO ’13) showed that in any garbling scheme with adaptive simulation-based security, the size of the garbled input must exceed the output size of the circuit. Here we show how to circumvent this lower bound and achieve significantly better efficiency under the minimal assumption that one-way functions exist by relaxing the security notion from simulation-based to indistinguishability-based. We rely on the recent work of Hemenway et al. (CRYPTO ’16) which constructed an adaptive simulation-based garbling scheme under one-way functions. The size of the garbled input in their scheme is as large as the output size of the circuit plus a certain pebble complexity of the circuit, where the latter is (e.g.,) bounded by the space complexity of the computation. By building on top of their construction and adapting their proof technique, we show how to remove the output size dependence in their result when considering indistinguishability-based security. As an application of the above result, we get a symmetric-key functional encryption based on one-way functions, with indistinguishability-based security where the adversary can obtain an unbounded number of function secret keys and then adaptively a single challenge ciphertext. The size of the ciphertext only depends on the maximal pebble complexity of each of the functions but not on the number of functions or their circuit size. PY - 2017/// DO - 10.1007/978-3-319-70503-3_2 SP - 40-71 OP - PB - Springer International Publishing SN - 9783319705026 9783319705033 UR - http://dx.doi.org/10.1007/978-3-319-70503-3_2 DB - Crossref ER - TY - CHAP TI - Server-Aided Secure Computation with Off-line Parties AU - Baldimtsi, Foteini AU - Papadopoulos, Dimitrios AU - Papadopoulos, Stavros AU - Scafuro, Alessandra AU - Triandopoulos, Nikos T2 - Computer Security – ESORICS 2017 AB - Online social networks (OSNs) allow users to jointly compute on each other’s data (e.g., profiles, geo-locations, etc.). Privacy issues naturally arise in this setting due to the sensitive nature of the exchanged information. Ideally, nothing about a user’s data should be revealed to the OSN provider or non-friends, and even her friends should only learn the output of a specific computation. A natural approach for achieving these strong privacy guarantees is via secure multi-party computation (MPC). However, existing MPC-based approaches do not capture two key properties of OSN setting: Users does not need to be online while their friends query the OSN server on their data; and, once uploaded, user’s data can be repeatedly queried by the server on behalf of user’s friends. In this work, we present two concrete MPC constructions that achieve these properties. The first is an adaptation of garbled circuits that converts inputs under different keys to ones under the same key, and the second is based on 2-party mixed protocols and involves a novel 2-party re-encryption module. Using state- of-the-art cryptographic tools, we provide a proof-of-concept implementation of our schemes for two concrete use cases, overall validating their efficiency and efficacy in protecting privacy in OSNs. PY - 2017/// DO - 10.1007/978-3-319-66402-6_8 SP - 103-123 OP - PB - Springer International Publishing SN - 9783319664019 9783319664026 UR - http://dx.doi.org/10.1007/978-3-319-66402-6_8 DB - Crossref ER - TY - JOUR TI - TMAP: Discovering relevant API methods through text mining of API documentation AU - Pandita, Rahul AU - Jetley, Raoul AU - Sudarsan, Sithu AU - Menzies, Timothy AU - Williams, Laurie T2 - Journal of Software: Evolution and Process AB - Abstract Developers often migrate their applications to support various platform/programming‐language application programming interfaces (APIs) to retain existing users and to attract new users. To migrate an application written using 1 API (source) to another API (target), a developer must know how the methods in the source API map to the methods in the target API. Given that a typical platform or language exposes a large number of API methods, manually discovering API mappings is prohibitively resource‐intensive and may be error prone. The goal of this research is to support software developers in migrating an application from a source API to a target API by automatically discovering relevant method mappings across APIs using text mining on the natural language API method descriptions. This paper proposes text mining based approach (TMAP) to discover relevant API mappings. To evaluate our approach, we used TMAP to discover API mappings for 15 classes across (1) Java and C# API; and (2) Java ME and Android API. We compared the discovered mappings with state‐of‐the‐art source code analysis‐based approaches: Rosetta and StaMiner. Our results indicate that TMAP on average found relevant mappings for 56% and 57% more methods compared to the Rosetta and the StaMiner approaches, respectively. DA - 2017/2/20/ PY - 2017/2/20/ DO - 10.1002/SMR.1845 VL - 29 IS - 12 SP - e1845 J2 - J Softw Evol Proc LA - en OP - SN - 2047-7473 UR - http://dx.doi.org/10.1002/SMR.1845 DB - Crossref KW - API documents KW - API mappings KW - text mining ER - TY - CHAP TI - A Comparisons of BKT, RNN and LSTM for Learning Gain Prediction AU - Lin, Chen AU - Chi, Min T2 - Lecture Notes in Computer Science AB - The objective of this study is to develop effective computational models that can predict student learning gains, preferably as early as possible. We compared a series of Bayesian Knowledge Tracing (BKT) models against vanilla RNNs and Long Short Term Memory (LSTM) based models. Our results showed that the LSTM-based model achieved the highest accuracy and the RNN based model have the highest F1-measure. Interestingly, we found that RNN can achieve a reasonably accurate prediction of student final learning gains using only the first 40% of the entire training sequence; using the first 70% of the sequence would produce a result comparable to using the entire sequence. PY - 2017/// DO - 10.1007/978-3-319-61425-0_58 SP - 536-539 OP - PB - Springer International Publishing SN - 9783319614243 9783319614250 UR - http://dx.doi.org/10.1007/978-3-319-61425-0_58 DB - Crossref KW - LSTM KW - RNN KW - BKT KW - Learning gain prediction ER - TY - CHAP TI - Stimulus Control for Semi-autonomous Computer Canine-Training AU - Majikes, John J. AU - Yuschak, Sherrie AU - Walker, Katherine AU - Brugarolas, Rita AU - Mealin, Sean AU - Foster, Marc AU - Bozkurt, Alper AU - Sherman, Barbara AU - Roberts, David L. T2 - Biomimetic and Biohybrid Systems AB - For thousands of years, humans have domesticated and trained dogs to perform tasks for them. Humans have developed areas of study, such as Applied Behavior Analysis, which aim to improve the training process. We introduce a semi-autonomous, canine-training system by combining existing research in Applied Behavior Analysis with computer systems consisting of hardware, software, audio, and visual components. These components comprise a biohybrid system capable of autonomously training a dog to perform a specific behavior on command. In this paper we further our previous computer canine-training system by the application of stimulus control over a newly-acquired, free operant behavior. This system uses light and sound as a discriminative stimulus for the behavior of a dog pushing a button with its nose. Indications of simple stimulus control of this behavior were achieved. Our pilot of this system indicates canine learning comparable to that from a professional dog trainer. PY - 2017/// DO - 10.1007/978-3-319-63537-8_24 SP - 279-290 OP - PB - Springer International Publishing SN - 9783319635361 9783319635378 UR - http://dx.doi.org/10.1007/978-3-319-63537-8_24 DB - Crossref ER - TY - CHAP TI - Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph AU - Ranshous, Stephen AU - Joslyn, Cliff A. AU - Kreyling, Sean AU - Nowak, Kathleen AU - Samatova, Nagiza F. AU - West, Curtis L. AU - Winters, Samuel T2 - Financial Cryptography and Data Security AB - Bitcoin exchanges operate between digital and fiat currency networks, thus providing an opportunity to connect real-world identities to pseudonymous addresses, an important task for anti-money laundering efforts. We seek to characterize, understand, and identify patterns centered around exchanges in the context of a directed hypergraph model for Bitcoin transactions. We introduce the idea of motifs in directed hypergraphs, considering a particular 2-motif as a potential laundering pattern. We identify distinct statistical properties of exchange addresses related to the acquisition and spending of bitcoin. We then leverage this to build classification models to learn a set of discriminating features, and are able to predict if an address is owned by an exchange with $$>80\%$$ accuracy using purely structural features of the graph. Applying this classifier to the 2-motif patterns reveals a preponderance of inter-exchange activity, while not necessarily significant laundering patterns. PY - 2017/// DO - 10.1007/978-3-319-70278-0_16 SP - 248-263 OP - PB - Springer International Publishing SN - 9783319702773 9783319702780 UR - http://dx.doi.org/10.1007/978-3-319-70278-0_16 DB - Crossref ER - TY - CHAP TI - Differentially Private K-Skyband Query Answering Through Adaptive Spatial Decomposition AU - Chen, Ling AU - Yu, Ting AU - Chirkova, Rada T2 - Data and Applications Security and Privacy XXXI AB - Given a set of multi-dimensional points, a $$k$$ -skyband query retrieves those points dominated by no more than k other points. $$k$$ -skyband queries are an important type of multi-criteria analysis with diverse applications in practice. In this paper, we investigate techniques to answer $$k$$ -skyband queries with differential privacy. We first propose a general technique BBS-Priv, which accepts any differentially private spatial decomposition tree as input and leverages data synthesis to answer $$k$$ -skyband queries privately. We then show that, though quite a few private spatial decomposition trees are proposed in the literature, they are mainly designed to answer spatial range queries. Directly integrating them with BBS-Priv would introduce too much noise to generate useful $$k$$ -skyband results. To address this problem, we propose a novel spatial decomposition technique k-skyband tree specially optimized for k-skyband queries, which partitions data adaptively based on the parameter k. We further propose techniques to generate a k-skyband tree over spatial data that satisfies differential privacy, and combine BBS-Priv with the private k-skyband tree to answer $$k$$ -skyband queries. We conduct extensive experiments based on two real-world datasets and three synthetic datasets that are commonly used for evaluating $$k$$ -skyband queries. The results show that the proposed scheme significantly outperforms existing differentially private spatial decomposition schemes and achieves high utility when privacy budgets are properly allocated. PY - 2017/// DO - 10.1007/978-3-319-61176-1_8 SP - 142-163 OP - PB - Springer International Publishing SN - 9783319611754 9783319611761 UR - http://dx.doi.org/10.1007/978-3-319-61176-1_8 DB - Crossref KW - k-skyband query KW - Differential privacy KW - Adaptive spatial decomposition ER - TY - CHAP TI - Lessons Learned: Visualizing Cyber Situation Awareness in a Network Security Domain AU - Healey, Christopher G. AU - Hao, Lihua AU - Hutchinson, Steve E. T2 - Theory and Models for Cyber Situation Awareness AB - This chapter discusses lesson learned working with cyber situation awareness and network security domain experts to integrate visualizations into their current workflows. Working closely with network security experts, we discovered a critical set of requirements that a visualization must meet to be considered for use by the these domain experts. We next present two separate examples of visualizations that address these requirements: a flexible web-based application that visualizes network traffic and security data through analyst-driven correlated charts and graphs, and a set of ensemble-based extensions to visualize network traffic and security alerts using existing and future ensemble visualization algorithms. PY - 2017/// DO - 10.1007/978-3-319-61152-5_3 SP - 47-65 OP - PB - Springer International Publishing SN - 9783319611518 9783319611525 UR - http://dx.doi.org/10.1007/978-3-319-61152-5_3 DB - Crossref ER - TY - CHAP TI - Balancing Learning and Engagement in Game-Based Learning Environments with Multi-objective Reinforcement Learning AU - Sawyer, Robert AU - Rowe, Jonathan AU - Lester, James T2 - Lecture Notes in Computer Science AB - Game-based learning environments create rich learning experiences that are both effective and engaging. Recent years have seen growing interest in data-driven techniques for tutorial planning, which dynamically personalize learning experiences by providing hints, feedback, and problem scenarios at run-time. In game-based learning environments, tutorial planners are designed to adapt gameplay events in order to achieve multiple objectives, such as enhancing student learning or student engagement, which may be complementary or competing aims. In this paper, we introduce a multi-objective reinforcement learning framework for inducing game-based tutorial planners that balance between improving learning and engagement in game-based learning environments. We investigate a model-based, linear-scalarized multi-policy algorithm, Convex Hull Value Iteration, to induce a tutorial planner from a corpus of student interactions with a game-based learning environment for middle school science education. Results indicate that multi-objective reinforcement learning creates policies that are more effective at balancing multiple reward sources than single-objective techniques. A qualitative analysis of select policies and multi-objective preference vectors shows how a multi-objective reinforcement learning framework shapes the selection of tutorial actions during students’ game-based learning experiences to effectively achieve targeted learning and engagement outcomes. PY - 2017/// DO - 10.1007/978-3-319-61425-0_27 SP - 323-334 OP - PB - Springer International Publishing SN - 9783319614243 9783319614250 UR - http://dx.doi.org/10.1007/978-3-319-61425-0_27 DB - Crossref KW - Tutorial planning KW - Multi-objective reinforcement learning KW - Game-based learning environments KW - Narrative centered learning ER - TY - CHAP TI - Affect Dynamics in Military Trainees Using vMedic: From Engaged Concentration to Boredom to Confusion AU - Ocumpaugh, Jaclyn AU - Andres, Juan Miguel AU - Baker, Ryan AU - DeFalco, Jeanine AU - Paquette, Luc AU - Rowe, Jonathan AU - Mott, Bradford AU - Lester, James AU - Georgoulas, Vasiliki AU - Brawner, Keith AU - Sottilare, Robert T2 - Lecture Notes in Computer Science AB - The role of affect in learning has received increasing attention from AIED researchers seeking to understand how emotion and cognition interact in learning contexts. The dynamics of affect over time have been explored in a variety of research environments, allowing researchers to determine the extent to which common patterns are captured by hypothesized models. This paper present an analysis of affect dynamics among learners using vMedic, which teaches combat medicine protocols as part of the military training at West Point, the United States Military Academy. In doing so, we seek both to broaden the variety of learning contexts being explored in order better understand differences in these patterns and to test the theoretical predictions on the development of affect over time. PY - 2017/// DO - 10.1007/978-3-319-61425-0_20 SP - 238-249 OP - PB - Springer International Publishing SN - 9783319614243 9783319614250 UR - http://dx.doi.org/10.1007/978-3-319-61425-0_20 DB - Crossref ER - TY - CHAP TI - Computer-Aided Human Centric Cyber Situation Awareness AU - Albanese, Massimiliano AU - Cooke, Nancy AU - Coty, González AU - Hall, David AU - Healey, Christopher AU - Jajodia, Sushil AU - Liu, Peng AU - McNeese, Michael D. AU - Ning, Peng AU - Reeves, Douglas AU - Subrahmanian, V. S. AU - Wang, Cliff AU - Yen, John T2 - Theory and Models for Cyber Situation Awareness AB - In this chapter, we provide an overview of Cyber Situational Awareness, an emerging research area in the broad field of cyber security, and discuss, at least at a high level, how to gain Cyber Situation Awareness. Our discussion focuses on answering the following questions: What is Cyber Situation Awareness? Why is research needed? What are the current research objectives and inspiring scientific principles? Why should one take a multidisciplinary approach? How could one take an end-to-end holistic approach? What are the future research directions? PY - 2017/// DO - 10.1007/978-3-319-61152-5_1 SP - 3-25 OP - PB - Springer International Publishing SN - 9783319611518 9783319611525 UR - http://dx.doi.org/10.1007/978-3-319-61152-5_1 DB - Crossref ER - TY - CHAP TI - Cost Analysis Comparing HPC Public Versus Private Cloud Computing AU - Dreher, Patrick AU - Nair, Deepak AU - Sills, Eric AU - Vouk, Mladen T2 - Communications in Computer and Information Science AB - The past several years have seen a rapid increase in the number and type of public cloud computing hardware configurations and pricing options offered to customers. In addition public cloud providers have also expanded the number and type of storage options and established incremental price points for storage and network transmission of outbound data from the cloud facility. This has greatly complicated the analysis to determine the most economical option for moving general purpose applications to the cloud. This paper investigates whether this economic analysis for moving general purpose applications to the public cloud can be extended to more computationally intensive HPC type computations. Using an HPC baseline hardware configuration for comparison, the total cost of operations for several HPC private and public cloud providers are analyzed. The analysis shows under what operational conditions the public cloud option may be a more cost effective alternative for HPC type applications. PY - 2017/// DO - 10.1007/978-3-319-62594-2_15 SP - 294-316 OP - PB - Springer International Publishing SN - 9783319625935 9783319625942 UR - http://dx.doi.org/10.1007/978-3-319-62594-2_15 DB - Crossref KW - High performance cloud computing KW - Economic analysis KW - Public cloud KW - Private cloud ER - TY - JOUR TI - Network service orchestration in heterogeneous 5G networks using an open marketplace AU - Bhat, Shireesh AU - Udechukwu, Robinson AU - Dutta, Rudra AU - Rouskas, George N. T2 - IET Networks AB - Network service orchestration across heterogeneous networks needs an open marketplace where the services advertised by the providers in different domains can be purchased for short-term or long-term time scales. The authors present two design paradigms and evaluate two corresponding prototypes which provide a framework for network services to be purchased. They compare the two prototypes from the point of view of how effective they are in addressing some of the challenges posed by heterogeneous 5G networks namely programmability, scalability and innovation. They present a network service orchestration algorithm which is advertised as a network service in the marketplace. DA - 2017/11/1/ PY - 2017/11/1/ DO - 10.1049/IET-NET.2017.0058 VL - 6 IS - 6 SP - 149-156 LA - en OP - SN - 2047-4954 2047-4962 UR - http://dx.doi.org/10.1049/IET-NET.2017.0058 DB - Crossref ER - TY - CHAP TI - Is More Agency Better? The Impact of Student Agency on Game-Based Learning AU - Sawyer, Robert AU - Smith, Andy AU - Rowe, Jonathan AU - Azevedo, Roger AU - Lester, James T2 - Lecture Notes in Computer Science AB - Student agency has long been viewed as a critical element in game-based learning. Agency refers to the degree of freedom and control that a student has to perform meaningful actions in a learning environment. While long postulated to be central to student self-regulation, there is limited evidence on the design of game-based learning environments that promote student agency and its effect on learning. This paper reports on an experiment to investigate the impact of student agency on learning and problem-solving behavior in a game-based learning environment for microbiology. Students interacted with one of three versions of the system. In the High Agency condition, students could freely navigate the game’s 3D open-world environment and perform problem-solving actions in any order they chose. In the Low Agency condition, students were required to traverse the environment and solve the mystery in a prescribed partially ordered sequence. In the No Agency condition, students watched a video of an expert playing the game by following an “ideal path” for solving the problem scenario. Results indicate that students in the Low Agency condition achieved greater learning gains than students in both the High Agency and No Agency conditions, but exhibited more unproductive behaviors, suggesting that artfully striking a balance between high and low agency best supports learning. PY - 2017/// DO - 10.1007/978-3-319-61425-0_28 VL - 10331 LNAI SP - 335-346 OP - PB - Springer International Publishing SN - 9783319614243 9783319614250 UR - http://dx.doi.org/10.1007/978-3-319-61425-0_28 DB - Crossref KW - Game-based learning KW - Student agency KW - Problem-solving behavior ER - TY - CONF TI - Enhancing student models in game-based learning with facial expression recognition AU - Sawyer, R. AU - Smith, A. AU - Rowe, J. AU - Azevedo, R. AU - Lester, J. AB - Recent years have seen a growing recognition of the role that affect plays in learning. Because game-based learning environments elicit a wide range of student affective states, affect-enhanced student modeling for game-based learning holds considerable promise. This paper introduces an affect-enhanced student modeling framework that leverages facial expression tracking for game-based learning. The affect-enhanced student modeling framework was used to generate predictive models of student learning and student engagement for students who interacted with CRYSTAL ISLAND, a game-based learning environment for microbiology education. Findings from the study reveal that the affect-enhanced student models significantly outperform baseline predictive student models that utilize the same gameplay traces but do not use facial expression tracking. The study also found that models based on individual facial action coding units are more effective than composite emotion models. The findings suggest that introducing facial expression tracking can improve the accuracy of student models, both for predicting student learning gains and also for predicting student engagement. C2 - 2017/// C3 - UMAP 2017 - Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization DA - 2017/// DO - 10.1145/3079628.3079686 SP - 192-201 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85026767763&partnerID=MN8TOARS KW - Student Modeling KW - Affect KW - Game-based Learning ER - TY - BOOK TI - Regional cultural differences in how students customize their avatars in technology-enhanced learning AU - Yarzebinski, E. AU - Dumdumaya, C. AU - Rodrigo, M.M.T. AU - Matsuda, N. AU - Ogan, A. AB - As AIED systems with agents and avatars are used by students in different world regions, we expect students to prefer ones that look like them according to the Similarity Attraction Hypothesis. We investigate this effect via a system with a customizable avatar deployed in 2 US regions and 2 Philippines regions. We find that US students do customize as expected, while students in the Philippines tend to select names and hairstyles from outside their culture. These results show the need for more nuanced system design to tailor options for regional-level preferences. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-61425-0_73 VL - 10331 LNAI SE - 598-601 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85022225246&partnerID=MN8TOARS KW - Avatar KW - Personalized learning systems KW - Culture ER - TY - CONF TI - Investigating the effects of cognitive and metacognitive scaffolding on learners using a learning by teaching environment AU - Dumdumaya, C. AU - Banawan, M. AU - Rodrigo, Ma.M. AU - Ogan, A. AU - Yarzebinski, E. AU - Matsuda, N. C2 - 2017/// C3 - Proceedings of the 25th International Conference on Computers in Education, ICCE 2017 - Main Conference Proceedings DA - 2017/// SP - 1-10 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85051544348&partnerID=MN8TOARS ER - TY - CONF TI - Efficient support of position independence on non-volatile memory AU - Chen, Guoyang AU - Zhang, Lei AU - Budhiraja, Richa AU - Shen, Xipeng AU - Wu, Youfeng T2 - the 50th Annual IEEE/ACM International Symposium AB - This paper explores solutions for enabling efficient supports of position independence of pointer-based data structures on byte-addressable None-Volatile Memory (NVM). When a dynamic data structure (e.g., a linked list) gets loaded from persistent storage into main memory in different executions, the locations of the elements contained in the data structure could differ in the address spaces from one run to another. As a result, some special support must be provided to ensure that the pointers contained in the data structures always point to the correct locations, which is called position independence. C2 - 2017/// C3 - Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-50 '17 DA - 2017/// DO - 10.1145/3123939.3124543 PB - ACM Press SN - 9781450349529 UR - http://dx.doi.org/10.1145/3123939.3124543 DB - Crossref KW - Compiler KW - Program Optimizations KW - Programming Languages KW - NVM ER - TY - CONF TI - Versapipe AU - Zheng, Zhen AU - Oh, Chanyoung AU - Zhai, Jidong AU - Shen, Xipeng AU - Yi, Youngmin AU - Chen, Wenguang T2 - the 50th Annual IEEE/ACM International Symposium AB - Pipeline is an important programming pattern, while GPU, designed mostly for data-level parallel executions, lacks an efficient mechanism to support pipeline programming and executions. This paper provides a systematic examination of various existing pipeline execution models on GPU, and analyzes their strengths and weaknesses. To address their shortcomings, this paper then proposes three new execution models equipped with much improved controllability, including a hybrid model that is capable of getting the strengths of all. These insights ultimately lead to the development of a software programming framework named VersaPipe. With VersaPipe, users only need to write the operations for each pipeline stage. VersaPipe will then automatically assemble the stages into a hybrid execution model and configure it to achieve the best performance. Experiments on a set of pipeline benchmarks and a real-world face detection application show that VersaPipe produces up to 6.90X (2.88X on average) speedups over the original manual implementations. C2 - 2017/// C3 - Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-50 '17 DA - 2017/// DO - 10.1145/3123939.3123978 PB - ACM Press SN - 9781450349529 UR - http://dx.doi.org/10.1145/3123939.3123978 DB - Crossref KW - GPU KW - Pipelined Computing ER - TY - CONF TI - Egeria AU - Guan, Hui AU - Shen, Xipeng AU - Krim, Hamid T2 - the International Conference for High Performance Computing, Networking, Storage and Analysis AB - Achieving high performance on modern systems is challenging. Even with a detailed profile from a performance tool, writing or refactoring a program to remove its performance issues is still a daunting task for application programmers: it demands lots of program optimization expertise that is often system specific. C2 - 2017/// C3 - Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '17 DA - 2017/// DO - 10.1145/3126908.3126961 PB - ACM Press SN - 9781450351140 UR - http://dx.doi.org/10.1145/3126908.3126961 DB - Crossref KW - program optimization KW - high performance computing KW - natural language processing ER - TY - JOUR TI - GLORE: generalized loop redundancy elimination upon LER-notation AU - Ding, Yufei AU - Shen, Xipeng T2 - Proceedings of the ACM on Programming Languages AB - This paper presents GLORE, a novel approach to enabling the detection and removal of large-scoped redundant computations in nested loops. GLORE works on LER-notation, a new representation of computations in both regular and irregular loops. Together with a set of novel algorithms, it makes GLORE able to systematically consider computation reordering at both the expression level and the loop level in a unified manner. GLORE shows an applicability much broader than prior methods have, and frequently lowers the computational complexities of some nested loops that are elusive to prior optimization techniques, producing significantly larger speedups. DA - 2017/10/12/ PY - 2017/10/12/ DO - 10.1145/3133898 VL - 1 IS - OOPSLA SP - 1-28 J2 - Proc. ACM Program. Lang. LA - en OP - SN - 2475-1421 UR - http://dx.doi.org/10.1145/3133898 DB - Crossref KW - program optimization KW - loop redundancy elimination KW - operation minimization ER - TY - CONF TI - Sharing and Using Programming Log Data (Abstract Only) AU - Price, Thomas W. AU - Brown, Neil C.C. AU - Piech, Chris AU - Rivers, Kelly AB - As more programming environments add logging features and programming data becomes more accessible, it is important to have a conversation about how we share and use this data. Uses of programming log data range from big-picture analyses to dashboards for instant teacher feedback, to intelligent, data-driven learning environments. The goal of this BOF is to talk about what data is important to collect, where it can be gathered and shared, what general data formats make sense, how to handle privacy and anonymization, and what ultimately we want to see the data used for. The BOF welcomes both producers of programming log data and current or potential consumers, interested in how it could be applied in their classrooms or research. One hopeful outcome of this BOF is a commitment to documenting and sharing existing programming data in an accessible location and format. C2 - 2017/// C3 - Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education CY - New York, NY, USA DA - 2017/// DO - 10.1145/3017680.3022366 SP - 729 PB - Association for Computing Machinery UR - https://doi.org/10.1145/3017680.3022366 ER - TY - CONF TI - iSnap: Towards Intelligent Tutoring in Novice Programming Environments. AU - Price, Thomas AU - Dong, Yihuan AU - Lipovac, Dragan T2 - 2017 ACM SIGCSE Technical Symposium on Computer Science Education AB - Programming environments intentionally designed to support novices have become increasingly popular, and growing research supports their efficacy. While these environments offer features to engage students and reduce the burden of syntax errors, they currently offer little support to students who get stuck and need expert assistance. Intelligent Tutoring Systems (ITSs) are computer systems designed to play this role, helping and guiding students to achieve better learning outcomes. We present iSnap, an extension to the Snap programming environment which adds some key features of ITSs, including detailed logging and automatically generated hints. We share results from a pilot study of iSnap, indicating that students are generally willing to use hints and that hints can create positive outcomes. We also highlight some key challenges encountered in the pilot study and discuss their implications for future work. C2 - 2017/3// C3 - SIGCSE '17: Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education CY - Seattle, Washington DA - 2017/3// PY - 2017/3/8/ DO - 10.1145/3017680.3017762 SP - 483-488 PB - Association for Computing Machinery UR - http://dx.doi.org/10.1145/3017680.3017762 KW - Novice programming KW - Intelligent Tutoring Systems KW - Hints KW - Data-driven KW - Logging KW - Snap ER - TY - CONF TI - Tosca: Operationalizing Commitments Over Information Protocols AU - King, Thomas C. AU - Günay, Akın AU - Chopra, Amit K. AU - Singh, Munindar P. T2 - Twenty-Sixth International Joint Conference on Artificial Intelligence AB - The notion of commitment is widely studied as a high-level abstraction for modeling multiagent interaction. An important challenge is supporting flexible decentralized enactments of commitment specifications. In this paper, we combine recent advances on specifying commitments and information protocols. Specifically, we contribute Tosca, a technique for automatically synthesizing information protocols from commitment specifications. Our main result is that the synthesized protocols support commitment alignment, which is the idea that agents must make compatible inferences about their commitments despite decentralization. C2 - 2017/8// C3 - Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence DA - 2017/8// DO - 10.24963/ijcai.2017/37 PB - International Joint Conferences on Artificial Intelligence Organization SN - 9780999241103 UR - http://dx.doi.org/10.24963/ijcai.2017/37 DB - Crossref ER - TY - CONF TI - When and Why the Topological Coverage Criterion Works AU - Cavanna, Nicholas J. AU - Gardner, Kirk P. AU - Sheehy, Donald R. T2 - Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms AB - In their seminal work on homological sensor networks, de Silva and Ghrist showed the surprising fact that it's possible to certify the coverage of a coordinate-free sensor network even with very minimal knowledge of the space to be covered. Here, coverage means that every point in the domain (except possibly those very near the boundary) has a nearby sensor. More generally, their algorithm takes a pair of nested neighborhood graphs along with a labeling of vertices as either boundary or interior and computes the relative homology of a simplicial complex induced by the graphs. This approach, called the Topological Coverage Criterion (TCC), requires some assumptions about the underlying geometric domain as well as some assumptions about the relationship of the input graphs to the domain. The goal of this paper is to generalize these assumptions and show how the TCC can be applied to both much more general domains as well as very weak assumptions on the input. We give a new, simpler proof of the de Silva-Ghrist Topological Coverage Criterion that eliminates any assumptions about the smoothness of the boundary of the underlying space, allowing the results to be applied to much more general problems. The new proof factors the geometric, topological, and combinatorial aspects, allowing us to provide a coverage condition that supports thick boundaries, k-coverage, and weighted coverage, in which sensors have varying radii. C2 - 2017/1// C3 - Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms DA - 2017/1// DO - 10.1137/1.9781611974782.177 PB - Society for Industrial and Applied Mathematics SN - 9781611974782 UR - http://dx.doi.org/10.1137/1.9781611974782.177 DB - Crossref ER - TY - CONF TI - Application of the Delphi Method in Computer Science Principles Rubric Creation AU - Cateté, Veronica AU - Barnes, Tiffany T2 - the 2017 ACM Conference AB - Growing public demand for computer science (CS) education in K-12 schools requires an increase in well-qualified and well-supported computing teachers. To alleviate the lack of K-12 computing teachers, CS education researchers have focused on hosting professional development workshops to prepare in-service teachers from other disciplines to teach introductory level computing courses. In addition to the curriculum knowledge and pedagogical content knowledge taught in the professional development workshops, these new teachers need support in computer science subject matter knowledge throughout the school year. In particular, these new teachers find it difficult to grade programs and labs. This research study uses two variations of the Delphi Method to create learning-oriented rubrics for Computer Science Principles teachers using the Beauty and Joy of Computing curriculum. To perform this study we implemented (1) a heavy-weight, heterogeneous wide-net Delphi, and (2) a lower-weight, homogeneous Delphi composed of master teachers. These methods resulted in the creation of two systematically- and rigorously-created rubrics that produce consistent grading and very similar inter-rater reliabilities. C2 - 2017/// C3 - Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education - ITiCSE '17 DA - 2017/// DO - 10.1145/3059009.3059042 VL - Part F128680 SP - 164-169 PB - ACM Press SN - 9781450347044 UR - http://dx.doi.org/10.1145/3059009.3059042 DB - Crossref KW - BJC KW - AP CS Principles KW - Rubrics KW - Evaluation KW - Delphi Method ER - TY - CONF TI - Using Serious Game Analytics to Inform Digital Curricular Sequencing AU - Peddycord-Liu, Zhongxiu AU - Cody, Christa AU - Kessler, Sarah AU - Barnes, Tiffany AU - Lynch, Collin F. AU - Rutherford, Teomara T2 - the Annual Symposium AB - This paper applied serious game analytics to inform digital curricular sequencing in a longitude, curriculum-integrated math game, ST Math. When integrating serious games into classrooms, teachers may have the flexibility to change the order of math objectives for student groups to play. However, it is unclear how teacher decisions, as well as the sequencing of the original curricular order affect students. Moreover, few researchers have applied data-driven methods to inform content ordering in educational games, where the nature of educational content and student behaviors are different from many e-learning platforms. In this paper, we present a novel method that suggests curricular sequencing based on the prediction relationship between math objectives. Our results include specific design recommendations for ST Math, and general data-driven insights for digital curricular design, such as the pacing of objectives and the ordering of math concepts. Our method can potentially be applied to data from a wide range of games and digital learning platforms, enabling developers to better understand how to sequence educational content. C2 - 2017/// C3 - Proceedings of the Annual Symposium on Computer-Human Interaction in Play - CHI PLAY '17 DA - 2017/// DO - 10.1145/3116595.3116620 PB - ACM Press SN - 9781450348980 UR - http://dx.doi.org/10.1145/3116595.3116620 DB - Crossref KW - Serious Games KW - Serious Game Analytics KW - Digital Curricular ER - TY - JOUR TI - Splee: A Declarative Information-Based Language for Multiagent Interaction Protocols T2 - AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS DA - 2017/// PY - 2017/// UR - https://publons.com/publon/21294377/ ER - TY - JOUR TI - SoSharP: Recommending Sharing Policies in Multiuser Privacy Scenarios T2 - IEEE Internet Computing AB - Users often share information about others; sometimes this inadvertently violates others' privacy. Thus, here the authors propose SoSharP, an agent-based approach to help users maintain their own and others' privacy by guiding a selection of sharing policies in multiuser scenarios. SoSharP learns incrementally and asks for users' input only when required, reducing users' effort. DA - 2017/// PY - 2017/// DO - 10.1109/MIC.2018.326150611 UR - https://publons.com/publon/21294370/ ER - TY - JOUR TI - How Good is a Security Policy against Real Breaches? A HIPAA Case Study T2 - Proceedings - International Conference on Software Engineering AB - Policy design is an important part of software development. As security breaches increase in variety, designing a security policy that addresses all potential breaches becomes a nontrivial task. A complete security policy would specify rules to prevent breaches. Systematically determining which, if any, policy clause has been violated by a reported breach is a means for identifying gaps in a policy. Our research goal is to help analysts measure the gaps between security policies and reported breaches by developing a systematic process based on semantic reasoning. We propose SEMAVER, a framework for determining coverage of breaches by policies via comparison of individual policy clauses and breach descriptions. We represent a security policy as a set of norms. Norms (commitments, authorizations, and prohibitions) describe expected behaviors of users, and formalize who is accountable to whom and for what. A breach corresponds to a norm violation. We develop a semantic similarity metric for pairwise comparison between the norm that represents a policy clause and the norm that has been violated by a reported breach. We use the US Health Insurance Portability and Accountability Act (HIPAA) as a case study. Our investigation of a subset of the breaches reported by the US Department of Health and Human Services (HHS) reveals the gaps between HIPAA and reported breaches, leading to a coverage of 65%. Additionally, our classification of the 1,577 HHS breaches shows that 44% of the breaches are accidental misuses and 56% are malicious misuses. We find that HIPAA's gaps regarding accidental misuses are significantly larger than its gaps regarding malicious misuses. DA - 2017/// PY - 2017/// DO - 10.1109/ICSE.2017.55 UR - https://publons.com/publon/21294374/ KW - Security and privacy breaches KW - social norms KW - breach ontology KW - semantic similarity ER - TY - JOUR TI - Arnor: Modeling Social Intelligence via Norms to Engineer Privacy-Aware Personal Agents T2 - AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS DA - 2017/// PY - 2017/// UR - https://publons.com/publon/21294376/ ER - TY - JOUR TI - Triaging Patient Complaints: Monte Carlo Cross-Validation of Six Machine Learning Classifiers AU - Elmessiry, Adel AU - Cooper, William O AU - Catron, Thomas F AU - Karrass, Jan AU - Zhang, Zhe AU - Singh, Munindar P T2 - JMIR Medical Informatics AB - Unsolicited patient complaints can be a useful service recovery tool for health care organizations. Some patient complaints contain information that may necessitate further action on the part of the health care organization and/or the health care professional. Current approaches depend on the manual processing of patient complaints, which can be costly, slow, and challenging in terms of scalability.The aim of this study was to evaluate automatic patient triage, which can potentially improve response time and provide much-needed scale, thereby enhancing opportunities to encourage physicians to self-regulate.We implemented a comparison of several well-known machine learning classifiers to detect whether a complaint was associated with a physician or his/her medical practice. We compared these classifiers using a real-life dataset containing 14,335 patient complaints associated with 768 physicians that was extracted from patient complaints collected by the Patient Advocacy Reporting System developed at Vanderbilt University and associated institutions. We conducted a 10-splits Monte Carlo cross-validation to validate our results.We achieved an accuracy of 82% and F-score of 81% in correctly classifying patient complaints with sensitivity and specificity of 0.76 and 0.87, respectively.We demonstrate that natural language processing methods based on modeling patient complaint text can be effective in identifying those patient complaints requiring physician action. DA - 2017/7/31/ PY - 2017/7/31/ DO - 10.2196/medinform.7140 ER - TY - BOOK TI - Discrete multi-agent plan recognition: Recognizing teams, goals, and plans from action sequences AU - Argenta, C. AU - Doyle, J. AB - Multi-agent Plan Recognition (MPAR) infers teams and their goals from observed actions of individual agents. The complexity of creating a priori plan libraries significantly increases to account for diversity of action sequences different team structures may exhibit. A key challenge in MPAR is effectively pruning the joint search space of agent to team compositions and goal to team assignments. Here, we describe discrete Multi-agent Plan Recognition as Planning (MAPRAP), which extends Ramirez and Geffner’s Plan Recognition as Planning (PRAP) approach to multi-agent domains. Instead of a plan library, MAPRAP uses the planning domain and synthesizes plans to achieve hypothesized goals with additional constraints for suspected team composition and previous observations. By comparing costs of plans, MAPRAP identifies feasible interpretations that explain the teams and plans observed. We establish a performance profile for discrete MAPRAP in a multi-agent blocks-world domain. We evaluated precision, accuracy, and recall after each observation. We compare two pruning strategies to dampen the explosion of hypotheses tested. Aggressive pruning averages 1.05 plans synthesized per goal per time step for multi-agent scenarios vice 0.56 for single agent scenarios. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-53354-4_12 VL - 10162 LNAI SE - 212-228 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85012952399&partnerID=MN8TOARS KW - Multi-agent systems KW - Plan recognition ER - TY - RPRT TI - Efficient Algorithms for Finding 2-Medians of a Tree AU - Stallmann, Matthias AU - Oudjit, Aissa A3 - North Carolina State University. Dept. of Computer Science DA - 2017/// PY - 2017/// PB - North Carolina State University. Dept. of Computer Science ER - TY - CONF TI - Formal understanding of tradeoffs among liveness and safety requirements AU - Kafali, O. AU - Ajmeri, N. AU - Singh, M.P. C2 - 2017/// C3 - Proceedings - 2016 IEEE 24th International Requirements Engineering Conference Workshops, REW 2016 DA - 2017/// DO - 10.1109/REW.2016.20 SP - 17-18 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85013105511&partnerID=MN8TOARS KW - Norms KW - sociotechnical systems KW - constraint logic programming ER - TY - CONF TI - Normative requirements in sociotechnical systems AU - Kafali, O. AU - Ajmeri, N. AU - Singh, M.P. C2 - 2017/// C3 - Proceedings - 2016 IEEE 24th International Requirements Engineering Conference Workshops, REW 2016 DA - 2017/// DO - 10.1109/REW.2016.21 SP - 259-260 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85013073005&partnerID=MN8TOARS KW - Norms KW - privacy KW - design patterns ER - TY - CONF TI - Arnor: Modeling social intelligence via norms to engineer privacy-Aware personal agents AU - Ajmeri, N. AU - Murukannaiah, P.K. AU - Guot, H. AU - Singh, M.P. C2 - 2017/// C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS DA - 2017/// VL - 1 SP - 230-238 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85046117998&partnerID=MN8TOARS ER - TY - CONF TI - Engineering socially intelligent personal agents via norms AU - Ajmeri, N. AU - Singh, M.P. C2 - 2017/// C3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS DA - 2017/// VL - 3 SP - 1822-1823 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85046418467&partnerID=MN8TOARS ER - TY - CONF TI - Kont: Computing Tradeoffs in Normative Multiagent Systems AU - Kafalı, Özgür AU - Ajmeri, Nirav AU - Singh, Munindar P. C2 - 2017/2// C3 - Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence CY - United States DA - 2017/2// SP - 3006–3012 PB - AAAI UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85027718735&partnerID=MN8TOARS ER - TY - JOUR TI - Aragorn: Eliciting and Maintaining Secure Service Policies AU - Ajmeri, Nirav AU - Hang, Chung-Wei AU - Parsons, Simon D. AU - Singh, Munindar P. T2 - Computer AB - Services are configured via policies that capture expected behaviors, but stakeholder requirements can change, making policy errors a surprisingly common occurrence. Aragorn applies formal argumentation to produce policies that balance stakeholder concerns. DA - 2017/// PY - 2017/// DO - 10.1109/MC.2017.4451210 VL - 50 IS - 12 SP - 50-58 UR - https://publons.com/publon/21294371/ ER - TY - CONF TI - Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits AU - Dumas, Jean-Guillaume AU - Kaltofen, Erich L. AU - Villard, Gilles AU - Zhi, Lihong T2 - the 2017 ACM AB - We present an interactive probabilistic proof protocol that certifies in (log N)O(1) arithmetic and Boolean operations for the verifier the determinant, for example, of an N x N matrix over a field whose entries a(i,j) are given by a single (log NO(1)-depth arithmetic circuit, which contains (log NO(1) field constants and which is polynomial time uniform, for example, which has size (log NO(1). The prover can produce the interactive certificate within a (log NO(1) factor of the cost of computing the determinant. Our protocol is a version of the proofs for muggles protocol by Goldwasser, Kalai and Rothblum [STOC 2008, J. ACM 2015]. An application is the following: suppose in a system of k homogeneous polynomials of total degree ≤ d in the k variables y1,...,yk the coefficient of the term y1e1 ... ykek in the i-th polynomial is the (hypergeometric) value ((i+e1 + ... + ek)!)/((i!)(e1!)...(ek!)), where e! is the factorial of e. Then we have a probabilistic protocol that certifies (projective) solvability or inconsistency of such a system in (k log(d))O(1) bit complexity for the verifier, that is, in polynomial time in the number of variables k and the logarithm of the total degree, log(d). C2 - 2017/// C3 - Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17 DA - 2017/// DO - 10.1145/3087604.3087640 PB - ACM Press SN - 9781450350648 UR - http://dx.doi.org/10.1145/3087604.3087640 DB - Crossref ER - TY - CONF TI - Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction AU - Kaltofen, Erich L. AU - Pernet, Clément AU - Storjohann, Arne AU - Waddell, Cleveland T2 - the 2017 ACM AB - Consider solving a black box linear system, A(u) x = b(u), where the entries are polynomials in u over a field K, and A(u) is full rank. The solution, x = 1/g(u) f(u), where g is always the least common monic denominator, can be found by evaluating the system at distinct points ξl in K. The solution can be recovered even if some evaluations are erroneous. In [Boyer and Kaltofen, Proc. SNC 2014] the problem is solved with an algorithm that generalizes Welch/Berlekamp decoding of an algebraic Reed-Solomon code. Their algorithm requires the sum of a degree bound for the numerators plus a degree bound for the denominator of the solution. It is possible that the degree bounds input to their algorithm grossly overestimate the actual degrees. We describe an algorithm that given the same inputs uses possibly fewer evaluations to compute the solution. We introduce a second count for the number of evaluations required to recover the solution based on work by Stanley Cabay. The Cabay count includes bounds for the highest degree polynomial in the coefficient matrix and right side vector, but does not require solution degree bounds. Instead our algorithm iterates until the Cabay termination criterion is reached. At this point our algorithm returns the solution. Assuming we have the actual degrees for all necessary input parameters, we give the criterion that determines when the Cabay count is fewer than the generalized Welch/Berlekamp count. C2 - 2017/// C3 - Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '17 DA - 2017/// DO - 10.1145/3087604.3087645 PB - ACM Press SN - 9781450350648 UR - http://dx.doi.org/10.1145/3087604.3087645 DB - Crossref ER - TY - CONF TI - The effect of visualization on students' miscalibration in the context of online peer assessment AU - Babik, Dmytro AU - Tinapple, David AU - Gehringer, Edward AU - Pramudianto, Ferry T2 - Western Decision Sciences Institute 2017 Annual Meeting C2 - 2017/// C3 - Proceedings of Western Decision Sciences Institute 2017 Annual Meeting CY - Vancouver, BC DA - 2017/// PY - 2017/4/4/ UR - http://wdsinet.org/Annual_Meetings/2017_Proceedings/CR%20PDF/cr60.pdf ER - TY - CONF TI - Verifying Concurrency in an Adaptive Ocean Circulation Model AU - Altuntas, Alper AU - Baugh, John AB - We present a model checking approach for verifying the correctness of concurrency in numerical models. The forms of concurrency we address are from (1) coupled modeling where distinct components, e.g., ocean, wave, and atmospheric, exchange interface conditions during runtime, and (2) multi-instance modeling where local variations of the same numerical model are executed concurrently to minimize common (and therefore redundant) computations. We present general guidelines for representing these forms of concurrency in an abstract verification model and then apply them to an adaptive ocean circulation model that determines the geographic extent and severity of coastal floods. The ocean model employs multi-instance concurrency: a collection of engineering design and failure scenarios are concurrently simulated using patches, regions of a grid that grow and shrink based on the hydrodynamic changes induced by each scenario. We show how concurrency inherent in the simulation model can be represented in a verification model to ensure correctness and to automatically generate safe synchronization arrangements. C2 - 2017/// C3 - Proceedings of the First International Workshop on Software Correctness for HPC Applications - Correctness'17 DA - 2017/// DO - 10.1145/3145344.3145346 PB - ACM Press ER - TY - JOUR TI - Exact Detection of Information Leakage: Decidability and Complexity AU - Chirkova, Rada AU - Yu, Ting T2 - TRANSACTIONS ON LARGE-SCALE DATA- AND KNOWLEDGE-CENTERED SYSTEMS XXXII AB - Elaborate security policies often require organizations to restrict user data access in a fine-grained manner, instead of traditional table- or column-level access control. Not surprisingly, managing fine-grained access control in software is rather challenging. In particular, if access is not configured carefully, information leakage may happen: Users may infer sensitive information through the data explicitly accessible to them. In this paper we formalize this information-leakage problem, by modeling sensitive information as answers to “secret queries,” and by modeling access-control rules as views. We focus on the scenario where sensitive information can be deterministically derived by adversaries. We review a natural data-exchange based inference model for detecting information leakage, and show its capabilities and limitation. We then introduce and formally study a new inference model, view-verified data exchange, that overcomes the limitation for the query language under consideration. Our formal study provides correctness and complexity results for the proposed inference model in the context of queries belonging to a frequent realistic query type and common types of integrity constraints on the data. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-662-55608-5_1 VL - 10420 SP - 1-23 SN - 1611-3349 KW - Privacy and security in data-intensive systems KW - Information leakage KW - Data exchange ER - TY - JOUR TI - An Intelligent Weighted Fuzzy Time Series Model Based on a Sine-Cosine Adaptive Human Learning Optimization Algorithm and Its Application to Financial Markets Forecasting AU - Yang, Ruixin AU - Xu, Mingyang AU - He, Junyi AU - Ranshous, Stephen AU - Samatova, Nagiza F. T2 - ADVANCED DATA MINING AND APPLICATIONS, ADMA 2017 AB - Financial forecasting is an extremely challenging task given the complex, nonlinear nature of financial market systems. To overcome this challenge, we present an intelligent weighted fuzzy time series model for financial forecasting, which uses a sine-cosine adaptive human learning optimization (SCHLO) algorithm to search for the optimal parameters for forecasting. New weighted operators that consider frequency based chronological order and stock volume are analyzed, and SCHLO is integrated to determine the effective intervals and weighting factors. Furthermore, a novel short-term trend repair operation is developed to complement the final forecasting process. Finally, the proposed model is applied to four world major trading markets: the Dow Jones Index (DJI), the German Stock Index (DAX), the Japanese Stock Index (NIKKEI), and Taiwan Stock Index (TAIEX). Experimental results show that our model is consistently more accurate than the state-of-the-art baseline methods. The easy implementation and effective forecasting performance suggest our proposed model could be a favorable market application prospect. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-69179-4_42 VL - 10604 SP - 595-607 SN - 1611-3349 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85033718976&partnerID=MN8TOARS KW - Weighted fuzzy time series KW - Human learning optimization algorithm KW - Financial markets forecasting ER - TY - JOUR TI - No (Privacy) News is Good News: An Analysis of New York Times and Guardian Privacy News from 2010-2016 AU - Sheshadri, Karthik AU - Ajmeri, Nirav AU - Staddon, Jessica T2 - 2017 15TH ANNUAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST) AB - Privacy news influences end-user attitudes and behaviors as well as product and policy development, and so is an important data source for understanding privacy perceptions. We provide a largescale text mining of privacy news, focusing on patterns in sentiment and keywords. This is a challenging task given the lack of a privacy news repository and a ground truth for sentiment. Using high-precision data sets from two popular news sources in the U. S. and U. K., the New York Times and the Guardian, we find negative privacy news is far more common than positive. In addition, in the NYT, privacy news is more prominently reported than many world events involving significant human suffering. Our analysis provides a rich snapshot of this driver of privacy perceptions and demonstrates that news facilitates the systematization of privacy knowledge. DA - 2017/// PY - 2017/// DO - 10.1109/PST.2017.00027 SP - 159-168 SN - 1712-364X UR - https://research-information.bris.ac.uk/en/publications/1a089ae2-94ea-412c-b5d2-5138d0130e81 ER - TY - JOUR TI - Sampling Density Criterion for Circular Structured Light 3D Imaging AU - Lee, Deokwoo AU - Krim, Hamid T2 - PROCEEDINGS OF THE 12TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER VISION, IMAGING AND COMPUTER GRAPHICS THEORY AND APPLICATIONS (VISIGRAPP 2017), VOL 6 DA - 2017/// PY - 2017/// DO - 10.5220/0006147504780483 SP - 478-483 KW - 3D Reconstruction KW - Structured Light Pattern KW - Sampling Theorem KW - Geometry ER - TY - CONF TI - Real time utility-based recommendation for revenue optimization via an adaptive online top-K high utility itemsets mining model AU - Yang, R. X. AU - Xu, M. Y. AU - Jones, P. AU - Samatova, N. AB - Recommender Systems (RS) in e-commerce are typically used to suggest products to online shopping customers, and now play a key role in product marketing strategies for major online retailers, such as Walmart and Amazon. The main goal of such systems is to predict likely future customer desires and to trigger purchases through the timely provision of product recommendations. Therefore, RS have become indispensable tools for both customers and retailers. However, most existing RS recommend products from the point view of customers (i.e. likelihood of customer purchase) but ignore one of the most important business goals: the optimization of revenue. Consequently, there is an increasing need to learn utility patterns online and provide near real-time utility-based recommendations. To address these challenges, we first define the utility of recommendation sets and formulate the problem of real time utility-based recommendation. Next, we consider that online transaction streams are usually accompanied with flow fluctuation, and propose an Adaptive Online Top-K (RAOTK) high utility itemsets mining model to guide the utility-based recommendations. Additionally, three variants of this algorithm are described and we provide a structural comparison of the four algorithms with discussions on their advantages and limitations. Moreover, to make our model more personalized, we also take the buying power of customers into account and propose a simple but effective method to estimate the consumers' willingness to pay. Finally, extensive empirical results on real-world datasets show that the proposed model works effectively and outperforms several baselines. C2 - 2017/// C3 - 2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) DA - 2017/// DO - 10.1109/fskd.2017.8393050 ER - TY - CONF TI - Trilogy: data placement to improve performance and robustness of cloud computing AU - Hsu, C. J. AU - Freeh, V. W. AU - Villanustre, F. AB - Infrastructure as a Service, one of the most disruptive aspects of cloud computing, enables configuring a cluster for each application for each workload. When the workload changes, a cluster will be either underutilized (wasting resources) or unable to meet demand (incurring opportunity costs). Consequently, efficient cluster resizing requires proper data replication and placement. Our work reveals that coarse-grain, workload-aware replication addresses over-utilization but cannot resolve under-utilization. With fine-grain partitioning of the dataset, data replication can reduce both under- and over-utilization. In our empirical studies, compared to a näive uniform data replication a coarse-grain workload-aware replication increases throughput by 81% on a highly-skewed workload. A fine-grain scheme further reaches 166% increase. Furthermore, a surprisingly small increase in granularity is sufficient to obtain most benefits. Evaluations also show that maximizing the number of unique partitions per node increases robustness to tolerate workload deviation while minimizing this number reduces storage footprint. C2 - 2017/// C3 - 2017 IEEE International Conference on Big Data (Big Data) DA - 2017/// DO - 10.1109/bigdata.2017.8258202 SP - 2442-2451 ER - TY - CONF TI - Rectangular hash table: Bloom filter and bitmap assisted hash table with high speed AU - Yang, T. AU - Yin, B. C. AU - Li, H. AU - Shahzad, M. AU - Uhlig, S. AU - Cui, B. AU - Li, X. M. AB - Hash table, a widely used data structure, can achieve an O(1) average lookup speed at the cost of large memory usage. Unfortunately, hash tables suffer from collisions and the rate of collisions is largely determined by the load factor. Broadly speaking, existing research has taken two approaches to improve the performance of hash tables. The first approach trades-off collision rate with memory usage, but only works well under low load. The second approach pursues high load and no hash collisions, but comes with update failures. The goal of this paper is to design a practical and efficient hash table that achieves high load factor, low hash collision rate, fast lookup speed, fast update speed, and zero update failures. To achieve this goal, we take a three-step approach. First, we propose a set of hashing techniques that leverage Bloom filters to significantly reduce hash collision rates. Second, we introduce a novel kick mechanism to achieve a high load factor. Last, we develop bitmaps to significantly accelerate the kick mechanism. Theoretical analysis and experimental results show that our hashing schemes significantly outperform the state-of-the-art Our hash table achieves a high load factor (greater than 95%), a low collision rate (less than 0.56%), and the number of hash buckets almost equals to the number of key-value pairs. Given n key-value pairs, the collision rate is reduced to 0 by either using 1.18 ×n buckets or allowing up to 5 blind kicks. We have released the source code of the implementations of our hash table and of 6 prior hash tables at Github [1]. C2 - 2017/// C3 - 2017 IEEE International Conference on Big Data (Big Data) DA - 2017/// DO - 10.1109/bigdata.2017.8257999 SP - 837-846 ER - TY - CONF TI - Leveraging External Knowledge for Phrase-based Topic Modeling AU - Xu, M. Y. AU - Yang, R. X. AU - Ranshous, S. AU - Li, S. J. AU - Samatova, N. F. AB - Topic modeling has been widely used for extracting the major topics from a corpus. Each discovered topic contains a set of related individual words that describe the topic itself. The discovered topics summarize the major themes of the corpus. Recently, a few phrase-based topic models have been proposed, which simultaneously model phrases and topics. The topics discovered by these models consist of phrases besides individual words, as phrases are typically more meaningful. However, these models typically require large amounts of data to provide reliable statistics for phrase-based topic modeling, thus limiting their performance in scenarios with limited data. To address this limitation, we propose a knowledge-based topic model that incorporates two types of pre-identified external knowledge for topical phrase discovery: Phrase knowledge, and phrase correlation knowledge. Phrase knowledge guides the discovery of meaningful phrases by leveraging a set of pre-identified exemplary phrases; Phrase correlation knowledge guides the discovery of meaningful topics by exploiting a set of pre-identified pairs of related phrases. Experimental results show that our method outperforms the state-of-the-art baseline on both small and large datasets, extracting more meaningful phrases and coherent topics. C2 - 2017/// C3 - 2017 conference on technologies and applications of artificial intelligence (taai) DA - 2017/// DO - 10.1109/taai.2017.25 SP - 29-32 ER - TY - CONF TI - LSTM for septic shock: Adding unreliable labels to reliable predictions AU - Zhang, Y. AU - Lin, C. AU - Chi, M. AU - Ivy, J. AU - Capan, M. AU - Huddleston, J. M. AB - Sepsis is a leading cause of death over the world and septic shock, the most severe complication of sepsis, reaches a mortality rate as high as 50%. Early diagnosis and treatment can prevent most morbidity and mortality. Nowadays, the increasing availability of the electronic health records (EHRs) has generated great interests in developing models to predict acute medical conditions such as septic shock. However, septic shock prediction faces two major challenges : 1) how to capture the informative progression of septic shock in a long visit to hospital of a patient; and 2) how to obtain reliable predictions without well-established moment-by-moment ground-truth labels for septic shock. In this work, we proposed a generic framework to predict septic shock based on Long-Short Term Memory (LSTM) model, which is capable of memorizing temporal dependencies over a long period. The framework integrates two levels of imperfect yet informative labels to jointly learn the discriminative patterns of septic shock: ICD-9 code as the visit-level label and the clinical criteria designed by domain experts as the moment-by-moment event-level label. We evaluate our method on a real-world data extracted from an EHR system constituted by 12,954 visits and 1,348,625 events, and compare it against multiple baselines. The robustness of the method is validated using three sets of clinician-proposed adjusted ground-truth labels. Also, we explore whether the framework is effective for the early prediction of the patients developing septic shock. The experimental results demonstrate the superiority of our proposed method in the task of septic shock prediction. C2 - 2017/// C3 - 2017 IEEE International Conference on Big Data (Big Data) DA - 2017/// DO - 10.1109/bigdata.2017.8258049 SP - 1233-1242 ER - TY - JOUR TI - Inducing Stealth Assessors from Game Interaction Data AU - Min, Wookhee AU - Frankosky, Megan H. AU - Mott, Bradford W. AU - Wiebe, Eric N. AU - Boyer, Kristy Elizabeth AU - Lester, James C. T2 - ARTIFICIAL INTELLIGENCE IN EDUCATION, AIED 2017 AB - A key untapped feature of game-based learning environments is their capacity to generate a rich stream of fine-grained learning interaction data. The learning behaviors captured in these data provide a wealth of information on student learning, which stealth assessment can utilize to unobtrusively draw inferences about student knowledge to provide tailored problem-solving support. In this paper, we present a long short-term memory network (LSTM)-based stealth assessment framework that takes as input an observed sequence of raw game-based learning environment interaction data along with external pre-learning measures to infer students’ post-competencies. The framework is evaluated using data collected from 191 middle school students interacting with a game-based learning environment for middle grade computational thinking. Results indicate that LSTM-based stealth assessors induced from student game-based learning interaction data outperform comparable models that required labor-intensive hand-engineering of input features. The findings suggest that the LSTM-based approach holds significant promise for evidence modeling in stealth assessment. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-61425-0_18 VL - 10331 SP - 212-223 SN - 1611-3349 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85022230700&partnerID=MN8TOARS KW - Game-based learning environments KW - Stealth assessment KW - Deep learning KW - Computational thinking KW - Educational games ER - TY - JOUR TI - Hint Generation Under Uncertainty: The Effect of Hint Quality on Help-Seeking Behavior AU - Price, Thomas W. AU - Zhi, Rui AU - Barnes, Tiffany T2 - ARTIFICIAL INTELLIGENCE IN EDUCATION, AIED 2017 AB - Much research in Intelligent Tutoring Systems has explored how to provide on-demand hints, how they should be used, and what effect they have on student learning and performance. Most of this work relies on hints created by experts and assumes that all help provided by the tutor is correct and of high quality. However, hints may not all be of equal value, especially in open-ended problem solving domains, where context is important. This work argues that hint quality, especially when using data-driven hint generation techniques, is inherently uncertain. We investigate the impact of hint quality on students’ help-seeking behavior in an open-ended programming environment with on-demand hints. Our results suggest that the quality of the first few hints on an assignment is positively associated with future hint use on the same assignment. Initial hint quality also correlates with possible help abuse. These results have important implications for hint design and generation. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-61425-0_26 VL - 10331 SP - 311-322 SN - 1611-3349 UR - http://dx.doi.org/10.1007/978-3-319-61425-0_26 KW - Intelligent Tutoring Systems KW - Hints KW - Help-seeking KW - Programming ER - TY - CONF TI - Enabling query processing across heterogeneous data models: A survey AU - Tan, R. AU - Chirkova, R. AU - Gadepally, V. AU - Mattson, T. G. AB - Modern applications often need to manage and analyze widely diverse datasets that span multiple data models [1], [2], [3], [4], [5]. Warehousing the data through Extract-Transform-Load (ETL) processes can be expensive in such scenarios. Transforming disparate data into a single data model may degrade performance. Further, curating diverse datasets and maintaining the pipeline can prove to be labor intensive. As a result, an emerging trend is to shift the focus to federating specialized data stores and enabling query processing across heterogeneous data models [6]. This shift can bring many advantages: First, systems can natively leverage multiple data models, which can translate to maximizing the semantic expressiveness of underlying interfaces and leveraging the internal processing capabilities of component data stores. Second, federated architectures support query-specific data integration with just-in-time transformation and migration, which has the potential to significantly reduce the operational complexity and overhead. Projects that focus on developing systems in this research area stem from various backgrounds and address diverse concerns, which could make it difficult to form a consistent view of the work in this area. In this survey, we introduce a taxonomy for describing the state of the art and propose a systematic evaluation framework conducive to understanding of query-processing characteristics in the relevant systems. We use the framework to assess four representative implementations: BigDAWG [7], [8], CloudMdsQL [9], [10], Myria [11], [12], and Apache Drill [13]. C2 - 2017/// C3 - 2017 IEEE International Conference on Big Data (Big Data) DA - 2017/// DO - 10.1109/bigdata.2017.8258302 SP - 3211-3220 ER - TY - CONF TI - A semantics-aware storage framework for scalable processing of knowledge graphs on hadoop AU - Kim, H. AU - Ravindra, P. AU - Anyanwu, K. AB - Knowledge graphs are graph-based data models which employ named nodes and edges to capture differentiation among entities and relationships in richly diverse data collections such as in the biomedical domain. The flexibility of knowledge graphs allows for heterogeneous collections to be linked and integrated in precise ways. However, resulting data models often have irregular structures which are not easy to manage using platforms for structured, schema-first data models like the relational model. To facilitate exchange, inter-operability and reuse of data, standards such as Resource Description Framework (RDF) have been increasingly adopted for representation. Domains such as the biomedical now have large collections of publicly available RDF graphs as well as benchmark workloads. To achieve scalability in data processing, some efforts are being made to build on distributed processing platforms such as Hadoop and Spark. However, while some distributed graph platforms have emerged for certain classes of mining workloads for non-semantic graphs (without typed edges and nodes), knowledge graph processing, which often involves ontological inferencing, continues to be plagued by scalability and efficiency challenges. In this paper, we present the design of a Hadoop-based storage architecture for knowledge graphs that overcomes some of the challenges of big RDF data processing. The rationale of the design strategy is to go beyond the traditional approach of exploiting structural properties of graphs while storing to include exploitation of semantic properties of knowledge graphs. Our system SemStorm is a Hadoop-based indexed, polymorphic, signatured file organization that supports efficient storage of data collections with significant data heterogeneity. Naive storage models for such data place more demands for meta-data management than traditional systems can support. The polymorphic file organization is further coupled with a nested, column-oriented file format to enable discriminatory data access based on queries. A major hallmark of SemStorm is the enabling of semantic-awareness in storage framework. The idea is to exploit the knowledge represented in ontologies that accompany data for optimizing data storage models such as identifying and managing data (sometimes implicit) redundancies. Another major advantage of SemStorm is that it derives optimized storage models for data autonomically, i.e., without user input. Extensive experiments conducted on real-world and synthetic benchmark datasets show that SemStorm is up to 10X faster than existing approaches. C2 - 2017/// C3 - 2017 IEEE International Conference on Big Data (Big Data) DA - 2017/// DO - 10.1109/bigdata.2017.8257927 SP - 193–202 ER - TY - CONF TI - A Comparisons of BKT, RNN and LSTM for Learning Gain Prediction AU - Lin, C. AU - Chi, M. C2 - 2017/// C3 - Artificial intelligence in education, aied 2017 DA - 2017/// VL - 10331 SP - 536-539 ER - TY - JOUR TI - "Thanks Alisha, Keep in Touch": Gender Effects and Engagement with Virtual Learning Companions AU - Pezzullo, Lydia G. AU - Wiggins, Joseph B. AU - Frankosky, Megan H. AU - Min, Wookhee AU - Boyer, Kristy Elizabeth AU - Mott, Bradford W. AU - Wiebe, Eric N. AU - Lester, James C. T2 - ARTIFICIAL INTELLIGENCE IN EDUCATION, AIED 2017 AB - Virtual learning companions have shown significant potential for supporting students. However, there appear to be gender differences in their effectiveness. In order to support all students well, it is important to develop a deeper understanding of the role that student gender plays during interactions with learning companions. This paper reports on a study to explore the impact of student gender and learning companion design. In a three-condition study, we examine middle school students’ interactions in a game-based learning environment that featured one of the following: (1) a learning companion deeply integrated into the narrative of the game; (2) a learning companion whose backstory and personality were not integrated into the narrative but who provided equivalent task support; and (3) no learning companion. The results show that girls were significantly more engaged than boys, particularly with the narrative-integrated agent, while boys reported higher mental demand with that agent. Even when controlling for video game experience and prior knowledge, the gender effects held. These findings contribute to the growing understanding that learning companions must adapt to students’ gender in order to facilitate the most effective learning interactions. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-61425-0_25 VL - 10331 SP - 299-310 SN - 1611-3349 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85022211435&partnerID=MN8TOARS KW - Learning companions KW - Pedagogical agents KW - Gender KW - Engagement KW - Game-based learning ER - TY - CONF TI - riboStreamR: A web application for quality control, analysis, and visualization of Ribo-seq data AU - Perkins, P. AU - Heber, Steffen AB - Ribo-seq is a popular technique for studying translation and its regulation. Various software tools for data preprocessing, quality assessment, analysis, and visualization of Ribo-seq data have been developed. However, many of them are inaccessible to users without a thorough practical knowledge of software applications, and often multiple different tools have to be used in combination with each other. Here, we present riboStreamR, a comprehensive Ribo-seq quality control (QC) platform in the form of an R Shiny web application. RiboStreamR provides visualization and analysis tools for various Ribo-seq QC metrics, including read length distribution, read periodicity, and translational efficiency. The platform's environment is centered on providing a user-friendly experience, and includes numerous options for graphical customization and report generation. In practice, Ribo-seq data analysis can be sensitive to data quality issues such as read length variation, low read periodicities, and contaminations with ribosomal and transfer RNA. What constitutes ‘high quality’ data is often unclear. Our goal is to develop novel functionality to automatically highlight quality issues and anomalies in the data. This NSF-supported project is performed in collaboration with Jose Alonso, Anna Stepanova, Serina Mazzoni-Putman, and Cranos Williams. C2 - 2017/// C3 - International conference on computational advances in bio and medical DA - 2017/// DO - 10.1109/iccabs.2017.8114317 ER - TY - JOUR TI - Towards Privacy-Aware Collaborative Security: A Game-Theoretic Approach AU - Jin, Richeng AU - He, Xiaofan AU - Dai, Huaiyu AU - Dutta, Rudra AU - Ning, Peng T2 - 2017 1ST IEEE SYMPOSIUM ON PRIVACY-AWARE COMPUTING (PAC) AB - With the rapid development of sophisticated attack techniques, individual security systems that base all of their decisions and actions of attack prevention and response on their own observations and knowledge become incompetent. To cope with this problem, collaborative security in which a set of security entities are coordinated to perform specific security actions is proposed in literature. In collaborative security schemes, multiple entities collaborate with each other by sharing threat evidence or analytics to make more effective decisions. Nevertheless, the anticipated information exchange raises privacy concerns, especially for those privacy-sensitive entities. In order to obtain a quantitative understanding of the fundamental tradeoff between the effectiveness of collaboration and the entities' privacy, a repeated two-layer single-leader multi-follower game is proposed in this work. Based on our game-theoretic analysis, the expected behaviors of both the attacker and the security entities are derived and the utility-privacy tradeoff curve is obtained. In addition, the existence of Nash equilibrium (NE) for the collaborative entities is proven, and an asynchronous dynamic update algorithm is proposed to compute the optimal collaboration strategies of the entities. Furthermore, the existence of Byzantine entities is considered and its influence is investigated. Finally, simulation results are presented to validate the analysis. DA - 2017/// PY - 2017/// DO - 10.1109/pac.2017.32 SP - 72-83 KW - collaborative security KW - game theory KW - privacy ER - TY - CONF TI - SafeRelay: Improving safety in the time-constrained VANET with geoaddresing relay AU - Carpenter, S. E. AU - Harfoush, K. AB - In a vehicular ad hoc network (VANET), vehicles attempt to improve safety by emitting safety messages that others receive to increase their awareness of one another. Yet, the conflicting data delivery requirements of safety applications can potentially jeopardize safety itself. While many information dissemination techniques have been proposed to improve data delivery in a VANET, such as flooding and geocasting, evaluations do not focus on measuring safety efficiency in terms of safety application requirements and often fail to include mobility considerations, such as time to contact (TTC). To improve safety in a VANET, we propose SafeRelay, a flooding-based message dissemination technique that relays safety messages within a geographically addressed forwarding zone (FZ). We evaluate different forwarding zone sizes in terms of several metrics, including safety awareness probability, which combines both communications and mobility performance. Simulation results of an urban downtown scenario show that SafeRelay can significantly improve safety awareness using moderately-sized nearby forwarding zones. C2 - 2017/// C3 - 2017 IEEE International Conference on Vehicular Electronics and Safety (ICVES) DA - 2017/// DO - 10.1109/icves.2017.7991899 SP - 44-50 ER - TY - JOUR TI - Parallel Processing over Spatial-Temporal Datasets from Geo, Bio, Climate and Social Science Communities: A Research Roadmap AU - Prasad, Sushil K. AU - Aghajarian, Danial AU - McDermott, Michael AU - Shah, Dhara AU - Mokbel, Mohamed AU - Puri, Satish AU - Rey, Sergio J. AU - Shekhar, Shashi AU - Xe, Yiqun AU - Vatsavai, Ranga Raju AU - Wang, Fusheng AU - Liang, Yanhui AU - Vo, Hoang AU - Wang, Shaowen T2 - 2017 IEEE 6TH INTERNATIONAL CONGRESS ON BIG DATA (BIGDATA CONGRESS 2017) AB - This vision paper reviews the current state-ofart and lays out emerging research challenges in parallel processing of spatial-temporal large datasets relevant to a variety of scientific communities. The spatio-temporal data, whether captured through remote sensors (global earth observations), ground and ocean sensors (e.g., soil moisture sensors, buoys), social media and hand-held, traffic-related sensors and cameras, medical imaging (e.g., MRI), or large scale simulations (e.g., climate) have always been “big.” A common thread among all these big collections of datasets is that they are spatial and temporal. Processing and analyzing these datasets requires high-performance computing (HPC) infrastructures. Various agencies, scientific communities and increasingly the society at large rely on spatial data management, analysis, and spatial data mining to gain insights and produce actionable plans. Therefore, an ecosystem of integrated and reliable software infrastructure is required for spatialtemporal big data management and analysis that will serve as crucial tools for solving a wide set of research problems from different scientific and engineering areas and to empower users with next-generation tools. This vision requires a multidisciplinary effort to significantly advance domain research and have a broad impact on the society. The areas of research discussed in this paper include (i) spatial data mining, (ii) data analytics over remote sensing data, (iii) processing medical images, (iv) spatial econometrics analyses, (v) Map-Reducebased systems for spatial computation and visualization, (vi) CyberGIS systems, and (vii) foundational parallel algorithms and data structures for polygonal datasets, and why HPC infrastructures, including harnessing graphics accelerators, are needed for time-critical applications. DA - 2017/// PY - 2017/// DO - 10.1109/bigdatacongress.2017.39 SP - 232-250 SN - 2379-7703 KW - High performance computing KW - Spatial data mining KW - Remote sensing data KW - Medical images KW - Spatial econometrics KW - Map-reduce systems KW - CyberGIS KW - Parallel algorithms and data structures ER - TY - JOUR TI - Leveraging Sentiment Analysis for Classifying Patient Complaints AU - ElMessiry, Adel AU - Zhang, Zhe AU - Cooper, William O. AU - Catron, Thomas F. AU - Karrass, Jan AU - Singh, Munindar P. T2 - ACM-BCB' 2017: PROCEEDINGS OF THE 8TH ACM INTERNATIONAL CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY,AND HEALTH INFORMATICS AB - Unsolicited patient complaints expressed in patients' own words provide an evidential basis for identifying and mitigating patient safety and financial risks associated with physicians and other practitioners. Classifying patient complaints is complicated by the complexity of linguistic representation. Current practice relies upon manual classification, which limits scalability. An automatic approach can potentially improve response time and scale, thereby enhancing opportunities to promote physician accountability for safe and respectful care. This research seeks to automate the classification of patient complaints to improve triage and response. We process a corpus of patient complaints data collected by the Patient Advocacy Reporting System (PARS) developed at Vanderbilt and associated institutions. Our method is to map each complaint to a vector based on enhanced Linguistic Inquiry and Word Count (LIWC) lexicons and to train a Naive Bayes classifier over those vectors. We compare it to both Term Frequency-Inverse Document Frequency (TF-IDF) and the best case results of any classifier over bag of words features. Our classifier outperforms traditional complaint analysis approaches, which disregard sentiment. Our classifier yields 3% greater accuracy overall than traditional approaches. For the SAFETY OF ENVIRONMENT label, our classifier had an accuracy of 84% (compared to 50% for traditional) and a sensitivity of 96% (compared to 0% for traditional). We conclude that patient sentiments conveyed in complaints are often overlooked yet can be valuable in analyzing such complaints to identify and mitigate patient safety and provider financial risks. We demonstrate that inferring the complaint sentiment leads to improved classification accuracy. DA - 2017/// PY - 2017/// DO - 10.1145/3107411.3107421 SP - 44-51 UR - https://publons.com/publon/21294373/ KW - Patient Complaints KW - NLP KW - Text Mining ER - TY - CONF TI - At the end of synthesis: Narrowing program candidates AU - Shriver, D. AU - Elbaum, S. AU - Stolee, K. T. C2 - 2017/// C3 - 2017 IEEE/ACM 39th International Conference on Software Engineering: New Ideas and Emerging Technologies Results Track (ICSE-NIER) DA - 2017/// SP - 19-22 ER - TY - CONF TI - Toward affect-sensitive virtual human tutors: The influence of facial expressions on learning and emotion AU - Mudrick, N. V. AU - Taub, M. AU - Azevedo, R. AU - Rowe, J. AU - Lester, J. AB - Affective support can play a central role in adaptive learning environments. Although virtual human tutors hold significant promise for providing affective support, a key open question is how a tutor's facial expressions can influence learners' performance. In this paper, we report on a study to examine the influence of a human tutor agent's facial expressions on learners' performance and emotions during learning. Results from the study suggest that learners' performance is significantly better when a human tutor agent facially expresses emotions that are congruent with the content relevancy. Results also suggest that learners facially express significantly more confusion when the human tutor agent provides incongruent facial expressions. These results can inform the design of virtual humans as pedagogical agents can inform the design of virtual humans as pedagogical agents and designing intelligent learner-agent interactions. C2 - 2017/// C3 - International conference on affective computing and intelligent DA - 2017/// DO - 10.1109/acii.2017.8273598 SP - 184-189 ER - TY - CONF TI - Semi-supervised deep generative models for change detection in very high resolution imagery AU - Connors, C. AU - Vatsavai, Ranga Raju AB - Increasing population, rapid urbanization, quest for biofuels, pollution, diseases, and adverse climate changes are some of the major drivers behind the changing surface of our planet. Timely monitoring and assessment of these changes, along with dissemination of accurate information, is important for policy makers, city planners, and humanitarian relief workers. Advances in remote sensing technologies have led to acquisition of very high resolution remote sensing imagery in the past decade. This data is highly useful for the aforementioned applications, and machine learning technology can be used to identify and quantify the changed regions. In this study we explore a semi-supervised deep generative model for change detection in very high resolution multispectral and bitemporal imagery. We constructed an auxiliary variational autoencoder that infers class labels without incurring high sample complexity costs. The resulting classifier was able to produce accurate predictions of real changes over images that appear significantly different due to environmental conditions (not real changes) while utilizing only a small set of labeled samples. C2 - 2017/// C3 - 2017 ieee international geoscience and remote sensing symposium (igarss) DA - 2017/// DO - 10.1109/igarss.2017.8127139 SP - 1063–1066 ER - TY - CONF TI - On service composition algorithm for open marketplaces of network services AU - Bhat, S. AU - Udechukwu, R. AU - Dutta, Rudra AU - Rouskas, George AB - Network service composition provided as a service in an Open Marketplace enables users to obtain customized end-to-end composed service(s) using the services advertised by the providers in the marketplace. By providing a semantic language for advertising services and offering choice for the composed service(s) we provide a level playing field for the providers and alternatives for the users to choose from based on their requirement. This is similar to the services offered in the cloud, but without the provider monopoly or the limitation of having to select from limited options. C2 - 2017/// C3 - 2017 european conference on networks and communications (eucnc) DA - 2017/// DO - 10.1109/eucnc.2017.7980657 ER - TY - CONF TI - Hierarchical change detection framework for biomass monitoring AU - Chen, Z. AU - Ramachandra, B. AU - Vatsavai, Ranga Raju AB - In this paper, we present a nearest neighbor based hierarchical change detection methodology for analyzing multi-temporal remote sensing imagery. A key contribution of this work is to define change as hierarchical rather than boolean. Based on this definition of change pattern, we developed a novel time series similarity based change detection framework for identifying inter-annual changes by exploiting phenological properties of growing crops from satellite time series imagery. The proposed framework consists of four components: hierarchical clustering tree construction, nearest neighbor based classification, relaxation labeling, and change detection using similarity hierarchy. Though the proposed approach is unsupervised, we present evaluation using manually induced change regions embedded in the real dataset. We compare our method with the widely used K-Means clustering and evaluation shows that K-Means over-detects changes in comparison to our proposed method. C2 - 2017/// C3 - 2017 ieee international geoscience and remote sensing symposium (igarss) DA - 2017/// DO - 10.1109/igarss.2017.8127030 SP - 620–623 ER - TY - JOUR TI - Factors Influencing Students' Help-Seeking Behavior while Programming with Human and Computer Tutors AU - Price, Thomas W. AU - Liu, Zhongxiu AU - Catete, Veronica AU - Barnes, Tiffany T2 - PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH (ICER 17) AB - When novice students encounter difficulty when learning to program, some can seek help from instructors or teaching assistants. This one-on-one tutoring is highly effective at fostering learning, but busy instructors and large class sizes can make expert help a scarce resource. Increasingly, programming environments attempt to imitate this human support by providing students with hints and feedback. In order to design effective, computer-based help, it is important to understand how and why students seek and avoid help when programming, and how this process differs when the help is provided by a human or a computer. We explore these questions through a qualitative analysis of 15 students' interviews, in which they reflect on solving two programming problems with human and computer help. We discuss implications for help design and present hypotheses on students' help-seeking behavior. DA - 2017/// PY - 2017/// DO - 10.1145/3105726.3106179 SP - 127-135 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85030158442&partnerID=MN8TOARS ER - TY - JOUR TI - Computing Team Process Measures From the Structure and Content of Broadcast Collaborative Communications AU - Kalia, Anup K. AU - Buchler, Norbou AU - DeCostanza, Arwen AU - Singh, Munindar P. T2 - IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS AB - Existing approaches to compute team process measures are primarily based on survey ratings, semantic classification of communications, and social network analyses. Although existing approaches reveal important information about team performance, they face specific limitations. Survey methodologies are in general unreliable, biased, and not dynamic; communication classifications are often a-theoretical; and social network analytics ignore the meanings of messages. Accordingly, we develop a better-defined formal empirical approach for computing team process measures. Our contribution builds on existing work in semantic classification of messages in broadcast communications and proposes a general set of meanings of messages for team processes. Using the meanings of messages, we propose formal approaches to compute team process measures. We evaluate these measures using a military data set and find the following. First, our text mining approach to infer meanings of messages significantly improves over the bag of words approach and yields macroaverage and microaverage F-measures of 70% and 80%, respectively. Second, compared with baseline measures such as degree centrality, cognitive processes remain significantly stable with time, whereas measures such as affective process significantly increase with time. DA - 2017/6// PY - 2017/6// DO - 10.1109/tcss.2017.2672980 VL - 4 IS - 2 SP - 26-39 SN - 2329-924X UR - https://publons.com/publon/21294372/ KW - Emergent states KW - team performance KW - team processes KW - text mining ER - TY - JOUR TI - Toward Automating Crowd RE AU - Murukannaiah, Pradeep K. AU - Ajmeri, Nirav AU - Singh, Munindar P. T2 - 2017 IEEE 25TH INTERNATIONAL REQUIREMENTS ENGINEERING CONFERENCE (RE) AB - Crowd RE is an emerging avenue for engaging the general public or the so called crowd in variety of requirements engineering tasks. Crowd RE scales RE by involving, potentially, millions of users. Although humans are at the center of Crowd RE, automated techniques are necessary (1) to derive useful insights from large amounts of raw data the crowd can produce; and (2) to drive the Crowd RE process, itself, by facilitating novel workflows combining crowd and machine intelligence.To facilitate automated techniques for Crowd RE, first, we showcase a crowd-acquired dataset, consisting of requirements and their ratings on multiple dimensions for the smart homes application domain. Our dataset is unique in that it contains not only requirements, but also the characteristics of the crowd workers who produced those requirements including their demographics, personality traits, and creative potential. Understanding the crowd characteristics is essential to developing effective Crowd RE processes. Second, we outline key challenges involved in automating Crowd RE and describe, how our dataset can serve as a foundation for developing such automated techniques. DA - 2017/// PY - 2017/// DO - 10.1109/re.2017.74 SP - 512-515 SN - 2332-6441 UR - https://publons.com/publon/21294375/ N1 - Data Track RN - Data Track KW - Crowd RE KW - personality KW - creativity KW - smarthome KW - dataset KW - data challenges ER - TY - JOUR TI - ScalaIOExtrap: Elastic I/O Tracing and Extrapolation AU - Luo, Xiaoqing AU - Mueller, Frank AU - Carns, Philip AU - Jenkins, Jonathan AU - Latham, Robert AU - Ross, Robert AU - Snyder, Shane T2 - 2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS) AB - Today's rapid development of supercomputers has caused I/O performance to become a major performance bottleneck for many scientific applications. Trace analysis tools have thus become vital for diagnosing root causes of I/O problems. This work contributes an I/O tracing framework with (a) techniques to gather a set of lossless, elastic I/O trace files for small number of nodes, (b) a mathematical model to analyze trace data and extrapolate it to larger number of nodes, and (c) a replay engine for the extrapolated trace file to verify its accuracy. The traces can in principle be extrapolated even beyond the scale of presentday systems and provide a test if applications scale in terms of I/O. We conducted our experiments on three platforms: a commodity Linux cluster, an IBM BG/Q system, and a discrete event simulation of an IBM BG/P system. We investigate a combination of synthetic benchmarks on all platforms as well as a production scientific application on the BG/Q system. The extrapolated I/O trace replays closely resemble the I/O behavior of equivalent applications in all cases. DA - 2017/// PY - 2017/// DO - 10.1109/ipdps.2017.45 SP - 585-594 SN - 1530-2075 ER - TY - CONF TI - Predicting future states in dota 2 using value-split models of time series attribute data AU - Cleghern, Z. AU - Lahiri, S. AU - Ozaltin, O. AU - Roberts, D. L. C2 - 2017/// C3 - Proceedings of the 12th International Conference on the Foundations of Digital Games (FDG'17) DA - 2017/// ER - TY - CONF TI - Position paper: Block-based programming should offer intelligent support for learners AU - Price, Thomas AU - Barnes, T. AB - Block-based programming environments make learning to program easier by allowing learners to focus on concepts rather than syntax. However, these environments offer little support when learners encounter difficulty with programming concepts themselves, especially in the absence of instructors. Textual programming environments increasingly use AI and data mining to provide intelligent, adaptive support for students, similar to human tutoring, which has been shown to improve performance and learning outcomes. In this position paper, we argue that block-based programming environments should also include these features. This paper gives an overview of promising research in intelligent support for programming and highlights the challenges and opportunities for applying this work to block-based programming. C2 - 2017/// C3 - 2017 IEEE Blocks and Beyond Workshop (B&B) DA - 2017/// DO - 10.1109/blocks.2017.8120414 SP - 65–68 ER - TY - CONF TI - Let's work together: Improving block-based environments by supporting synchronous collaboration AU - Tsan, J. AU - Rodriguez, F. J. AU - Boyer, K. E. AU - Lynch, C. AB - Block-based programming environments are a good way to teach beginners how to code, in part because they eliminate syntax errors and provide visual feedback. However, many of the existing environments do not explicitly support synchronous collaboration. Collaboration is a critical component of computer science practice and CS education. We therefore argue that features to support collaboration could significantly enhance existing and new block-based programming environments. We review existing block-based programming environments, suggest design ideas for supporting synchronous collaboration, and evaluate environments that currently support some of these features. C2 - 2017/// C3 - 2017 IEEE Blocks and Beyond Workshop (B&B) DA - 2017/// DO - 10.1109/blocks.2017.8120411 SP - 53-56 ER - TY - JOUR TI - LCD: A Fast Contrastive Divergence Based Algorithm for Restricted Boltzmann Machine AU - Ning, Lin AU - Pittman, Randall AU - Shen, Xipeng T2 - 2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) AB - Restricted Boltzmann Machine (RBM) is the building block of Deep Belief Nets and other deep learning tools. Fast learning and prediction are both essential for practical usage of RBM-based machine learning techniques. This paper proposes Lean Contrastive Divergence (LCD), a modified Contrastive Divergence (CD) algorithm, to accelerate RBM learning and prediction without changing the results. LCD avoids most of the required computations with two optimization techniques. The first is called bounds-based filtering, which, through triangle inequality, replaces expensive calculations of many vector dot products with fast bounds calculations. The second is delta product, which effectively detects and avoids many repeated calculations in the core operation of RBM, Gibbs Sampling. The optimizations are applicable to both the standard contrastive divergence learning algorithm and its variations. Results show that the optimizations can produce several-fold (up to 3X for training and 5.3X for prediction) speedups. DA - 2017/// PY - 2017/// DO - 10.1109/icdm.2017.131 SP - 1015-1020 SN - 1550-4786 ER - TY - JOUR TI - Gender differences and bias in open source: pull request acceptance of women versus men AU - Terrell, J. AU - Kofink, A. AU - Middleton, J. AU - Rainear, C. AU - Murphy-Hill, E. AU - Parnin, C. AU - Stallings, J. T2 - PeerJ Computer Science DA - 2017/// PY - 2017/// ER - TY - CONF TI - Extensions and improvements of jump-stay rendezvous algorithms for cognitive radios AU - Li, Z. F. AU - Thuente, D. J. AB - Modular-based channel hopping (CH) rendezvous algorithms can provide guaranteed rendezvous for Cognitive Radio Networks (CRNs) without time synchronization or Common Control Channels (i.e., blind rendezvous). The Enhanced Jump-Stay (EJS) scheme [1] has now been recognized as arguably the best in terms of Maximum-Time-To-Rendezvous (MTTR) and bounds for the Expected-Time-To-Rendezvous (ETTR) for users with a different number of channels (asymmetric). In [2], we developed a probabilistic channel detecting jamming attacks that dramatically decreased the rendezvous success rates of EJS and developed the Random Enhanced Jump Stay (REJS) CH rendezvous algorithm that largely mitigated those jamming attack. Here we provide extensions of EJS and REJS and provide guidelines when they should be used. The focus in [2] was jamming mitigation but here we carefully analyze the performance of several new algorithms while still guaranteeing bounded MTTR and improved the ETTR over EJS. In fact, it appears EJS should seldom be used. We show our jump-stay extensions are better than EJS with significant decreases in the average TTR. C2 - 2017/// C3 - International conference on selected topics in mobile and wireless DA - 2017/// DO - 10.1109/mownet.2017.8045952 SP - 77-84 ER - TY - JOUR TI - Evaluation of a Template-based Puzzle Generator for an Educational Programming Game AU - Dong, Yihuan AU - Barnes, Tiffany T2 - PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON THE FOUNDATIONS OF DIGITAL GAMES (FDG'17) AB - Although there has been much work on procedural content generation for other game genres, very few researchers have tackled automated content generation for educational games. In this paper, we present a template-based, automatic puzzle generator for an educational puzzle programming game called BOTS. Two experts created their own new puzzles and evaluated generator-generated puzzles for meeting the educational goals, the structural and visual novelty. We show that our generator can generate puzzles with expert-designed educational goals while saving experts more than 80% of creation time, and these puzzles exhibit structural and visual novelty compared to expert-created puzzles. The contribution of this work is defined and implemented the first template-based automatic puzzle generator that saves expert time while incorporating expert-designed educational goals and enhancing puzzle creativity. DA - 2017/// PY - 2017/// DO - 10.1145/3102071.3106347 SP - KW - Educational games KW - puzzle generation KW - template-based KW - procedural content generation ER - TY - CONF TI - Efficient attack plan recognition using automated planning AU - Amos-Binks, A. AU - Clark, J. AU - Weston, K. AU - Winters, M. AU - Harfoush, K. AB - Network attacks are becoming ever more sophisticated and are able to hide more easily in the increasing amount of traffic being generated by everyday activity. Administrators are placed in the unfortunate position of distinguishing between the two. The attack graph has been in use for some time because it provides a concise knowledge representation, and has had successful security metrics developed from it. Previous methods of attack plan recognition have relied on statistical inference to capture network attacks, however they are computationally expensive and can fail to capture obvious cause and effect relationships. In this paper, we use automated planning to capture new properties of attack graphs and use it for plan recognition. Experimental results demonstrate the efficacy of our approach. C2 - 2017/// C3 - 2017 ieee symposium on computers and communications (iscc) DA - 2017/// DO - 10.1109/iscc.2017.8024656 SP - 1001-1006 ER - TY - CONF TI - Detection of abandoned objects using robust subspace recovery with intrinsic video alignment AU - Thomaz, L. A. AU - Silva, A. F. AU - Silva, E. A. B. AU - Netto, S. L. AU - Krim, H. AB - The detection of abandoned objects in videos from moving cameras is of great importance to automatic surveillance systems that monitor large and visually complex areas. This paper proposes a new method based on sparse decompositions to identify video anomalies associated with abandoned objects. The proposed scheme inherently incorporates synchronization between the reference (anomaly-free) and target (under analysis) sequences thus reducing the implementation complexity of the overall surveillance system. Results indicate that the proposed video-processing scheme can lead to 95% complexity reduction while maintaining excellent detection capability of foreground objects. C2 - 2017/// C3 - 2017 ieee international symposium on circuits and systems (iscas) DA - 2017/// DO - 10.1109/iscas.2017.8050385 SP - 599-602 ER - TY - CONF TI - Deriving quests from open world mechanics AU - Alexander, R. AU - Martens, C. AB - Open world games present players with more freedom than games with linear progression structures. However, without clearly-defined objectives, they often leave players without a sense of purpose. Most of the time, quests and objectives are hand-authored and overlaid atop an open world's mechanics. But what if they could be generated organically from the gameplay itself? The goal of our project was to develop a model of the mechanics in Minecraft that could be used to determine the ideal placement of objectives in an open world setting. We formalized the game logic of Minecraft in terms of logical rules that can be manipulated in two ways: they may be executed to generate graphs representative of the player experience when playing an open world game with little developer direction; and they may be statically analyzed to determine dependency orderings, feedback loops, and bottlenecks. These analyses may then be used to place achievements on gameplay actions algorithmically. C2 - 2017/// C3 - Proceedings of the 12th International Conference on the Foundations of Digital Games (FDG'17) DA - 2017/// DO - 10.1145/3102071.3102098 ER - TY - JOUR TI - Deriving Quests from Open World Mechanics AU - Alexander, Ryan AU - Martens, Chris T2 - PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON THE FOUNDATIONS OF DIGITAL GAMES (FDG'17) AB - Formal models of games help us account for and predict behavior, leading to more robust and innovative designs. While the games research community has proposed many formalisms for both the "game half" (game models, game description languages) and the "human half" (player modeling) of a game experience, little attention has been paid to the interface between the two, particularly where it concerns the player expressing her intent toward the game. We describe an analytical and computational toolbox based on programming language theory to examine the phenomenon sitting between control schemes and game rules, which we identify as a distinct player intent language for each game. DA - 2017/// PY - 2017/// DO - 10.1145/3102071.3102096 SP - KW - procedural content generation KW - quests KW - Minecraft KW - game modeling ER - TY - JOUR TI - Co-Run Scheduling with Power Cap on Integrated CPU-GPU Systems AU - Zhu, Qi AU - Wo, Bo AU - Shen, Xipeng AU - Shen, Li AU - Wang, Zhiying T2 - 2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS) AB - This paper presents the first systematic study on co-scheduling independent jobs on integrated CPU-GPU systems with power caps considered. It reveals the performance degradations caused by the co-run contentions at the levels of both memory and power. It then examines the problem of using job co-scheduling to alleviate the degradations in this less understood scenario. It offers several algorithms and a lightweight co-run performance and power predictive model for computing the performance bounds of the optimal co-schedules and finding appropriate schedules. Results show that the method can efficiently find co-schedules that significantly improve the system throughput (9-46% on average over the default schedules). DA - 2017/// PY - 2017/// DO - 10.1109/ipdps.2017.124 SP - 967-977 SN - 1530-2075 ER - TY - JOUR TI - Cheetah: Just-in-Time Taint Analysis for Android Apps AU - Do, Lisa Nguyen Quang AU - Ali, Karim AU - Livshits, Benjamin AU - Bodden, Eric AU - Smith, Justin AU - Murphy-Hill, Emerson T2 - PROCEEDINGS OF THE 2017 IEEE/ACM 39TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING COMPANION (ICSE-C 2017) AB - Current static-analysis tools are often long-running, which causes them to be sidelined into nightly build checks. As a result, developers rarely use such tools to detect bugs when writing code, because they disrupt their workflow. In this paper, we present Cheetah, a static taint analysis tool for Android apps that interleaves bug fixing and code development in the Eclipse integrated development environment. Cheetah is based on the novel concept of Just-in-Time static analysis that discovers and reports the most relevant results to the developer fast, and computes the more complex results incrementally later. Unlike traditional batch-style static-analysis tools, Cheetah causes minimal disruption to the developer's workflow. This video demo showcases the main features of Cheetah: https://www.youtube.com/watch?v=i_KQD-GTBdA. DA - 2017/// PY - 2017/// DO - 10.1109/icse-c.2017.20 SP - 39-42 SN - 2574-1926 ER - TY - CONF TI - Authenticall: Efficient identity and content authentication for phone calls AU - Reaves, B. AU - Blue, L. AU - Abdullah, H. AU - Vargas, L. AU - Traynor, P. AU - Shrimpton, T. C2 - 2017/// C3 - Proceedings of the 26th Usenix Security Symposium (USENIX Security '17) DA - 2017/// SP - 575-592 ER - TY - JOUR TI - A Generative Model of Group Conversation AU - Morrison, Hannah AU - Martens, Chris T2 - PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON THE FOUNDATIONS OF DIGITAL GAMES (FDG'17) AB - Conversations with non-player characters (NPCs) in games are typically confined to dialogue between a human player and a virtual agent, where the conversation is initiated and controlled by the player. To create richer, more believable environments for players, we need conversational behavior to reflect initiative on the part of the NPCs, including conversations that include multiple NPCs who interact with one another as well as the player. DA - 2017/// PY - 2017/// DO - 10.1145/3102071.3116218 SP - KW - conversation modeling ER - TY - JOUR TI - Wildlife species preferences differ among children in continental and island locations AU - Shapiro, Hannah G. AU - Peterson, M. Nils AU - Stevenson, Kathryn T. AU - Frew, Kristin N. AU - Langerhans, R. Brian T2 - ENVIRONMENTAL CONSERVATION AB - SUMMARY Efforts to prioritize wildlife for conservation benefit from an understanding of public preferences for particular species, yet no studies have integrated species preferences with key attributes of the conservation landscape such as whether species occur on islands (where invasive exotics are the primary extinction threat) or continents (where land use change is the primary extinction threat). In this paper, we compare wildlife species preferences among children from a continental location (North Carolina, USA, n = 433) and an island location (Andros Island, The Bahamas, n = 197). Children on the island preferred feral domesticated species and different types of taxa than mainland children, perhaps due to the strongly divergent species richness between the regions (e.g. island children showed greater preferences for invertebrates, lizards and aquatic species). Boys preferred fish, birds and lizards more than girls, whereas girls preferred mammals. The fact that island children showed strong preferences for invasive species suggests challenges for conservation efforts on islands, where controlling invasive exotic species is often of paramount importance, but can conflict with cultural preferences for these same species. DA - 2017/12// PY - 2017/12// DO - 10.1017/s0376892917000133 VL - 44 IS - 4 SP - 389-396 SN - 1469-4387 KW - wildlife preferences KW - cross-cultural KW - human dimensions KW - children KW - environmental education KW - conservation ER - TY - JOUR TI - Using multi-channel data with multi-level modeling to assess in-game performance during gameplay with CRYSTAL ISLAND AU - Taub, Michelle AU - Mudrick, Nicholas V. AU - Azevedo, Roger AU - Millar, Garrett C. AU - Rowe, Jonathan AU - Lester, James T2 - COMPUTERS IN HUMAN BEHAVIOR AB - Game-based learning environments (GBLEs) have been touted as the solution for failing educational outcomes. In this study, we address some of these major issues by using multi-level modeling with data from eye movements and log files to examine the cognitive and metacognitive self-regulatory processes used by 50 college students as they read books and completed the associated in-game assessments (concept matrices) while playing the Crystal Island game-based learning environment. Results revealed that participants who read fewer books in total, but read each of them more frequently, and who had low proportions of fixations on books and concept matrices exhibited the strongest performance. Results stress the importance of assessing quality vs. quantity during gameplay, such that it is important to read books in-depth (i.e., quality), compared to reading books once (i.e., quantity). Implications for these findings involve designing adaptive GBLEs that scaffold participants based on their trace data, such that we can model efficient behaviors that lead to successful performance. DA - 2017/11// PY - 2017/11// DO - 10.1016/j.chb.2017.01.038 VL - 76 SP - 641-655 SN - 1873-7692 KW - Cognitive strategies KW - Metacognitive monitoring KW - Game-based learning environments KW - Eye tracking KW - Log files KW - Self-regulated learning ER - TY - JOUR TI - More visual mind wandering occurrence during visual task performance: Modality of the concurrent task affects how the mind wanders AU - Choi, HeeSun AU - Geden, Michael AU - Feng, Jing T2 - PLOS ONE AB - Mind wandering has been considered as a mental process that is either independent from the concurrent task or regulated like a secondary task. These accounts predict that the form of mind wandering (i.e., images or words) should be either unaffected by or different from the modality form (i.e., visual or auditory) of the concurrent task. Findings from this study challenge these accounts. We measured the rate and the form of mind wandering in three task conditions: fixation, visual 2-back, and auditory 2-back. Contrary to the general expectation, we found that mind wandering was more likely in the same form as the task. This result can be interpreted in light of recent findings on overlapping brain activations during internally- and externally-oriented processes. Our result highlights the importance to consider the unique interplay between the internal and external mental processes and to measure mind wandering as a multifaceted rather than a unitary construct. DA - 2017/12/14/ PY - 2017/12/14/ DO - 10.1371/journal.pone.0189667 VL - 12 IS - 12 SP - SN - 1932-6203 ER - TY - JOUR TI - High performance GPU computing based approaches for oil spill detection from multi-temporal remote sensing data AU - Bhangale, Ujwala AU - Durbha, Surya S. AU - King, Roger L. AU - Younan, Nicolas H. AU - Vatsavai, Rangaraju T2 - REMOTE SENSING OF ENVIRONMENT AB - Oil spills have adverse effects on the environment and economy. Near real time detection and response activities enable to better manage the required resources at the incident area for clean-up and control operations. Multi-temporal remote sensing (RS) technologies are widely used to detect and monitor oil spills on the Ocean surfaces. However, current techniques using RS data for oil spill detection are time consuming and expensive in terms of computational cost and related infrastructure. The main focus of this work is oil spill detection from voluminous multi-temporal LANDSAT-7 imagery using high performance computing technologies such as graphics processing units (GPUs) and Message Passing Interface (MPI) to speed up the detection process and provide rapid response. Kepler compute architecture based GPU (Tesla K40) with Compute Unified Device Architecture (CUDA), which is a parallel programming mechanism for GPU is used in the development of the detection algorithms. Oil spill detection techniques that were adapted to GPU based processing include band-ratio and Morphological attribute profile (MAP) based on six structural and shape description attributes namely, Gray mean, standard deviation, elongation, shape complexity, solidity and orientation. Experimental results show the significant gains in the computational speed of these techniques when implemented on a GPU and MPI. A GPU vs. CPU comparison shows that the proposed approach achieves a speedup of around 10 × for MAP and 14 × for band ratio approaches, which includes the data transfer cost. However, the MPI implementation using 64 cores outperforms the GPU, and executes the time intensive task of computing the above said attributes in only 18 min, whereas a GPU consumes around an hour. DA - 2017/12/1/ PY - 2017/12/1/ DO - 10.1016/j.rse.2017.03.024 VL - 202 SP - 28-44 SN - 1879-0704 KW - High performance computing (HPC) KW - Graphics processing unit (GPU) KW - Oil spill KW - Morphological attribute profiles ER - TY - JOUR TI - Disruption of Trim9 function abrogates macrophage motility in vivo AU - Tokarz, Debra A. AU - Heffelfinger, Amy K. AU - Jima, Dereje D. AU - Gerlach, Jamie AU - Shah, Radhika N. AU - Rodriguez-Nunez, Ivan AU - Kortum, Amanda N. AU - Fletcher, Ashley A. AU - Nordone, Shila K. AU - Law, J. McHugh AU - Heber, Steffen AU - Yoder, Jeffrey A. T2 - JOURNAL OF LEUKOCYTE BIOLOGY AB - The vertebrate immune response comprises multiple molecular and cellular components that interface to provide defense against pathogens. Because of the dynamic complexity of the immune system and its interdependent innate and adaptive functionality, an understanding of the whole-organism response to pathogen exposure remains unresolved. Zebrafish larvae provide a unique model for overcoming this obstacle, because larvae are protected against pathogens while lacking a functional adaptive immune system during the first few weeks of life. Zebrafish larvae were exposed to immune agonists for various lengths of time, and a microarray transcriptome analysis was executed. This strategy identified known immune response genes, as well as genes with unknown immune function, including the E3 ubiquitin ligase tripartite motif-9 (Trim9). Although trim9 expression was originally described as "brain specific," its expression has been reported in stimulated human Mϕs. In this study, we found elevated levels of trim9 transcripts in vivo in zebrafish Mϕs after immune stimulation. Trim9 has been implicated in axonal migration, and we therefore investigated the impact of Trim9 disruption on Mϕ motility and found that Mϕ chemotaxis and cellular architecture are subsequently impaired in vivo. These results demonstrate that Trim9 mediates cellular movement and migration in Mϕs as well as neurons. DA - 2017/12// PY - 2017/12// DO - 10.1189/jlb.1a0816-371r VL - 102 IS - 6 SP - 1371-1380 SN - 1938-3673 KW - chemotaxis KW - zebrafish KW - leukocyte KW - ubiquitin ER - TY - JOUR TI - Assessing implicit science learning in digital games AU - Rowe, Elizabeth AU - Asbell-Clarke, Jodi AU - Baker, Ryan S. AU - Eagle, Michael AU - Hicks, Andrew G. AU - Barnes, Tiffany M. AU - Brown, Rebecca A. AU - Edwards, Teon T2 - COMPUTERS IN HUMAN BEHAVIOR AB - Building on the promise shown in game-based learning research, this paper explores methods for Game-Based Learning Assessments (GBLA) using a variety of educational data mining techniques (EDM). GBLA research examines patterns of behaviors evident in game data logs for the measurement of implicit learning—the development of unarticulated knowledge that is not yet expressible on a test or formal assessment. This paper reports on the study of two digital games showing how the combination of human coding with EDM has enabled researchers to measure implicit learning of Physics. In the game Impulse, researchers combined human coding of video with educational data mining to create a set of automated detectors of students' implicit understanding of Newtonian mechanics. For Quantum Spectre, an optics puzzle game, human coding of Interaction Networks was used to identify common student errors. Findings show that several of our measures of student implicit learning within these games were significantly correlated with improvements in external postassessments. Methods and detailed findings were different for each type of game. These results suggest GBLA shows promise for future work such as adaptive games and in-class, data-driven formative assessments, but design of the assessment mechanics must be carefully crafted for each game. DA - 2017/11// PY - 2017/11// DO - 10.1016/j.chb.2017.03.043 VL - 76 SP - 617-630 SN - 1873-7692 KW - Computer-based assessment KW - Implicit science learning KW - Game-based learning KW - Educational data mining KW - Learning analytics ER - TY - CONF TI - Probabilistic multi-agent plan recognition as planning (P-Maprap): Recognizing teams, goals, and plans from action sequences AU - Argenta, C. AU - Doyle, J. C2 - 2017/// C3 - ICAART 2017 - Proceedings of the 9th International Conference on Agents and Artificial Intelligence DA - 2017/// VL - 2 SP - 575-582 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85068733514&partnerID=MN8TOARS ER - TY - JOUR TI - FinTechSec: Addressing the Security Challenges of Digital Financial Services AU - Traynor, Patrick AU - Butler, Kevin AU - Bowers, Jasmine AU - Reaves, Bradley T2 - IEEE SECURITY & PRIVACY AB - Digital financial systems such as mobile money and online credit have tremendous potential to enable financial inclusion. However, in the rush to provide such systems, security and privacy have often been overlooked. This article looks into the challenges facing these truly transformative technologies and discusses how this community can help. DA - 2017/// PY - 2017/// DO - 10.1109/msp.2017.3681060 VL - 15 IS - 5 SP - 85-89 SN - 1558-4046 ER - TY - CONF TI - The NASA analogy software cost model: A web-based cost analysis tool AU - Hihn, J. AU - Saing, M. AU - Huntington, E. AU - Johnson, J. AU - Menzies, Tim AU - Mathew, G. AB - This paper provides an overview of the many new features and algorithm updates in the release of the NASA Analogy Software Cost Tool (ASCoT). ASCoT is a web-based tool that provides a suite of estimation tools to support early lifecycle NASA Flight Software analysis. ASCoT employs advanced statistical methods such as Cluster Analysis to provide an analogy based estimate of software delivered lines of code and development effort, a regression based Cost Estimating Relationships (CER) model that estimates cost (dollars), and a COCOMO II based estimate. The ASCoT algorithms are designed to primarily work with system level inputs such as mission type (earth orbiter vs. planetary vs. rover), the number of instruments, and total mission cost. This allows the user to supply a minimal number of mission-level parameters which are better understood early in the life-cycle, rather than a large number of complex inputs. C2 - 2017/// C3 - 2017 ieee aerospace conference DA - 2017/// DO - 10.1109/aero.2017.7943730 ER - TY - JOUR TI - Sublinear Zero-Knowledge Arguments for RAM Programs AU - Mohassel, Payman AU - Rosulek, Mike AU - Scafuro, Alessandra T2 - ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I AB - We describe a new succinct zero-knowledge argument protocol with the following properties. The prover commits to a large data-set M, and can thereafter prove many statements of the form $$\exists w : \mathcal {R}_i(M,w)=1$$ , where $$\mathcal {R}_i$$ is a public function. The protocol is succinct in the sense that the cost for the verifier (in computation & communication) does not depend on |M|, not even in any initialization phase In each proof, the computation/communication cost for both the prover and the verifier is proportional only to the running time of an oblivious RAM program implementing $$\mathcal {R}_i$$ (in particular, this can be sublinear in |M|). The only costs that scale with |M| are the computational costs of the prover in a one-time initial commitment to M. Known sublinear zero-knowledge proofs either require an initialization phase where the work of the verifier is proportional to |M| and are therefore sublinear only in an amortized sense, or require that the computational cost for the prover is proportional to |M| upon each proof. Our protocol uses efficient crypto primitives in a black-box way and is UC-secure in the global, non-programmable random oracle, hence it does not rely on any trusted setup assumption. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-56620-7_18 VL - 10210 SP - 501-531 SN - 1611-3349 ER - TY - JOUR TI - SoSharP: Recommending Sharing Policies in Multiuser Privacy Scenarios AU - Fogues, Ricard L. AU - Murukannaiah, Pradeep K. AU - Such, Jose M. AU - Singh, Munindar P. T2 - IEEE INTERNET COMPUTING AB - Users often share information about others; sometimes this inadvertently violates others' privacy. Thus, here the authors propose SoSharP, an agent-based approach to help users maintain their own and others' privacy by guiding a selection of sharing policies in multiuser scenarios. SoSharP learns incrementally and asks for users' input only when required, reducing users' effort. DA - 2017/// PY - 2017/// DO - 10.1109/mic.2017.4180836 VL - 21 IS - 6 SP - 28-36 SN - 1941-0131 ER - TY - JOUR TI - Characterizing and Predicting Mental Fatigue during Programming Tasks AU - Sarkar, Saurabh AU - Parnin, Chris T2 - 2017 IEEE/ACM 2ND INTERNATIONAL WORKSHOP ON EMOTION AWARENESS IN SOFTWARE ENGINEERING (SEMOTION 2017) AB - Mental fatigue reduces one's cognitive and physical abilities. In tasks requiring continuous attention, such as driving, fatigue is a well-known risk. However, when fatigued during daily tasks, such as programming, the nature of risk is more diffuse and accumulative, yet the consequences can be just as severe (e.g. defects in autopilot software). Identifying risks of fatigue in the context of programming can lead to interventions that prevent introduction of defects and introduce coping mechanisms. To character and predict these risks, we conducted two studies: a survey study in which we asked 311 software developers to rate the severity and frequency of their fatigue and to recall a recent experience of being fatigued while programming, and an observational study with 9 professional software developers to investigate the feasibility of predicting fatigue from interaction history. From the survey, we found that a majority of developers report severe (66%) and frequent (59%) issues with fatigue. Further, we categorized their experiences into seven effects on programming tasks, which include reduced motivation and reduced ability to handle tasks involving large mental workloads. From our observational study, our results found how several measures, such as focus duration, key press time, error rates, and increases in software quality warnings, may be applied for detecting fatigue levels. Together, these results aims to support developers and the industry for improving software quality and work conditions for software developers. DA - 2017/// PY - 2017/// DO - 10.1109/semotion.2017.2 SP - 32-37 ER - TY - JOUR TI - Who prophets from big data in education? New insights and new challenges AU - Lynch, Collin F. T2 - THEORY AND RESEARCH IN EDUCATION AB - Big Data can radically transform education by enabling personalized learning, deep student modeling, and true longitudinal studies that compare changes across classrooms, regions, and years. With these promises, however, come risks to individual privacy and educational validity, along with deep policy and ethical issues. Education is largely a public service targeted primarily at minors. Participation is compulsory in most advanced societies, and in many ways, it is seen as a fundamental right. Academic success is necessary for advancement, but students often have little individual say in the process. For these reasons, it poses unique policy challenges that do not arise in other domains. Big data requires deep and constant monitoring of students, classes, and instructors. Who consents to such monitoring, and how will student or instructor privacy be preserved? Data also has immense commercial value. Who owns it? And who is permitted to profit from its use? In this article, I will discuss some of these unique issues, and I will outline some potential approaches that may be taken to address them. DA - 2017/11// PY - 2017/11// DO - 10.1177/1477878517738448 VL - 15 IS - 3 SP - 249-271 SN - 1741-3192 KW - Data-driven assessment KW - educational data mining KW - ethics KW - personalized learning KW - policy KW - privacy ER - TY - JOUR TI - Using Bad Learners to Find Good Configurations AU - Nair, Vivek AU - Menzies, Tim AU - Siegmund, Norbert AU - Apel, Sven T2 - ESEC/FSE 2017: PROCEEDINGS OF THE 2017 11TH JOINT MEETING ON FOUNDATIONS OF SOFTWARE ENGINEERING AB - Finding the optimally performing configuration of a software system for a given setting is often challenging. Recent approaches address this challenge by learning performance models based on a sample set of configurations. However, building an accurate performance model can be very expensive (and is often infeasible in practice). The central insight of this paper is that exact performance values (e.g. the response time of a software system) are not required to rank configurations and to identify the optimal one. As shown by our experiments, models that are cheap to learn but inaccurate (with respect to the difference between actual and predicted performance) can still be used rank configurations and hence find the optimal configuration. This novel \emph{rank-based approach} allows us to significantly reduce the cost (in terms of number of measurements of sample configuration) as well as the time required to build models. We evaluate our approach with 21 scenarios based on 9 software systems and demonstrate that our approach is beneficial in 16 scenarios; for the remaining 5 scenarios, an accurate model can be built by using very few samples anyway, without the need for a rank-based approach. DA - 2017/// PY - 2017/// DO - 10.1145/3106237.3106238 SP - 257-267 KW - Performance Prediction KW - SBSE KW - Sampling KW - Rank-based method ER - TY - JOUR TI - Theory-Guided Data Science: A New Paradigm for Scientific Discovery from Data AU - Karpatne, Anuj AU - Atluri, Gowtham AU - Faghmous, James H. AU - Steinbach, Michael AU - Banerjee, Arindam AU - Ganguly, Auroop AU - Shekhar, Shashi AU - Samatova, Nagiza AU - Kumar, Vipin T2 - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING AB - Data science models, although successful in a number of commercial domains, have had limited applicability in scientific problems involving complex physical phenomena. Theory-guided data science (TGDS) is an emerging paradigm that aims to leverage the wealth of scientific knowledge for improving the effectiveness of data science models in enabling scientific discovery. The overarching vision of TGDS is to introduce scientific consistency as an essential component for learning generalizable models. Further, by producing scientifically interpretable models, TGDS aims to advance our scientific understanding by discovering novel domain insights. Indeed, the paradigm of TGDS has started to gain prominence in a number of scientific disciplines such as turbulence modeling, material discovery, quantum chemistry, bio-medical science, bio-marker discovery, climate science, and hydrology. In this paper, we formally conceptualize the paradigm of TGDS and present a taxonomy of research themes in TGDS. We describe several approaches for integrating domain knowledge in different research themes using illustrative examples from different disciplines. We also highlight some of the promising avenues of novel research for realizing the full potential of theory-guided data science. DA - 2017/10/1/ PY - 2017/10/1/ DO - 10.1109/tkde.2017.2720168 VL - 29 IS - 10 SP - 2318-2331 SN - 1558-2191 KW - Data science KW - knowledge discovery KW - domain knowledge KW - scientific theory KW - physical consistency KW - interpretability ER - TY - JOUR TI - The Tech-Talk Balance: What Technical Interviewers Expect from Technical Candidates AU - Ford, Denae AU - Barik, Titus AU - Rand-Pickett, Leslie AU - Parnin, Chris T2 - 2017 IEEE/ACM 10TH INTERNATIONAL WORKSHOP ON COOPERATIVE AND HUMAN ASPECTS OF SOFTWARE ENGINEERING (CHASE 2017) AB - Software engineer job candidates are not succeeding at technical interviews. Although candidates are able to answer technical questions, there is a mismatch of what candidates think interviewers assess versus what criteria is used in practice. This mismatch in expectations can cost candidates a job opportunity. To determine what criteria interviewers value, we conducted mock technical interviews with software engineer candidates at a university and collected evaluations from interviewers. We analyzed 70 interview evaluations from 9 software companies. Using a grounded theory approach, we compared interviewer interpretations of criteria including: performing a problem solving walkthrough, applying previous experience to problem solving, and the ability to engaging in conversation beyond writing code. From these findings, we provide implications on what candidates can expect to be evaluated on during technical interviews across companies, which can sometimes vary significantly. DA - 2017/// PY - 2017/// DO - 10.1109/chase.2017.8 SP - 43-48 KW - career KW - interpersonal skills KW - technical interview KW - software engineer ER - TY - JOUR TI - The Rising Tide Lifts All Boats: The Advancement of Science in Cyber Security (Invited Talk) AU - Williams, Laurie T2 - ESEC/FSE 2017: PROCEEDINGS OF THE 2017 11TH JOINT MEETING ON FOUNDATIONS OF SOFTWARE ENGINEERING AB - Stolen passwords, compromised medical records, taking the internet out through video cameras– cybersecurity breaches are in the news every day. Despite all this, the practice of cybersecurity today is generally reactive rather than proactive. That is, rather than improving their defenses in advance, organizations react to attacks once they have occurred by patching the individual vulnerabilities that led to those attacks. Researchers engineer solutions to the latest form of attack. What we need, instead, are scientifically founded design principles for building in security mechanisms from the beginning, giving protection against broad classes of attacks. Through scientific measurement, we can improve our ability to make decisions that are evidence-based, proactive, and long-sighted. Recognizing these needs, the US National Security Agency (NSA) devised a new framework for collaborative research, the “Lablet” structure, with the intent to more aggressively advance the science of cybersecurity. A key motivation was to catalyze a shift in relevant areas towards a more organized and cohesive scientific community. The NSA named Carnegie Mellon University, North Carolina State University, and the University of Illinois – Urbana Champaign its initial Lablets in 2011, and added the University of Maryland in 2014. DA - 2017/// PY - 2017/// DO - 10.1145/3106237.3121272 SP - 1-1 KW - Systems security KW - Software and application security KW - Human and societal aspects of security and privacy KW - Trust frameworks ER - TY - JOUR TI - The Internet of Things and Multiagent Systems: Decentralized Intelligence in Distributed Computing AU - Singh, Munindar P. AU - Chopra, Amit K. T2 - 2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017) AB - Traditionally, distributed computing concentrates on computation understood at the level of information exchange and sets aside human and organizational concerns as largely to be handled in an ad hoc manner. Increasingly, however, distributed applications involve multiple loci of autonomy. Research in multiagent systems (MAS) addresses autonomy by drawing on concepts and techniques from artificial intelligence. However, MAS research generally lacks an adequate understanding of modern distributed computing. In this Blue Sky paper, we envision decentralized multiagent systems as a way to place decentralized intelligence in distributed computing, specifically, by supporting computation at the level of social meanings. We motivate our proposals for research in the context of the Internet of Things (IoT), which has become a major thrust in distributed computing. From the IoT's representative applications, we abstract out the major challenges of relevance to decentralized intelligence. These include the heterogeneity of IoT components; asynchronous and delay-tolerant communication and decoupled enactment; and multiple stakeholders with subtle requirements for governance, incorporating resource usage, cooperation, and privacy. The IoT yields high-impact problems that require solutions that go beyond traditional ways of thinking. We conclude with highlights of some possible research directions in decentralized MAS, including programming models; interaction-oriented software engineering; and what we term enlightened governance. DA - 2017/// PY - 2017/// DO - 10.1109/icdcs.2017.304 SP - 1738-1747 SN - 1063-6927 UR - https://publons.com/publon/21294369/ KW - Governance KW - Multiagent systems KW - Decentralization KW - Sociotechnical systems KW - Norms ER - TY - JOUR TI - Play in the Museum: Design and Development of a Game-Based Learning Exhibit for Informal Science Education AU - Rowe, Jonathan P. AU - Lobene, Eleni V. AU - Mott, Bradford W. AU - Lester, James C. T2 - INTERNATIONAL JOURNAL OF GAMING AND COMPUTER-MEDIATED SIMULATIONS AB - Digital games have been found to yield effective and engaging learning experiences across a broad range of subjects. Much of this research has been conducted in laboratory and K-12 classrooms. Recent advances in game technologies are expanding the range of educational contexts where game-based learning environments can be deployed, including informal settings such as museums and science centers. In this article, the authors describe the design, development, and formative evaluation of Future Worlds, a prototype game-based exhibit for collaborative explorations of sustainability in science museums. They report findings from a museum pilot study that investigated the influence of visitors' individual differences on learning and engagement. Results indicate that visitors showed significant gains in sustainability knowledge as well as high levels of engagement in a free-choice learning environment with Future Worlds. These findings point toward the importance of designing game-based learning exhibits that address the distinctive design challenges presented by museum settings. DA - 2017/// PY - 2017/// DO - 10.4018/ijgcms.2017070104 VL - 9 IS - 3 SP - 96-113 SN - 1942-3896 KW - Educational Game Design KW - Game-Based Learning KW - Museum Education KW - Pedagogical Agents KW - Surface Computing Tables KW - Visitor Studies ER - TY - JOUR TI - Hytrace: A Hybrid Approach to Performance Bug Diagnosis in Production Cloud Infrastructures AU - Dai, Ting AU - Dean, Daniel AU - Wang, Peipei AU - Gu, Xiaohui AU - Lu, Shan T2 - PROCEEDINGS OF THE 2017 SYMPOSIUM ON CLOUD COMPUTING (SOCC '17) AB - Server applications running inside production cloud infrastructures are prone to various performance problems (e.g., software hang, performance slow down). When those problems occur, developers often have little clue to diagnose those problems. We present HyTrace, a novel hybrid approach to diagnosing performance problems in production cloud infrastructures. HyTrace combines rule-based static analysis and runtime inference techniques to achieve higher bug localization accuracy than pure-static and pure-dynamic approaches for performance bugs. HyTrace does not require source code and can be applied to both compiled and interpreted programs such as C/C++ and Java. We conduct experiments using real performance bugs from seven commonly used server applications. The results show that our approach can significantly improve the performance bug diagnosis accuracy compared to existing diagnosis techniques. DA - 2017/// PY - 2017/// DO - 10.1145/3127479.3132562 SP - 641-641 KW - Hybrid analysis KW - performance bug diagnosis ER - TY - JOUR TI - Highlights of the ACM Student Research Competition AU - Williams, Laurie AU - Baldwin, Doug T2 - COMMUNICATIONS OF THE ACM AB - No abstract available. DA - 2017/11// PY - 2017/11// DO - 10.1145/3145811 VL - 60 IS - 11 SP - 5-5 SN - 1557-7317 ER - TY - CONF TI - Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction AU - Ding, Y. F. AU - Ning, L. AU - Guan, H. AU - Shen, Xipeng AB - Triangular Inequality (TI) has been used in many manual algorithm designs to achieve good efficiency in solving some distance calculation-based problems. This paper presents our generalization of the idea into a compiler optimization technique, named TI-based strength reduction. The generalization consists of three parts. The first is the establishment of the theoretic foundation of this new optimization via the development of a new form of TI named Angular Triangular Inequality, along with several fundamental theorems. The second is the revealing of the properties of the new forms of TI and the proposal of guided TI adaptation, a systematic method to address the difficulties in effective deployments of TI optimizations. The third is an integration of the new optimization technique in an open-source compiler. Experiments on a set of data mining and machine learning algorithms show that the new technique can speed up the standard implementations by as much as 134X and 46X on average for distance-related problems, outperforming previous TI-based optimizations by 2.35X on average. It also extends the applicability of TI-based optimizations to vector related problems, producing tens of times of speedup. C2 - 2017/// C3 - ACM SIGPLAN Notices DA - 2017/// DO - 10.1145/3140587.3062377 VL - 52 SP - 33–48 M1 - 6 ER - TY - JOUR TI - Fast and Accurate Tracking of Population Dynamics in RFID Systems AU - Shahzad, Muhammad AU - Liu, Alex X. T2 - 2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017) AB - RFID systems have been widely deployed for various applications such as supply chain management, indoor localization, inventory control, and access control. This paper deals with the fundamental problem of estimating the number of arriving and departing tags between any two time instants in dynamically changing RFID tag populations, which is needed in many applications such as warehouse monitoring and privacy sensitive RFID systems. In this paper, we propose a dynamic tag estimation scheme, namely DTE, that can achieve arbitrarily high required reliability, is compliant with the C1G2 standard, and works in single as well as multiple-reader environment. DTE uses the standardized frame slotted Aloha protocol and utilizes the number of slots that change their values in corresponding Aloha frames at the two time instants to estimate the number of arriving and departing tags. It is easy to deploy because it neither requires modification to tags nor to the communication protocol between tags and readers. We have extensively evaluated and compared DTE with the only prior scheme, ZDE, that can estimate the number of arriving and departing tags. Unfortunately, ZDE can not achieve arbitrarily high required reliability. In contrast, our proposed scheme always achieves the required reliability. For example, for a tag population containing 10 4 tags, a required reliability of 95%, and a required confidence interval of 5%, DTE takes 5.12 seconds to achieve the required reliability whereas ZDE achieves a reliability of only 66% in the same amount of time. DA - 2017/// PY - 2017/// DO - 10.1109/icdcs.2017.58 SP - 836-846 SN - 1063-6927 KW - RFID KW - Estimation KW - Tracking KW - Population KW - Mobile ER - TY - CONF TI - EffiSha: A software framework for enabling efficient preemptive scheduling of GPU AU - Chen, G. Y. AU - Zhao, Y. AU - Shen, Xipeng AU - Zhou, H. Y. AB - Modern GPUs are broadly adopted in many multitasking environments, including data centers and smartphones. However, the current support for the scheduling of multiple GPU kernels (from different applications) is limited, forming a major barrier for GPU to meet many practical needs. This work for the first time demonstrates that on existing GPUs, efficient preemptive scheduling of GPU kernels is possible even without special hardware support. Specifically, it presents EffiSha, a pure software framework that enables preemptive scheduling of GPU kernels with very low overhead. The enabled preemptive scheduler offers flexible support of kernels of different priorities, and demonstrates significant potential for reducing the average turnaround time and improving the system overall throughput of programs that time share a modern GPU. C2 - 2017/// C3 - ACM SIGPLAN Notices DA - 2017/// DO - 10.1145/3155284.3018748 VL - 52 SP - 3–16 M1 - 8 ER - TY - CONF TI - Bridging the gap between memory performance and massive parallelism: The critical role of programming systems innovations (keynote) AU - Shen, Xipeng AB - This talk examines some trends in the modern developments of memory systems and their relations with the massive parallelism in processors and applications. It then draws on some recent work on GPU to explain the important role of programming systems in bridging the gap; it particularly emphasizes the importance of innovations for enabling better software controllability, more software elasticity, and inter-thread data locality enhancements. The talk further discusses the implications brought to programming systems by the increasingly blurred boundaries among memory, storage, and processing. C2 - 2017/// C3 - ACM SIGPLAN Notices DA - 2017/// DO - 10.1145/3156685.3092569 VL - 52 SP - 1–1 M1 - 9 ER - TY - CONF TI - An infrastructure for HPC knowledge sharing and reuse AU - Zhao, Y. AU - Liao, C. H. AU - Shen, Xipeng AB - This paper presents a prototype infrastructure for addressing the barriers for effective accumulation, sharing, and reuse of the various types of knowledge for high performance parallel computing. C2 - 2017/// C3 - ACM SIGPLAN Notices DA - 2017/// DO - 10.1145/3155284.3019023 VL - 52 SP - 461–462 M1 - 8 ER - TY - JOUR TI - A Shifting Framework for Set Queries AU - Yang, Tong AU - Liu, Alex X. AU - Shahzad, Muhammad AU - Yang, Dongsheng AU - Fu, Qiaobin AU - Xie, Gaogang AU - Li, Xiaoming T2 - IEEE-ACM TRANSACTIONS ON NETWORKING AB - Set queries are fundamental operations in computer networks. This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a shifting bloom filter (ShBF) framework for representing and querying sets. We demonstrate the effectiveness of ShBF using three types of popular set queries: membership, association, and multiplicity queries. The key novelty of ShBF is on encoding the auxiliary information of a set element in a location offset. In contrast, prior BF-based set data structures allocate additional memory to store auxiliary information. We further extend our shifting framework from BF-based data structures to sketch-based data structures, which are widely used to store multiplicities of items. We conducted experiments using real-world network traces, and results show that ShBF significantly advances the state-of-the-art on all three types of set queries. DA - 2017/10// PY - 2017/10// DO - 10.1109/tnet.2017.2730227 VL - 25 IS - 5 SP - 3116-3131 SN - 1558-2566 KW - Set queries KW - Bloom filters KW - algorithms ER - TY - JOUR TI - A Partial Contour Similarity-Based Approach to Visual Affordances in Habile Agents AU - Horton, Thomas E. AU - Amant, Robert St. T2 - IEEE TRANSACTIONS ON COGNITIVE AND DEVELOPMENTAL SYSTEMS AB - In a typical tool use task, we can view both the relationship between the agent and the tool and the relationship between the tool and the target in terms of affordances. One set of affordances relates to the ability of the agent to manipulate the tool, while a second set of affordances relates to the ability of the agent to manipulate the target by means of the tool. In both cases, effective tool use is facilitated by the coupling of one object to another: agent-to-tool-to-target. In this paper, we focus on the visual identification of such affordances via contour similarity. Objects with complementary contour segments can fit together, which suggests possible opportunities for effective interactions. We present a system for the identification and evaluation of partial contour-based matches and analyze the system’s behavior. We propose a set of sample tool-use scenarios as part of our analysis. We demonstrate the use of the system in providing guidance to an autonomous robotic agent performing tool selection tasks. DA - 2017/9// PY - 2017/9// DO - 10.1109/tcds.2017.2702599 VL - 9 IS - 3 SP - 269-280 SN - 2379-8939 KW - Affordance KW - cognitive robotics KW - computer vision KW - image matching KW - object segmentation ER - TY - JOUR TI - A Mechanism for Cooperative Demand-Side Management AU - Yuan, Guangchao AU - Hang, Chung-Wei AU - Huhns, Michael N. AU - Singh, Munindar P. T2 - 2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017) AB - Demand-side management (DSM) is an important theme in studies of the Smart Grid and offers the possibility of leveling power consumption with its attendant benefits of reducing capital expenses. This paper develops an algorithmic mechanism that reduces peak total power consumption and encourages prosocial behavior, such as expressing flexibility in one's power consumption and reporting preferences truthfully. The objective is to provide a tractable, budget-balanced mechanism that promotes truth-telling from households. The resulting mechanism is theoretically and empirically proven to be ex ante budget-balanced, weakly Pareto-efficient, and weakly Bayesian incentive-compatible. A simulation study verifies that the mechanism could largely reduce the computational complexity that the optimal allocation requires, while maintaining approximately the same performance. A user study with 20 subjects further shows the effectiveness of the mechanism in preventing participants from defecting and incentivizing them to reveal flexible preferences. DA - 2017/// PY - 2017/// DO - 10.1109/icdcs.2017.300 SP - 361-371 SN - 1063-6927 UR - https://publons.com/publon/21294368/ KW - Demand-side management KW - Prosocial behaviors ER - TY - JOUR TI - Towards Automatic Linkage of Knowledge Worker's Claims with Associated Evidence from Screenshots AU - Jones, Paul AU - Medd, Dakota AU - Ramakrishnan, Sreekanth AU - Shah, Rajat AU - Keyton, Joann AU - Samatova, Nagiza T2 - 2017 THIRD IEEE INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING SERVICE AND APPLICATIONS (IEEE BIGDATASERVICE 2017) AB - Knowledge workers are frequently subject to information overload. As a result, when looking to make analytic judgements, they may only have time to search for evidence that already matches their existing viewpoint, leading to confirmation bias. New computer systems are needed that can help users overcome this and other cognitive biases. As an enabling step towards such systems, the research community has developed instrumentation software that captures data to help better understand sensemaking processes and workflows. However, existing instrumentation approaches are limited by the need to write operating system-specific (and often application-specific) code to `see' what the user is doing inside different applications on their computer. This source code quickly becomes complex and brittle. Furthermore, this approach does not provide a holistic view of how the user is gleaning information from multiple applications at once. We propose an alternative approach to instrumentation based on automated analysis of desktop screenshots, and demonstrate this in the context of extraction of `claims' from reports that users are writing, and association of these claims with `evidence' obtained from web browsing. We evaluate our approach on a corpus of 121,000 screenshots obtained from a study of 150 participants carrying out a controlled analysis task. The topic of the task was previously unfamiliar to them (hence the need to search for evidence on the web). We report results from several variants of our approach using a human evaluation of extracted claim/evidence pairs, and find that a simple word matching metric (based on Jaccard similarity) can outperform more complex sentence similarity metrics. We also describe many of the difficulties inherent to screenshot analysis and our approaches to overcome them. DA - 2017/// PY - 2017/// DO - 10.1109/bigdataservice.2017.21 SP - 17-22 ER - TY - JOUR TI - T-Chain: A General Incentive Scheme for Cooperative Computing AU - Shin, Kyuyong AU - Joe-Wong, Carlee AU - Ha, Sangtae AU - Yi, Yung AU - Rhee, Injong AU - Reeves, Douglas S. T2 - IEEE-ACM TRANSACTIONS ON NETWORKING AB - In this paper, we propose a simple, distributed, but highly efficient fairness-enforcing incentive mechanism for cooperative computing. The proposed mechanism, called triangle chaining (T-Chain), enforces reciprocity to avoid the exploitable aspects of the schemes that allow free-riding. In T-Chain, symmetric key cryptography provides the basis for a lightweight, almost-fair exchange protocol, which is coupled with a pay-it-forward mechanism. This combination increases the opportunity for multi-lateral exchanges and further maximizes the resource utilization of participants, each of whom is assumed to operate solely for his or her own benefit. T-Chain also provides barrier-free entry to newcomers with flexible resource allocation, allowing them to immediately benefit, and, therefore, is suitable for dynamic environments with high churn (i.e., turnover). T-Chain is distributed and simple to implement, as no trusted third party is required to monitor or enforce the scheme, nor is there any reliance on reputation information or tokens. DA - 2017/8// PY - 2017/8// DO - 10.1109/tnet.2017.2685560 VL - 25 IS - 4 SP - 2122-2137 SN - 1558-2566 KW - Cooperative communication KW - reciprocity KW - symmetric encryption ER - TY - JOUR TI - Scalable communication event tracing via clustering AU - Bahmani, Amir AU - Mueller, Frank T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - Communication traces help developers of high-performance computing (HPC) applications understand and improve their codes. When run on large-scale HPC facilities, the scalability of tracing tools becomes a challenge. To address this problem, traces can be clustered into groups of processes that exhibit similar behavior. Instead of collecting trace information of each individual node, it then suffices to collect a trace of a small set of representative nodes, namely one per cluster. However, clustering algorithms themselves need to have low overhead, be scalable, and adapt to application characteristics. We devised an adaptive clustering algorithm for large-scale applications called ACURDION that traces the MPI communication of code with O(log P) time complexity. First, ACURDION identifies the parameters that differ across processes by using a logarithmic algorithm called Adaptive Signature Building. Second, it clusters the processes based on those parameters. Experiments show that collecting traces of just nine nodes/clusters suffices to capture the communication behavior of all nodes for a wide set of HPC benchmarks codes while retaining sufficient accuracy of trace events and parameters. In summary, ACURDION improves trace scalability and automation over prior approaches. DA - 2017/11// PY - 2017/11// DO - 10.1016/j.jpdc.2017.06.008 VL - 109 SP - 230-244 SN - 1096-0848 KW - Clustering algorithms KW - Programming techniques KW - Concurrent programming KW - Performance measurement ER - TY - JOUR TI - DINO: Divergent node cloning for sustained redundancy in HPC AU - Rezaei, Arash AU - Mueller, Frank AU - Hargrove, Paul AU - Roman, Eric T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - Complexity and scale of next generation HPC systems pose significant challenges in fault resilience methods such that contemporary checkpoint/restart (C/R) methods that address fail-stop behavior may be insufficient. Redundant computing has been proposed as an alternative at extreme scale. Triple redundancy has an advantage over C/R in that it can also detect silent data corruption (SDC) and then correct results via voting. However, current redundant computing approaches do not repair failed or corrupted replicas. Consequently, SDCs can no longer be detected after a replica failure since the system has been degraded to dual redundancy without voting capability. Hence, a job may have to be aborted if voting uncovers mismatching results between the remaining two replicas. And while replicas are logically equivalent, they may have divergent runtime states during job execution, which presents a challenge to simply creating new replicas dynamically. This problem is addressed by, DIvergent NOde cloning (DINO), a redundant execution environment that quickly recovers from hard failures. DINO consists of a novel node cloning service integrated into the MPI runtime system that solves the problem of consolidating divergent states among replicas on-the-fly. With DINO, after degradation to dual redundancy, a good replica can be quickly cloned so that triple redundancy is restored. We present experimental results over 9 NAS Parallel Benchmarks (NPB), Sweep3D and LULESH. Results confirm the applicability of the approach and the correctness of the recovery process and indicate that DINO can recover from failures nearly instantly. The cloning overhead depends on the process image size that needs to be transferred between source and destination of the clone operation and varies between 5.60 to 90.48 s. Simulation results with our model show that dual redundancy with DINO recovery always outperforms 2x and surpasses 3x redundancy on up to 1 million nodes. To the best of our knowledge, the design and implementation for repairing failed replicas in redundant MPI computing is unprecedented. DA - 2017/11// PY - 2017/11// DO - 10.1016/j.jpdc.2017.06.010 VL - 109 SP - 350-362 SN - 1096-0848 KW - Fault tolerance KW - High performance computing KW - Node cloning KW - Redundant computing ER - TY - JOUR TI - A novel framework for software defined based secure storage systems AU - Darabseh, Ala' AU - Al-Ayyoub, Mahmoud AU - Jararweh, Yaser AU - Benkhelifa, Elhadj AU - Vouk, Mladen AU - Rindos, Andy T2 - SIMULATION MODELLING PRACTICE AND THEORY AB - The Software Defined Systems (SDSys) paradigm has been introduced recently as a solution to reduce the overhead in the control and management operations of complex computing systems and to maintain a high level of security and protection. The main concept behind this technology is around isolating the data plane from the control plane. Building a Software Defined System in a real life environment is considered an expensive solution and may have a lot of risks. Thus, there is a need to simulate such systems before the real-life implementation and deployment. In this paper we present a novel experimental framework as a virtualized testbed environment for software defined based secure storage systems. Its also covers some related issues for large scale data storage and sharing such as deduplication. This work builds on the Mininet simulator, where its core components, the host, switch and the controller, are customized to build the proposed experimental simulation framework. The developed emulator, will not only support the development and testing of SD-based secure storage solutions, it will also serve as an experimentation tool for researchers and for benchmarking purposes. The developed simulator/emulator could also be used as an educational tool to train students and novice researchers. DA - 2017/9// PY - 2017/9// DO - 10.1016/j.simpat.2016.05.003 VL - 77 SP - 407-423 SN - 1878-1462 KW - Software Defined Network (SDN) KW - Software Defined Storage (SDStore) KW - Software Defined Security (SDSec) KW - Big data KW - Mininet KW - Virtualization ER - TY - JOUR TI - Understanding problem solving behavior of 6-8 graders in a debugging game AU - Liu, Zhongxiu AU - Zhi, Rui AU - Hicks, Andrew AU - Barnes, Tiffany T2 - COMPUTER SCIENCE EDUCATION AB - Debugging is an over-looked component in K-12 computational thinking education. Few K-12 programming environments are designed to teach debugging, and most debugging research were conducted on college-aged students. In this paper, we presented debugging exercises to 6th–8th grade students and analyzed their problem solving behaviors in a programming game – BOTS. Apart from the perspective of prior literature, we identified student behaviors in relation to problem solving stages, and correlated these behaviors with student prior programming experience and performance. We found that in our programming game, debugging required deeper understanding than writing new codes. We also found that problem solving behaviors were significantly correlated with students’ self-explanation quality, number of code edits, and prior programming experience. This study increased our understanding of younger students’ problem solving behavior, and provided actionable suggestions to the future design of debugging exercises in BOTS and similar environments. DA - 2017/// PY - 2017/// DO - 10.1080/08993408.2017.1308651 VL - 27 IS - 1 SP - 1-29 SN - 1744-5175 KW - Debugging KW - K-12 KW - educational games KW - computational thinking ER - TY - JOUR TI - To log, or not to log: using heuristics to identify mandatory log events - a controlled experiment AU - King, Jason AU - Stallings, Jon AU - Riaz, Maria AU - Williams, Laurie T2 - EMPIRICAL SOFTWARE ENGINEERING DA - 2017/10// PY - 2017/10// DO - 10.1007/s10664-016-9449-1 VL - 22 IS - 5 SP - 2684-2717 SN - 1573-7616 UR - https://doi.org/10.1007/s10664-016-9449-1 KW - Logging KW - User activity logs KW - Security KW - Controlled experiment KW - User study KW - Mandatory log events ER - TY - JOUR TI - System input-output theoretic three-dimensional measurement based on circular-shaped structured light patterns AU - Lee, Deokwoo AU - Krim, Hamid T2 - OPTICAL ENGINEERING AB - Alternative approaches to three-dimensional (3-D) reconstruction by employing the concepts of “system identification” and “communication systems” based on structured light patterns are proposed. In addition, a sampling criterion of the light source is derived in the case of using multiple projectors because 3-D reconstruction sometimes employs multiple viewpoints (cameras) and multiple structured light sources (or projectors). To reformulate a reconstruction problem, an input–output (I/O) system theoretic is adopted, and camera(s) and light source(s) that are located at different positions are defined as the output and the input, respectively. Akin to the system identification problem, the ratio of an output to an input, the “system function,” is defined as a 3-D measurement result. Alternatively, the reconstruction work can employ the concept of the “modulation and demodulation theory,” and the reconstruction work can be reinterpreted as an “input estimation problem.” This contribution chiefly deals with approximate reconstruction results that are sufficient for practical applications, such as 3-D object detection, clarification, recognition, and classification, rather than a perfect 3-D reconstruction itself. To that end, the development of an efficient and fast 3-D imaging system framework is proposed. DA - 2017/7// PY - 2017/7// DO - 10.1117/1.oe.56.7.073104 VL - 56 IS - 7 SP - SN - 1560-2303 KW - reconstruction KW - system identification KW - structured light system KW - modulation-demodulation KW - multiple viewpoints KW - multiple projectors ER - TY - JOUR TI - Negative results for software effort estimation AU - Menzies, Tim AU - Yang, Ye AU - Mathew, George AU - Boehm, Barry AU - Hihn, Jairus T2 - EMPIRICAL SOFTWARE ENGINEERING AB - More than half the literature on software effort estimation (SEE) focuses on comparisons of new estimation methods. Surprisingly, there are no studies comparing state of the art latest methods with decades-old approaches. Accordingly, this paper takes five steps to check if new SEE methods generated better estimates than older methods. Firstly, collect effort estimation methods ranging from “classical” COCOMO (parametric estimation over a pre-determined set of attributes) to “modern” (reasoning via analogy using spectral-based clustering plus instance and feature selection, and a recent “baseline method” proposed in ACM Transactions on Software Engineering). Secondly, catalog the list of objections that lead to the development of post-COCOMO estimation methods. Thirdly, characterize each of those objections as a comparison between newer and older estimation methods. Fourthly, using four COCOMO-style data sets (from 1991, 2000, 2005, 2010) and run those comparisons experiments. Fifthly, compare the performance of the different estimators using a Scott-Knott procedure using (i) the A12 effect size to rule out “small” differences and (ii) a 99 % confident bootstrap procedure to check for statistically different groupings of treatments. The major negative result of this paper is that for the COCOMO data sets, nothing we studied did any better than Boehms original procedure. Hence, we conclude that when COCOMO-style attributes are available, we strongly recommend (i) using that data and (ii) use COCOMO to generate predictions. We say this since the experiments of this paper show that, at least for effort estimation, how data is collected is more important than what learner is applied to that data. DA - 2017/10// PY - 2017/10// DO - 10.1007/s10664-016-9472-2 VL - 22 IS - 5 SP - 2658-2683 SN - 1573-7616 KW - Effort estimation KW - COCOMO KW - CART KW - Nearest neighbor KW - Clustering KW - Feature selection KW - Prototype generation KW - Bootstrap sampling KW - Effect size KW - A12 ER - TY - JOUR TI - Identifying the implied: Findings from three differentiated replications on the use of security requirements templates AU - Riaz, Maria AU - King, Jason AU - Slankas, John AU - Williams, Laurie AU - Massacci, Fabio AU - Quesada-Lopez, Christian AU - Jenkins, Marcelo T2 - EMPIRICAL SOFTWARE ENGINEERING AB - Identifying security requirements early on can lay the foundation for secure software development. Security requirements are often implied by existing functional requirements but are mostly left unspecified. The Security Discoverer (SD) process automatically identifies security implications of individual requirements sentences and suggests applicable security requirements templates. The objective of this research is to support requirements analysts in identifying security requirements by automating the suggestion of security requirements templates that are implied by existing functional requirements. We conducted a controlled experiment in a graduate-level security class at North Carolina State University (NCSU) to evaluate the SD process in eliciting implied security requirements in 2014. We have subsequently conducted three differentiated replications to evaluate the generalizability and applicability of the initial findings. The replications were conducted across three countries at the University of Trento, NCSU, and the University of Costa Rica. We evaluated the responses of the 205 total participants in terms of quality, coverage, relevance and efficiency. We also develop shared insights regarding the impact of context factors such as time, motivation and support, on the study outcomes and provide lessons learned in conducting the replications. Treatment group, using the SD process, performed significantly better than the control group (at p-value <0.05) in terms of the coverage of the identified security requirements and efficiency of the requirements elicitation process in two of the three replications, supporting the findings of the original study. Participants in the treatment group identified 84 % more security requirements in the oracle as compared to the control group on average. Overall, 80 % of the 111 participants in the treatment group were favorable towards the use of templates in identifying security requirements. Our qualitative findings indicate that participants may be able to differentiate between relevant and extraneous templates suggestions and be more inclined to fill in the templates with additional support. Security requirements templates capture the security knowledge of multiple experts and can support the security requirements elicitation process when automatically suggested, making the implied security requirements more evident. However, individual participants may still miss out on identifying a number of security requirements due to empirical constraints as well as potential limitations on knowledge and security expertise. DA - 2017/8// PY - 2017/8// DO - 10.1007/s10664-016-9481-1 VL - 22 IS - 4 SP - 2127-2178 SN - 1573-7616 UR - https://doi.org/10.1007/s10664-016-9481-1 KW - Security requirements KW - Controlled experiment KW - Replication KW - Requirements engineering KW - Templates KW - Patterns KW - Automation ER - TY - JOUR TI - Automated Assessment of the Quality of Peer Reviews using Natural Language Processing Techniques AU - Ramachandran, Lakshmi AU - Gehringer, Edward F. AU - Yadav, Ravi K. T2 - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION DA - 2017/9// PY - 2017/9// DO - 10.1007/s40593-016-0132-x VL - 27 IS - 3 SP - 534-581 SN - 1560-4306 KW - Intelligent tutoring systems KW - Collaborative learning KW - Peer reviews ER - TY - JOUR TI - Are delayed issues harder to resolve? Revisiting cost-to-fix of defects throughout the lifecycle AU - Menzies, Tim AU - Nichols, William AU - Shull, Forrest AU - Layman, Lucas T2 - EMPIRICAL SOFTWARE ENGINEERING AB - Many practitioners and academics believe in a delayed issue effect (DIE); i.e. the longer an issue lingers in the system, the more effort it requires to resolve. This belief is often used to justify major investments in new development processes that promise to retire more issues sooner. This paper tests for the delayed issue effect in 171 software projects conducted around the world in the period from 2006–2014. To the best of our knowledge, this is the largest study yet published on this effect. We found no evidence for the delayed issue effect; i.e. the effort to resolve issues in a later phase was not consistently or substantially greater than when issues were resolved soon after their introduction. This paper documents the above study and explores reasons for this mismatch between this common rule of thumb and empirical data. In summary, DIE is not some constant across all projects. Rather, DIE might be an historical relic that occurs intermittently only in certain kinds of projects. This is a significant result since it predicts that new development processes that promise to faster retire more issues will not have a guaranteed return on investment (depending on the context where applied), and that a long-held truth in software engineering should not be considered a global truism. DA - 2017/8// PY - 2017/8// DO - 10.1007/s10664-016-9469-x VL - 22 IS - 4 SP - 1903-1935 SN - 1573-7616 UR - https://doi.org/10.1007/s10664-016-9469-x KW - Software economics KW - Phase delay KW - Cost to fix ER - TY - JOUR TI - A superpower transformed: The remaking of American foreign relations in the 1970s AU - Mitchell, N. T2 - Cold War History DA - 2017/// PY - 2017/// VL - 17 IS - 2 SP - 198-200 ER - TY - JOUR TI - Valuation of a hypothetical mining project under commodity price and exchange rate uncertainties by using numerical methods AU - Aminrostamkolaee, Behnam AU - Scroggs, Jeffrey S. AU - Borghei, Matin Sadat AU - Safdari-Vaighani, Ali AU - Mohammadi, Teymour AU - Pourkazemi, Mohammad Hossein T2 - RESOURCES POLICY AB - One of the goals presented here is the use of a radial basis function (RBF) method to approximate the numerical values of a gold mining project. RBFs have many attractive features compared to implicit finite differences method (FDM) and explicit FDM. They are mesh-free, computationally more efficient in high dimensions, and very accurate. In other words, the model is more comprehensive, and results are more accurate compared to the previous works. This paper compares accuracy of the RBF method with that of the implicit method (FDM) in this case study. The results indicate that convergence order of the RBF is higher than that of the implicit method. Also, this paper compares the results of the RBF method with those of implicit method for various scenarios. The most important goal presented here is combining exchange rate uncertainty together with commodity price (spot price) uncertainty. In fact, this paper tries to address this question: how can we model the exchange rate volatility and the correlation coefficient between returns of commodity price and exchange rate in assessing a gold mining project. Considering the disadvantages of the Discounted Cash Flow (DCF) method which does not use uncertainties, the approach presented here makes use of real options valuation for a gold mine project valuation. This paper uses an explicit method (FDM) for these calculations. The results indicate increasing volatilities for either or both commodity price or exchange rate results in decreasing the maximum project value. Also, the correlation coefficients between returns of commodity price and exchange rate in different years are negative and statistically significant. The final result indicates that with an increase in the correlation coefficient, the volatility of gold price in terms of Canadian dollar decreases and therefore the maximum project value increases too. In summary, the exchange rate volatility and the correlation coefficient between returns of commodity price and exchange rate have a significant impact on mining project values. DA - 2017/6// PY - 2017/6// DO - 10.1016/j.resourpol.2017.04.004 VL - 52 SP - 296-307 SN - 1873-7641 KW - Discounted cash flow KW - Real options valuation KW - Geometric Brownian Motion KW - Commodity price KW - Volatility KW - Implicit FDM and explicit FDM KW - Radial basis function KW - Exchange rate ER - TY - JOUR TI - Sweet KNN: An Efficient KNN on GPU through Reconciliation between Redundancy Removal and Regularity AU - Chen, Guoyang AU - Ding, Yufei AU - Shen, Xipeng T2 - 2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017) AB - Finding the k nearest neighbors of a query point or a set of query points (KNN) is a fundamental problem in many application domains. It is expensive to do. Prior efforts in improving its speed have followed two directions with conflicting considerations: One tries to minimize the redundant distance computations but often introduces irregularities into computations, the other tries to exploit the regularity in computations to best exert the power of GPU-like massively parallel processors, which often introduces even extra distance computations. This work gives a detailed study on how to effectively combine the strengths of both approaches. It manages to reconcile the polar opposite effects of the two directions through elastic algorithmic designs, adaptive runtime configurations, and a set of careful implementation-level optimizations. The efforts finally lead to a new KNN on GPU named Sweet KNN, the first high-performance triangular-inequality-based KNN on GPU that manages to reach a sweet point between redundancy minimization and regularity preservation for various datasets. Experiments on a set of datasets show that Sweet KNN outperforms existing GPU implementations on KNN by up to 120X (11X on average). DA - 2017/// PY - 2017/// DO - 10.1109/icde.2017.116 SP - 621-632 SN - 1084-4627 ER - TY - JOUR TI - SF-sketch: A Fast, Accurate, and Memory Efficient Data Structure to Store Frequencies of Data Items AU - Yang, Tong AU - Liu, Lingtong AU - Yan, Yibo AU - Shahzad, Muhammad AU - Shen, Yulong AU - Li, Xiaoming AU - Cui, Bin AU - Xie, Gaogang T2 - 2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017) AB - A sketch is a probabilistic data structure that is used to record frequencies of items in a multi-set. Sketches have been applied in a variety of fields, such as data stream processing, natural language processing, distributed data sets etc. In this paper, we propose a new sketch, called Slim-Fat (SF) sketch, which has a much smaller memory footprint for query while supporting updates. The key idea behind our proposed SF-sketch is to maintain two separate sketches: a small sketch called Slimsubsketch and a large sketch called Fat-subsketch. The Slimsubsketch enables fast and accurate querying. The Fat-subsketch is used to assist the insertion and deletion from Slim-subsketch. We implemented and evaluated SF-sketch along with several prior sketches and compared them side by side. Our experimental results show that SF-sketch significantly outperforms the most commonly used CM-sketch in terms of accuracy. The full version is provided at arXiv.org [12]. DA - 2017/// PY - 2017/// DO - 10.1109/icde.2017.50 SP - 103-106 SN - 1084-4627 ER - TY - JOUR TI - KAML: A Flexible, High-Performance Key-Value SSD AU - Jin, Yanqin AU - Tseng, Hung-Wei AU - Papakonstantinou, Yannis AU - Swanson, Steven T2 - 2017 23RD IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA) AB - Modern solid state drives (SSDs) unnecessarily confine host programs to the conventional block I/O interface, leading to suboptimal performance and resource under-utilization. Recent attempts to replace or extend this interface with a key-value-oriented interface and/or built-in support for transactions offer some improvements, but the details of their implementations make them a poor match for many applications. This paper presents the key-addressable, multi-log SSD (KAML), an SSD with a key-value interface that uses a novel multi-log architecture and stores data as variable-sized records rather than fixed-sized sectors. Exposing a key-value interface allows applications to remove a layer of indirection between application-level keys (e.g., database record IDs or file inode numbers) and data stored in the SSD. KAML also provides native transaction support tuned to support fine-grained locking, achieving improved performance compared to previous designs that require page-level locking. Finally, KAML includes a caching layer analogous to a conventional page cache that leverages host DRAM to improve performance and provides additional transactional features. We have implemented a prototype of KAML on a commercial SSD prototyping platform, and our results show that compared with existing key-value stores, KAML improves the performance of online transaction processing (OLTP) workloads by 1.1x - 4.0x, and NoSQL key-value store applications by 1.1x - 3.0x. DA - 2017/// PY - 2017/// DO - 10.1109/hpca.2017.15 SP - 373-384 SN - 1530-0897 ER - TY - JOUR TI - GazeGIS: A Gaze-Based Reading and Dynamic Geographic Information System AU - Tateosian, Laura G. AU - Glatz, Michelle AU - Shukunobe, Makiko AU - Chopra, Pankaj T2 - EYE TRACKING AND VISUALIZATION: FOUNDATIONS, TECHNIQUES, AND APPLICATIONS, ETVIS 2015 AB - Location is an important component of a narrative. Mapped place names provide vital geographical, economic, historical, political, and cultural context for the text. Online sources such as news articles, travel logs, and blogs frequently refer to geographic locations, but often these are not mapped. When a map is provided, the reader is still responsible for matching references in the text with map positions. As they read a place name within the text, readers must locate its map position, then find their place again in the text to resume reading, and repeat this for each toponym. We propose a gaze-based reading and dynamic geographic information system (GazeGIS) which uses eye tracking and geoparsing to enable a more cohesive reading experience by dynamically mapping locations just as they are encountered within the text. We developed a prototype GazeGIS application and demonstrated its application to several narrative passages. We conducted a study in which participants read text passages using the system and evaluated their experience. We also explored an application for intelligence analysis and discuss how experts in this domain envision its use. Layman and intelligence expert evaluations indicate a positive reception for this new reading paradigm. This could change the way we read online news and e-books, the way school children study political science and geography, the way officers study military history, the way intelligence analysts consume reports, and the way we plan our next vacation. DA - 2017/// PY - 2017/// DO - 10.1007/978-3-319-47024-5_8 SP - 129-147 SN - 1612-3786 ER - TY - JOUR TI - Determination of a Sampling Criterion for 3D Reconstruction AU - Lee, Deokwoo AU - Krim, Hamid T2 - JOURNAL OF IMAGING SCIENCE AND TECHNOLOGY AB - A sampling criterion for a surface reconstruction using structured light patterns is derived in this article. The problem of signal recovery from its samples is addressed, and a salient spatial frequency component of an object is defined for a sampling rate determination. The authors introduce 3D object coordinate extraction from a 2D captured image by employing structured light systems (a set of concentric circular light patterns), without any prior information about an object of interest. To achieve an efficient 3D reconstruction (approximate reconstruction result), a minimal sampling rate, defined as the minimum number of circular patterns to be projected onto the 3D scene, is derived using specific geometric information (e.g., curvature) of an object. This article chiefly deals with theoretical algorithms for efficient 3D scene reconstruction, recognition and other applications of 3D imaging techniques, and the proposed algorithms can be applied to diverse applications in the field of computer vision, 3D graphics, etc. DA - 2017/7// PY - 2017/7// DO - 10.2352/j.imagingsci.technol.2017.61.4.040501 VL - 61 IS - 4 SP - SN - 1943-3522 ER - TY - JOUR TI - Design and evaluation of a multi-recommendation system for local code search AU - Ge, , Xi AU - Shepherd, David C. AU - Damevski, Kostadin AU - Murphy-Hill, Emerson T2 - JOURNAL OF VISUAL LANGUAGES AND COMPUTING AB - Searching for relevant code in the local code base is a common activity during software maintenance. However, previous research indicates that 88% of manually composed search queries retrieve no relevant results. One reason that many searches fail is existing search tools’ dependence on string matching algorithms, which cannot find semantically related code. To solve this problem by helping developers compose better queries, researchers have proposed numerous query recommendation techniques, relying on a variety of dictionaries and algorithms. However, few of these techniques are empirically evaluated by usage data from real-world developers. To fill this gap, we designed a multi-recommendation system that relies on the cooperation between several query recommendation techniques. We implemented and deployed this recommendation system within the Sando code search tool and conducted a longitudinal field study. Our study shows that over 34% of all queries were adopted from recommendation; and recommended queries retrieved results 11% more often than manual queries. DA - 2017/4// PY - 2017/4// DO - 10.1016/j.jvlc.2016.07.002 VL - 39 SP - 1-9 SN - 1095-8533 KW - Code search KW - Recommender systems KW - Field study ER - TY - JOUR TI - Behavior Based Human Authentication on Touch Screen Devices Using Gestures and Signatures AU - Shahzad, Muhammad AU - Liu, Alex X. AU - Samuel, Arjmand T2 - IEEE TRANSACTIONS ON MOBILE COMPUTING AB - With the rich functionalities and enhanced computing capabilities available on mobile computing devices with touch screens, users not only store sensitive information (such as credit card numbers) but also use privacy sensitive applications (such as online banking) on these devices, which make them hot targets for hackers and thieves. To protect private information, such devices typically lock themselves after a few minutes of inactivity and prompt a password/PIN/pattern screen when reactivated. Passwords/ PINs/patterns based schemes are inherently vulnerable to shoulder surfing attacks and smudge attacks. In this paper, we propose BEAT, an authentication scheme for touch screen devices that authenticates users based on their behavior of performing certain actions on the touch screens. An action is either a gesture, which is a brief interaction of a user's fingers with the touch screen such as swipe rightwards, or a signature, which is the conventional unique handwritten depiction of one's name. Unlike existing authentication schemes for touch screen devices, which use what user inputs as the authentication secret, BEAT authenticates users mainly based on howthey input, using distinguishing features such as velocity, device acceleration, and stroke time. Even if attackers see what action a user performs, they cannot reproduce the behavior of the user doing those actions through shoulder surfing or smudge attacks. We implemented BEATon Samsung Focus smart phones and Samsung Slate tablets running Windows, collected 15,009 gesture samples and 10,054 signature samples, and conducted real-time experiments to evaluate its performance. Experimental results show that, with only 25 training samples, for gestures, BEATachieves an average equal error rate of 0.5 percent with three gestures and for signatures, it achieves an average equal error rate of 0.52 percent with single signature. DA - 2017/10/1/ PY - 2017/10/1/ DO - 10.1109/tmc.2016.2635643 VL - 16 IS - 10 SP - 2726-2741 SN - 1558-0660 KW - Mobile authentication KW - touch screen devices KW - gesture KW - signature ER - TY - JOUR TI - Adaptive subdomain modeling: A multi-analysis technique for ocean circulation models AU - Altuntas, Alper AU - Baugh, John T2 - OCEAN MODELLING AB - Many coastal and ocean processes of interest operate over large temporal and geographical scales and require a substantial amount of computational resources, particularly when engineering design and failure scenarios are also considered. This study presents an adaptive multi-analysis technique that improves the efficiency of these computations when multiple alternatives are being simulated. The technique, called adaptive subdomain modeling, concurrently analyzes any number of child domains, with each instance corresponding to a unique design or failure scenario, in addition to a full-scale parent domain providing the boundary conditions for its children. To contain the altered hydrodynamics originating from the modifications, the spatial extent of each child domain is adaptively adjusted during runtime depending on the response of the model. The technique is incorporated in ADCIRC++, a re-implementation of the popular ADCIRC ocean circulation model with an updated software architecture designed to facilitate this adaptive behavior and to utilize concurrent executions of multiple domains. The results of our case studies confirm that the method substantially reduces computational effort while maintaining accuracy. DA - 2017/7// PY - 2017/7// DO - 10.1016/j.ocemod.2017.05.009 VL - 115 SP - 86-104 SN - 1463-5011 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85020014888&partnerID=MN8TOARS KW - Storm surge KW - Adaptive algorithm KW - Subdomain modeling KW - Moving boundaries KW - ADCIRC ER - TY - CONF TI - A comparison of IoT application layer protocols through a smart parking implementation AU - Kayal, P. AU - Perros, H. AB - Several IoT protocols have been introduced in order to provide an efficient communication for resource-ronstrained applications. However, their performance is not as yet well understood. To address this issue, we evaluated and compared four communication protocols, namely, CoAP, MQTT, XMPP, and WebSocket. For this, we implemented a smart parking application using open source software for these protocols and measured their response time by varying the traffic load. C2 - 2017/// C3 - Proceedings of the 2017 20th conference on innovations in clouds, internet and networks (icin) DA - 2017/// DO - 10.1109/icin.2017.7899436 SP - 331-336 ER - TY - JOUR TI - A Lifelong Learning Topic Model Structured Using Latent Embeddings AU - Xu, Mingyang AU - Yang, Ruixin AU - Harenberg, Steve AU - Samatova, Nagiza F. T2 - 2017 11TH IEEE INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC) AB - We propose a latent-embedding-structured lifelong learning topic model, called the LLT model, to discover coherent topics from a corpus. Specifically, we exploit latent word embeddings to structure our model and mine word correlation knowledge to assist in topic modeling. During each learning iteration, our model learns new word embeddings based on the topics generated in the previous learning iteration. Experimental results demonstrate that our LLT model is able to generate more coherent topics than state-of-the-art methods. DA - 2017/// PY - 2017/// DO - 10.1109/icsc.2017.15 SP - 260-261 SN - 2325-6516 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85018319146&partnerID=MN8TOARS KW - Lifelong learning KW - Topic modeling KW - Latent embeddings ER - TY - JOUR TI - Touchscreen interfaces in context: A systematic review of research into touchscreens across settings, populations, and implementations AU - Orphanides, Andreas K. AU - Nam, Chang S. T2 - APPLIED ERGONOMICS AB - Although many studies have been conducted on the human factors and ergonomics (HFE) of touchscreens, no comprehensive review has summarized the findings of these studies. Based on a schema (three dimensions of understanding critical for successful display selection) presented by Wickens et al. (2004), we identified three dimensions of analysis for touchscreen implementations: touchscreen technology, setting and environment of implementation, and user population. We conducted a systematic review based on the PRISMA protocol (Moher et al., 2009), searching five article databases for relevant quantitative literature on touchscreens. We found that all three dimensions of analysis have a significant effect on the HFE of touchscreens, and that a selection for or against touchscreens must take into consideration the specific context of system interaction in order to maximize safety, performance, and user satisfaction. Our report concludes with a set of specific recommendations for systems designers considering touchscreens as input/output devices, and suggestions for future study into the HFE of touchscreens. DA - 2017/5// PY - 2017/5// DO - 10.1016/j.apergo.2017.01.013 VL - 61 SP - 116-143 SN - 1872-9126 KW - Touchscreen interface KW - Human factors and ergonomics KW - User-centered design ER - TY - JOUR TI - Sharing Policies in Multiuser Privacy Scenarios: Incorporating Context, Preferences, and Arguments in Decision Making AU - Fogues, Ricard L. AU - Murukannaiah, Pradeep K. AU - Such, Jose M. AU - Singh, Munindar P. T2 - ACM TRANSACTIONS ON COMPUTER-HUMAN INTERACTION AB - Social network services (SNSs) enable users to conveniently share personal information. Often, the information shared concerns other people, especially other members of the SNS. In such situations, two or more people can have conflicting privacy preferences; thus, an appropriate sharing policy may not be apparent. We identify such situations as multiuser privacy scenarios . Current approaches propose finding a sharing policy through preference aggregation. However, studies suggest that users feel more confident in their decisions regarding sharing when they know the reasons behind each other’s preferences. The goals of this paper are (1) understanding how people decide the appropriate sharing policy in multiuser scenarios where arguments are employed, and (2) developing a computational model to predict an appropriate sharing policy for a given scenario. We report on a study that involved a survey of 988 Amazon Mechanical Turk (MTurk) users about a variety of multiuser scenarios and the optimal sharing policy for each scenario. Our evaluation of the participants’ responses reveals that contextual factors, user preferences, and arguments influence the optimal sharing policy in a multiuser scenario. We develop and evaluate an inference model that predicts the optimal sharing policy given the three types of features. We analyze the predictions of our inference model to uncover potential scenario types that lead to incorrect predictions, and to enhance our understanding of when multiuser scenarios are more or less prone to dispute. DA - 2017/3// PY - 2017/3// DO - 10.1145/3038920 VL - 24 IS - 1 SP - SN - 1557-7325 UR - https://publons.com/publon/21294367/ KW - Privacy KW - social media KW - multiuser KW - argumentation KW - crowdsourcing ER - TY - JOUR TI - Continuous Authentication and Authorization for the Internet of Things AU - Shahzad, Muhammad AU - Singh, Munindar P. T2 - IEEE INTERNET COMPUTING AB - With the dawn of the Internet of Things, small but smart devices have become ubiquitous. Although these devices carry a lot of compute power and enable several interesting applications, they lack conventional interfaces such as keyboards, mice, and touchscreens. As a result, such devices can't authenticate and authorize users in familiar ways. Furthermore, unlike for conventional settings, a one-time authentication at the start of a session usually isn't appropriate for the IoT, because the application scenarios are dynamic and a user might not retain physical control or even awareness of IoT devices quite as readily as with traditional computers. Thus, users need to be continuously authenticated and authorized. Fortunately, the IoT offers interesting potential solutions for meeting these requirements. This article discusses some challenges and opportunities in developing continuous authentication and authorization approaches for the IoT while also presenting a case study of a Wi-Fi-based human authentication system called WiFiU. DA - 2017/// PY - 2017/// DO - 10.1109/mic.2017.33 VL - 21 IS - 2 SP - 86-90 SN - 1941-0131 UR - https://publons.com/publon/21294366/ ER - TY - JOUR TI - The Top 10 Adages in Continuous Deployment AU - Parnin, Chris AU - Helms, Eric AU - Atlee, Chris AU - Boughton, Harley AU - Ghattas, Mark AU - Glover, Andy AU - Holman, James AU - Micco, John AU - Murphy, Brendan AU - Savor, Tony AU - Stumm, Michael AU - Whitaker, Shari AU - Williams, Laurie T2 - IEEE SOFTWARE AB - Continuous deployment involves automatically testing incremental software changes and frequently deploying them to production environments. With it, developers' changes can reach customers in days or even hours. Such ultrafast changes create a new reality in software development. To understand the emerging practices surrounding continuous deployment, researchers facilitated a one-day Continuous Deployment Summit at the Facebook campus in July 2015, at which participants from 10 companies described how they used continuous deployment. From the resulting conversation, the researchers derived 10 adages about continuous-deployment practices. These adages represent a working set of approaches and beliefs that guide current practice and establish a tangible target for empirical validation by the research community. DA - 2017/// PY - 2017/// DO - 10.1109/ms.2017.86 VL - 34 IS - 3 SP - 86-95 SN - 1937-4194 ER - TY - JOUR TI - On Distance-Adaptive Routing and Spectrum Assignment in Mesh Elastic Optical Networks AU - Talebi, Sahar AU - Rouskas, George N. T2 - JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING AB - The routing and spectrum assignment (RSA) problem has emerged as the key design and control problem in elastic optical networks. Distance-adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. In this paper, we consider the distance-adaptive RSA (DA-RSA) problem with fixed alternate routing. We first show that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem. We then leverage insights from the scheduling theory to 1) present new results regarding the complexity of the DA-RSA problem and 2) build upon the list of scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources. DA - 2017/5// PY - 2017/5// DO - 10.1364/jocn.9.000456 VL - 9 IS - 5 SP - 456-465 SN - 1943-0639 KW - Distance-adaptive routing and spectrum assignment KW - Elastic optical networks KW - Multiprocessor scheduling KW - Network design KW - Spectrum assignment ER - TY - JOUR TI - Less is more: Minimizing code reorganization using XTREE AU - Krishna, Rahul AU - Menzies, Tim AU - Layman, Lucas T2 - INFORMATION AND SOFTWARE TECHNOLOGY AB - Context: Developers use bad code smells to guide code reorganization. Yet developers, textbooks, tools, and researchers disagree on which bad smells are important. How can we offer reliable advice to developers about which bad smells to fix? Objective: To evaluate the likelihood that a code reorganization to address bad code smells will yield improvement in the defect-proneness of the code. Method: We introduce XTREE, a framework that analyzes a historical log of defects seen previously in the code and generates a set of useful code changes. Any bad smell that requires changes outside of that set can be deprioritized (since there is no historical evidence that the bad smell causes any problems). Evaluation: We evaluate XTREE’s recommendations for bad smell improvement against recommendations from previous work (Shatnawi, Alves, and Borges) using multiple data sets of code metrics and defect counts. Results: Code modules that are changed in response to XTREE’s recommendations contain significantly fewer defects than recommendations from previous studies. Further, XTREE endorses changes to very few code metrics, so XTREE requires programmers to do less work. Further, XTREE’s recommendations are more responsive to the particulars of different data sets. Finally XTREE’s recommendations may be generalized to identify the most crucial factors affecting multiple datasets (see the last figure in paper). Conclusion: Before undertaking a code reorganization based on a bad smell report, use a framework like XTREE to check and ignore any such operations that are useless; i.e. ones which lack evidence in the historical record that it is useful to make that change. Note that this use case applies to both manual code reorganizations proposed by developers as well as those conducted by automatic methods. DA - 2017/8// PY - 2017/8// DO - 10.1016/j.infsof.2017.03.012 VL - 88 SP - 53-66 SN - 1873-6025 KW - Bad smells KW - Performance prediction KW - Decision trees ER - TY - JOUR TI - A guest editorial: special issue on search based software engineering and data mining AU - Kessentini, Marouane AU - Menzies, Tim T2 - AUTOMATED SOFTWARE ENGINEERING DA - 2017/9// PY - 2017/9// DO - 10.1007/s10515-017-0217-2 VL - 24 IS - 3 SP - 573-574 SN - 1573-7535 ER - TY - JOUR TI - Recognizing Keystrokes Using WiFi Devices AU - Ali, Kamran AU - Liu, Alex X. AU - Wang, Wei AU - Shahzad, Muhammad T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - Keystroke privacy is critical for ensuring the security of computer systems and the privacy of human users as what is being typed could be passwords or privacy sensitive information. In this paper, we show for the first time that WiFi signals can also be exploited to recognize keystrokes. The intuition is that while typing a certain key, the hands and fingers of a user move in a unique formation and direction and thus generate a unique pattern in the time-series of channel state information (CSI) values, which we call CSI-waveform for that key. In this paper, we propose a WiFi signal-based keystroke recognition system called WiKey. WiKey consists of two commercial off-the-shelf WiFi devices, a sender (such as a router) and a receiver (such as a laptop). The sender continuously emits signals and the receiver continuously receives signals. When a human subject types on a keyboard, WiKey recognizes the typed keys based on how the CSI values at the WiFi signal receiver end. We implemented the WiKey system using a TP-Link TL-WR1043ND WiFi router and a Lenovo X200 laptop. WiKey achieves over 97.5% detection rate for detecting the keystroke and 96.4% recognition accuracy for classifying single keys. In real-world experiments, WiKey can recognize keystrokes in a continuously typed sentence with an accuracy of 93.5%. WiKey can also recognize complete words inside a sentence with over 85% accuracy. DA - 2017/5// PY - 2017/5// DO - 10.1109/jsac.2017.2680998 VL - 35 IS - 5 SP - 1175-1190 SN - 1558-0008 KW - Keystroke recognition KW - wireless sensing KW - human computer interaction (HCI) KW - wireless security ER - TY - JOUR TI - NEAT: Network link emulation with adaptive time dilation AU - Lee, Hee Won AU - Sichitiu, Mihail L. AU - Thuente, David T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING AB - In evaluating the performance of highly complex networked systems, emulation is often used as it maintains much of the realism of testbeds, while offering increased flexibility and scalability. In large emulation systems, multiple and heterogeneous virtual machines can be deployed in relatively few general purpose physical hosts. Time dilation is a technique that allows virtual time to pass at a different (and potentially variable) rate with respect to real time, allowing for increased scalability of the emulated system. In this paper we present networking links in a large emulated system employing adaptive time dilation. The link emulation focuses on accurate delay and throughput emulation while allowing varying time dilation factors. To evaluate our system, we measure the delay and throughput of the virtual links under variable system loads. DA - 2017/6// PY - 2017/6// DO - 10.1016/j.jpdc.2017.01.013 VL - 104 SP - 88-98 SN - 1096-0848 KW - Network emulation KW - Time dilation KW - Virtual time KW - Distributed system KW - Virtual machines KW - KVM KW - QEMU ER - TY - JOUR TI - Experience, experiment, evaluate: A framework for assessing experiential games AU - Lytle, N. AU - Floryan, M. AU - Amin, D. T2 - International Journal of Serious Games DA - 2017/// PY - 2017/// VL - 4 IS - 1 SP - 15-30 ER - TY - JOUR TI - Device-Free Human Activity Recognition Using Commercial WiFi Devices AU - Wang, Wei AU - Liu, Alex X. AU - Shahzad, Muhammad AU - Ling, Kang AU - Lu, Sanglu T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - Since human bodies are good reflectors of wireless signals, human activities can be recognized by monitoring changes in WiFi signals. However, existing WiFi-based human activity recognition systems do not build models that can quantify the correlation between WiFi signal dynamics and human activities. In this paper, we propose a Channel State Information (CSI)-based human Activity Recognition and Monitoring system (CARM). CARM is based on two theoretical models. First, we propose a CSI-speed model that quantifies the relation between CSI dynamics and human movement speeds. Second, we propose a CSI-activity model that quantifies the relation between human movement speeds and human activities. Based on these two models, we implemented the CARM on commercial WiFi devices. Our experimental results show that the CARM achieves recognition accuracy of 96% and is robust to environmental changes. DA - 2017/5// PY - 2017/5// DO - 10.1109/jsac.2017.2679658 VL - 35 IS - 5 SP - 1118-1131 SN - 1558-0008 KW - Device-free sensing KW - human activities KW - WiFi KW - CSI ER - TY - JOUR TI - A Service Computing Manifesto: The Next 10 Years AU - Bouguettaya, Athman AU - Singh, Munindar AU - Huhns, Michael AU - Sheng, Quan Z. AU - Dong, Hai AU - Yu, Qi AU - Neiat, Azadeh Ghari AU - Mistry, Sajib AU - Benatallah, Boualem AU - Medjahed, Brahim AU - Ouzzani, Mourad AU - Casati, Fabio AU - Liu, Xumin AU - Wang, Hongbing AU - Georgakopoulos, Dimitrios AU - Chen, Liang AU - Nepal, Surya AU - Malik, Zaki AU - Erradi, Abdelkarim AU - Wang, Yan AU - Blake, Brian AU - Dustdar, Schahram AU - Leymann, Frank AU - Papazoglou, Michael T2 - COMMUNICATIONS OF THE ACM AB - Mapping out the challenges and strategies for the widespread adoption of service computing. DA - 2017/4// PY - 2017/4// DO - 10.1145/2983528 VL - 60 IS - 4 SP - 64-72 SN - 1557-7317 UR - https://publons.com/publon/5950224/ ER - TY - JOUR TI - Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times AU - Pei, J. AU - Liu, X. B. AU - Pardalos, P. M. AU - Fan, W. J. AU - Yang, S. L. T2 - Annals of Operations Research DA - 2017/// PY - 2017/// VL - 249 IS - 1-2 SP - 175-195 ER - TY - JOUR TI - Preface for the Special Issue on AI-Supported Education in Computer Science AU - Barnes, Tiffany AU - Boyer, Kristy AU - Hsiao, Sharon I-Han AU - Le, Nguyen-Thinh AU - Sosnovsky, Sergey T2 - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION DA - 2017/3// PY - 2017/3// DO - 10.1007/s40593-016-0123-y VL - 27 IS - 1 SP - 1-4 SN - 1560-4306 ER - TY - JOUR TI - Optimizing Data Placement on GPU Memory: A Portable Approach AU - Chen, Guoyang AU - Shen, Xipeng AU - Wu, Bo AU - Li, Dong T2 - IEEE Transactions on Computers AB - Modern GPUs feature complex memory system designs. One GPU may contain many types of memory of different properties. The best way to place data in memory is sensitive to many factors (e.g., program inputs, architectures), making portable optimizations of GPU data placement a difficult challenge. PORPLE is a recently proposed method that overcomes the difficulties by enabling online optimizations of data placement through a three-way synergy: a specification language for memory system description, a compiler framework for data access analysis and code staging, and a runtime library for efficiently finding and materializing data placement on the fly. This article provides a comprehensive description of this method, and presents several extensions that significantly improve the scalability of PORPLE, which include a novel algorithm design for efficiently searching for the best data placements, the use of active profiling for reducing the online-profiling overhead, and a systematic examination of a path-based performance model. By automatically tailoring data placements for each execution of a GPU program, the enhanced PORPLE brings significant speedups (1.72X on average) to many GPU kernels across GPU architectures and program inputs. DA - 2017/3/1/ PY - 2017/3/1/ DO - 10.1109/tc.2016.2604372 VL - 66 IS - 3 SP - 473-487 J2 - IEEE Trans. Comput. OP - SN - 0018-9340 UR - http://dx.doi.org/10.1109/TC.2016.2604372 DB - Crossref KW - GPU KW - memory performance KW - cache KW - compiler KW - data placement KW - hardware specification language ER - TY - JOUR TI - Evolution of an Intelligent Deductive Logic Tutor Using Data-Driven Elements AU - Mostafavi, Behrooz AU - Barnes, Tiffany T2 - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION DA - 2017/3// PY - 2017/3// DO - 10.1007/s40593-016-0112-1 VL - 27 IS - 1 SP - 5-36 SN - 1560-4306 KW - Deductive logic instruction KW - Intelligent tutoring systems KW - Data-driven methods ER - TY - JOUR TI - Do You Think You Can? The Influence of Student Self-Efficacy on the Effectiveness of Tutorial Dialogue for Computer Science AU - Wiggins, Joseph B. AU - Grafsgaard, Joseph F. AU - Boyer, Kristy Elizabeth AU - Wiebe, Eric N. AU - Lester, James C. T2 - INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION DA - 2017/3// PY - 2017/3// DO - 10.1007/s40593-015-0091-7 VL - 27 IS - 1 SP - 130-153 SN - 1560-4306 KW - Self-efficacy KW - Tutorial dialogue KW - Computer science education ER - TY - JOUR TI - A Leader-Follower Controlled Markov Stopping Game for Delay Tolerant and Opportunistic Resource Sharing Networks AU - He, Xiaofan AU - Dai, Huaiyu AU - Ning, Peng AU - Dutta, Rudra T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS AB - In various resource sharing networks, opportunistic resources with dynamic quality are often present for the users to exploit. As many user tasks are delay-tolerant, this favorably allows the network users to wait for and access the opportunistic resource at the time of its best quality. For such delay-tolerant and opportunistic resource sharing networks, the resource accessing strategies developed in the literature suffer from three limitations. First, they mainly focused on single-user scenarios, whereas the competition from other users is ignored. Second, the influence from the resource seller who may take actions to manipulate the resource sharing procedure is not considered. Third, the impact of the actions from both the network users and the resource seller on the resource quality dynamics is not considered either. To overcome these limitations, a leader-follower controlled Markov stopping game (LF-C-MSG) is developed in this paper. The derived Stackelberg equilibrium strategy of the LF-C-MSG can be used to guide the behaviors of both the network users and the resource seller for better performance and resource utilization efficiency. Two exemplary applications of the proposed LF-C-MSG are presented, along with corresponding numerical results to verify the effectiveness of the proposed framework. DA - 2017/3// PY - 2017/3// DO - 10.1109/jsac.2017.2659581 VL - 35 IS - 3 SP - 615-627 SN - 1558-0008 KW - Resource sharing KW - delay tolerant KW - opportunistic resource KW - game theory KW - optimal stopping ER - TY - JOUR TI - Twist-3 Distribution Amplitudes of Pion in the Light-Front Quark Model AU - Choi, Ho-Meoyng AU - Ji, Chueng-Ryong T2 - FEW-BODY SYSTEMS AB - We analyzed two twist-3 distribution amplitudes of pion, i.e. pseudoscalar $\phi^P_{3;\pi}(x)$ and pseudotensor $\phi^\sigma_{3;\pi}(x)$, within the LFQM. Our LFQM descriptions both for twist-3 $\phi^P_{3;\pi}$ and $\phi^\sigma_{3;\pi}$ not only satisfy the fundamental constraint required from the isospin symmetry, but also reproduce exactly the asymptotic forms anticipated from QCD's conformal limit. DA - 2017/3// PY - 2017/3// DO - 10.1007/s00601-016-1208-8 VL - 58 IS - 2 SP - SN - 1432-5411 ER - TY - JOUR TI - The Use of Functional Data Analysis to Evaluate Activity in a Spontaneous Model of Degenerative Joint Disease Associated Pain in Cats AU - Gruen, Margaret E. AU - Alfaro-Cordoba, Marcela AU - Thomson, Andrea E. AU - Worth, Alicia C. AU - Staicu, Ana-Maria AU - Lascelles, B. Duncan X. T2 - PLOS ONE AB - Introduction and objectives Accelerometry is used as an objective measure of physical activity in humans and veterinary species. In cats, one important use of accelerometry is in the study of therapeutics designed to treat degenerative joint disease (DJD) associated pain, where it serves as the most widely applied objective outcome measure. These analyses have commonly used summary measures, calculating the mean activity per-minute over days and comparing between treatment periods. While this technique has been effective, information about the pattern of activity in cats is lost. In this study, functional data analysis was applied to activity data from client-owned cats with (n = 83) and without (n = 15) DJD. Functional data analysis retains information about the pattern of activity over the 24-hour day, providing insight into activity over time. We hypothesized that 1) cats without DJD would have higher activity counts and intensity of activity than cats with DJD; 2) that activity counts and intensity of activity in cats with DJD would be inversely correlated with total radiographic DJD burden and total orthopedic pain score; and 3) that activity counts and intensity would have a different pattern on weekends versus weekdays. Results and conclusions Results showed marked inter-cat variability in activity. Cats exhibited a bimodal pattern of activity with a sharp peak in the morning and broader peak in the evening. Results further showed that this pattern was different on weekends than weekdays, with the morning peak being shifted to the right (later). Cats with DJD showed different patterns of activity from cats without DJD, though activity and intensity were not always lower; instead both the peaks and troughs of activity were less extreme than those of the cats without DJD. Functional data analysis provides insight into the pattern of activity in cats, and an alternative method for analyzing accelerometry data that incorporates fluctuations in activity across the day. DA - 2017/1/18/ PY - 2017/1/18/ DO - 10.1371/journal.pone.0169576 VL - 12 IS - 1 SP - SN - 1932-6203 ER - TY - JOUR TI - Multi-Category RFID Estimation AU - Liu, Xiulong AU - Li, Keqiu AU - Liu, Alex X. AU - Guo, Song AU - Shahzad, Muhammad AU - Wang, Ann L. AU - Wu, Jie T2 - IEEE-ACM TRANSACTIONS ON NETWORKING AB - This paper concerns the practically important problem of multi-category radio frequency identification (RFID) estimation: given a set of RFID tags, we want to quickly and accurately estimate the number of tags in each category. However, almost all the existing RFID estimation protocols are dedicated to the estimation problem on a single set, regardless of tag categories. A feasible solution is to separately execute the existing estimation protocols on each category. The execution time of such a serial solution is proportional to the number of categories, and cannot satisfy the delay-stringent application scenarios. Simultaneous RIFD estimation over multiple categories is desirable, and hence, this paper proposes an approach called simultaneous estimation for multi-category RFID systems (SEM). SEM exploits the Manchester-coding mechanism, which is supported by the ISO 18000-6 RFID standard, to decode the combined signals, thereby simultaneously obtaining the reply status of tags from each category. As a result, multiple bit vectors are decoded from just one physical slotted frame. Built on our SEM, many existing excellent estimation protocols can be used to estimate the tag cardinality of each category in a simultaneous manner. To ensure the predefined accuracy, we calculate the variance of the estimate in one round, as well as the variance of the average estimate in multiple rounds. To find the optimal frame size, we propose an efficient binary search-based algorithm. To address significant variance in category sizes, we propose an adaptive partitioning (AP) strategy to group categories of similar sizes together and execute the estimation protocol for each group separately. Compared with the existing protocols, our approach is much faster, meanwhile satisfying the predefined estimation accuracy. For example, with 20 categories, the proposed SEM+AP is about seven times faster than prior estimation schemes. Moreover, our approach is the only one whose normalized estimation time (i.e., time per category) decreases as the number of categories increases. DA - 2017/2// PY - 2017/2// DO - 10.1109/tnet.2016.2594481 VL - 25 IS - 1 SP - 264-277 SN - 1558-2566 KW - RFID KW - cardinality estimation KW - multi-category KW - Manchester coding KW - adaptive partitioning ER - TY - JOUR TI - Influence of Radical Bridges on Electron Spin Coupling AU - Steenbock, Torben AU - Shultz, David A. AU - Kirk, Martin L. AU - Herrmann, Carmen T2 - JOURNAL OF PHYSICAL CHEMISTRY A AB - Increasing interactions between spin centers in molecules and molecular materials is a desirable goal for applications such as single-molecule magnets for information storage or magnetic metal–organic frameworks for adsorptive separation and targeted drug delivery and release. To maximize these interactions, introducing unpaired spins on bridging ligands is a concept used in several areas where such interactions are otherwise quite weak, in particular, lanthanide-based molecular magnets and magnetic metal–organic frameworks. Here, we use Kohn–Sham density functional theory to study how much the ground spin state is stabilized relative to other low-lying spin states by creating an additional spin center on the bridge for a series of simple model compounds. The di- and triradical structures consist of nitronyl nitroxide (NNO) and semiquinone (SQ) radicals attached to a meta-phenylene(R) bridge (where R = −NH•/–NH2, −O•/OH, −CH2•/CH2). These model compounds are based on a fully characterized SQ–meta-phenylene–NNO diradical with moderately strong antiferromagnetic coupling. Replacing closed-shell substituents CH3 and NH2 with their radical counterparts CH2• and NH• leads to an increase in stabilization of the ground state with respect to other low-lying spin states by a factor of 3–6, depending on the exchange–correlation functional. For OH compared with O• substituents, no conclusions can be drawn as the spin state energetics depend strongly on the functional. This could provide a basis for constructing sensitive test systems for benchmarking theoretical methods for spin state energy splittings. Reassuringly, the stabilization found for a potentially synthesizable complex (up to a factor of 3.5) is in line with the simple model systems (where a stabilization of up to a factor of 6.2 was found). Absolute spin state energy splittings are considerably smaller for the potentially stable system than those for the model complexes, which points to a dependence on the spin delocalization from the radical substituent on the bridge. DA - 2017/1/12/ PY - 2017/1/12/ DO - 10.1021/acs.jpca.6b07270 VL - 121 IS - 1 SP - 216-225 SN - 1089-5639 ER - TY - JOUR TI - Algorithm Animation with Galant AU - Stallmann, Matthias F. T2 - IEEE COMPUTER GRAPHICS AND APPLICATIONS AB - Although surveys suggest positive student attitudes toward the use of algorithm animations, it is not clear that they improve learning outcomes. The Graph Algorithm Animation Tool, or Galant, challenges and motivates students to engage more deeply with algorithm concepts, without distracting them with programming language details or GUIs. Even though Galant is specifically designed for graph algorithms, it has also been used to animate other algorithms, most notably sorting algorithms. DA - 2017/// PY - 2017/// DO - 10.1109/mcg.2017.2 VL - 37 IS - 1 SP - 8-14 SN - 1558-1756 ER - TY - JOUR TI - Semantics-Enabled Framework for Spatial Image Information Mining of Linked Earth Observation Data AU - Kurte, Kuldeep R. AU - Durbha, Surya S. AU - King, Roger L. AU - Younan, Nicolas H. AU - Vatsavai, Rangaraju T2 - IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING AB - Recent developments in sensor technology are contributing toward the tremendous growth of remote sensing (RS) archives (currently, at the petabyte scale). However, this data largely remain unexploited due to the current limitations in the data discovery, querying, and retrieval capabilities. This issue becomes exacerbated in disaster situations, where there is a need for rapid processing and retrieval of the affected areas. Furthermore, the retrieval of images based on the spatial configurations of affected regions [land use/cover (LULC) classes] in an image is important in disaster situations such as floods and earthquakes. The majority of existing Earth observation (EO) image information mining (IIM) systems does not consider the spatial relations among image regions during image retrieval (aka spatial semantic gap). In this work, we have specifically addressed two issues, i.e., explicit modeling of topological and directional relationships between image regions, and development of a resource description framework (RDF)-based spatial semantic graphs (SSGs). This enables more intuitive querying and reasoning on the archived data. A spatial IIM (SIIM) framework is proposed, which integrates a logic-based reasoning mechanism to extract the hidden spatial relationships (both topological and directional) and enables image retrieval based on spatial relationships. The system is tested using several spatial relations-based queries on the RS image repository of flood-affected areas to check its applicability in post flood scenario. Precision, recall, and F-measure metrics were used to evaluate the performance of the SIIM system, which showed good potential for spatial relations-based image retrieval. DA - 2017/1// PY - 2017/1// DO - 10.1109/jstars.2016.2547992 VL - 10 IS - 1 SP - 29-44 SN - 2151-1535 KW - Description logic (DL) KW - direction relations KW - image retrieval KW - linked data KW - reasoning KW - region connection calculus (RCC-8) KW - resource description framework (RDF) KW - semantic web rules language (SWRL) KW - SPARQL KW - spatial image information mining (SIIM) KW - spatial relations KW - topological relations KW - Web ontology language (OWL) ER - TY - JOUR TI - Human Subtlety Proofs: Using Computer Games to Model Cognitive Processes for Cybersecurity AU - Dominguez, Ignacio X. AU - Goodwin, Prairie Rose AU - Roberts, David L. AU - St Amant, Robert T2 - INTERNATIONAL JOURNAL OF HUMAN-COMPUTER INTERACTION AB - This article describes an emerging direction in the intersection between human–computer interaction and cognitive science: the use of cognitive models to give insight into the challenges of cybersecurity (cyber-SA). The article gives a brief overview of work in different areas of cyber-SA where cognitive modeling research plays a role, with regard to direct interaction between end users and computer systems and with regard to the needs of security analysts working behind the scenes. The problem of distinguishing between human users and automated agents (bots) interacting with computer systems is introduced, as well as ongoing efforts toward building Human Subtlety Proofs (HSPs), persistent and unobtrusive windows into human cognition with direct application to cyber-SA. Two computer games are described, proxies to illustrate different ways in which cognitive modeling can potentially contribute to the development of HSPs and similar cyber-SA applications. DA - 2017/// PY - 2017/// DO - 10.1080/10447318.2016.1232229 VL - 33 IS - 1 SP - 44-54 SN - 1532-7590 ER - TY - JOUR TI - Enhancing Writing Achievement Through a Digital Learning Environment: Case Studies of Three Struggling Adolescent Male Writers AU - Pruden, Manning AU - Kerkhoff, Shea N. AU - Spires, Hiller A. AU - Lester, James T2 - READING & WRITING QUARTERLY AB - The aim of this study was to explore how Narrative Theatre, a narrative-centered digital learning environment, supported the writing processes of 3 struggling adolescent male writers. We utilized a multicase study approach to capture 3 sixth-grade participants’ experiences with the digital learning environment before, during, and after writing. The case studies provided detailed portraits of the writers as well as insights into their digital writing processes related to student interest, student ability, and value for writing. The across-case analysis revealed 3 themes (i.e., choice, scaffolding, and self-efficacy) that illustrated how the digital learning environment contributed to the students’ writing experiences. Future research and development will focus on the addition of text animation for student products and the degree to which this feature further contributes to engagement and proficiency with struggling writers. DA - 2017/// PY - 2017/// DO - 10.1080/10573569.2015.1059780 VL - 33 IS - 1 SP - 1-19 SN - 1521-0693 ER - TY - JOUR TI - Balancing noise sensitivity, response latency, and posture accuracy for a computer-assisted canine posture training system AU - Majikes, John AU - Brugarolas, Rita AU - Winters, Michael AU - Yuschak, Sherrie AU - Mealin, Sean AU - Walker, Katherine AU - Yang, Pu AU - Sherman, Barbara AU - Bozkurt, Alper AU - Roberts, David L. T2 - INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES AB - This paper describes a canine posture detection system composed of wearable sensors and instrumented devices that detect the postures sit, stand, and eat. The system consists of a customized harness outfitted with wearable Inertial Measurement Units (IMUs) and a base station for processing IMU data to classify canine postures. Research in operant conditioning, the science of behavior change, indicates that successful animal training requires consistent and accurate feedback on behavior. Properly designed computer systems excel at timeliness and accuracy, which are two characteristics most amateur trainers struggle with and professionals strive for. Therefore, in addition to the system being ergonomically designed to ensure the dog׳s comfort and well-being, it is engineered to provide posture detection with timing and accuracy on par with a professional trainer. We contend that providing a system with these characteristics will one day aid dogs in learning from humans by overcoming poor or ineffective timing during training. We present the initial steps in the development and validation of a computer-assisted training system designed to work outside of laboratory environments. The main contributions of this work are (a) to explore the trade-off between low-latency responses to changes in time-series IMU data representative of posture changes while maintaining accuracy and timing similar to a professional trainer, and (b) to provide a model for future ACI technologies by documenting the user-centered approach we followed to create a computer-assisted training system that met the criteria identified in (a). Accordingly, in addition to describing our system, we present the results of three experiments to characterize the performance of the system at capturing sit postures of dogs and providing timely reinforcement. These trade-offs are illustrated through the comparison of two algorithms. The first is Random Forest classification and the second is an algorithm which uses a Variance-based Threshold for classification of postures. Results indicate that with proper parameter tuning, our system can successfully capture and reinforce postures to provide computer-assisted training of dogs. DA - 2017/2// PY - 2017/2// DO - 10.1016/j.ijhcs.2016.04.010 VL - 98 SP - 179-195 SN - 1095-9300 KW - Animal-computer interaction KW - Classification algorithm KW - Machine learning KW - Random Forest KW - Wearable technology ER - TY - JOUR TI - Virtual multipath attack and defense for location distinction in wireless networks AU - Fang, S. AU - Liu, Y. AU - Shen, W. B. AU - Zhu, H. J. AU - Wang, T. T2 - IEEE Transactions on Mobile Computing DA - 2017/// PY - 2017/// VL - 16 IS - 2 SP - 566-580 ER - TY - JOUR TI - Understanding co-run performance on CPU-GPU integrated processors: observations, insights, directions AU - Zhu, Qi AU - Wu, Bo AU - Shen, Xipeng AU - Shen, Kai AU - Shen, Li AU - Wang, Zhiying T2 - Frontiers of Computer Science DA - 2017/2// PY - 2017/2// DO - 10.1007/s11704-016-5468-8 VL - 11 IS - 1 SP - 130-146 J2 - Front. Comput. Sci. LA - en OP - SN - 2095-2228 2095-2236 UR - http://dx.doi.org/10.1007/s11704-016-5468-8 DB - Crossref KW - performance analysis KW - GPGPU KW - co-run degradation KW - fused processor KW - program transformation ER -