TY - BOOK TI - Accuracy of service area estimation methods used for critical infrastructure recovery AU - Pala, O. AU - Wilson, D. AU - Bent, R. AU - Linger, S. AU - Arnold, J. DA - 2014/// PY - 2014/// VL - 441 SE - 173-191 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908286528&partnerID=MN8TOARS ER - TY - CONF TI - Tutorial: Text Analytics for Security AU - Enck, William AU - Xie, Tao T2 - ACM C2 - 2014/// C3 - Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security DA - 2014/// SP - 1540-1541 ER - TY - CONF TI - PREC: practical root exploit containment for android devices AU - Ho, Tsung-Hsuan AU - Dean, Daniel AU - Gu, Xiaohui AU - Enck, William T2 - ACM C2 - 2014/// C3 - Proceedings of the 4th ACM conference on Data and application security and privacy DA - 2014/// SP - 187-198 ER - TY - CONF TI - SEER: practical memory virus scanning as a service AU - Gionta, Jason AU - Azab, Ahmed AU - Enck, William AU - Ning, Peng AU - Zhang, Xiaolan T2 - ACM C2 - 2014/// C3 - Proceedings of the 30th Annual Computer Security Applications Conference DA - 2014/// SP - 186-195 ER - TY - CONF TI - NativeWrap: ad hoc smartphone application creation for end users AU - Nadkarni, Adwait AU - Tendulkar, Vasant AU - Enck, William T2 - ACM C2 - 2014/// C3 - Proceedings of the 2014 ACM conference on Security and privacy in wireless & mobile networks DA - 2014/// SP - 13-24 ER - TY - CONF TI - Modeling and sensing risky user behavior on mobile devices AU - Liu, Qian AU - Bae, Juhee AU - Watson, Benjamin AU - McLaughhlin, Anne AU - Enck, William T2 - ACM C2 - 2014/// C3 - Proceedings of the 2014 Symposium and Bootcamp on the Science of Security DA - 2014/// SP - 33 ER - TY - CONF TI - Insecure behaviors on mobile devices under stress AU - Davis, Agnes AU - Shashidharan, Ashwin AU - Liu, Qian AU - Enck, William AU - McLaughlin, Anne AU - Watson, Benjamin T2 - ACM C2 - 2014/// C3 - Proceedings of the 2014 Symposium and Bootcamp on the Science of Security DA - 2014/// SP - 31 ER - TY - CONF TI - Improving mobile application security via bridging user expectations and application behaviors AU - Yang, Wei AU - Xiao, Xusheng AU - Pandita, Rahul AU - Enck, William AU - Xie, Tao T2 - ACM C2 - 2014/// C3 - Proceedings of the 2014 Symposium and Bootcamp on the Science of Security DA - 2014/// SP - 32 ER - TY - RPRT TI - GraphAudit: Privacy Auditing for Massive Graph Mining AU - Nadkarni, Adwait AU - Sheth, A AU - Weinsberg, U AU - Taft, N AU - Enck, W A3 - North Carolina State University. Dept. of Computer Science DA - 2014/// PY - 2014/// PB - North Carolina State University. Dept. of Computer Science ER - TY - CONF TI - Dacsa: A decoupled architecture for cloud security analysis AU - Gionta, Jason AU - Azab, Ahmed AU - Enck, William AU - Ning, Peng AU - Zhang, Xiaolan C2 - 2014/// C3 - Proceedings of the 7th Workshop on Cyber Security Experimentation and Test DA - 2014/// ER - TY - JOUR TI - An Application Package Configuration Approach to Mitigating Android SSL Vulnerabilities AU - Tendulkar, Vasant AU - Enck, William T2 - arXiv preprint arXiv:1410.7745 DA - 2014/// PY - 2014/// ER - TY - CONF TI - ASM: A Programmable Interface for Extending Android Security. AU - Heuser, Stephan AU - Nadkarni, Adwait AU - Enck, William AU - Sadeghi, Ahmad-Reza C2 - 2014/// C3 - USENIX Security Symposium DA - 2014/// SP - 1005-1019 ER - TY - CONF TI - ${$ASM$}$: A Programmable Interface for Extending Android Security AU - Heuser, Stephan AU - Nadkarni, Adwait AU - Enck, William AU - Sadeghi, Ahmad-Reza C2 - 2014/// C3 - 23rd USENIX Security Symposium (USENIX Security 14) DA - 2014/// SP - 1005-1019 ER - TY - JOUR TI - Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective AU - Talebi, Sahar AU - Bampis, Evripidis AU - Lucarelli, Giorgio AU - Katib, Iyad AU - Rouskas, George N. T2 - Journal of Optical Communications and Networking AB - The routing and spectrum assignment problem has emerged as the key design and control problem in elastic optical networks. In this work, we show that the spectrum assignment (SA) problem in mesh networks transforms to the problem of scheduling multiprocessor tasks on dedicated processors. Based on this new perspective, we show that the SA problem in chain (linear) networks is NP-hard for four or more links, but is solvable in polynomial time for three links. We also develop new constant-ratio approximation algorithms for the SA problem in chains when the number of links is fixed. Finally, we present several list scheduling algorithms that are computationally efficient and simple to implement, yet produce solutions that, on average, are within 1%–5% of the lower bound. DA - 2014/7/31/ PY - 2014/7/31/ DO - 10.1364/jocn.6.000754 VL - 6 IS - 8 SP - 754 J2 - J. Opt. Commun. Netw. LA - en OP - SN - 1943-0620 1943-0639 UR - http://dx.doi.org/10.1364/jocn.6.000754 DB - Crossref ER - TY - CONF TI - Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, HVC 2014, Haifa, Israel, November 18-20, 2014. Proceedings A2 - Yahav, Eran AB - This book constitutes the refereed proceedings of the 10th International Haifa Verification Conference, HVC 2014, held in Haifa, Israel, in November 2014. The 17 revised full papers and 4 short papers C2 - 2014/// DA - 2014/// DO - 10.1007/978-3-319-13338-6 VL - 8855 PB - Springer UR - https://doi.org/10.1007/978-3-319-13338-6 ER - TY - CONF TI - Compositional solution space quantification for probabilistic software analysis AU - Borges, Mateus AU - Filieri, Antonio AU - d’Amorim, Marcelo AU - Pasareanu, Corina S. AU - Visser, Willem AB - Probabilistic software analysis aims at quantifying how likely a target event is to occur during program execution. Current approaches rely on symbolic execution to identify the conditions to reach the target event and try to quantify the fraction of the input domain satisfying these conditions. Precise quantification is usually limited to linear constraints, while only approximate solutions can be provided in general through statistical approaches. However, statistical approaches may fail to converge to an acceptable accuracy within a reasonable time. C2 - 2014/// C3 - ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, Edinburgh, United Kingdom - June 09 - 11, 2014 DA - 2014/// DO - 10.1145/2594291.2594329 SP - 123-132 UR - http://doi.acm.org/10.1145/2594291.2594329 ER - TY - CONF TI - A Comparative Study of Incremental Constraint Solving Approaches in Symbolic Execution AU - Liu, Tianhai AU - Araújo, Mateus AU - d’Amorim, Marcelo AU - Taghdiri, Mana AB - Constraint solving is a major source of cost in Symbolic Execution (SE). This paper presents a study to assess the importance of some sensible options for solving constraints in SE. The main observation is that stack-based approaches to incremental solving is often much faster compared to cache-based approaches, which are more popular. Considering all 96 C programs from the KLEE benchmark that we analyzed, the median speedup obtained with a (non-optimized) stack-based approach was of 5x. Results suggest that tools should take advantage of incremental solving support from modern SMT solvers and researchers should look for ways to combine stack- and cache-based approaches to reduce execution cost even further. Instructions to reproduce results are available online: http://asa.iti.kit.edu/130_392.php C2 - 2014/// C3 - Hardware and Software: Verification and Testing - 10th International Haifa Verification Conference, HVC 2014, Haifa, Israel, November 18-20, 2014. Proceedings DA - 2014/// DO - 10.1007/978-3-319-13338-6_21 SP - 284-299 UR - https://doi.org/10.1007/978-3-319-13338-6_21 ER - TY - CONF TI - Quantifying information leaks using reliability analysis AU - Phan, Quoc-Sang AU - Malacaria, Pasquale AU - Pasareanu, Corina S. AU - d’Amorim, Marcelo AB - We report on our work-in-progress into the use of reliability analysis to quantify information leaks. In recent work we have proposed a software reliability analysis technique that uses symbolic execution and model counting to quantify the probability of reaching designated program states, e.g. assert violations, under uncertainty conditions in the environment. The technique has many applications beyond reliability analysis, ranging from program understanding and debugging to analysis of cyber-physical systems. In this paper we report on a novel application of the technique, namely Quantitative Information Flow analysis (QIF). The goal of QIF is to measure information leakage of a program by using information-theoretic metrics such as Shannon entropy or Renyi entropy. We exploit the model counting engine of the reliability analyzer over symbolic program paths, to compute an upper bound of the maximum leakage over all possible distributions of the confidential data. C2 - 2014/// C3 - 2014 International Symposium on Model Checking of Software, SPIN 2014, Proceedings, San Jose, CA, USA, July 21-23, 2014 DA - 2014/// DO - 10.1145/2632362.2632367 SP - 105-108 UR - http://doi.acm.org/10.1145/2632362.2632367 ER - TY - JOUR TI - Efficient static checker for tainted variable attacks AU - Rimsa, Andrei AU - d’Amorim, Marcelo AU - Pereira, Fernando Magno Quintão AU - Silva Bigonha, Roberto T2 - Sci. Comput. Program. AB - Tainted flow attacks originate from program inputs maliciously crafted to exploit software vulnerabilities. These attacks are common in server-side scripting languages, such as PHP. In 1997, Ørbæk and Palsberg formalized the problem of detecting these exploits as an instance of type-checking, and gave an O(V3) algorithm to solve it, where V is the number of program variables. A similar algorithm was, ten years later, implemented on the Pixy tool. In this paper we give an O(V2) solution to the same problem. Our solution uses Bodik et al.’s extended Static Single Assignment (e-SSA) program representation. The e-SSA form can be efficiently computed and it enables us to solve the problem via a sparse dataflow analysis. Using the same infrastructure, we compared a state-of-the-art dataflow solution with our technique. Both approaches have detected 36 vulnerabilities in well known PHP programs. Our results show that our approach tends to outperform the dataflow algorithm for larger inputs. We have reported the new bugs that we found, and an implementation of our algorithm is publicly available at https://github.com/rimsa/tainted-phc.git. DA - 2014/// PY - 2014/// DO - 10.1016/j.scico.2013.03.012 VL - 80 SP - 91-105 UR - https://doi.org/10.1016/j.scico.2013.03.012 ER - TY - CONF TI - ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '14, Edinburgh, United Kingdom - June 09 - 11, 2014 A2 - O’Boyle, Michael F. P. A2 - Pingali, Keshav C2 - 2014/// DA - 2014/// PB - ACM UR - http://dl.acm.org/citation.cfm?id=2594291 ER - TY - CONF TI - 2014 International Symposium on Model Checking of Software, SPIN 2014, Proceedings, San Jose, CA, USA, July 21-23, 2014 A2 - Rungta, Neha A2 - Tkachuk, Oksana C2 - 2014/// DA - 2014/// PB - ACM UR - http://dl.acm.org/citation.cfm?id=2632362 ER - TY - JOUR TI - Implementing mixed-criticality systems upon a preemptive varying-speed processor AU - Guo, Zhishan AU - Baruah, Sanjoy T2 - Leibniz Transactions on Embedded Systems (LITES) AB - A mixed criticality (MC) workload consists of components of varying degrees of importance (or criticalities); the more critical components typically need to have their correctness validated to greater levels of assurance than the less critical ones. The problem of executing such a MC workload upon a preemptive processor whose effective speed may vary during run-time, in a manner that is not completely known prior to run-time, is considered. Such a processor is modeled as being characterized by several execution speeds: a normal speed and several levels of degraded speed. Under normal circumstances it will execute at or above its normal speed; conditions during run-time may cause it to execute slower. It is desired that all components of the MC workload execute correctly under normal circumstances. If the processor speed degrades, it should nevertheless remain the case that the more critical components execute correctly (although the less critical ones need not do so). In this work, we derive an optimal algorithm for scheduling MC workloads upon such platforms; achieving optimality does not require that the processor be able to monitor its own run-time speed. For the sub-case of the general problem where there are only two criticality levels defined, we additionally provide an implementation that is asymptotically optimal in terms of run-time efficiency. DA - 2014/// PY - 2014/// DO - 10.4230/LITES-v001-i002-a003 VL - 1 IS - 2 SP - 3:1–3:19 ER - TY - CONF TI - Graph Regularized Dual Lasso for Robust eQTL Mapping AU - Cheng, Wei AU - Zhang, Xiang AU - Guo, Zhishan AU - Shi, Yu AU - Wang, Wei T2 - 22nd Annual International Conference on Intelligent Systems for Molecular Biology (ISMB) C2 - 2014/7// C3 - Proceedings of the 22nd Annual International Conference on Intelligent Systems for Molecular Biology (ISMB) CY - Boston, MA, USA DA - 2014/7// PY - 2014/7// ER - TY - ER - TY - ER - TY - JOUR TI - Graph-regularized dual Lasso for robust eQTL mapping AU - Cheng, Wei AU - Zhang, Xiang AU - Guo, Zhishan AU - Shi, Yu AU - Wang, Wei T2 - Bioinformatics AB - Abstract Motivation: As a promising tool for dissecting the genetic basis of complex traits, expression quantitative trait loci (eQTL) mapping has attracted increasing research interest. An important issue in eQTL mapping is how to effectively integrate networks representing interactions among genetic markers and genes. Recently, several Lasso-based methods have been proposed to leverage such network information. Despite their success, existing methods have three common limitations: (i) a preprocessing step is usually needed to cluster the networks; (ii) the incompleteness of the networks and the noise in them are not considered; (iii) other available information, such as location of genetic markers and pathway information are not integrated. Results: To address the limitations of the existing methods, we propose Graph-regularized Dual Lasso (GDL), a robust approach for eQTL mapping. GDL integrates the correlation structures among genetic markers and traits simultaneously. It also takes into account the incompleteness of the networks and is robust to the noise. GDL utilizes graph-based regularizers to model the prior networks and does not require an explicit clustering step. Moreover, it enables further refinement of the partial and noisy networks. We further generalize GDL to incorporate the location of genetic makers and gene-pathway information. We perform extensive experimental evaluations using both simulated and real datasets. Experimental results demonstrate that the proposed methods can effectively integrate various available priori knowledge and significantly outperform the state-of-the-art eQTL mapping methods. Availability: Software for both C++ version and Matlab version is available at http://www.cs.unc.edu/∼weicheng/. Contact: weiwang@cs.ucla.edu Supplementary information: Supplementary data are available at Bioinformatics online. DA - 2014/6/11/ PY - 2014/6/11/ DO - 10.1093/bioinformatics/btu293 VL - 30 IS - 12 SP - i139-i148 LA - en OP - SN - 1367-4811 1367-4803 UR - http://dx.doi.org/10.1093/bioinformatics/btu293 DB - Crossref ER - TY - JOUR TI - On the benefits of providing versioning support for end users AU - Kuttal, Sandeep K. AU - Sarma, Anita AU - Rothermel, Gregg T2 - ACM Transactions on Computer-Human Interaction AB - End users with little formal programming background are creating software in many different forms, including spreadsheets, web macros, and web mashups. Web mashups are particularly popular because they are relatively easy to create, and because many programming environments that support their creation are available. These programming environments, however, provide no support for tracking versions or provenance of mashups. We believe that versioning support can help end users create, understand, and debug mashups. To investigate this belief, we have added versioning support to a popular wire-oriented mashup environment, Yahoo! Pipes. Our enhanced environment, which we call “Pipes Plumber,” automatically retains versions of pipes and provides an interface with which pipe programmers can browse histories of pipes and retrieve specific versions. We have conducted two studies of this environment: an exploratory study and a larger controlled experiment. Our results provide evidence that versioning helps pipe programmers create and debug mashups. Subsequent qualitative results provide further insights into the barriers faced by pipe programmers, the support for reuse provided by our approach, and the support for debugging provided. DA - 2014/2// PY - 2014/2// DO - 10.1145/2560016 VL - 21 IS - 2 SP - 1-43 J2 - ACM Trans. Comput.-Hum. Interact. LA - en OP - SN - 1073-0516 1557-7325 UR - http://dx.doi.org/10.1145/2560016 DB - Crossref ER - TY - CHAP TI - The Importance of Narrative as an Affective Instructional Strategy AU - Riedl, Mark AU - Young, R. Michael T2 - Design Recommendations for Intelligent Tutoring Systems A2 - Sottilare, Robert A2 - Graesser, Arthur A2 - Hu, Xiangen A2 - Goldberg, Benjamin PY - 2014/// VL - 2 SP - 57-70 PB - Springer Verlag ER - TY - JOUR TI - An integrated programming and development environment for adiabatic quantum optimization AU - Humble, T.S. AU - McCaskey, A.J. AU - Bennink, R.S. AU - Billings, J.J. AU - Dazevedo, E.D. AU - Sullivan, B.D. AU - Klymko, C.F. AU - Seddiqi, H. T2 - Computational Science and Discovery AB - Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization programs. Processor behavior depends on multiple steps to synthesize an adiabatic quantum program, which are each highly tunable. We present an integrated programming and development environment for adiabatic quantum optimization called JADE that provides control over all the steps taken during program synthesis. JADE captures the workflow needed to rigorously specify the adiabatic quantum optimization algorithm while allowing a variety of problem types, programming techniques, and processor configurations. We have also integrated JADE with a quantum simulation engine that enables program profiling using numerical calculation. The computational engine supports plug-ins for simulation methodologies tailored to various metrics and computing resources. We present the design, integration, and deployment of JADE and discuss its potential use for benchmarking adiabatic quantum optimization programs by the quantum computer science community. DA - 2014/// PY - 2014/// DO - 10.1088/1749-4680/7/1/015006 VL - 7 IS - 1 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84920520607&partnerID=MN8TOARS ER - TY - JOUR TI - Adiabatic quantum programming: Minor embedding with hard faults AU - Klymko, C. AU - Sullivan, B.D. AU - Humble, T.S. T2 - Quantum Information Processing AB - Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. These methods extend with fabric growth while scaling linearly in time and quadratically in footprint. We also provide methods for handling hard faults in the logical fabric without invoking approximations to the original problem and illustrate their versatility through numerical studies of embeddability versus fault rates in square lattices of complete bipartite unit cells. The studies show that these algorithms are more resilient to faulty fabrics than naive embedding approaches, a feature which should prove useful in benchmarking the adiabatic quantum optimization algorithm on existing faulty hardware. DA - 2014/// PY - 2014/// DO - 10.1007/s11128-013-0683-9 VL - 13 IS - 3 SP - 709-729 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894070640&partnerID=MN8TOARS KW - Quantum computing KW - Adiabatic quantum optimization KW - Graph embedding KW - Fault-tolerant computing ER - TY - CONF TI - Locally Estimating Core Numbers AU - Obrien, M.P. AU - Sullivan, B.D. AB - Graphs are a powerful way to model interactions and relationships in data from a wide variety of application domains. In this setting, entities represented by vertices at the 'center' of the graph are often more important than those associated with vertices on the 'fringes'. For example, central nodes tend to be more critical in the spread of information or disease and play an important role in clustering/community formation. Identifying such 'core' vertices has recently received additional attention in the context of network experiments, which analyze the response when a random subset of vertices are exposed to a treatment (e.g. Inoculation, free product samples, etc). Specifically, the likelihood of having many central vertices in any exposure subset can have a significant impact on the experiment. We focus on using k-cores and core numbers to measure the extent to which a vertex is central in a graph. Existing algorithms for computing the core number of a vertex require the entire graph as input, an unrealistic scenario in many real world applications. Moreover, in the context of network experiments, the sub graph induced by the treated vertices is only known in a probabilistic sense. We introduce a new method for estimating the core number based only on the properties of the graph within a region of radius δ around the vertex, and prove an asymptotic error bound of our estimator on random graphs. Further, we empirically validate the accuracy of our estimator for small values of δ on a representative corpus of real data sets. Finally, we evaluate the impact of improved local estimation on an open problem in network experimentation posed by Ugander et al. C2 - 2014/// C3 - Proceedings - IEEE International Conference on Data Mining, ICDM DA - 2014/// DO - 10.1109/ICDM.2014.136 VL - 2015-January SP - 460-469 M1 - January UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84936947120&partnerID=MN8TOARS ER - TY - CONF TI - Sequential Pattern mining in StarCraft:Brood War for short and long-term goals AU - Leece, M. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-15 SP - 8-13 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974846142&partnerID=MN8TOARS ER - TY - CONF TI - Preface AU - Horswill, I. AU - Jhala, A. AU - Dill, K. AU - Orkin, J. AU - Shaker, N. AU - Si, M. AU - Sturtevant, N. AU - Young, R.M. C2 - 2014/// C3 - Proceedings of the 10th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2014 DA - 2014/// SP - xiii-xiv UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84916910001&partnerID=MN8TOARS ER - TY - CONF TI - Multi-modal analysis of movies for rhythm extraction AU - Bates, D. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-06 SP - 14-17 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974856015&partnerID=MN8TOARS ER - TY - CONF TI - Leveraging communication for player modeling and cooperative play AU - Sarratt, T. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-19 SP - 14-17 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974830954&partnerID=MN8TOARS ER - TY - CONF TI - EduCam: Cinematic vocabulary for educational videos AU - Morgens, S.-M. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-06 SP - 57-60 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974817717&partnerID=MN8TOARS ER - TY - CONF TI - Automating camera control in games using gaze AU - Alston, C. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-06 SP - 7-13 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974817401&partnerID=MN8TOARS ER - TY - CONF TI - Converging to a player model in Monte-Carlo Tree Search AU - Sarratt, T. AU - Pynadath, D.V. AU - Jhala, A. AB - Player models allow search algorithms to account for differences in agent behavior according to player's preferences and goals. However, it is often not until the first actions are taken that an agent can begin assessing which models are relevant to its current opponent. This paper investigates the integration of belief distributions over player models in the Monte-Carlo Tree Search (MCTS) algorithm. We describe a method of updating belief distributions through leveraging information sampled during the MCTS. We then characterize the effect of tuning parameters of the MCTS to convergence of belief distributions. Evaluation of this approach is done in comparison with value iteration for an iterated version of the prisoner's dilemma problem. We show that for a sufficient quantity of iterations, our approach converges to the correct model faster than the same model under value iteration. C2 - 2014/// C3 - IEEE Conference on Computatonal Intelligence and Games, CIG DA - 2014/// DO - 10.1109/CIG.2014.6932881 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84910070055&partnerID=MN8TOARS ER - TY - CONF TI - Gamification of private digital data archive management AU - Maltzahn, C. AU - Jhala, A. AU - Mateas, M. AU - Whitehead, J. AB - The super-exponential growth of digital data world-wide is matched by personal digital archives containing songs, ebooks, audio books, photos, movies, textual documents, and documents of other media types. For many types of media it is usually a lot easier to add items than to keep archives from falling into disarray and incurring data loss. The overhead of maintaining these personal archives frequently surpasses the time and patience their owners are willing to dedicate to this important task. The promise of gamification in this context is to significantly extend the willingness to maintain personal archives by enhancing the experience of personal archive management. C2 - 2014/// C3 - ACM International Conference Proceeding Series DA - 2014/// DO - 10.1145/2594776.2594783 SP - 33-37 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899793632&partnerID=MN8TOARS ER - TY - CONF TI - Opponent state modeling in RTS games with limited information using Markov random fields AU - Leece, M. AU - Jhala, A. AB - One of the critical problems in adversarial and imperfect information domains is modeling an opponent's state from the information available to the acting agent. In the domain of real time strategy games, this information consists of the portion of the map and enemy units visible to the agent at any given point in the match. From this, we wish to infer the true values of the opponent's state, to inform both current actions and planning ahead. We present a graphical model for opponent modeling in StarCraft: Brood War that uses observed quantities to infer distributions for unseen features. We train and test this model using replays of professional play, and show that our results improve upon prior work. In addition, we present a new metric for measuring aggregate performance of a model within this domain. Finally, we consider possible use cases and extensions for this model. C2 - 2014/// C3 - IEEE Conference on Computatonal Intelligence and Games, CIG DA - 2014/// DO - 10.1109/CIG.2014.6932877 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84910070176&partnerID=MN8TOARS ER - TY - CONF TI - Mid-scale shot classification for detecting narrative transitions in movie clips AU - Zhang, B. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-06 SP - 64-71 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974777472&partnerID=MN8TOARS ER - TY - CONF TI - Domain-specific sentiment classification for games-related tweets AU - Sarratt, T. AU - Morgens, S.-M. AU - Jhala, A. C2 - 2014/// C3 - AAAI Workshop - Technical Report DA - 2014/// VL - WS-14-17 SP - 32-34 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84974816757&partnerID=MN8TOARS ER - TY - CONF TI - CAD Apps: Computer aided design applications for the MAE curriculum AU - Battestilli, Lina AU - Silverberg, Larry AU - Eischen, Jeffrey T2 - Annual MathWorks Curriculum Conference C2 - 2014/// DA - 2014/// PY - 2014/// ER - TY - CONF TI - SHE++ Documentary Screening and Discussion AU - Battestilli, L. T2 - NCSU Women In Computer Science, (WiCS) program C2 - 2014/// CY - NC State University, Raleigh, NC DA - 2014/// PY - 2014/// ER - TY - CONF TI - InVis: An EDM Tool for Graphical Rendering and Analysis of Student Interaction Data AU - Sheshadri, V. AU - Lynch, C. AU - Barnes, T. T2 - EDM 2014 A2 - Gutierrez-Santos, S. A2 - Santos, O.C. C2 - 2014/// C3 - EDM 2014 Extended Proceedings: Workshop Proceedings of the 7th International Conference on Educational Data Mining CY - London, UK DA - 2014/// PY - 2014/// PB - CEUR-WS ER - TY - CONF TI - Evaluation of Logic Proof Problem Difficulty Through Student Performance Data AU - Mostafavi, Behrooz AU - Barnes, Tiffany T2 - EDM 2014 A2 - Gutierrez-Santos, S. A2 - C, O. C2 - 2014/// C3 - EDM 2014 Extended Proceedings: Workshop Proceedings of the 7th International Conference on Educational Data Mining CY - London, UK DA - 2014/// PY - 2014/// PB - CEUR-WS ER - TY - CONF TI - Extracting temporal features using BCIpy AU - Peters, Justis AU - Jauhari, Sagar AU - Barnes, Tiffany T2 - Intelligent Tutoring Systems (ITS2014) C2 - 2014/6/5/ C3 - Proceedings of the Workshop on Utilizing EEG Input in Intelligent Tutoring Systems CY - Honolulu, Hawaii DA - 2014/6/5/ PY - 2014/6/5/ ER - TY - CONF TI - Balancing physical and cognitive challenge: A study of players psychological responses to exergame play AU - Nickel, Andrea AU - Barnes, Tiffany AU - Payton, Jamie AU - Wikstrom, Erik T2 - Foundations of Digital Games C2 - 2014/4/3/ CY - Fort Lauderdale, FL DA - 2014/4/3/ PY - 2014/4/3/ ER - TY - CONF TI - Exploring differences in problem solving with data-driven approach maps AU - Eagle, Michael AU - Barnes, Tiffany T2 - EDM2014 C2 - 2014/// C3 - Educational Data Mining CY - London, UK DA - 2014/// PY - 2014/// SP - 76–83 ER - TY - CONF TI - Generating hints for programming problems using intermediate output AU - Peddycord, Barry, III AU - Hicks, Andrew AU - Barnes, Tiffany T2 - EDM2014 C2 - 2014/// C3 - Educational Data Mining CY - London, UK DA - 2014/// PY - 2014/// SP - 92–98 ER - TY - CONF TI - Exploration of student's use of rule application references in a propositional logic tutor AU - Eagle, Michael AU - Polamreddi, Vinaya AU - Mostafavi, Behrooz AU - Barnes, Tiffany T2 - EDM2014 C2 - 2014/// C3 - Educational Data Mining CY - London, UK DA - 2014/// PY - 2014/// SP - 249–252 ER - TY - JOUR TI - Reflections from a computational service learning trip to Haiti AU - Burns, Richard AU - Eugene, Wanda AU - Barnes, Tiffany AU - Chandler, Stephen AU - Harwell, Megan AU - Omokaro, Osarieme T2 - The Journal of Computing Sciences in Colleges AB - This paper describes the experiences from two week-long service learning trips to Cap-Haitien, Haiti where a small group of computing students, faculty, and volunteers engaged young women from near... DA - 2014/1// PY - 2014/1// DO - 10.5555/2544322.2544331 VL - 29 IS - 3 SP - 43–50 ER - TY - JOUR TI - Feature selection based on meta-heuristics for biomedicine AU - Wang, L. AU - Ni, H. AU - Yang, R. AU - Pappu, V. AU - Fenn, M.B. AU - Pardalos, P.M. T2 - Optimization Methods and Software AB - Feature selection can efficiently improve the accuracy of classification and reduce the measurement, storage and computation demands, and thus it has been applied in biomedical research increasingly. Considering the non-deterministic polynomial-time hard characteristic of feature selection, meta-heuristics are introduced into feature selection in biomedicine on account of their excellent global search ability. However, most of biomedical problems are characterized by high dimensionality, which is a challenge for feature selection methods based on meta-heuristics due to the curse of dimensionality. Thus, six meta-heuristics, that is, a genetic algorithm, particle swarm optimization, ant colony optimization, harmony search, differential evolution, and quantum-inspired evolutionary algorithm, which are widely studied in the meta-heuristic community, are introduced into feature selection in this paper and the performance of the algorithms is analysed and compared with each other for solving feature selection in biomedicine effectively. To evaluate the search ability of the algorithms fairly and exactly, a set of feature selection benchmark problems are designed and yielded for the performance tests. The experimental results show that all the meta-heuristics are powerful enough to achieve the ideal results on low-dimensional feature selection problems, while it is essential to choose a proper algorithm for the high-dimensional ones. DA - 2014/// PY - 2014/// DO - 10.1080/10556788.2013.834900 VL - 29 IS - 4 SP - 703-719 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894101318&partnerID=MN8TOARS KW - meta-heuristic KW - feature selection KW - biomedicine ER - TY - BOOK TI - A simple human learning optimization algorithm AU - Wang, L. AU - Ni, H. AU - Yang, R. AU - Fei, M. AU - Ye, W. AB - This paper presents a novel Simple Human Learning Optimization (SHLO) algorithm, which is inspired by human learning mechanisms. Three learning operators are developed to generate new solutions and search for the optima by mimicking the learning behaviors of human. The 0-1 knapsack problems are adopted as benchmark problems to validate the performance of SHLO, and the results are compared with those of binary particle swarm optimization (BPSO), modified binary differential evolution (MBDE), binary fruit fly optimization algorithm (bFOA) and adaptive binary harmony search algorithm (ABHS). The experimental results demonstrate that SHLO significantly outperforms BPSO, MBDE, bFOA and ABHS. Considering the ease of implementation and the excellence of global search ability, SHLO is a promising optimization tool. DA - 2014/// PY - 2014/// DO - 10.1007/978-3-662-45261-5_7 VL - 462 SE - 56-65 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908599084&partnerID=MN8TOARS ER - TY - JOUR TI - Comments on: Queueing models for the analysis of communication systems AU - Perros, Harry G. T2 - TOP AB - Over the last 30 years, Dr. Bruneel’s team has produced a continuous stream of high-quality papers, which focus on the use of generating functions in the analysis of complex queueing systems that arise in communication networks. DA - 2014/5/10/ PY - 2014/5/10/ DO - 10.1007/S11750-014-0329-9 VL - 22 IS - 2 SP - 458-459 J2 - TOP LA - en OP - SN - 1134-5764 1863-8279 UR - http://dx.doi.org/10.1007/S11750-014-0329-9 DB - Crossref ER - TY - CHAP TI - Enabling a Package Query Paradigm on the Semantic Web: Model and Algorithms AU - Sessoms, Matthew AU - Anyanwu, Kemafor T2 - Transactions on Large-Scale Data- and Knowledge-Centered Systems XIII A2 - Hameurlain, A. A2 - Küng, J. A2 - Wagner, R. T3 - Lecture Notes in Computer Science AB - The traditional search model of finding links on the Web is unsatisfactory for the increasingly complex tasks that seek to leverage the diverse, increasingly structured and semantically annotated data on the Web. A good example is when users seek to find collections or packages of resources that meet some constraints e.g., a collection of learning resources that cover some topics and have a good average rating or a collection of tourist attractions in a city such that total cost and total travel time for visiting all attractions meet the given constraints. For such queries, the goal is the return a set of constraint-qualifying collections or packages. However, using the traditional “set of links” query paradigm, such queries can only be satisfied by issuing multiple queries, reviewing answer lists and manually assembling packages to suit a user’s desired constraints. PY - 2014/// DO - 10.1007/978-3-642-54426-2_1 SP - 1-32 PB - Springer SN - 9783642544255 9783662459423 SV - 8420 ER - TY - CONF TI - Log Your CRUD: Design Principles for Software Logging Mechanisms AU - King, Jason AU - Williams, Laurie AB - According to a 2011 survey in healthcare, the most commonly reported breaches of protected health information involved employees snooping into medical records of friends and relatives. Logging mechanisms can provide a means for forensic analysis of user activity in software systems by proving that a user performed certain actions in the system. However, logging mechanisms often inconsistently capture user interactions with sensitive data, creating gaps in traces of user activity. Explicit design principles and systematic testing of logging mechanisms within the software development lifecycle may help strengthen the overall security of software. The objective of this research is to observe the current state of logging mechanisms by performing an exploratory case study in which we systematically evaluate logging mechanisms by supplementing the expected results of existing functional black-box test cases to include log output. We perform an exploratory case study of four open-source electronic health record (EHR) logging mechanisms: OpenEMR, OSCAR, Tolven eCHR, and WorldVistA. We supplement the expected results of 30 United States government-sanctioned test cases to include log output to track access of sensitive data. We then execute the test cases on each EHR system. Six of the 30 (20%) test cases failed on all four EHR systems because user interactions with sensitive data are not logged. We find that viewing protected data is often not logged by default, allowing unauthorized views of data to go undetected. Based on our results, we propose a set of principles that developers should consider when developing logging mechanisms to ensure the ability to capture adequate traces of user activity. C2 - 2014/// C3 - Proceedings of the 2014 Symposium and Bootcamp on the Science of Security CY - New York, NY, USA DA - 2014/// DO - 10.1145/2600176.2600183 SP - 5:1-5:10 PB - ACM UR - http://doi.acm.org/10.1145/2600176.2600183 ER - TY - CONF TI - Using Templates to Elicit Implied Security Requirements from Functional Requirements - a Controlled Experiment AU - Riaz, Maria AU - Slankas, John AU - King, Jason AU - Williams, Laurie AB - Context: Security requirements for software systems can be challenging to identify and are often overlooked during the requirements engineering process. Existing functional requirements of a system can imply the need for security requirements. Systems having similar security objectives (e.g., confidentiality) often also share security requirements that can be captured in the form of reusable templates and instantiated in the context of a system to specify security requirements. C2 - 2014/// C3 - Proceedings of the 8th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement CY - New York, NY, USA DA - 2014/// DO - 10.1145/2652524.2652532 SP - 22:1-22:10 PB - ACM UR - http://doi.acm.org/10.1145/2652524.2652532 ER - TY - JOUR TI - Plans and Planning in Narrative Generation: A Review of Plan-Based Approaches to the Generation of Story, Discourse and Interactivity in Narratives AU - Young, R.Michael AU - Ware, Stephen AU - Cassell, Bradley AU - Robertson, Justus T2 - Sprache und Datenverarbeitung DA - 2014/// PY - 2014/// VL - 17 IS - 1-2 SP - 41–64 ER - TY - BOOK TI - GIS-based Analysis of Coastal Lidar Time-Series AU - Hardin, E. AU - Mitasova, H. AU - Tateosian, L. AU - Overton, M. AB - This SpringerBrief presents the principles, methods, and workflows for processing and analyzing coastal LiDAR data time-series. Robust methods for computing high resolution digital elevation models (D DA - 2014/// PY - 2014/// DO - 10.1007/978-1-4939-1835-5 PB - Springer SN - 9781493918348 9781493918355 ER - TY - BOOK TI - HoTSoS '14 : proceedings of the 2014 Symposium and Bootcamp on the Science of Security (HotSoS) : April 08-09 2014, Raleigh, NC, USA A3 - Nicol, David M. A3 - Singh, Munindar P. A3 - Williams, Laurie A. DA - 2014/// PY - 2014/// PB - ACM ER - TY - CHAP TI - A Survey of Methods for Improving Review Quality AU - Gehringer, Edward F. T2 - Lecture Notes in Computer Science AB - For peer review to be successful, students need to submit high-quality reviews of each other’s work. This requires a certain amount of training and guidance by the review system. We consider four methods for improving review quality: calibration, reputation systems, meta-reviewing, and automated meta-reviewing. Calibration is training to help a reviewer match the scores given by the instructor. Reputation systems determine how well each reviewer’s scores track scores assigned by other reviewers. Meta-reviewing means evaluating the quality of a review; this can be done either by a human or by software. Combining these strategies effectively is a topic for future research. PY - 2014/// DO - 10.1007/978-3-319-13296-9_10 SP - 92-97 OP - PB - Springer International Publishing SN - 9783319132952 9783319132969 UR - http://dx.doi.org/10.1007/978-3-319-13296-9_10 DB - Crossref ER - TY - CHAP TI - Agile Software Development in Practice AU - Doyle, Maureen AU - Williams, Laurie AU - Cohn, Mike AU - Rubin, Kenneth S. T2 - Lecture Notes in Business Information Processing AB - Agile software development methods have been around since the mid 1990s. Over these years, teams have evolved the specific software development practices used. Aims: The goal of this paper is to provide a view of the agile practices used by new teams, and the relationship between the practices used, project outcomes, and the agile principles. Method: This paper provides a summary and analysis of 2,229 Comparative AgilityTM (CA) assessment surveys completed between March 2011 and October 2012 by agile developers who knew about the survey. The CA tool assesses a team’s agility and project outcomes using a 65-statement Likert survey. Results: The agile principle of respect for individuals occurs the most frequently, while simplicity occurs least. Progress/Planning is correlated strongly to nine principles. Conclusion: Subject to sampling issues, successful teams report more positive results for agile practices with the most important practice being teams knowing their velocity. PY - 2014/// DO - 10.1007/978-3-319-06862-6_3 SP - 32-45 OP - PB - Springer International Publishing SN - 9783319068619 9783319068626 UR - http://dx.doi.org/10.1007/978-3-319-06862-6_3 DB - Crossref ER - TY - CHAP TI - SYRql: A Dataflow Language for Large Scale Processing of RDF Data AU - Maali, Fadi AU - Ravindra, Padmashree AU - Anyanwu, Kemafor AU - Decker, Stefan T2 - The Semantic Web – ISWC 2014 AB - The recent big data movement resulted in a surge of activity on layering declarative languages on top of distributed computation platforms. In the Semantic Web realm, this surge of analytics languages was not reflected despite the significant growth in the available RDF data. Consequently, when analysing large RDF datasets, users are left with two main options: using SPARQL or using an existing non-RDF-specific big data language, both with its own limitations. The pure declarative nature of SPARQL and the high cost of evaluation can be limiting in some scenarios. On the other hand, existing big data languages are designed mainly for tabular data and, therefore, applying them to RDF data results in verbose, unreadable, and sometimes inefficient scripts. In this paper, we introduce SYRql, a dataflow language designed to process RDF data at a large scale. SYRql blends concepts from both SPARQL and existing big data languages. We formally define a closed algebra that underlies SYRql and discuss its properties and some unique optimisation opportunities this algebra provides. Furthermore, we describe an implementation that translates SYRql scripts into a series of MapReduce jobs and compare the performance to other big data processing languages. PY - 2014/// DO - 10.1007/978-3-319-11964-9_10 SP - 147-163 OP - PB - Springer International Publishing SN - 9783319119632 9783319119649 UR - http://dx.doi.org/10.1007/978-3-319-11964-9_10 DB - Crossref ER - TY - CONF TI - The Persistent Homology of Distance Functions under Random Projection AU - Sheehy, Donald R. T2 - 30th International Symposium on Computational Geometry AB - Given n points P in a Euclidean space, the Johnson-Lindenstrauss lemma guarantees that the distances between pairs of points is preserved up to a small constant factor with high probability by random projection into O(log n) dimensions. In this paper, we show that the persistent homology of the distance function to P is also preserved up to a comparable constant factor. One could never hope to preserve the distance function to P pointwise, but we show that it is preserved sufficiently at the critical points of the distance function to guarantee similar persistent homology. We prove these results in the more general setting of weighted kth nearest neighbor distances, for which k = 1 and all weights equal to zero gives the usual distance to P. C2 - 2014/// C3 - SOCG: Symposium on Computational Geometry CY - Kyoto, Japan DA - 2014/// PY - 2014/6/8/ DO - 10.1145/2582112.2582126 ER - TY - CONF TI - Finding the limit AU - Ding, Yufei AU - Zhou, Mingzhou AU - Zhao, Zhijia AU - Eisenstat, Sarah AU - Shen, Xipeng T2 - the 19th international conference AB - This work aims to find out the full potential of compilation scheduling for JIT-based runtime systems. Compilation scheduling determines the order in which the compilation units (e.g., functions) in a program are to be compiled or recompiled. It decides when what versions of the units are ready to run, and hence affects performance. But it has been a largely overlooked direction in JIT-related research, with some fundamental questions left open: How significant compilation scheduling is for performance, how good the scheduling schemes employed by existing runtime systems are, and whether a great potential exists for improvement. This study proves the strong NP-completeness of the problem, proposes a heuristic algorithm that yields near optimal schedules, examines the potential of two current scheduling schemes empirically, and explores the relations with JIT designs. It provides the first principled understanding to the complexity and potential of compilation scheduling, shedding some insights for JIT-based runtime system improvement. C2 - 2014/// C3 - Proceedings of the 19th international conference on Architectural support for programming languages and operating systems - ASPLOS '14 DA - 2014/// DO - 10.1145/2541940.2541945 PB - ACM Press SN - 9781450323055 UR - http://dx.doi.org/10.1145/2541940.2541945 DB - Crossref KW - Performance KW - JIT KW - Compilation Scheduling KW - Compilation Order KW - NP-completeness KW - Heuristic Algorithm KW - Runtime System ER - TY - CONF TI - Challenging the "embarrassingly sequential" AU - Zhao, Zhijia AU - Wu, Bo AU - Shen, Xipeng T2 - the 19th international conference AB - Finite-State Machine (FSM) applications are important for many domains. But FSM computation is inherently sequential, making such applications notoriously difficult to parallelize. Most prior methods address the problem through speculations on simple heuristics, offering limited applicability and inconsistent speedups. C2 - 2014/// C3 - Proceedings of the 19th international conference on Architectural support for programming languages and operating systems - ASPLOS '14 DA - 2014/// DO - 10.1145/2541940.2541989 PB - ACM Press SN - 9781450323055 UR - http://dx.doi.org/10.1145/2541940.2541989 DB - Crossref KW - Languages KW - Performance KW - FSM KW - Speculative Parallelization KW - Lookback KW - DFA KW - Multicore KW - Partial Commit ER - TY - CONF TI - Localization of concurrency bugs using shared memory access pairs AU - Wang, Wenwen AU - Wang, Zhenjiang AU - Wu, Chenggang AU - Yew, Pen-Chung AU - Shen, Xipeng AU - Yuan, Xiang AU - Li, Jianjun AU - Feng, Xiaobing AU - Guan, Yong T2 - the 29th ACM/IEEE international conference AB - We propose an effective approach to automatically localize buggy shared memory accesses that trigger concurrency bugs. Compared to existing approaches, our approach has two advantages. First, as long as enough successful runs of a concurrent program are collected, our approach can localize buggy shared memory accesses even with only one single failed run captured, as opposed to the requirement of capturing multiple failed runs in existing approaches. This is a significant advantage because it is more difficult to capture the elusive failed runs than the successful runs in practice. Second, our approach exhibits more precise bug localization results because it also captures buggy shared memory accesses in those failed runs that terminate prematurely, which are often neglected in existing approaches. Based on this proposed approach, we also implement a prototype, named LOCON. Evaluation results on 16 common concurrency bugs show that all buggy shared memory accesses that trigger these bugs can be precisely localized by LOCON with only one failed run captured. C2 - 2014/// C3 - Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14 DA - 2014/// DO - 10.1145/2642937.2642972 PB - ACM Press SN - 9781450330138 UR - http://dx.doi.org/10.1145/2642937.2642972 DB - Crossref ER - TY - CONF TI - SatScore AU - Zhao, Zhijia AU - Zhou, Mingzhou AU - Shen, Xipeng T2 - the 2014 ACM International Joint Conference AB - Important for user experience on mobile devices, app launch responsiveness has received many recent attentions. This paper reveals a principled pitfall in previous studies. Most of these studies have used average reduction of response delays as the metric for responsiveness. Through a systematic user study and statistical analysis, this paper shows that the metric fails to faithfully reflect user experienced responsiveness. To avoid the pitfall, a straight-forward solution is to employ users' direct feedback as the responsiveness metric, which is unfortunately hard to obtain. This paper presents the promise of solving the dilemma through a SatScore model. It further demonstrates some new opportunities for responsiveness enhancement enabled by the SatScore model. C2 - 2014/// C3 - Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing - UbiComp '14 Adjunct DA - 2014/// DO - 10.1145/2632048.2632080 PB - ACM Press SN - 9781450329682 UR - http://dx.doi.org/10.1145/2632048.2632080 DB - Crossref KW - Smartphone KW - Launch responsiveness KW - User study KW - Measurement Pitfalls ER - TY - CHAP TI - PExy: The Other Side of Exploit Kits AU - De Maio, Giancarlo AU - Kapravelos, Alexandros AU - Shoshitaishvili, Yan AU - Kruegel, Christopher AU - Vigna, Giovanni T2 - Detection of Intrusions and Malware, and Vulnerability Assessment AB - The drive-by download scene has changed dramatically in the last few years. What was a disorganized ad-hoc generation of malicious pages by individuals has evolved into sophisticated, easily extensible frameworks that incorporate multiple exploits at the same time and are highly configurable. We are now dealing with exploit kits.In this paper we focus on the server-side part of drive-by downloads by automatically analyzing the source code of multiple exploit kits. We discover through static analysis what checks exploit-kit authors perform on the server to decide which exploit is served to which client and we automatically generate the configurations to extract all possible exploits from every exploit kit. We also examine the source code of exploit kits and look for interesting coding practices, their detection mitigation techniques, the similarities between them and the rise of Exploit-as-a-Service through a highly customizable design. Our results indicate that even with a perfect drive-by download analyzer it is not trivial to trigger the expected behavior from an exploit kit so that it is classified appropriately as malicious. PY - 2014/// DO - 10.1007/978-3-319-08509-8_8 SP - 132-151 OP - PB - Springer International Publishing SN - 9783319085081 9783319085098 UR - http://dx.doi.org/10.1007/978-3-319-08509-8_8 DB - Crossref ER - TY - JOUR TI - Choose to Change: The West Virginia Early Childhood Obesity Prevention Project AU - Partington, Susan AU - Murphy, E. AU - Bowen, E. AU - Lacombe, D. AU - Piras, G. AU - Cottrell, L. AU - Menzies, T. T2 - Journal of Nutrition Education and Behavior AB - Choose to Change is a five year study designed to assess contributors to early childhood and design, implement and evaluate home-school- and community-level obesity prevention initiatives. Components: multi-level assessment of behavioral and environmental contributors to childhood obesity, implementation of community-, school-, and home-level interventions, and assessment of intervention efficacy. Study population: 286 children in HeadStart/pre-kindergarten in two West Virginia counties. Change in physical activity and eating behavior in children and families from pre- to post intervention. Characteristics of home and neighborhood environments may be important influences on eating and physical activity behaviors in families of very young children. DA - 2014/7// PY - 2014/7// DO - 10.1016/J.JNEB.2014.04.213 VL - 46 IS - 4 SP - S197 J2 - Journal of Nutrition Education and Behavior LA - en OP - SN - 1499-4046 UR - http://dx.doi.org/10.1016/J.JNEB.2014.04.213 DB - Crossref ER - TY - JOUR TI - Special issue on realizing artificial intelligence synergies in software engineering AU - Menzies, Tim AU - Mernik, Marjan T2 - Software Quality Journal AB - This special issue focuses on issues arising from the RAISE’12 Workshop on Realizing Artificial Intelligence Synergies in Software Engineering. Our objective is to provide a forum for researchers and industrial practitioners to exchange and discuss the latest innovative synergistic AI and SE techniques/practices. Why explore this combination of SE and AI? We think there are many answers to that question. As SE is asked to answer dynamic automated, adaptive, and/or large-scale demands, other computer science disciplines come to play. AI is one of them that may bring SE to further heights. Conversely, SE can also play a role to alleviate development costs and the development effort associated with AI tools. Such mutually beneficial characteristics have appeared in the past few decades and still evolve due to new challenges. That is, this special issue explores not only the application of AI techniques to software engineering problems but also the application of software engineering techniques to AI problems. This special issue is the result of much work that is still ongoing. As to future work, the RAISE series is also on-going. At the time of this writing, the RAISE’13 workshop has just completed (that event was sponsored by the United States National Science Foundation, and we thank them for their generous support). At that meeting, we saw much continued interest in this union of AI and SE. The reader should expect much novel and exciting work from this combination of ideas, in the very near future. And regarding the work seen to date, we hope that all the aforementioned papers will provide readers with some glimpse of the kind of work discussed at RAISE’12. Also, we would like to sincerely thank the reviewers for their assistance in the reviewing process. DA - 2014/2/5/ PY - 2014/2/5/ DO - 10.1007/S11219-014-9228-4 VL - 22 IS - 1 SP - 49-50 J2 - Software Qual J LA - en OP - SN - 0963-9314 1573-1367 UR - http://dx.doi.org/10.1007/S11219-014-9228-4 DB - Crossref ER - TY - CHAP TI - Can Diagrams Predict Essay Grades? AU - Lynch, Collin F. AU - Ashley, Kevin D. AU - Chi, Min T2 - Intelligent Tutoring Systems AB - Diagrammatic models of argument have grown in prominence in recent years. While they have been applied in a number of tutoring contexts, it has not yet been shown that student-produced diagrams can be used to effectively grade students or predict their future performance. We show that manually-assigned diagram grades and automatic structural features of argument diagrams can be used to predict students’ future essay grades, thus supporting the use of argument diagrams for instruction. We also show that the automatic features are competitive with expert human grading despite the fact that semantic content was ignored in automatic processing. PY - 2014/// DO - 10.1007/978-3-319-07221-0_32 SP - 260-265 OP - PB - Springer International Publishing SN - 9783319072203 9783319072210 UR - http://dx.doi.org/10.1007/978-3-319-07221-0_32 DB - Crossref ER - TY - CHAP TI - When Is Tutorial Dialogue More Effective Than Step-Based Tutoring? AU - Chi, Min AU - Jordan, Pamela AU - VanLehn, Kurt T2 - Intelligent Tutoring Systems AB - It is often assumed that one-on-one dialogue with a tutor, which involves micro-steps, is more effective than conventional step-based tutoring. Although earlier research often has not supported this hypothesis, it may be because tutors often are not good at making micro-step decisions. In this paper, we compare a micro-step based NL-tutoring system that employs induced pedagogical policies, Cordillera, to a well-evaluated step-based ITS, Andes. Our overall conclusion is that the pairing of effective policies with a micro-step based system does significantly outperform a step-based system; however, there is no significant difference in the absence of effective policies. Moreover, while micro-step tutoring is more time-consuming, the findings still hold for five out of six learning performance measures when time on task is factored out. PY - 2014/// DO - 10.1007/978-3-319-07221-0_25 SP - 210-219 OP - PB - Springer International Publishing SN - 9783319072203 9783319072210 UR - http://dx.doi.org/10.1007/978-3-319-07221-0_25 DB - Crossref ER - TY - CHAP TI - Fast Set Intersection through Run-Time Bitmap Construction over PForDelta-Compressed Indexes AU - Zou, Xiaocheng AU - Lakshminarasimhan, Sriram AU - Boyuka, David A., II AU - Ranshous, Stephen AU - Tang, Houjun AU - Klasky, Scott AU - Samatova, Nagiza F. T2 - Lecture Notes in Computer Science AB - Set intersection is a fundamental operation for evaluating conjunctive queries in the context of scientific data analysis. The state-of-the-art approach in performing set intersection, compressed bitmap indexing, achieves high computational efficiency because of cheap bitwise operations; however, overall efficiency is often nullified by the HPC I/O bottleneck, because compressed bitmap indexes typically exhibit a heavy storage footprint. Conversely, the recently-presented PForDelta-compressed index has been demonstrated to be storage-lightweight, but has limited performance for set intersection. Thus, a more effective set intersection approach should be efficient in both computation and I/O. PY - 2014/// DO - 10.1007/978-3-319-09873-9_56 SP - 668-679 OP - PB - Springer International Publishing SN - 9783319098722 9783319098739 UR - http://dx.doi.org/10.1007/978-3-319-09873-9_56 DB - Crossref ER - TY - CHAP TI - Improving Read Performance with Online Access Pattern Analysis and Prefetching AU - Tang, Houjun AU - Zou, Xiaocheng AU - Jenkins, John AU - Boyuka, David A., II AU - Ranshous, Stephen AU - Kimpe, Dries AU - Klasky, Scott AU - Samatova, Nagiza F. T2 - Lecture Notes in Computer Science AB - Among the major challenges of transitioning to exascale in HPC is the ubiquitous I/O bottleneck. For analysis and visualization applications in particular, this bottleneck is exacerbated by the write-onceread- many property of most scientific datasets combined with typically complex access patterns. One promising way to alleviate this problem is to recognize the application’s access patterns and utilize them to prefetch data, thereby overlapping computation and I/O. However, current research methods for analyzing access patterns are either offline-only and/or lack the support for complex access patterns, such as high-dimensional strided or composition-based unstructured access patterns. Therefore, we propose an online analyzer capable of detecting both simple and complex access patterns with low computational and memory overhead and high accuracy. By combining our pattern detection with prefetching,we consistently observe run-time reductions, up to 26%, across 18 configurations of PIOBench and 4 configurations of a micro-benchmark with both structured and unstructured access patterns. PY - 2014/// DO - 10.1007/978-3-319-09873-9_21 SP - 246-257 OP - PB - Springer International Publishing SN - 9783319098722 9783319098739 UR - http://dx.doi.org/10.1007/978-3-319-09873-9_21 DB - Crossref ER - TY - CHAP TI - RADAR: Runtime Asymmetric Data-Access Driven Scientific Data Replication AU - Jenkins, John AU - Zou, Xiaocheng AU - Tang, Houjun AU - Kimpe, Dries AU - Ross, Robert AU - Samatova, Nagiza F. T2 - Lecture Notes in Computer Science AB - Efficient I/O on large-scale spatiotemporal scientific data requires scrutiny of both the logical layout of the data (e.g., row-major vs. column-major) and the physical layout (e.g., distribution on parallel filesystems). For increasingly complex datasets, hand optimization is a difficult matter prone to error and not scalable to the increasing heterogeneity of analysis workloads. Given these factors, we present a partial data replication system called RADAR. We capture datatype- and collective-aware I/O access patterns (indicating logical access) via MPI-IO tracing and use a combination of coarse-grained and fine-grained performance modeling to evaluate and select optimized physical data distributions for the task at hand. Unlike conventional methods, we store all replica data and metadata, along with the original untouched data, under a single file container using the object abstraction in parallel filesystems. Our system results in manyfold improvements in some commonly used subvolume decomposition access patterns.Moreover, the modeling approach can determine whether such optimizations should be undertaken in the first place. PY - 2014/// DO - 10.1007/978-3-319-07518-1_19 SP - 296-313 OP - PB - Springer International Publishing SN - 9783319075174 9783319075181 UR - http://dx.doi.org/10.1007/978-3-319-07518-1_19 DB - Crossref ER - TY - JOUR TI - Community detection in large-scale networks: a survey and empirical evaluation AU - Harenberg, Steve AU - Bello, Gonzalo AU - Gjeltema, L. AU - Ranshous, Stephen AU - Harlalka, Jitendra AU - Seay, Ramona AU - Padmanabhan, Kanchana AU - Samatova, Nagiza T2 - Wiley Interdisciplinary Reviews: Computational Statistics AB - Community detection is a common problem in graph data analytics that consists of finding groups of densely connected nodes with few connections to nodes outside of the group. In particular, identifying communities in large‐scale networks is an important task in many scientific domains. In this review, we evaluated eight state‐of‐the‐art and five traditional algorithms for overlapping and disjoint community detection on large‐scale real‐world networks with known ground‐truth communities. These 13 algorithms were empirically compared using goodness metrics that measure the structural properties of the identified communities, as well as performance metrics that evaluate these communities against the ground‐truth. Our results show that these two types of metrics are not equivalent. That is, an algorithm may perform well in terms of goodness metrics, but poorly in terms of performance metrics, or vice versa. WIREs Comput Stat 2014, 6:426–439. doi: 10.1002/wics.1319 This article is categorized under: Algorithms and Computational Methods > Algorithms Statistical Learning and Exploratory Methods of the Data Sciences > Clustering and Classification Data: Types and Structure > Graph and Network Data DA - 2014/7/22/ PY - 2014/7/22/ DO - 10.1002/WICS.1319 VL - 6 IS - 6 SP - 426-439 J2 - WIREs Comput Stat LA - en OP - SN - 1939-5108 UR - http://dx.doi.org/10.1002/WICS.1319 DB - Crossref KW - clustering KW - community detection KW - empirical evaluation KW - graphs KW - ground-truth KW - networks ER - TY - CONF TI - Deep learning-based goal recognition in open-ended digital games AU - Min, W. AU - Ha, E.Y. AU - Rowe, J. AU - Mott, B. AU - Lester, J. C2 - 2014/// C3 - Proceedings of the 10th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2014 DA - 2014/// SP - 37-43 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84916877257&partnerID=MN8TOARS ER - TY - CONF TI - Use and development of entertainment technologies in after school STEM program AU - Cateté, Veronica AU - Wassell, Katherine AU - Barnes, Tiffany T2 - 45th ACM technical symposium on Computer science education AB - This design research paper examines the implementation and curriculum changes of an after school computer science program that promotes computational thinking to middle school students. The program, Students in Programming, Robotics, and Computer Science (SPARCS), can adapt to different presentation environments, such as independent after school sessions or a semester-long apprenticeship program. We trace one implementation of the program through the initial deployment, the development of infrastructure, and a reorganization of content to address student interests. We found that student attrition dropped and the average session enjoyment increased when our sessions integrated consumer technologies such as mobile applications, video games, and the Minecraft computer game. In this paper, we provide readers a framework for running computing outreach activities around similar consumer technologies. C2 - 2014/// C3 - SIGCSE '14: Proceedings of the 45th ACM technical symposium on Computer science education CY - Georgia, Atlanta DA - 2014/// PY - 2014/3/5/ DO - 10.1145/2538862.2538952 SP - 163–168 PB - ACM Press UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899768214&partnerID=MN8TOARS KW - CS Education KW - SPARCS outreach KW - curriculum KW - games KW - mobile applications ER - TY - CONF TI - Part of the game: Changing level creation to identify and filter low quality user-generated levels AU - Hicks, Andrew AU - Cateté, Veronica AU - Barnes, Tiffany T2 - Foundations of Digital Games (FDG2014) C2 - 2014/4/3/ C3 - Foundations of Digital Games (FDG) CY - Fort Lauderdale, FL DA - 2014/4/3/ PY - 2014/4/3/ ER - TY - CONF TI - CS outreach to high school enrollment: bridging the gap AU - Cateté, Veronica AB - Researchers in CS have heard of disparities between underrepresented groups and the lack of people to ll future jobs. Initiatives focus on strengthening the computing pipeline and getting more students interested. This research goes further by analyzing factors that affect behavioral change and get students to enroll in computing courses. We focus on a middle grades outreach program called SPARCS that has a 84% transfer rate into high school courses. We approach with a lens on identity, social cognitive career theory, and other attitudes and demographics perspectives. C2 - 2014/// C3 - Proceedings of the tenth annual conference on International computing education research DA - 2014/// DO - 10.1145/2632320.2632323 SP - 143-144 PB - ACM Press UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84905837167&partnerID=MN8TOARS ER - TY - CONF TI - Snag'em: Graph Data Mining for a Social Networking Game AU - Cateté, V. AU - Hicks, A. AU - Barnes, T. AU - Lynch, C. T2 - EDM 2014 A2 - Gutierrez-Santos, S. A2 - Santos, O.C. C2 - 2014/6/4/ C3 - EDM 2014 Extended Proceedings: Workshop Proceedings of the 7th International Conference on Educational Data Mining CY - London, UK DA - 2014/6/4/ PY - 2014/// VL - 6 SP - 10 M1 - 4 PB - CEUR-WS UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84922311434&partnerID=MN8TOARS ER - TY - CONF TI - You better be honest: Discouraging free-riding and false-reporting in mobile crowdsourcing AB - Crowdsourcing is an emerging paradigm where users can pay for the services they need or receive rewards for providing services. One example in wireless networking is mobile crowdsourcing, which leverages a cloud computing platform for recruiting mobile users to collect data (such as photos, videos, mobile user activities, etc) for applications in various domains, such as environmental monitoring, social networking, healthcare, transportation, etc. However, a critical problem arises as how to ensure that users pay or receive what they deserve. Free-riding and false-reporting may make the system vulnerable to dishonest users. In this paper, we aim to design schemes to tackle these problems, so that each individual in the system is better off being honest. We first design a mechanism EFF which eliminates dishonest behavior with the help from a trusted third party for arbitration. We then design another mechanism DFF which, without the help from any third party, discourages free-riding and false-reporting. We prove that EFF eliminates the existence of free-riding and false-reporting, while guaranteeing truthfulness, individual rationality, budget-balance, and computational efficiency. We also prove that DFF is semi-truthful, which discourages dishonest behavior such as free-riding and false-reporting when the rest of the individuals are honest, while guaranteeing budget-balance and computational efficiency. Performance evaluation shows that within our mechanisms, no dishonest behavior could bring extra benefit for each individual. C2 - 2014/12// C3 - 2014 IEEE Global Communications Conference DA - 2014/12// DO - 10.1109/glocom.2014.7037593 UR - http://dx.doi.org/10.1109/glocom.2014.7037593 ER - TY - CHAP TI - Understanding Which Graph Depictions Are Best for Viewers AU - Christensen, Johanne AU - Bae, Ju Hee AU - Watson, Ben AU - Rappa, Micheal T2 - Smart Graphics AB - We use data from a study of three different graph depictions: node-link, centered matrix, and quilts to explore how pathfinding time is influenced by the graph structure, measured by the number of nodes, links, skips and layers. We use regressions to determine the influence of these attributes. Furthering this idea, we begin to explore how individual users navigate through graphs. PY - 2014/// DO - 10.1007/978-3-319-11650-1_17 SP - 174-177 OP - PB - Springer International Publishing SN - 9783319116495 9783319116501 UR - http://dx.doi.org/10.1007/978-3-319-11650-1_17 DB - Crossref ER - TY - CHAP TI - Tuning Hadoop Map Slot Value Using CPU Metric AU - Kc, Kamal AU - Freeh, Vincent W. T2 - Big Data Benchmarks, Performance Optimization, and Emerging Hardware AB - Hadoop is a widely used open source mapreduce framework. Its performance is critical because it increases the usefulness of products and services for a large number of companies who have adopted Hadoop for their business purposes. One of the configuration parameters that influences the resource allocation and thus the performance of a Hadoop application is map slot value (MSV). MSV determines the number of map tasks that run concurrently on a node. For a given architecture, a Hadoop application has an MSV for which its performance is best. Furthermore, there is not a single map slot value that is best for all applications. A Hadoop application’s performance suffers when MSV is not the best. Therefore, knowing the best MSV is important for an application. In this work, we find a low-overhead method to predict the best MSV using a new Hadoop counter that measures per-map task CPU utilization. Our experiments on a variety of Hadoop applications show that using a single MSV for all applications results in performance degradation up to 132 % when compared to using the best MSV for each application. PY - 2014/// DO - 10.1007/978-3-319-13021-7_11 SP - 141-153 OP - PB - Springer International Publishing SN - 9783319130200 9783319130217 UR - http://dx.doi.org/10.1007/978-3-319-13021-7_11 DB - Crossref ER - TY - JOUR TI - Equine digital veins are more sensitive to superoxide anions than digital arteries AU - Lapo, Rock Allister AU - Gogny, Marc AU - Chatagnon, Gérard AU - Lalanne, Valérie AU - Harfoush, Khaled AU - Assane, Moussa AU - Desfontis, Jean-Claude AU - Mallem, Mohamed Yassine T2 - European Journal of Pharmacology AB - This work was designed to investigate (i) the effect of superoxide dismutase (SOD) inhibition on endothelial function and (ii) the free radical-induced endothelial dysfunction in equine digital veins (EDVs) and equine digital arteries (EDAs) isolated from healthy horses. EDV and EDA rings were suspended in a 5 ml organ bath containing Krebs solution. After a 60 min equilibration period, EDV and EDA rings were contracted with phenylephrine. Then, cumulative concentration-response curves (CCRCs) to acetylcholine were performed. In both EDVs and EDAs, acetylcholine (1 nM to 10 µM) produced concentration-dependent relaxation. We investigated the influence of SOD inhibition by diethyldithiocarbamate (DETC; 100 µM), a CuZnSOD inhibitor, on EDAs and EDVs relaxant responses to acetylcholine. Acetylcholine -mediated relaxation was impaired by DETC only in EDVs. SOD activity assayed by a xanthine-xanthine oxidase method was higher in EDAs compared with EDVs (P<0.05). CCRCs to acetylcholine established in the presence of pyrogallol (30 µM) or homocysteine (20 µM), two superoxide anions generating systems showed that in both EDVs and EDAs, the acetylcholine-mediated relaxation was significantly impaired by pyrogallol and homocysteine. This impairment was more pronounced in EDVs than in EDAs. Moreover, the pyrogallol-induced impairment of acetylcholine-mediated relaxation was potentiated by DETC to a greater extent in EDVs. We concluded that due to the lower activity of SOD, EDVs are more sensitive to superoxide anions than EDAs. So, any alteration of superoxide anions metabolism is likely to have a more important impact on venous rather than arterial relaxation. DA - 2014/10// PY - 2014/10// DO - 10.1016/J.EJPHAR.2014.06.016 VL - 740 SP - 66-71 J2 - European Journal of Pharmacology LA - en OP - SN - 0014-2999 UR - http://dx.doi.org/10.1016/J.EJPHAR.2014.06.016 DB - Crossref KW - EDVs KW - EDAs KW - Vasorelaxation KW - Superoxide anions KW - Endothelium ER - TY - CHAP TI - ScalaJack: Customized Scalable Tracing with In-situ Data Analysis AU - Ananthakrishnan, Srinath Krishna AU - Mueller, Frank T2 - Lecture Notes in Computer Science AB - Root cause diagnosis of large-scale HPC applications often fails because tools, specifically trace-based ones, can no longer record all metrics they measure. We address this problems by combining customized tracing and providing support for in-situ data analysis via ScalaJack, a framework with customizable instrumentation and pluggable extension capabilities for problem directed instrumentation and in-situ data analysis. We further eliminate cross cutting concerns by code refactoring for aspect orientation and evaluate these capabilities in case studies within and beyond the scope of tracing. PY - 2014/// DO - 10.1007/978-3-319-09873-9_2 SP - 13-25 OP - PB - Springer International Publishing SN - 9783319098722 9783319098739 UR - http://dx.doi.org/10.1007/978-3-319-09873-9_2 DB - Crossref ER - TY - CHAP TI - Tools for Simulation and Benchmark Generation at Exascale AU - Lagadapati, Mahesh AU - Mueller, Frank AU - Engelmann, Christian T2 - Tools for High Performance Computing 2013 PY - 2014/// DO - 10.1007/978-3-319-08144-1_2 SP - 19-24 OP - PB - Springer International Publishing SN - 9783319081434 9783319081441 UR - http://dx.doi.org/10.1007/978-3-319-08144-1_2 DB - Crossref ER - TY - BOOK TI - Investigating the effect of meta-cognitive scaffolding for learning by teaching AU - Matsuda, N. AU - Griger, C.L. AU - Barbalios, N. AU - Stylianides, G.J. AU - Cohen, W.W. AU - Koedinger, K.R. AB - This paper investigates the effect of meta-cognitive help in the context of learning by teaching. Students learned to solve algebraic equations by tutoring a teachable agent, called SimStudent, using an online learning environment, called APLUS. A version of APLUS was developed to provide meta-cognitive help on what problems students should teach, as well as when to quiz SimStudent. A classroom study comparing APLUS with and without the meta-cognitive help was conducted with 173 seventh to ninth grade students. The data showed that students with the meta-cognitive help showed better problem selection and scored higher on the post-test than those who tutored SimStudent without the meta-cognitive help. These results suggest that, when carefully designed, learning by teaching can support students to not only learn cognitive skills but also employ meta-cognitive skills for effective tutoring. DA - 2014/// PY - 2014/// DO - 10.1007/978-3-319-07221-0_13 VL - 8474 LNCS SE - 104-113 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84958535516&partnerID=MN8TOARS ER - TY - BOOK TI - Authoring tutors with simstudent: An evaluation of efficiency and model quality AU - MacLellan, C.J. AU - Koedinger, K.R. AU - Matsuda, N. AB - Authoring Intelligent Tutoring Systems is expensive and time consuming. To reduce costs, the Cognitive Tutor Authoring Tools and the Example-Tracing Tutor paradigm were developed to make the tutor authoring process more efficient. Under this paradigm, tutors are constructed by demonstrating behavior directly in a tutor interface, reducing the need for programming expertise. This paper evaluates the efficiency of authoring a tutor with SimStudent, an extension to the Example-Tracing paradigm that is designed to produce greater generality in less time by induction from past demonstrations and feedback. We found that authoring an algebra tutor in SimStudent is faster than Example-Tracing while maintaining equivalent final model quality. Furthermore, we found that the SimStudent model generalizes beyond the problems that were used to author it. DA - 2014/// PY - 2014/// DO - 10.1007/978-3-319-07221-0_70 VL - 8474 LNCS SE - 551-560 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84958536161&partnerID=MN8TOARS ER - TY - CONF TI - Making games and apps in introductory computer science (abstract only) AU - Barnes, Tiffany AU - Catete, Veronica AU - Hicks, Andrew AU - Peddycord, Barry T2 - the 45th ACM technical symposium AB - The new CS Principles curriculum, a pilot Advanced Placement course, offers novice students an exciting opportunity to learn computing in a hands-on, fun way. High school and college teachers of introductory computer science course are invited to this workshop to learn basic game and mobile phone development. Participants will learn GameMaker, AppInventor, and Touch Develop. These tools allow students to create and have fun with computing while teaching object-oriented and event-driven programming and game architectures. Participants should bring their own laptops (ideally with AppInventor installed). Windows 7 phones will be provided during the workshop. We will provide links to curricular modules for the CS Principles: Beauty and Joy of Computing course. C2 - 2014/// C3 - Proceedings of the 45th ACM technical symposium on Computer science education - SIGCSE '14 DA - 2014/// DO - 10.1145/2538862.2539000 SP - 739-739 PB - ACM Press SN - 9781450326056 UR - http://dx.doi.org/10.1145/2538862.2539000 DB - Crossref ER - TY - JOUR TI - A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations AU - Miller, Gary L. AU - Sheehy, Donald R. T2 - Discrete & Computational Geometry AB - We describe a new algorithm for computing the Voronoi diagram of a set of $$n$$ points in constant-dimensional Euclidean space. The running time of our algorithm is $$O(f \log n \log \varDelta )$$ where $$f$$ is the output complexity of the Voronoi diagram and $$\varDelta $$ is the spread of the input, the ratio of largest to smallest pairwise distances. Despite the simplicity of the algorithm and its analysis, it improves on the state of the art for all inputs with polynomial spread and near-linear output size. The key idea is to first build the Voronoi diagram of a superset of the input points using ideas from Voronoi refinement mesh generation. Then, the extra points are removed in a straightforward way that allows the total work to be bounded in terms of the output complexity, yielding the output sensitive bound. The removal only involves local flips and is inspired by kinetic data structures. DA - 2014/9/3/ PY - 2014/9/3/ DO - 10.1007/s00454-014-9629-y VL - 52 IS - 3 SP - 476-491 J2 - Discrete Comput Geom LA - en OP - SN - 0179-5376 1432-0444 UR - http://dx.doi.org/10.1007/s00454-014-9629-y DB - Crossref KW - Voronoi diagram KW - Delaunay triangulation KW - Output-sensitive algorithms KW - Mesh generation KW - Kinetic data structures ER - TY - JOUR TI - Zigzag Zoology: Rips Zigzags for Homology Inference AU - Oudot, Steve Y. AU - Sheehy, Donald R. T2 - Foundations of Computational Mathematics AB - For $$n$$ points sampled near a compact set $$X$$ , the persistence barcode of the Rips filtration built from the sample contains information about the homology of $$X$$ as long as $$X$$ satisfies some geometric assumptions. The Rips filtration is prohibitively large; however, zigzag persistence can be used to keep the size linear in $$n$$ , with a constant factor depending only (exponentially) on the intrinsic dimension of $$X$$ . We present several species of Rips-like zigzags and compare them with respect to the signal-to-noise ratio, a measure of how well the underlying homology is represented in the persistence barcode relative to the noise in the barcode at the relevant scales. Some of these Rips-like zigzags have been available as part of the Dionysus library for several years while others are new. Interestingly, we show that some species of Rips zigzags will exhibit less noise than the (nonzigzag) Rips filtration itself. Thus, Rips zigzags can offer improvements in both size complexity and signal-to-noise ratio. Along the way, we develop new techniques for manipulating and comparing persistence barcodes from zigzag modules. In particular, we give methods for reversing arrows and removing spaces from a zigzag while controlling the changes occurring in its barcode. These techniques were developed to provide our theoretical analysis of the signal-to-noise ratio of Rips-like zigzags, but they are of independent interest as they apply to zigzag modules generally. DA - 2014/9/12/ PY - 2014/9/12/ DO - 10.1007/s10208-014-9219-7 VL - 15 IS - 5 SP - 1151-1186 J2 - Found Comput Math LA - en OP - SN - 1615-3375 1615-3383 UR - http://dx.doi.org/10.1007/s10208-014-9219-7 DB - Crossref KW - Topological inference KW - Persistent homology KW - Vietoris-Rips complex KW - Quiver representations KW - Reflections ER - TY - CONF TI - Efficient and Robust Persistent Homology for Measures AU - Buchet, Mickaël AU - Chazal, Frédéric AU - Oudot, Steve Y. AU - Sheehy, Donald R. T2 - Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms AB - A new paradigm for point cloud data analysis has emerged recently, where point clouds are no longer treated as mere compact sets but rather as empirical measures. A notion of distance to such measures has been defined and shown to be stable with respect to perturbations of the measure. This distance can easily be computed pointwise in the case of a point cloud, but its sublevel-sets, which carry the geometric information about the measure, remain hard to compute or approximate. This makes it challenging to adapt many powerful techniques based on the Euclidean distance to a point cloud to the more general setting of the distance to a measure on a metric space.We propose an efficient and reliable scheme to approximate the topological structure of the family of sublevel-sets of the distance to a measure. We obtain an algorithm for approximating the persistent homology of the distance to an empirical measure that works in arbitrary metric spaces. Precise quality and complexity guarantees are given with a discussion on the behavior of our approach in practice. C2 - 2014/12/22/ C3 - Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms DA - 2014/12/22/ DO - 10.1137/1.9781611973730.13 PB - Society for Industrial and Applied Mathematics SN - 9781611973747 9781611973730 UR - http://dx.doi.org/10.1137/1.9781611973730.13 DB - Crossref ER - TY - JOUR TI - The Thing Itself Speaks Accountability as a Foundation for Requirements in Sociotechnical Systems T2 - IEEE 7TH INTERNATIONAL WORKSHOP ON REQUIREMENTS ENGINEERING AND LAW (RELAW) DA - 2014/// PY - 2014/// UR - https://publons.com/publon/21294415/ ER - TY - JOUR TI - The Science of Security: Introduction from the Perspective of Secure Collaboration T2 - 1ST INTERNATIONAL WORKSHOP ON AGENTS & CYBERSECURITY AB - Despite sustained research effort in security, current security practice conveys a decidedly ad hoc flavor---find a bug; patch it; find the next bug; and so on. This methodology is sometimes termed engineering, using the term in the narrow sense of developing solutions to specific problems. The past few years have seen a growing push to develop a science of security (SoS), viewed as a systematic body of knowledge with strong theoretical and empirical underpinnings that inform the engineering of secure information systems. I introduce SoS, briefly describing its key elements. I then motivate some of the foundational challenges of SoS from the standpoint of systems of autonomous participants, sometimes termed systems of systems. I describe how security is an element of the governance of such systems and advocate an approach based on a new formulation of norms and accountability. DA - 2014/// PY - 2014/// DO - 10.1145/2602945.2602956 UR - https://publons.com/publon/21294418/ KW - Science of security KW - Collaboration KW - Security Ecosystem ER - TY - CONF TI - Xipho: Extending tropos to engineer context-aware personal agents AU - Murukannaiah, P.K. AU - Singh, M.P. C2 - 2014/// C3 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 DA - 2014/// VL - 1 SP - 309-316 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908533940&partnerID=MN8TOARS ER - TY - JOUR TI - Supervised Semantic Analysis of Product Reviews Using Weighted k-NN Classifier T2 - 11TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS (ITNG) AB - On line shopping, today, has become the call of the day. People are showing more inclination towards on line shops, due to large variety of options at fingertips, ease of access, access to global products. Further the buyer also benefits from information regarding user review of products, comparison of similar products etc. Therefore the importance of product review is also escalating exponentially. Most of the existing sentiment analysis systems require large training datasets and complex tools for implementation. This paper presents a Two-Parse algorithm with a training dataset of approximately 7,000 keywords, for automatic product review analysis. The proposed algorithm is more efficient as compared to some of the popular review analysis systems with enormous datasets. This algorithm is a solution to a very common problem of high polarity of datasets. This paper proposes a Weighted k-Nearest Neighbor (Weighted k-NN) Classifier which achieves a better efficiency than the classical k-Nearest Neighbor Classifier. The proposed Classifier is capable of successfully classifying weakly and mildly polar reviews along with the highly polar ones. The Classifier provides an option of modifying the parameters according to need of the system and thus overcomes the problem of static parameters in classical machine learning algorithms. DA - 2014/// PY - 2014/// DO - 10.1109/ITNG.2014.99 UR - https://publons.com/publon/21294414/ KW - Sentiment Analysis KW - Weighted k-Nearest Neighbor algorithm KW - Polarity KW - k-Nearest Neighbor Classifier KW - Machine Learning ER - TY - CONF TI - Platys: A framework for supporting context-aware personal agents AU - Murukannaiah, P.K. AU - Fogues, R. AU - Singh, M.P. C2 - 2014/// C3 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 DA - 2014/// VL - 2 SP - 1689-1690 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84911364009&partnerID=MN8TOARS ER - TY - CONF TI - Message from the program chairs AU - Nicol, D.M. AU - Singh, M.P. C2 - 2014/// C3 - ACM International Conference Proceeding Series DA - 2014/// UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84906819223&partnerID=MN8TOARS ER - TY - CONF TI - ReNew: A semi-supervised framework for generating domain-specific lexicons and sentiment analysis AU - Zhang, Z. AU - Singh, M.P. C2 - 2014/// C3 - 52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 - Proceedings of the Conference DA - 2014/// VL - 1 SP - 542-551 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84906923074&partnerID=MN8TOARS ER - TY - CONF TI - Exploiting sentiment homophily for link prediction AU - Yuan, G. AU - Murukannaiah, P.K. AU - Zhang, Z. AU - Singh, M.P. AB - Link prediction on social media is an important problem for recommendation systems. Understanding the interplay of users' sentiments and social relationships can be potentially valuable. Specifically, we study how to exploit sentiment homophily for link prediction. We evaluate our approach on a dataset gathered fro Twitter that consists of tweets sent in one month during U.S. 2012 political campaign along with the "follows" relationship between users. Our first contribution is defining a set of sentiment-based features that help predict the likelihood of two users becoming "friends" (i.e., mutually mentioning or following each other) based on their sentiments toward topics of mutual interest. Our evaluation in a supervised learning framework demonstrates the benefits of sentiment-based features in link prediction. We find that Adamic-Adar and Euclidean distance measures are the best predictors. Our second contribution is proposing a factor graph model that incorporates a sentiment-based variant of cognitive balance theory. Our evaluation shows that, when tie strength is not too weak, our model is more effective in link prediction than traditional machine learning techniques. C2 - 2014/// C3 - RecSys 2014 - Proceedings of the 8th ACM Conference on Recommender Systems DA - 2014/// DO - 10.1145/2645710.2645734 SP - 17-24 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908881365&partnerID=MN8TOARS KW - Social media KW - Social networks KW - Link prediction KW - Sentiment analysis KW - Topic affiliation ER - TY - JOUR TI - Determining Team Hierarchy from Broadcast Communications T2 - Lecture Notes in Computer Science AB - Broadcast chat messages among team members in an organization can be used to evaluate team coordination and performance. Intuitively, a well-coordinated team should reflect the team hierarchy, which would indicate that team members assigned with particular roles are performing their jobs effectively. Existing approaches to identify hierarchy are limited to data from where graphs can be extracted easily. We contribute a novel approach that takes as input broadcast messages, extracts communication patterns—as well as semantic, communication, and social features—and outputs an organizational hierarchy. We evaluate our approach using a dataset of broadcast chat communications from a large-scale Army exercise for which ground truth is available. We further validate our approach on the Enron corpus of corporate email. DA - 2014/// PY - 2014/// DO - 10.1007/978-3-319-13734-6_35 UR - https://publons.com/publon/21294413/ ER - TY - BOOK TI - Estimating trust from agents' interactions via commitments AU - Kalia, A.K. AU - Zhang, Z. AU - Singh, M.P. AB - How an agent trusts another naturally depends on the outcomes of their interactions. Previous approaches have treated the outcomes in a domain-specific way. We propose an approach relating trust to the domain-independent notion of commitments. We conduct an empirical study to evaluate our approach, in which subjects read emails extracted from the Enron dataset (augmented with some synthetic emails for completeness), and estimate trust between each pair of communicating participants. We propose a probabilistic model for trust based on commitment outcomes and show how to train its parameters for each subject based on the subject's trust assessments. The results are promising, though imperfect. Our main contribution is to launch a research program into computing trust based on a semantically well-founded account of agent interactions. DA - 2014/// PY - 2014/// DO - 10.3233/978-1-61499-419-0-1043 VL - 263 SE - 1043-1044 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84923196983&partnerID=MN8TOARS ER - TY - BOOK TI - Determining team hierarchy from broadcast communications AU - Kalia, A.K. AU - Buchler, N. AU - Ungvarsky, D. AU - Govindan, R. AU - Singh, M.P. DA - 2014/// PY - 2014/// VL - 8851 SE - 493-507 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84914173058&partnerID=MN8TOARS ER - TY - CONF TI - Extracting normative relationships from business contracts AU - Gao, X. AU - Singh, M.P. C2 - 2014/// C3 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014 DA - 2014/// VL - 1 SP - 101-108 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84911401191&partnerID=MN8TOARS ER - TY - CONF TI - Characterizing artificial socio-cognitive technical systems AU - Christiaanse, R. AU - Ghose, A. AU - Noriega, P. AU - Singh, M.P. C2 - 2014/// C3 - CEUR Workshop Proceedings DA - 2014/// VL - 1283 SP - 336-346 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84910069753&partnerID=MN8TOARS ER - TY - JOUR TI - Argument schemes for reasoning about trust AU - Parsons, S. AU - Atkinson, K. AU - Li, Z. AU - McBurney, P. AU - Sklar, E. AU - Singh, M. AU - Haigh, K. AU - Levitt, K. AU - Rowe, J. T2 - Argument and Computation AB - Trust is a natural mechanism by which an autonomous party, an agent, can deal with the inherent uncertainty regarding the behaviours of other parties and the uncertainty in the information it shares with those parties. Trust is thus crucial in any decentralised system. This paper builds on recent efforts to use argumentation to reason about trust. Specifically, a set of schemes is provided, and abstract patterns of reasoning that apply in multiple situations geared towards trust. Schemes are described in which one agent, A, can establish arguments for trusting another agent, B, directly, as well as schemes that A can use to construct arguments for trusting C, where C is trusted by B. For both sets of schemes, a set of critical questions is offered that identify the situations in which these schemes can fail. DA - 2014/// PY - 2014/// DO - 10.1080/19462166.2014.913075 VL - 5 IS - 2-3 SP - 160-190 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84900511494&partnerID=MN8TOARS KW - argument representation KW - formal models of argumentation KW - social influence ER - TY - CONF TI - Including blind people in computing through access to graphs AU - Balik, Suzanne P AU - Mealin, Sean P AU - Stallmann, Matthias F AU - Rodman, Robert D AU - Glatz, Michelle L AU - Sigler, Veronica J T2 - ACM C2 - 2014/// C3 - Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility DA - 2014/// SP - 91-98 ER - TY - CONF TI - A Model of Trust, Moods, and Emotions in Multiagent Systems, and its Empirical Evaluation AU - Kalia, Anup K. AU - Ajmeri, Nirav AU - Chan, Kevin AU - Cho, Jin-Hee AU - Adalı, Sibel AU - Singh, Munindar P. T2 - International Joint Conference on Autonomous Agents and Multiagent Systems C2 - 2014/5// C3 - Proceedings of the 16th AAMAS Workshop on Trust in Agent Societies (Trust) CY - Paris, France DA - 2014/5// VL - 1740 SP - 1-11 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85006168135&partnerID=MN8TOARS ER - TY - CHAP TI - Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations AU - Boyer, Brice AU - Comer, Matthew T. AU - Kaltofen, Erich L. T2 - Computer Mathematics PY - 2014/// DO - 10.1007/978-3-662-43799-5_16 SP - 183-197 OP - PB - Springer Berlin Heidelberg SN - 9783662437988 9783662437995 UR - http://dx.doi.org/10.1007/978-3-662-43799-5_16 DB - Crossref ER - TY - CHAP TI - Symbolic Computation and Complexity Theory Transcript of My Talk AU - Kaltofen, Erich L. T2 - Computer Mathematics PY - 2014/// DO - 10.1007/978-3-662-43799-5_1 SP - 3-7 OP - PB - Springer Berlin Heidelberg SN - 9783662437988 9783662437995 UR - http://dx.doi.org/10.1007/978-3-662-43799-5_1 DB - Crossref ER - TY - CONF TI - Cleaning-up data for sparse model synthesis AU - Kaltofen, Erich L. T2 - the 2014 Symposium AB - The discipline of symbolic computation contributes to mathematical model synthesis in several ways. One is the pioneering creation of interpolation algorithms that can account for sparsity in the resulting multi-dimensional models, for example, by Zippel [12], Ben-Or and Tiwari [1], and in their recent numerical counterparts by Giesbrecht-Labahn-Lee [5] and Kaltofen-Yang-Zhi [9]. C2 - 2014/// C3 - Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14 DA - 2014/// DO - 10.1145/2631948.2631949 PB - ACM Press SN - 9781450329637 UR - http://dx.doi.org/10.1145/2631948.2631949 DB - Crossref ER - TY - CONF TI - Numerical linear system solving with parametric entries by error correction AU - Boyer, Brice AU - Kaltofen, Erich L. T2 - the 2014 Symposium AB - We consider the problem of solving a full rank consistent linear system A(u)x = b(u) where the m x n matrix A and the m-dimensional vector b has entries that are polynomials in u over a field. We give an algorithm that computes the unique solution x = f(u)/g(u), which is a vector of rational functions, by evaluating the parameter u at distinct points. Those points ξλ where the matrix A evaluates to a matrix A(ξλ), with entries over the scalar field, of lower rank, or in the numeric setting to an ill-conditioned matrix, are not identified but accounted for by error-correcting code techniques. We also correct true errors where the evaluation at some u = ξλ results in an erroneous, possibly full rank consistent and well-conditioned scalar linear system. Our algorithm generalizes Welch/Berlekamp decoding of Reed/Solomon error correcting codes and their numeric floating point counterparts. C2 - 2014/// C3 - Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14 DA - 2014/// DO - 10.1145/2631948.2631956 PB - ACM Press SN - 9781450329637 UR - http://dx.doi.org/10.1145/2631948.2631956 DB - Crossref ER - TY - CONF TI - Essentially optimal interactive certificates in linear algebra AU - Dumas, Jean-Guillaume AU - Kaltofen, Erich T2 - the 39th International Symposium AB - Certificates to a linear algebra computation are additional data structures for each output, which can be used by a---possibly randomized---verification algorithm that proves the correctness of each output. The certificates are essentially optimal if the time (and space) complexity of verification is essentially linear in the input size $N$, meaning $N$ times a factor $N^{o(1)}$, i.e., a factor $N^{\eta(N)}$ with $\lim\_{N\to \infty} \eta(N)$ $=$ $0$. We give algorithms that compute essentially optimal certificates for the positive semidefiniteness, Frobenius form, characteristic and minimal polynomial of an $n\times n$ dense integer matrix $A$. Our certificates can be verified in Monte-Carlo bit complexity $(n^2 \log\|A\|)^{1+o(1)}$, where $\log\|A\|$ is the bit size of the integer entries, solving an open problem in [Kaltofen, Nehring, Saunders, Proc.\ ISSAC 2011] subject to computational hardness assumptions. Second, we give algorithms that compute certificates for the rank of sparse or structured $n\times n$ matrices over an abstract field, whose Monte Carlo verification complexity is $2$ matrix-times-vector products $+$ $n^{1+o(1)}$ arithmetic operations in the field. For example, if the $n\times n$ input matrix is sparse with $n^{1+o(1)}$ non-zero entries, our rank certificate can be verified in $n^{1+o(1)}$ field operations. This extends also to integer matrices with only an extra $\|A\|^{1+o(1)}$ factor. All our certificates are based on interactive verification protocols with the interaction removed by a Fiat-Shamir identification heuristic. The validity of our verification procedure is subject to standard computational hardness assumptions from cryptography. C2 - 2014/// C3 - Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14 DA - 2014/// DO - 10.1145/2608628.2608644 PB - ACM Press SN - 9781450325011 UR - http://dx.doi.org/10.1145/2608628.2608644 DB - Crossref ER - TY - CONF TI - Sparse polynomial interpolation codes and their decoding beyond half the minimum distance AU - Kaltofen, Erich L. AU - Pernet, Clément T2 - the 39th International Symposium AB - We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial interpolation codes and state that their minimal distance is precisely the length divided by twice the sparsity. At ISSAC 2012, we have given a decoding algorithm for as much as half the minimal distance and a list decoding algorithm up to the minimal distance. Our new polynomial-time list decoding algorithm uses sub-sequences of the received evaluations indexed by a linear progression, allowing the decoding for a larger radius, that is, more errors in the evaluations while returning a list of candidate sparse polynomials. We quantify this improvement for all typically small values of number of terms and number of errors, and provide a worst case asymptotic analysis of this improvement. For instance, for sparsity T = 5 with up to 10 errors we can list decode in polynomial-time from 74 values of the polynomial with unknown terms, whereas our earlier algorithm required 2T (E + 1) = 110 evaluations. We then propose two variations of these codes in characteristic zero, where appropriate choices of values for the variable yield a much larger minimal distance: the length minus twice the sparsity. C2 - 2014/// C3 - Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14 DA - 2014/// DO - 10.1145/2608628.2608660 PB - ACM Press SN - 9781450325011 UR - http://dx.doi.org/10.1145/2608628.2608660 DB - Crossref ER - TY - CONF TI - Sparse multivariate function recovery with a high error rate in the evaluations AU - Kaltofen, Erich L. AU - Yang, Zhengfeng T2 - the 39th International Symposium AB - In [Kaltofen and Yang, Proc. ISSAC 2013] we have generalized algebraic error-correcting decoding to multivariate sparse rational function interpolation from evaluations that can be numerically inaccurate and where several evaluations can have severe errors ("outliers"). Here we present a different algorithm that can interpolate a sparse multivariate rational function from evaluations where the error rate is 1/q for any q > 2, which our ISSAC 2013 algorithm could not handle. When implemented as a numerical algorithm we can, for instance, reconstruct a fraction of trinomials of degree 15 in 50 variables with non-outlier evaluations of relative noise as large as 10-7 and where as much as 1/4 of the 14717 evaluations are outliers with relative error as small as 0.01 (large outliers are easily located by our method). C2 - 2014/// C3 - Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14 DA - 2014/// DO - 10.1145/2608628.2608637 PB - ACM Press SN - 9781450325011 UR - http://dx.doi.org/10.1145/2608628.2608637 DB - Crossref ER - TY - CONF TI - A survey of methods for improving review quality AU - Gehringer, Edward F. T2 - The 13th International Conference on Web-Based Learning: Peer-Review, Peer-Assessment, and Self-Assessment in Education C2 - 2014/// C3 - Proceedings of the 13th International Conference on Web-Based Learning: Peer-Review, Peer-Assessment, and Self-Assessment in Education CY - Talinn, Estonia DA - 2014/// PY - 2014/8/14/ ER - TY - CONF TI - Optimizing your teaching load AU - Gehringer, Edward F. T2 - 2014 ASEE Annual Conference & Exposition AB - Abstract Optimizing Your Teaching LoadIf asked whether it is easier to teach two sections of the same course, or one section oftwo different courses, most new instructors would opt for the single course. And, ifasked whether it is easier to teach a small course or a large course, almost all would optfor the small course. But they would not always be right. This paper explores some ofthe reasons why.Teaching multiple sections of the same course does have certain advantages. There isonly one set of lectures to prepare for. The same homework assignments—and maybethe same exams—can be used for both sections (but be cautious if the exams are not backto back).On the other hand, if you are teaching multiple sections, you may be the only instructorteaching the course. Then you are responsible for all the homework, exams, and labs. Tomake matters worse, multiple-section courses tend to be introductory courses, wherestudents need to be given more complete guidance on how to do the projects, and are lessprepared to deal with ambiguity. Any mis-specification can lead to mass confusion. Ifproblems arise, you cannot rely on a colleague to help fix them. Teaching multiplesections may also increase the interval until you get to teach the same course again. Thenyou are less fresh on the material, and as technology evolves, more about the courseneeds to be changed.If instead you teach a single section of the same course in consecutive semesters, it iseasier to come up to speed. Software, labs, and other issues change less from oneoffering to the next. You can collaborate with other instructors in making up homeworkand labs. We teach students that collaboration produces better products; why not practicewhat we preach?Downsides of teaching the same course semester after semester include more“preparations,” since it is likely that you will be teaching two different courses each term.You have to make up more total assignments, since it is riskier to assign the samehomework or exams in multiple semesters than it is to assign them to multiple sections inthe same semester.Though conventional wisdom holds that small classes are easier than large classes, that’snot necessarily true, especially when the same instructor teaches them repeatedly. Alarge class has more teaching-assistant support. TAs can specialize on particularassignments, equipment, software, etc. The instructor can supervise, rather than handleall the low-level details. Student-generated content also works better in large courses.Assign students to create homework problems, test questions, etc., and the larger theclass, the more usable material you will get.Related topics include the efficiency of teaching piggybacked undergrad/grad courses,on-campus/DE courses, and the ability to cooperate with instructors at other schools. Thefull paper will report on a survey of instructors on several listservs about their experienceand outcomes with different ways of handling all these issues. C2 - 2014/// C3 - 2014 ASEE Annual Conference & Exposition CY - Indianapolis, Indiana DA - 2014/// PY - 2014/6/15/ DO - 10.18260/1-2--22894 ER - TY - CONF TI - Towards an Extended Declarative Representation for Camera Planning AU - Price, Thomas William AU - Young, R Michael C2 - 2014/// C3 - Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence DA - 2014/// ER - TY - CONF TI - Towards optimization of RDF analytical queries on MapReduce AU - Ravindra, P. C2 - 2014/// C3 - 2014 IEEE 30th International Conference on Data Engineering Workshops (ICDEW) DA - 2014/// SP - 335-339 ER - TY - CONF TI - Understanding the tradeoffs between software-managed vs. hardware-managed caches in GPUs AU - Li, C. AU - Yang, Y. AU - Dai, H. W. AU - Yan, S. G. AU - Mueller, F. AU - Zhou, H. Y. C2 - 2014/// C3 - Ieee international symposium on performance analysis of systems and DA - 2014/// SP - 231-241 ER - TY - CONF TI - Protos: Foundations for engineering innovative sociotechnical systems AU - Chopra, A.K. AU - Dalpiaz, F. AU - Aydemir, F.B. AU - Giorgini, P. AU - Mylopoulos, J. AU - Singh, Munindar P. AB - We address the challenge of requirements engineering for sociotechnical systems, wherein humans and organizations supported by technical artifacts such as software interact with one another. Traditional requirements models emphasize the goals of the stakeholders above their interactions. However, the participants in a sociotechnical system may not adopt the goals of the stakeholders involved in its specification. We motivate, Protos, a requirements engineering approach that gives prominence to the interactions of autonomous parties and specifies a sociotechnical system in terms of its participants' social relationships, specifically, commitments. The participants can adopt any goal they like, a key basis for innovative behavior, as long as they interact according to the commitments. Protos describes an abstract requirements engineering process as a series of refinements that seek to satisfy stakeholder requirements by incrementally expanding a specification set and an assumption set, and reducing requirements until all requirements are accommodated. We demonstrate this process via the London Ambulance System described in the literature. C2 - 2014/// C3 - 2014 IEEE 22nd International Requirements Engineering Conference, RE 2014 - Proceedings DA - 2014/// DO - 10.1109/re.2014.6912247 SP - 53-62 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84909957450&partnerID=MN8TOARS ER - TY - JOUR TI - How Developers Visualize Compiler Messages: A Foundational Approach to Notification Construction AU - Barik, Titus AU - Lubick, Kevin AU - Christie, Samuel AU - Murphy-Hill, Emerson T2 - 2014 SECOND IEEE WORKING CONFERENCE ON SOFTWARE VISUALIZATION (VISSOFT) AB - Self-explanation is one cognitive strategy through which developers comprehend error notifications. Self-explanation, when left solely to developers, can result in a significant loss of productivity because humans are imperfect and bounded in their cognitive abilities. We argue that modern IDEs offer limited visual affordances for aiding developers with self-explanation, because compilers do not reveal their reasoning about the causes of errors to the developer. The contribution of our paper is a foundational set of visual annotations that aid developers in better comprehending error messages when compilers expose their internal reasoning. We demonstrate through a user study of 28 undergraduate Software Engineering students that our annotations align with the way in which developers self-explain error notifications. We show that these annotations allow developers to give significantly better self-explanations when compared against today's dominant visualization paradigm, and that better self-explanations yield better mental models of notifications. The results of our work suggest that the diagrammatic techniques developers use to explain problems can serve as an effective foundation for how IDEs should visually communicate to developers. DA - 2014/// PY - 2014/// DO - 10.1109/vissoft.2014.24 SP - 87-96 ER - TY - CONF TI - Hidden in plain sight: Automatically identifying security requirements from natural language artifacts AU - Riaz, M. AU - King, Jason AU - Slankas, J. AU - Williams, L. AB - Natural language artifacts, such as requirements specifications, often explicitly state the security requirements for software systems. However, these artifacts may also imply additional security requirements that developers may overlook but should consider to strengthen the overall security of the system. The goal of this research is to aid requirements engineers in producing a more comprehensive and classified set of security requirements by (1) automatically identifying security-relevant sentences in natural language requirements artifacts, and (2) providing context-specific security requirements templates to help translate the security-relevant sentences into functional security requirements. Using machine learning techniques, we have developed a tool-assisted process that takes as input a set of natural language artifacts. Our process automatically identifies security-relevant sentences in the artifacts and classifies them according to the security objectives, either explicitly stated or implied by the sentences. We classified 10,963 sentences in six different documents from healthcare domain and extracted corresponding security objectives. Our manual analysis showed that 46% of the sentences were security-relevant. Of these, 28% explicitly mention security while 72% of the sentences are functional requirements with security implications. Using our tool, we correctly predict and classify 82% of the security objectives for all the sentences (precision). We identify 79% of all security objectives implied by the sentences within the documents (recall). Based on our analysis, we develop context-specific templates that can be instantiated into a set of functional security requirements by filling in key information from security-relevant sentences. C2 - 2014/// C3 - 2014 ieee 22nd international requirements engineering conference (re) DA - 2014/// DO - 10.1109/re.2014.6912260 SP - 183–192 ER - TY - CONF TI - Towards a framework to measure security expertise in requirements analysis AU - Hibshi, H. AU - Breaux, T. AU - Riaz, M. AU - Williams, L. AB - Research shows that commonly accepted security requirements are not generally applied in practice. Instead of relying on requirements checklists, security experts rely on their expertise and background knowledge to identify security vulnerabilities. To understand the gap between available checklists and practice, we conducted a series of interviews to encode the decision-making process of security experts and novices during security requirements analysis. Participants were asked to analyze two types of artifacts: source code, and network diagrams for vulnerabilities and to apply a requirements checklist to mitigate some of those vulnerabilities. We framed our study using Situation Awareness-a cognitive theory from psychology-to elicit responses that we later analyzed using coding theory and grounded analysis. We report our preliminary results of analyzing two interviews that reveal possible decision-making patterns that could characterize how analysts perceive, comprehend and project future threats which leads them to decide upon requirements and their specifications, in addition, to how experts use assumptions to overcome ambiguity in specifications. Our goal is to build a model that researchers can use to evaluate their security requirements methods against how experts transition through different situation awareness levels in their decision-making process. C2 - 2014/// C3 - 2014 IEEE 1st Workshop on Evolving Security and Privacy Requirements Engineering (ESPRE) DA - 2014/// DO - 10.1109/espre.2014.6890522 SP - 13-18 ER - TY - JOUR TI - PORPLE: An Extensible Optimizer for Portable Data Placement on GPU AU - Chen, Guoyang AU - Wu, Bo AU - Li, Dong AU - Shen, Xipeng T2 - 2014 47TH ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO) AB - GPU is often equipped with complex memory systems, including globalmemory, texture memory, shared memory, constant memory, and variouslevels of cache. Where to place the data is important for theperformance of a GPU program. However, the decision is difficult for aprogrammer to make because of architecture complexity and thesensitivity of suitable data placements to input and architecturechanges.This paper presents PORPLE, a portable data placement engine thatenables a new way to solve the data placement problem. PORPLE consistsof a mini specification language, a source-to-source compiler, and a runtime data placer. The language allows an easy description of amemory system; the compiler transforms a GPU program into a formamenable to runtime profiling and data placement; the placer, based onthe memory description and data access patterns, identifies on the flyappropriate placement schemes for data and places themaccordingly. PORPLE is distinctive in being adaptive to program inputsand architecture changes, being transparent to programmers (in mostcases), and being extensible to new memory architectures. Ourexperiments on three types of GPU systems show that PORPLE is able toconsistently find optimal or near-optimal placement despite the largedifferences among GPU architectures and program inputs, yielding up to2.08X (1.59X on average) speedups on a set of regular and irregularGPU benchmarks. DA - 2014/// PY - 2014/// DO - 10.1109/micro.2014.20 SP - 88-100 SN - 1072-4451 KW - GPU KW - cache KW - compiler KW - data placement KW - hardware specification language ER - TY - CONF TI - Integrity assurance for outsourced databases without DBMS modification AU - Wei, W. AU - Yu, T. C2 - 2014/// C3 - Data and applications security and privacy xxviii DA - 2014/// VL - 8566 SP - 1-16 ER - TY - JOUR TI - Transparent In Situ Data Transformations in ADIOS AU - Boyuka, David A., II AU - Lakshminarasimhan, Sriram AU - Zou, Xiaocheng AU - Gong, Zhenhuan AU - Jenkins, John AU - Schendel, Eric R. AU - Podhorszki, Norbert AU - Liu, Qing AU - Klasky, Scott AU - Samatova, Nagiza F. T2 - 2014 14TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID) AB - Though an abundance of novel "data transformation" technologies have been developed (such as compression, level-of-detail, layout optimization, and indexing), there remains a notable gap in the adoption of such services by scientific applications. In response, we develop an in situ data transformation framework in the ADIOS I/O middleware with a "plug in" interface, thus greatly simplifying both the deployment and use of data transform services in scientific applications. Our approach ensures user-transparency, runtime-configurability, compatibility with existing I/O optimizations, and the potential for exploiting read-optimizing transforms (such as level-of-detail) to achieve I/O reduction. We demonstrate use of our framework with the QLG simulation at up to 8,192 cores on the leadership-class Titan supercomputer, showing negligible overhead. We also explore the read performance implications of data transforms with respect to parameters such as chunk size, access pattern, and the "opacity" of different transform methods including compression and level-of-detail. DA - 2014/// PY - 2014/// DO - 10.1109/ccgrid.2014.73 SP - 256-266 SN - 2376-4414 ER - TY - CONF TI - Toward implementation of a software defined cloud on a supercomputer AU - Dreher, P. AU - Kallumkal, G. C2 - 2014/// C3 - 2014 ieee international conference on cloud engineering (ic2e) DA - 2014/// SP - 580-585 ER - TY - JOUR TI - On Coverage-Based Attack Profiles AU - Rivers, Anthony T. AU - Vouk, Mladen A. AU - Williams, Laurie T2 - 2014 IEEE EIGHTH INTERNATIONAL CONFERENCE ON SOFTWARE SECURITY AND RELIABILITY - COMPANION (SERE-C 2014) AB - Automated cyber attacks tend to be schedule and resource limited. The primary progress metric is often "coverage" of pre-determined "known" vulnerabilities that may not have been patched, along with possible zero-day exploits (if such exist). We present and discuss a hypergeometric process model that describes such attack patterns. We used web request signatures from the logs of a production web server to assess the applicability of the model. DA - 2014/// PY - 2014/// DO - 10.1109/sere-c.2014.15 SP - 5-6 KW - security KW - coverage KW - models KW - attack KW - profile ER - TY - JOUR TI - NoCMsg: Scalable NoC-Based Message Passing AU - Zimmer, Christopher AU - Mueller, Frank T2 - 2014 14TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID) AB - Current processor design with ever more cores may ensure that theoretical compute performance still follows past increases (resting from Moore's law), but they also increasingly present a challenge to hardware and software alike. As the core count increases, the network-on-chip(NoC) topology has changed from buses over rings and fully connected meshes to 2D meshes. The question is which programming paradigm provides the scalability needed to ensure performance is close to theoretical peak, where 2D meshes provide the most scalable design to date. This work contributes NoCMsg, a low-level message passing abstraction over NoCs. NoCMsg is specifically designed for large core counts in2D meshes. Its design ensures deadlock free messaging for wormhole Manhattan-path routing over the NoC. Experimental results on the Tile Pro hardware platform show that NoCMsg can significantly reduce communication times by up to 86% for single packet messages and up to40% for larger messages compared to other NoC-based message approaches. Results further demonstrate the potential of NoC messaging to outperform shared memory abstractions by up to 93% as core counts and inter-process communication increase, i.e., we observe that shared memory scales up to about 16 cores while message passing performs well beyond that threshold on this platform. To the best of our knowledge, this is the first head-on comparison of shared memory and advanced message passing specifically designed for NoCs on an actual hardware platform with larger core counts on a single socket. DA - 2014/// PY - 2014/// DO - 10.1109/ccgrid.2014.19 SP - 186-195 SN - 2376-4414 ER - TY - CONF TI - Is agile too fragile for space-based systems engineering? AU - Carpenter, S. E. AU - Dagnino, A. C2 - 2014/// C3 - 2014 IEEE International Conference on Space Mission Challenges for Information Technology (SMC-IT) DA - 2014/// SP - 38-45 ER - TY - CONF TI - Improving error notification comprehension through visual overlays in IDEs AU - Barik, T. C2 - 2014/// C3 - 2014 ieee symposium on visual languages and human-centric computing (vl/hcc 2014) DA - 2014/// SP - 177-178 ER - TY - CONF TI - How developers use multi-recommendation system in local code search AU - Ge, X. AU - Shepherd, D. AU - Damevski, K. AU - Murphy-Hill, E. AB - Developers often start programming tasks by searching for relevant code in their local codebase. Previous research suggests that 88% of manually-composed queries retrieve no relevant results. Many searches fail because existing search tools depend solely on string matching with a manually-composed query, which cannot find semantically-related code. To solve this problem, researchers proposed query recommendation techniques to help developers compose queries without the extensive knowledge of the codebase under search. However, few of these techniques are empirically evaluated by the usage data from real-world developers. To fill this gap, we studied several query recommendation techniques by extending Sando and conducting a longitudinal field study. Our study shows that over 30% of all queries were adopted from recommendation; and recommended queries retrieved results 7% more often than manual queries. C2 - 2014/// C3 - 2014 ieee symposium on visual languages and human-centric computing (vl/hcc 2014) DA - 2014/// DO - 10.1109/vlhcc.2014.6883025 SP - 69-76 ER - TY - CONF TI - Enhancing tools' intelligence for improved program analysis tool usability AU - Johnson, B. C2 - 2014/// C3 - 2014 ieee symposium on visual languages and human-centric computing (vl/hcc 2014) DA - 2014/// SP - 191-192 ER - TY - JOUR TI - Algebraic optimization of RDF graph pattern queries on MapReduce AU - Anyanwu, K. AU - Ravindra, P. AU - Kim, H. T2 - Large Scale and Big Data: Processing and Management DA - 2014/// PY - 2014/// DO - 10.1201/b17112-7 SP - 183–227 ER - TY - CONF TI - PAQO: Preference-aware query optimization for decentralized database systems AU - Farnan, N. L. AU - Lee, A. J. AU - Chrysanthis, P. K. AU - Yu, T. AB - The declarative nature of SQL has traditionally been a major strength. Users simply state what information they are interested in, and the database management system determines the best plan for retrieving it. A consequence of this model is that should a user ever want to specify some aspect of how their queries are evaluated (e.g., a preference to read data from a specific replica, or a requirement for all joins to be performed by a single server), they are unable to. This can leave database administrators shoehorning evaluation preferences into database cost models. Further, for distributed database users, it can result in query evaluation plans that violate data handling best practices or the privacy of the user. To address such issues, we have developed a framework for declarative, user-specified constraints on the query optimization process and implemented it within PosgreSQL. Our Preference-Aware Query Optimizer (PAQO) upholds both strict requirements and partially ordered preferences that are issued alongside of the queries that it processes. In this paper, we present the design of PAQO and thoroughly evaluate its performance. C2 - 2014/// C3 - 2014 ieee 30th international conference on data engineering (icde) DA - 2014/// DO - 10.1109/icde.2014.6816670 SP - 424-435 ER - TY - CONF TI - A real-time distributed hash table AU - Qian, T. AU - Mueller, F. AU - Xin, Y. F. AB - Currently, the North American power grid uses a centralized system to monitor and control wide-area power grid states. This centralized architecture is becoming a bottleneck as large numbers of wind and photo-voltaic (PV) generation sources require real-time monitoring and actuation to ensure sustained reliability. We have designed and implemented a distributed storage system, a real-time distributed hash table (DHT), to store and retrieve this monitoring data as a real-time service to an upper layer decentralized control system. Our real-time DHT utilizes the DHT algorithm Chord in a cyclic executive to schedule data-lookup jobs on distributed storage nodes. We formally define the pattern of the workload on our real-time DHT and use queuing theory to stochastically derive the time bound for response times of these lookup requests. We also define the quality of service (QoS) metrics of our real-time DHT as the probability that deadlines of requests can be met. We use the stochastic model to derive the QoS. An experimental evaluation on distributed nodes shows that our model is well suited to provide time bounds for requests following typical workload patterns and that a prioritized extension can increase the probability of meeting deadlines for subsequent requests. C2 - 2014/// C3 - 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA) DA - 2014/// DO - 10.1109/rtcsa.2014.6910537 ER - TY - CONF TI - Determining team hierarchy from broadcast communications AU - Kalia, A. K. AU - Buchler, N. AU - Ungvarsky, D. AU - Govindan, R. AU - Singh, M. P. C2 - 2014/// C3 - Social informatics, socinfo 2014 DA - 2014/// VL - 8851 SP - 493-507 ER - TY - BOOK TI - VBR video traffic models AU - Tanwir, S. DA - 2014/// PY - 2014/// PB - Hoboken, NJ: John Wiley & Sons, Inc. ER - TY - CONF TI - The thing itself speaks: Accountability as a foundation for requirements in sociotechnical systems AU - Chopra, A.K. AU - Singh, Munindar P. AB - We consider sociotechnical systems (STSs) that facilitate social interaction among autonomous principals (either humans or organizations). Although accountability is a foundational concept in such systems, established requirements engineering methods do not support accountability in the broad sense of calling to account of one party by another. To address this short-coming, we propose the notion of accountability requirement. Further, we claim that to model an STS means to precisely capture the accountability requirements between its principals. C2 - 2014/// C3 - 2014 IEEE 7th International Workshop on Requirements Engineering and Law, RELAW 2014 - Proceedings DA - 2014/// DO - 10.1109/RELAW.2014.6893477 SP - 22–24 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908610765&partnerID=MN8TOARS ER - TY - CONF TI - Identifying malicious metering data in advanced metering infrastructure AU - Choo, E. AU - Park, Y. AU - Siyamwala, H. C2 - 2014/// C3 - 2014 IEEE 8th International Symposium on Service Oriented System Engineering (SOSE) DA - 2014/// SP - 490-495 ER - TY - BOOK TI - A first course in probability AU - Stewart, W. J. DA - 2014/// PY - 2014/// PB - [Place of publication not identified]: [CreateSpace Independent Publishing Platform] ER - TY - JOUR TI - Solving the maximum duo-preservation string mapping problem with linear programming AU - Chen, Wenbin AU - Chen, Zhengzhang AU - Samatova, Nagiza F. AU - Peng, Lingxi AU - Wang, Jianxiong AU - Tang, Maobin T2 - THEORETICAL COMPUTER SCIENCE AB - In this paper, we introduce the maximum duo-preservation string mapping problem (MPSM), which is complementary to the minimum common string partition problem (MCSP). When each letter occurs at most k times in any input string, the version of MPSM is called k-MPSM. In order to design approximation algorithms for MPSM, we also introduce the constrained maximum induced subgraph problem (CMIS) and the constrained minimum induced subgraph (CNIS) problem. We show that both CMIS and CNIS are NP-complete. We also study the approximation algorithms for the restricted version of CMIS, which is called k-CMIS (k⩾2). Using Linear Programming method, we propose an approximation algorithm for 2-CMIS with approximation ratio 2 and an approximation algorithm for k-CMIS (k⩾3) with approximation ratio k2. Based on approximation algorithms for k-CMIS, we get approximation algorithms for k-MPSM with the same approximation ratio. DA - 2014/4/17/ PY - 2014/4/17/ DO - 10.1016/j.tcs.2014.02.017 VL - 530 SP - 1-11 SN - 1879-2294 KW - Approximation algorithm KW - Constrained maximum induced subgraph problem KW - Duo-preservation string mapping KW - Linear programming KW - Integer programming KW - Randomized rounding ER - TY - JOUR TI - Bliss: Specifying Declarative Service Protocols AU - Singh, Munindar P. T2 - 2014 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC 2014) AB - BSPL, the Blindingly Simple Protocol Language, is a recent approach for declaratively expressing service communication protocols that involves only two main constructs: a way to specify a message as an atomic protocol and a way to compose protocols. BSPL supports the Local State Transfer architectural style for decentralized service enactment. BSPL offers significant gains in expressing protocols (i.e., specifications) that decouple participants in service engagements (i.e., agents) as much as possible given the causal constraints induced from the information exchanged by them. Importantly, BSPL relies exclusively on how appropriate information flows are induced from the specification. This paper proposes Bliss, a conceptual model for interaction that is based on information flow. The idea behind Bliss is to incrementally develop the information needed to complete the social object that a protocol computes. Bliss yields simple steps to help ensure that the resulting protocol adequately captures the given requirements with respect to the social object. DA - 2014/// PY - 2014/// DO - 10.1109/scc.2014.39 SP - 235-242 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84919657961&partnerID=MN8TOARS KW - Business process modeling KW - Business protocols ER - TY - CONF TI - A real-time distributed storage system for multi-resolution virtual synchrophasor AU - Qian, T. AU - Chakrabortty, A. AU - Mueller, F. AU - Xin, Y. F. AB - With the continuing large-scale deployment of Phasor Measurement Units (PMU), the Wide-Area Measurement System (WAMS) technology is envisioned to evolve towards a distributed architecture where multiple sets of distributed Phasor Data Concentrators (PDCs) collectively process PMU data to achieve real-time distributed intelligence. Emerging applications developed under this vision will pose stringent but heterogeneous real-time requirements on throughput, delay, and reliability performance of the underlying communication and computing infrastructure. To address this problem, we present a novel virtual PMU (vPMU) architecture that decomposes phasor samples into multiple resolution layers. For a particular receiver with a certain resolution requirement, a complete set of PMU data can be composed by combining samples from the lower layers, without the need for samples from higher layers. We design and implement a real-time distributed storage system to support the virtual PMU data communication. We extend the Chord algorithm so that the response time of data communication can be bounded by our storage system. In addition, we use queuing theory to analyze the response time of requests with our stochastic model. C2 - 2014/// C3 - 2014 ieee pes general meeting - conference & exposition DA - 2014/// DO - 10.1109/pesgm.2014.6939832 ER - TY - CONF TI - A model based fault locating method for distribution systems AU - Baran, M. AU - Padmanabhan, A. AU - Chouhan, S. AU - Yuan, X. Y. AU - Smith, J. AU - Mayfield, H. AB - This paper presents a Fault Locating Method (FLM) which uses the current waveforms from Power Quality (PQ) Monitors located on a distribution feeder to determine the location of a permanent fault on the feeder. The method is model based in that it uses a detailed feeder model to estimate the fault currents and compares it with the data obtained from PQ monitors. Test results on the proposed FLM have been provided for two different distribution feeders. C2 - 2014/// C3 - 2014 ieee pes general meeting - conference & exposition DA - 2014/// DO - 10.1109/pesgm.2014.6939019 ER - TY - JOUR TI - Toward Cyber-Enhanced Working Dogs for Search and Rescue AU - Bozkurt, Alper AU - Roberts, David L. AU - Sherman, Barbara L. AU - Brugarolas, Rita AU - Mealin, Sean AU - Majikes, John AU - Yang, Pu AU - Loftin, Robert T2 - IEEE INTELLIGENT SYSTEMS AB - The authors introduce the fundamental building blocks for a cyber-enabled, computer-mediated communication platform to connect human and canine intelligence to achieve a new generation of Cyber-Enhanced Working Dog (CEWD). The use of monitoring technologies provides handlers with real-time information about the behavior and emotional state of their CEWDs and the environments they're working in for a more intelligent canine-human collaboration. From handler to dog, haptic feedback and auditory cues are integrated to provide remote command and feedback delivery. From dog to handler, multiple inertial measurement units strategically located on a harness are used to accurately detect posture and behavior, and concurrent noninvasive photoplethysmogram and electrocardiogram for physiological monitoring. The authors also discuss how CEWDs would be incorporated with a variety of other robotic and autonomous technologies to create next-generation intelligent emergency response systems. Using cyber-physical systems to supplement and augment the two-way information exchange between human handlers and dogs would amplify the remarkable sensory capacities of search and rescue dogs and help them save more lives. DA - 2014/// PY - 2014/// DO - 10.1109/mis.2014.77 VL - 29 IS - 6 SP - 32-39 SN - 1941-1294 ER - TY - JOUR TI - Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations AU - Zhou, M. Z. AU - Shen, Xipeng AU - Gao, Y. Q. AU - Yiu, G. T2 - ACM SIGPLAN Notices AB - Function versioning is an approach to addressing input-sensitivity of program optimizations. A major side effect of it is notable code size increase, which has been hindering its broad applications to large code bases and space-stringent environments. In this paper, we initiate a systematic exploration into the problem, providing answers to some fundamental questions: Given a space constraint, to which function we should apply versioning? How many versions of a function should we include in the final executable? Is the optimal selection feasible to do in polynomial time? This study proves selecting the best set of versions under a space constraint is NP-complete and proposes a heuristic algorithm named CHoGS which yields near optimal results in quadratic time. We implement the algorithm and conduct experiments through the IBM XL compilers. We observe significant performance enhancement with only slight code size increase; the results from CHoGS show factors of higher space efficiency than those from traditional hotness-based methods. DA - 2014/// PY - 2014/// DO - 10.1145/2714064.2660229 VL - 49 IS - 10 SP - 763–776 ER - TY - JOUR TI - Call Sequence Prediction through Probabilistic Calling Automata AU - Zhao, Zhijia AU - Wu, Bo AU - Zhou, Mingzhou AU - Ding, Yufei AU - Sun, Jianhua AU - Shen, Xipeng AU - Wu, Youfeng T2 - ACM SIGPLAN NOTICES AB - Predicting a sequence of upcoming function calls is important for optimizing programs written in modern managed languages (e.g., Java, Javascript, C#.) Existing function call predictions are mainly built on statistical patterns, suitable for predicting a single call but not a sequence of calls. This paper presents a new way to enable call sequence prediction, which exploits program structures through Probabilistic Calling Automata (PCA), a new program representation that captures both the inherent ensuing relations among function calls, and the probabilistic nature of execution paths. It shows that PCA-based prediction outperforms existing predictions, yielding substantial speedup when being applied to guide Just-In-Time compilation. By enabling accurate, efficient call sequence prediction for the first time, PCA-based predictors open up many new opportunities for dynamic program optimizations. DA - 2014/10// PY - 2014/10// DO - 10.1145/2714064.2660221 VL - 49 IS - 10 SP - 745-762 SN - 1558-1160 KW - Languages KW - Performance KW - Function call KW - Call sequence prediction KW - Probabilistic calling automata KW - Dynamic optimizations KW - Just-in-time compilation KW - Parallel compilation ER - TY - CONF TI - Generalizability of goal recognition models in narrative-centered learning environments AU - Baikadi, A. AU - Rowe, J. AU - Mott, B. AU - Lester, J. AB - Recent years have seen growing interest in automated goal recognition. In user-adaptive systems, goal recognition is the problem of recognizing a user’s goals by observing the actions the user performs. Models of goal recognition can support student learning in intelligent tutoring systems, enhance communication efficiency in dialogue systems, or dynamically adapt software to users’ interests. In this paper, we describe an approach to goal recognition that leverages Markov Logic Networks (MLNs)—a machine learning framework that combines probabilistic inference with first-order logical reasoning—to encode relations between problem-solving goals and discovery events, domain-specific representations of user progress in narrative-centered learning environments. We investigate the impact of discovery event representations on goal recognition accuracy and efficiency. We also investigate the generalizability of discovery event-based goal recognition models across two corpora from students interacting with two distinct narrative-centered learning environments. Empirical results indicate that discovery event-based models outperform previous state-of-the-art approaches on both corpora. C2 - 2014/// C3 - User modeling, adaptation, and personalization, umap 2014 DA - 2014/// DO - 10.1007/978-3-319-08786-3_24 VL - 8538 SP - 278-289 ER - TY - JOUR TI - Cognitive models of discourse comprehension for narrative generation AU - Niehaus, James AU - Young, R. Michael T2 - Literary and Linguistic Computing AB - This article presents an approach to using cognitive models of narrative discourse comprehension to define an explicit computational model of a reader’s comprehension process during reading, predicting aspects of narrative focus and inferencing with precision. This computational model is employed in a narrative discourse generation system to select and sequence content from a partial plan representing story world facts, objects, and events, creating discourses that satisfy comprehension criteria. Cognitive theories of narrative discourse comprehension define explicit models of a reader’s mental state during reading. These cognitive models are created to test hypotheses and explain empirical results about reader comprehension, but do not often contain sufficient precision for implementation on a computer. Therefore, they have not previously been suitable for computational narrative generation. The results of three experiments are presented and discussed, exhibiting empirical support for the approach presented. This work makes a number of contributions that advance the state-of-the-art in narrative discourse generation: a formal model of narrative focus, a formal model of online inferencing in narrative, a method of selecting narrative discourse content to satisfy comprehension criteria, and both implementation and evaluation of these models. DA - 2014/10/13/ PY - 2014/10/13/ DO - 10.1093/llc/fqu056 VL - 29 IS - 4 SP - 561-582 J2 - Lit Linguist Computing LA - en OP - SN - 0268-1145 1477-4615 UR - http://dx.doi.org/10.1093/llc/fqu056 DB - Crossref ER - TY - JOUR TI - Bayesian neural networks for detecting epistasis in genetic association studies AU - Beam, Andrew L AU - Motsinger-Reif, Alison AU - Doyle, Jon T2 - BMC Bioinformatics AB - Discovering causal genetic variants from large genetic association studies poses many difficult challenges. Assessing which genetic markers are involved in determining trait status is a computationally demanding task, especially in the presence of gene-gene interactions. A non-parametric Bayesian approach in the form of a Bayesian neural network is proposed for use in analyzing genetic association studies. Demonstrations on synthetic and real data reveal they are able to efficiently and accurately determine which variants are involved in determining case-control status. By using graphics processing units (GPUs) the time needed to build these models is decreased by several orders of magnitude. In comparison with commonly used approaches for detecting interactions, Bayesian neural networks perform very well across a broad spectrum of possible genetic relationships. The proposed framework is shown to be a powerful method for detecting causal SNPs while being computationally efficient enough to handle large datasets. DA - 2014/// PY - 2014/// DO - 10.1186/s12859-014-0368-0 VL - 15 IS - 1 SP - 368 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84923857700&partnerID=MN8TOARS ER - TY - JOUR TI - A GENI Meso-Scale Experiment of a Verification Service AU - Babaoglu, Ahmet Can AU - Dutta, Rudra T2 - 2014 THIRD GENI RESEARCH AND EDUCATIONAL EXPERIMENT WORKSHOP (GREE) AB - In this work, we demonstrate the real world results of a verification service that verifies the performance of a set of network providers by measuring the user flows, using GENI experimental facility. We first give an overview of the architectural components and their interactions to enable such a verification capability. We then give the experiment setup details followed by the numerical results for various network measurement metrics and the evaluation of these results. DA - 2014/// PY - 2014/// DO - 10.1109/gree.2014.13 SP - 65-68 ER - TY - JOUR TI - Nesting Strategies for Enabling Nimble MapReduce Dataflows for Large RDF Data AU - Ravindra, Padmashree AU - Anyanwu, Kemafor T2 - INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS AB - Graph and semi-structured data are usually modeled in relational processing frameworks as “thin” relations (node, edge, node) and processing such data involves a lot of join operations. Intermediate results of joins with multi-valued attributes or relationships, contain redundant subtuples due to repetition of single-valued attributes. The amount of redundant content is high for real-world multi-valued relationships in social network (millions of Twitter followers of popular celebrities) or biological (multiple references to related proteins) datasets. In MapReduce-based platforms such as Apache Hive and Pig, redundancy in intermediate results contributes avoidable costs to the overall I/O, sorting, and network transfer overhead of join-intensive workloads due to longer workflows. Consequently, providing techniques for dealing with such redundancy will enable more nimble execution of such workflows. This paper argues for the use of a nested data model for representing intermediate data concisely using nesting-aware dataflow operators that allow for lazy and partial unnesting strategies. This approach reduces the overall I/O and network footprint of a workflow by concisely representing intermediate results during most of a workflow's execution, until complete unnesting is absolutely necessary. The proposed strategies are integrated into Apache Pig and experimental evaluation over real-world and synthetic benchmark datasets confirms their superiority over relational-style MapReduce systems such as Apache Pig and Hive. DA - 2014/// PY - 2014/// DO - 10.4018/ijswis.2014010101 VL - 10 IS - 1 SP - 1-26 SN - 1552-6291 KW - Hadoop KW - MapReduce KW - Multi-Valued Properties KW - RDF Graph Pattern Queries KW - Semantic Web KW - SPARQL KW - Unnesting Strategies ER - TY - CONF TI - How the Sando search tool recommends queries AU - Ge, X. AU - Shepherd, D. AU - Damevski, K. AU - Murphy-Hill, E. AB - Developers spend a significant amount of time searching their local codebase. To help them search efficiently, researchers have proposed novel tools that apply state-of-the-art information retrieval algorithms to retrieve relevant code snippets from the local codebase. However, these tools still rely on the developer to craft an effective query, which requires that the developer is familiar with the terms contained in the related code snippets. Our empirical data from a state-of-the-art local code search tool, called Sando, suggests that developers are sometimes unacquainted with their local codebase. In order to bridge the gap between developers and their ever-increasing local codebase, in this paper we demonstrate the recommendation techniques integrated in Sando. C2 - 2014/// C3 - 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE) DA - 2014/// DO - 10.1109/csmr-wcre.2014.6747210 SP - 425-428 ER - TY - JOUR TI - Evaluating the Impact of SDC on the GMRES Iterative Solver AU - Elliott, James AU - Hoemmen, Mark AU - Mueller, Frank T2 - 2014 IEEE 28TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM AB - Increasing parallelism and transistor density, along with increasingly tighter energy and peak power constraints, may force exposure of occasionally incorrect computation or storage to application codes. Silent data corruption (SDC) will likely be infrequent, yet one SDC suffices to make numerical algorithms like iterative linear solvers cease progress towards the correct answer. Thus, we focus on resilience of the iterative linear solver GMRES to a single transient SDC. We derive inexpensive checks to detect the effects of an SDC in GMRES that work for a more general SDC model than presuming a bit flip. Our experiments show that when GMRES is used as the inner solver of an inner-outer iteration, it can "run through" SDC of almost any magnitude in the computationally intensive orthogonalization phase. That is, it gets the right answer using faulty data without any required roll back. Those SDCs which it cannot run through, get caught by our detection scheme. DA - 2014/// PY - 2014/// DO - 10.1109/ipdps.2014.123 SP - SN - 1530-2075 ER - TY - CONF TI - Estimating trust from agents' interactions via commitments AU - Kalia, A. K. AU - Zhang, Z. AU - Singh, M. P. C2 - 2014/// C3 - 21st european conference on artificial intelligence (ecai 2014) DA - 2014/// VL - 263 SP - 1043-1044 ER - TY - CONF TI - When is tutorial dialogue more effective than step-based tutoring? AU - Chi, M. AU - Jordan, P. AU - VanLehn, K. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// VL - 8474 SP - 210-219 ER - TY - JOUR TI - The importance of governance ongoing engagement with the campus community around the CMS AU - Petherbridge, D. T. AU - Dulberg, M. S. T2 - Research on course management systems in higher education DA - 2014/// PY - 2014/// SP - 221-238 ER - TY - CONF TI - Survival analysis on duration data in intelligent tutors AU - Eagle, M. AU - Barnes, T. AB - Effects such as student dropout and the non-normal distribution of duration data confound the exploration of tutor efficiency, time-in-tutor vs. tutor performance, in intelligent tutors. We use an accelerated failure time (AFT) model to analyze the effects of using automatically generated hints in Deep Thought, a propositional logic tutor. AFT is a branch of survival analysis, a statistical technique designed for measuring time-to-event data and account for participant attrition. We found that students provided with automatically generated hints were able to complete the tutor in about half the time taken by students who were not provided hints. We compare the results of survival analysis with a standard between-groups mean comparison and show how failing to take student dropout into account could lead to incorrect conclusions. We demonstrate that survival analysis is applicable to duration data collected from intelligent tutors and is particularly useful when a study experiences participant attrition. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// DO - 10.1007/978-3-319-07221-0_22 VL - 8474 SP - 178-187 ER - TY - JOUR TI - Subspace Learning of Dynamics on a Shape Manifold: A Generative Modeling Approach AU - Yi, Sheng AU - Krim, Hamid T2 - IEEE TRANSACTIONS ON IMAGE PROCESSING AB - In this paper, we propose a novel subspace learning algorithm of shape dynamics. Compared to the previous works, our method is invertible and better characterizes the nonlinear geometry of a shape manifold while retaining a good computational efficiency. In this paper, using a parallel moving frame on a shape manifold, each path of shape dynamics is uniquely represented in a subspace spanned by the moving frame, given an initial condition (the starting point and starting frame). Mathematically, such a representation may be formulated as solving a manifold-valued differential equation, which provides a generative modeling of high-dimensional shape dynamics in a lower dimensional subspace. Given the parallelism and a path on a shape manifold, the parallel moving frame along the path is uniquely determined up to the choice of the starting frame. With an initial frame, we minimize the reconstruction error from the subspace to shape manifold. Such an optimization characterizes well the Riemannian geometry of the manifold by imposing parallelism (equivalent as a Riemannian metric) constraints on the moving frame. The parallelism in this paper is defined by a Levi-Civita connection, which is consistent with the Riemannian metric of the shape manifold. In the experiments, the performance of the subspace learning is extensively evaluated using two scenarios: 1) how the high dimensional geometry is characterized in the subspace and 2) how the reconstruction compares with the original shape dynamics. The results demonstrate and validate the theoretical advantages of the proposed approach. DA - 2014/11// PY - 2014/11// DO - 10.1109/tip.2014.2358200 VL - 23 IS - 11 SP - 4907-4919 SN - 1941-0042 KW - Subspace learning KW - dimension reduction KW - shape analysis KW - shape dynamic analysis ER - TY - CONF TI - Serious games go informal: a museum-centric perspective on intelligent game-based learning AU - Rowe, J. P. AU - Lobene, E. V. AU - Mott, B. W. AU - Lester, J. C. AB - Intelligent game-based learning environments show considerable promise for creating effective and engaging learning experiences that are tailored to individuals. To date, much of the research on intelligent game-based learning environments has focused on formal education settings and training. However, intelligent game-based learning environments also offer significant potential for informal education settings, such as museums and science centers. In this paper, we describe Future Worlds, a prototype game-based learning environment for collaborative explorations of sustainability in science museums. We report findings from a study investigating the influence of individual differences on learning and engagement in Future Worlds. Results indicate that learners showed significant gains in sustainability knowledge as well as high levels of engagement. Boys were observed to actively engage with Future Worlds for significantly longer than girls, and young children engaged with the exhibit longer than older children. These findings support the promise of intelligent game-based learning environments that dynamically recognize and adapt to learners’ individual differences during museum learning. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// DO - 10.1007/978-3-319-07221-0_51 VL - 8474 SP - 410-415 ER - TY - JOUR TI - Reinforcing Visual Grouping Cues to Communicate Complex Informational Structure AU - Bae, Juhee AU - Watson, Benjamin T2 - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS AB - In his book Multimedia Learning [7], Richard Mayer asserts that viewers learn best from imagery that provides them with cues to help them organize new information into the correct knowledge structures. Designers have long been exploiting the Gestalt laws of visual grouping to deliver viewers those cues using visual hierarchy, often communicating structures much more complex than the simple organizations studied in psychological research. Unfortunately, designers are largely practical in their work, and have not paused to build a complex theory of structural communication. If we are to build a tool to help novices create effective and well structured visuals, we need a better understanding of how to create them. Our work takes a first step toward addressing this lack, studying how five of the many grouping cues (proximity, color similarity, common region, connectivity, and alignment) can be effectively combined to communicate structured text and imagery from real world examples. To measure the effectiveness of this structural communication, we applied a digital version of card sorting, a method widely used in anthropology and cognitive science to extract cognitive structures. We then used tree edit distance to measure the difference between perceived and communicated structures. Our most significant findings are: 1) with careful design, complex structure can be communicated clearly; 2) communicating complex structure is best done with multiple reinforcing grouping cues; 3) common region (use of containers such as boxes) is particularly effective at communicating structure; and 4) alignment is a weak structural communicator. DA - 2014/12// PY - 2014/12// DO - 10.1109/tvcg.2014.2346998 VL - 20 IS - 12 SP - 1973-1982 SN - 1941-0506 KW - Visual grouping KW - visual hierarchy KW - gestalt principles KW - perception KW - visual communication ER - TY - JOUR TI - Processing MPI Derived Datatypes on Noncontiguous GPU-Resident Data AU - Jenkins, John AU - Dinan, James AU - Balaji, Pavan AU - Peterka, Tom AU - Samatova, Nagiza F. AU - Thakur, Rajeev T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - Driven by the goals of efficient and generic communication of noncontiguous data layouts in GPU memory, for which solutions do not currently exist, we present a parallel, noncontiguous data-processing methodology through the MPI datatypes specification. Our processing algorithm utilizes a kernel on the GPU to pack arbitrary noncontiguous GPU data by enriching the datatypes encoding to expose a fine-grained, data-point level of parallelism. Additionally, the typically tree-based datatype encoding is preprocessed to enable efficient, cached access across GPU threads. Using CUDA, we show that the computational method outperforms DMA-based alternatives for several common data layouts as well as more complex data layouts for which reasonable DMA-based processing does not exist. Our method incurs low overhead for data layouts that closely match best-case DMA usage or that can be processed by layout-specific implementations. We additionally investigate usage scenarios for data packing that incur resource contention, identifying potential pitfalls for various packing strategies. We also demonstrate the efficacy of kernel-based packing in various communication scenarios, showing multifold improvement in point-to-point communication and evaluating packing within the context of the SHOC stencil benchmark and HACC mesh analysis. DA - 2014/10// PY - 2014/10// DO - 10.1109/tpds.2013.234 VL - 25 IS - 10 SP - 2627-2637 SN - 1558-2183 KW - MPI KW - graphics processing unit KW - CUDA KW - datatype ER - TY - CONF TI - Modeling student dropout in tutoring systems AU - Eagle, M. AU - Barnes, T. AB - Intelligent tutors have been shown to be almost as effective as human tutors in supporting learning in many domains. However, the construction of intelligent tutors can be costly. One way to address this problem is to use previously collected data to generate models to provide intelligent feedback to otherwise non-personalized tutors. In this work, we explore how we can use previously collected data to build models of student dropout over time; we define dropout as ceasing to interact with the tutor before the completion of all required tasks. We use survival analysis, a statistical method of measuring time to event data, to model how long we can expect students to interact with a tutor. Future work will explore ways to use these models to to provide personalized feedback, with the goal of preventing students from dropping out. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// DO - 10.1007/978-3-319-07221-0_104 VL - 8474 SP - 676-678 ER - TY - JOUR TI - Mining Contracts for Business Events and Temporal Constraints in Service Engagements AU - Gao, Xibin AU - Singh, Munindar P. T2 - IEEE TRANSACTIONS ON SERVICES COMPUTING AB - Contracts are legally binding descriptions of business service engagements. In particular, we consider business events as elements of a service engagement. Business events such as purchase, delivery, bill payment, and bank interest accrual not only correspond to essential processes but are also inherently temporally constrained. Identifying and understanding the events and their temporal relationships can help a business partner determine what to deliver and what to expect from others as it participates in the service engagement specified by a contract. However, contracts are expressed in unstructured text and their insights are buried therein. Our contributions are threefold. We develop a novel approach employing a hybrid of surface patterns, parsing, and classification to extract 1) business events and 2) their temporal constraints from contract text. We use topic modeling to 3) automatically organize the event terms into clusters. An evaluation on a real-life contract dataset demonstrates the viability and promise of our hybrid approach, yielding an F-measure of 0.89 in event extraction and 0.90 in temporal constraints extraction. The topic model yields event term clusters with an average match of 85 percent between two independent human annotations and an expert-assigned set of class labels for the clusters. DA - 2014/// PY - 2014/// DO - 10.1109/tsc.2013.21 VL - 7 IS - 3 SP - 427-439 SN - 1939-1374 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84907217976&partnerID=MN8TOARS KW - Service engagements KW - contract mining KW - business events ER - TY - BOOK TI - Leveraging semi-supervised learning to predict student problem-solving performance in narrative-centered learning environments AU - Min, Wookhee AU - Mott, B.W. AU - Rowe, J.P. AU - Lester, J.C. AB - This paper presents a semi-supervised machine-learning approach to predicting whether students will be successful in solving problem-solving tasks within narrative-centered learning environments. Results suggest the approach often outperforms standard supervised learning methods. DA - 2014/// PY - 2014/// DO - 10.1007/978-3-319-07221-0_99 VL - 8474 LNCS SE - 664-665 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84958543350&partnerID=MN8TOARS ER - TY - CONF TI - Identifying effective moves in tutoring: On the refinement of dialogue act annotation schemes AU - Vail, A. K. AU - Boyer, K. E. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// VL - 8474 SP - 199-209 ER - TY - JOUR TI - Guest Editors' Introduction: Special Issue on Security and Privacy in Mobile Platforms AU - Ahn, Gail-Joon AU - Enck, William AU - Shin, Dongwan T2 - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING AB - The articles in this special issue focus on the use of computer security and privacy applications in mobile communication platforms. DA - 2014/// PY - 2014/// DO - 10.1109/tdsc.2014.2312738 VL - 11 IS - 3 SP - 209-210 SN - 1941-0018 ER - TY - JOUR TI - Dynamic Adaptive Anti-Jamming via Controlled Mobility AU - He, Xiaofan AU - Dai, Huaiyu AU - Ning, Peng T2 - IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS AB - In this paper, the mobility of network nodes is explored as a new promising approach for jamming defense. To fulfill it, properly designed node motion that can intelligently adapt to the jammer's action is crucial. In our study, anti-jamming mobility control is investigated in the context of the single and multiple commodity flow problems, in the presence of intelligent mobile jammers which can respond to the evasion of legitimate nodes as well. Based on spectral graph theory, two new spectral quantities, single- and multi-weighted Cheeger constants and corresponding eigenvalue variants, are constructed to direct motions of the defender and the attacker in this dynamic adaptive competition. Both analytical and simulation results are presented to justify the effectiveness of the proposed approach. Furthermore, the proposed scheme can also be applied in cognitive radio networks to reconfigure the secondary users in the presence of mobile primary users. DA - 2014/8// PY - 2014/8// DO - 10.1109/twc.2014.2320973 VL - 13 IS - 8 SP - 4374-4388 SN - 1558-2248 KW - Jamming/anti-jamming KW - mobility control KW - conductance KW - cognitive radio network KW - security ER - TY - JOUR TI - Different Modes of Variability over the Tasman Sea: Implications for Regional Climate AU - Liess, Stefan AU - Kumar, Arjun AU - Snyder, Peter K. AU - Kawale, Jaya AU - Steinhaeuser, Karsten AU - Semazzi, Frederick H. M. AU - Ganguly, Auroop R. AU - Samatova, Nagiza F. AU - Kumar, Vipin T2 - JOURNAL OF CLIMATE AB - Abstract A new approach is used to detect atmospheric teleconnections without being bound by orthogonality (such as empirical orthogonal functions). This method employs negative correlations in a global dataset to detect potential teleconnections. One teleconnection occurs between the Tasman Sea and the Southern Ocean. It is related to El Niño–Southern Oscillation (ENSO), the Indian Ocean dipole (IOD), and the southern annular mode (SAM). This teleconnection is significantly correlated with SAM during austral summer, fall, and winter, with IOD during spring, and with ENSO in summer. It can thus be described as a hybrid between these modes. Given previously found relationships between IOD and ENSO, and IOD’s proximity to the teleconnection centers, correlations to IOD are generally stronger than to ENSO. Increasing pressure over the Tasman Sea leads to higher (lower) surface temperature over eastern Australia (the southwestern Pacific) in all seasons and is related to reduced surface temperature over Wilkes Land and Adélie Land in Antarctica during fall and winter. Precipitation responses are generally negative over New Zealand. For one standard deviation of the teleconnection index, precipitation anomalies are positive over Australia in fall, negative over southern Australia in winter and spring, and negative over eastern Australia in summer. When doubling the threshold, the size of the anomalous high-pressure center increases and annual precipitation anomalies are negative over southeastern Australia and northern New Zealand. Eliassen–Palm fluxes quantify the seasonal dependence of SAM, ENSO, and IOD influences. Analysis of the dynamical interactions between these teleconnection patterns can improve prediction of seasonal temperature and precipitation patterns in Australia and New Zealand. DA - 2014/11/15/ PY - 2014/11/15/ DO - 10.1175/jcli-d-13-00713.1 VL - 27 IS - 22 SP - 8466-8486 SN - 1520-0442 KW - Australia KW - Southern Ocean KW - Annular mode KW - ENSO KW - Teleconnections KW - Drought ER - TY - CONF TI - Building games to learn from their players: Generating hints in a serious game AU - Hicks, A. AU - Peddycord, B. AU - Barnes, T. AB - This paper presents a method for generating hints based on observed world states in a serious game. BOTS is an educational puzzle game designed to teach programming fundamentals. To incorporate intelligent feedback in the form of personalized hints, we apply data-driven hint-generation methods. This is especially challenging for games like BOTS because of the open-ended nature of the problems. By using a modified representation of player data focused on outputs rather than actions, we are able to generate hints for players who are in similar (rather than identical) states, creating hints for multiple cases without requiring expert knowledge. Our contributions in this work are twofold. Firstly, we generalize techniques from the ITS community in hint generation to an educational game. Secondly, we introduce a novel approach to modeling student states for open-ended problems, like programming in BOTS. These techniques are potentially generalizable to programming tutors for mainstream languages. C2 - 2014/// C3 - Intelligent tutoring systems, its 2014 DA - 2014/// DO - 10.1007/978-3-319-07221-0_39 VL - 8474 SP - 312-317 ER - TY - JOUR TI - A Computational Model of Plan-Based Narrative Conflict at the Fabula Level AU - Ware, Stephen G. AU - Young, R. Michael AU - Harrison, Brent AU - Roberts, David L. T2 - IEEE Transactions on Computational Intelligence and AI in Games AB - Conflict is an essential element of interesting stories. In this paper, we operationalize a narratological definition of conflict and extend established narrative planning techniques to incorporate this definition. The conflict partial order causal link planning algorithm (CPOCL) allows narrative conflict to arise in a plan while maintaining causal soundness and character believability. We also define seven dimensions of conflict in terms of this algorithm's knowledge representation. The first three-participants, reason, and duration-are discrete values which answer the “who?” “why?” and “when?” questions, respectively. The last four-balance, directness, stakes, and resolution-are continuous values which describe important narrative properties that can be used to select conflicts based on the author's purpose. We also present the results of two empirical studies which validate our operationalizations of these narrative phenomena. Finally, we demonstrate the different kinds of stories which CPOCL can produce based on constraints on the seven dimensions. DA - 2014/9// PY - 2014/9// DO - 10.1109/tciaig.2013.2277051 VL - 6 IS - 3 SP - 271-288 J2 - IEEE Trans. Comput. Intell. AI Games OP - SN - 1943-068X 1943-0698 UR - http://dx.doi.org/10.1109/tciaig.2013.2277051 DB - Crossref KW - Conflict KW - narrative KW - planning ER - TY - JOUR TI - Protecting communications infrastructure against cyber attacks AU - Gu, D. W. AU - Jiang, X. X. AU - Xue, Y. B. AU - Zou, W. AU - Guo, L. T2 - China Communications DA - 2014/// PY - 2014/// VL - 11 IS - 8 SP - I- ER - TY - JOUR TI - Hierarchical traffic grooming: A tutorial AU - Wang, Hui AU - Rouskas, George N. T2 - COMPUTER NETWORKS AB - Traffic grooming is concerned with the design, operation, and control of networks with multigranular bandwidth demands. As the number of resources in a multigranular network increases rapidly with the network size, wavelength capacity, and load, a scalable framework for managing these entities becomes essential. Hierarchical traffic grooming facilitates the control and management of multigranular WDM networks. In this paper, we present a survey of traffic grooming schemes for optical networks that make use of architectures, algorithms and design techniques that impose a hierarchical structure on the network topology. DA - 2014/8/20/ PY - 2014/8/20/ DO - 10.1016/j.comnet.2014.04.019 VL - 69 SP - 147-156 SN - 1872-7069 KW - Traffic grooming KW - Hierarchical grooming KW - Network design ER - TY - JOUR TI - Analysis and Control of Beliefs in Social Networks AU - Wang, Tian AU - Krim, Hamid AU - Viniotis, Yannis T2 - IEEE TRANSACTIONS ON SIGNAL PROCESSING AB - In this paper, we investigate the problem of how beliefs diffuse among members of social networks. We propose an information flow model (IFM) of belief that captures how interactions among members affect the diffusion and eventual convergence of a belief. The IFM model includes a generalized Markov Graph (GMG) model as a social network model, which reveals that the diffusion of beliefs depends heavily on two characteristics of the social network characteristics, namely degree centralities and clustering coefficients. We apply the IFM to both converged belief estimation and belief control strategy optimization. The model is compared with an IFM including the Barabási-Albert model, and is evaluated via experiments with published real social network data. DA - 2014/11/1/ PY - 2014/11/1/ DO - 10.1109/tsp.2014.2352591 VL - 62 IS - 21 SP - 5552-5564 SN - 1941-0476 KW - Complex networks KW - information flow KW - machine learning ER - TY - JOUR TI - Understanding Location-Based User Experience AU - Murukannaiah, Pradeep K. AU - Singh, Munindar P. T2 - IEEE INTERNET COMPUTING AB - As location-based applications increase in scope and variety, engineering them to deliver a high-quality user experience becomes increasingly important. The authors describe how user experience criteria map to location-based applications, the special demands these criteria place on modeling, and how to realize such applications to obtain high-quality user experience. DA - 2014/// PY - 2014/// DO - 10.1109/mic.2014.127 VL - 18 IS - 6 SP - 72-76 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84908507901&partnerID=MN8TOARS KW - Mobile radio mobility management KW - User centered design KW - User interfaces KW - Context awareness KW - Mobile computing KW - Quality of service KW - mobile computing KW - location-based services KW - context-aware services KW - user experience ER - TY - JOUR TI - Targeted Combinatorial Alternative Splicing Generates Brain Region-Specific Repertoires of Neurexins AU - Schreiner, Dietmar AU - Nguyen, Thi-Minh AU - Russo, Giancarlo AU - Heber, Steffen AU - Patrignani, Andrea AU - Ahrne, Erik AU - Scheiffele, Peter T2 - NEURON AB - Molecular diversity of surface receptors has been hypothesized to provide a mechanism for selective synaptic connectivity. Neurexins are highly diversified receptors that drive the morphological and functional differentiation of synapses. Using a single cDNA sequencing approach, we detected 1,364 unique neurexin-α and 37 neurexin-β mRNAs produced by alternative splicing of neurexin pre-mRNAs. This molecular diversity results from near-exhaustive combinatorial use of alternative splice insertions in Nrxn1α and Nrxn2α. By contrast, Nrxn3α exhibits several highly stereotyped exon selections that incorporate novel elements for posttranscriptional regulation of a subset of transcripts. Complexity of Nrxn1α repertoires correlates with the cellular complexity of neuronal tissues, and a specific subset of isoforms is enriched in a purified cell type. Our analysis defines the molecular diversity of a critical synaptic receptor and provides evidence that neurexin diversity is linked to cellular diversity in the nervous system. DA - 2014/10/22/ PY - 2014/10/22/ DO - 10.1016/j.neuron.2014.09.011 VL - 84 IS - 2 SP - 386-398 SN - 1097-4199 ER - TY - JOUR TI - TaintDroid: An Information-Flow Tracking System for Realtime Privacy Monitoring on Smartphones AU - Enck, William AU - Gilbert, Peter AU - Han, Seungyeop AU - Tendulkar, Vasant AU - Chun, Byung-Gon AU - Cox, Landon P. AU - Jung, Jaeyeon AU - McDaniel, Patrick AU - Sheth, Anmol N. T2 - ACM TRANSACTIONS ON COMPUTER SYSTEMS AB - Today’s smartphone operating systems frequently fail to provide users with visibility into how third-party applications collect and share their private data. We address these shortcomings with TaintDroid, an efficient, system-wide dynamic taint tracking and analysis system capable of simultaneously tracking multiple sources of sensitive data. TaintDroid enables realtime analysis by leveraging Android’s virtualized execution environment. TaintDroid incurs only 32% performance overhead on a CPU-bound microbenchmark and imposes negligible overhead on interactive third-party applications. Using TaintDroid to monitor the behavior of 30 popular third-party Android applications, in our 2010 study we found 20 applications potentially misused users’ private information; so did a similar fraction of the tested applications in our 2012 study. Monitoring the flow of privacy-sensitive data with TaintDroid provides valuable input for smartphone users and security service firms seeking to identify misbehaving applications. DA - 2014/6// PY - 2014/6// DO - 10.1145/2619091 VL - 32 IS - 2 SP - SN - 1557-7333 KW - Design KW - Security KW - Performance KW - Information-flow tracking KW - privacy monitoring KW - smartphones KW - mobile apps ER - TY - CONF TI - Real time detection of harmonic structure: A case for topological signal analysis AU - Emrani, S. AU - Chintakunta, H. AU - Krim, H. AB - The goal of this study is to find evidence of cyclicity or periodicity in data with low computational complexity and high accuracy. Using delay embeddings, we transform the timedomain signal into a point cloud, whose topology reflects the periodic behavior of the signal. Persistent homology is employed to determine the underlying manifold of the point cloud, and the Euler characteristic provides for a fast computation of topology of the resulting manifold. We apply the introduced approach to breathing sound signals for wheeze detection. Our experiments substantiate the capabilities of the proposed method. C2 - 2014/// C3 - International conference on acoustics speech and signal processing DA - 2014/// DO - 10.1109/icassp.2014.6854240 ER - TY - JOUR TI - Maintenance of cooperative overlays in multi-overlay networks AU - Chung, W. C. AU - Hsu, C. J. AU - Lai, K. C. AU - Li, K. C. AU - Chung, Y. C. T2 - IET Communications DA - 2014/// PY - 2014/// VL - 8 IS - 15 SP - 2676-2683 ER - TY - CONF TI - Computing persistent features in big data: A distributed dimension reduction approach AU - Wilkerson, A. C. AU - Chintakunta, H. AU - Krim, H. AB - Persistent homology has become one of the most popular tools used in topological data analysis for analyzing big data sets. In an effort to minimize the computational complexity of finding the persistent homology of a data set, we develop a simplicial collapse algorithm called the selective collapse. This algorithm works by representing the previously developed strong collapse as a forest and uses that forest data to improve the speed of both the strong collapse and of persistent homology. Finally, we demonstrate the savings in computational complexity using geometric random graphs. C2 - 2014/// C3 - International conference on acoustics speech and signal processing DA - 2014/// DO - 10.1109/icassp.2014.6853548 ER - TY - JOUR TI - ChoiceNet: Toward an Economy Plane for the Internet AU - Wolf, Tilman AU - Griffioen, James AU - Calvert, Ken AU - Dutta, Rudra AU - Rouskas, George AU - Baldin, Ilya AU - Nagurney, Anna T2 - ACM SIGCOMM COMPUTER COMMUNICATION REVIEW AB - The Internet has been a key enabling technology for many new distributed applications and services. However, the deployment of new protocols and services in the Internet infrastructure itself has been sluggish, especially where economic incentives for network providers are unclear. In our work, we seek to develop an "economy plane" for the Internet that enables network providers to offer new network-based services (QoS, storage, etc.) for sale to customers. The explicit connection between economic relationships and network services across various time scales enables users to select among service alternatives. The resulting competition among network service providers will lead to overall better technological solutions and more competitive prices. In this paper, we present the architectural aspects of our ChoiceNet economy plane as well as some of the technological problems that need to be addressed in a practical deployment. DA - 2014/7// PY - 2014/7// DO - 10.1145/2656877.2656886 VL - 44 IS - 3 SP - 58-65 SN - 1943-5819 ER - TY - JOUR TI - A novel trust management framework for multi-cloud environments based on trust service providers AU - Fan, Wenjuan AU - Perros, Harry T2 - KNOWLEDGE-BASED SYSTEMS AB - In this paper, we address the problem of trust management in multi-cloud environments based on a set of distributed Trust Service Providers (TSPs). These are independent third-party providers/trust agents, trusted by Cloud Providers (CPs), Cloud Service Providers (CSPs) and Cloud Service Users (CSUs), that provide trust related services to cloud participants. TSPs are distributed over the clouds, and they elicit raw trust evidence from different sources and in different formats. This evidence is information regarding the adherence of a CSP to a Service Level Agreement (SLA) for a cloud-based service and the feedback sent by CSUs. Using this information, they evaluate an objective trust and a subjective trust of CSPs. TSPs communicate among themselves through a trust propagation network that permits a TSP to obtain trust information about a CSP from other TSPs. Experiments show that our proposed framework is effective and relatively stable in differentiating trustworthy and untrustworthy CSPs in a multi-cloud environment. DA - 2014/11// PY - 2014/11// DO - 10.1016/j.knosys.2014.07.018 VL - 70 SP - 392-406 SN - 1872-7409 KW - Trust management KW - Trust service provider KW - Multi-cloud KW - Subjective trust and objective trust KW - Trust propagation ER - TY - BOOK TI - VBR Video Traffic Models AU - Tanwir, S AU - Perros, H DA - 2014/// PY - 2014/// DO - 10.1002/9781118931066 SE - 1-148 SN - 978-1-84821-636-5 ER - TY - JOUR TI - Theory-Guided Data Science for Climate Change AU - Faghmous, James H. AU - Banerjee, Arindam AU - Shekhar, Shashi AU - Steinbach, Michael AU - Kumar, Vipin AU - Ganguly, Auroop R. AU - Samatova, Nagiza T2 - COMPUTER AB - To adequately address climate change, we need novel data-science methods that account for the spatiotemporal and physical nature of climate phenomena. Only then will we be able to move from statistical analysis to scientific insights. DA - 2014/11// PY - 2014/11// DO - 10.1109/mc.2014.335 VL - 47 IS - 11 SP - 74-78 SN - 1558-0814 KW - data analysis KW - discovery analytics KW - data mining KW - big data KW - scientific computing KW - theory-guided data science KW - climate change ER - TY - JOUR TI - Permission Use Analysis for Vetting Undesirable Behaviors in Android Apps AU - Zhang, Yuan AU - Yang, Min AU - Yang, Zhemin AU - Gu, Guofei AU - Ning, Peng AU - Zang, Binyu T2 - IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY AB - The android platform adopts permissions to protect sensitive resources from untrusted apps. However, after permissions are granted by users at install time, apps could use these permissions (sensitive resources) with no further restrictions. Thus, recent years have witnessed the explosion of undesirable behaviors in Android apps. An important part in the defense is the accurate analysis of Android apps. However, traditional syscall-based analysis techniques are not well-suited for Android, because they could not capture critical interactions between the application and the Android system. This paper presents VetDroid, a dynamic analysis platform for generally analyzing sensitive behaviors in Android apps from a novel permission use perspective. VetDroid proposes a systematic permission use analysis technique to effectively construct permission use behaviors, i.e., how applications use permissions to access (sensitive) system resources, and how these acquired permission-sensitive resources are further utilized by the application. With permission use behaviors, security analysts can easily examine the internal sensitive behaviors of an app. Using real-world Android malware, we show that VetDroid can clearly reconstruct fine-grained malicious behaviors to ease malware analysis. We further apply VetDroid to 1249 top free apps in Google Play. VetDroid can assist in finding more information leaks than TaintDroid, a state-of-the-art technique. In addition, we show how we can use VetDroid to analyze fine-grained causes of information leaks that TaintDroid cannot reveal. Finally, we show that VetDroid can help to identify subtle vulnerabilities in some (top free) applications otherwise hard to detect. DA - 2014/11// PY - 2014/11// DO - 10.1109/tifs.2014.2347206 VL - 9 IS - 11 SP - 1828-1842 SN - 1556-6021 KW - Android security KW - permission use analysis KW - vetting undesirable behaviors KW - android behavior representation ER - TY - BOOK TI - Networking services : QoS, signaling, processes AU - Perros, H. DA - 2014/// PY - 2014/// PB - CreateSpace Independent Publishing Platform SN - 9781495437489 ER - TY - JOUR TI - DIRAQ: scalable in situ data- and resource-aware indexing for optimized query performance AU - Lakshminarasimhan, Sriram AU - Zou, Xiaocheng AU - Boyuka, David A., II AU - Pendse, Saurabh V. AU - Jenkins, John AU - Vishwanath, Venkatram AU - Papka, Michael E. AU - Klasky, Scott AU - Samatova, Nagiza F. T2 - CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS DA - 2014/12// PY - 2014/12// DO - 10.1007/s10586-014-0358-z VL - 17 IS - 4 SP - 1101-1119 SN - 1573-7543 KW - Exascale computing KW - Indexing KW - Query processing KW - Compression ER - TY - JOUR TI - An Open Source Web-Mapping System for Tourism Planning and Marketing AU - Supak, Stacy Kathleen AU - Devine, Hugh Alexander AU - Brothers, Gene Leroy AU - Rich, Samantha Rozier AU - Shen, Wenbo T2 - JOURNAL OF TRAVEL & TOURISM MARKETING AB - Core retail management functions include defining market areas and profiling customers. For tourism enterprises, market areas are geographically dispersed with many customers residing beyond the immediate area surrounding the attraction. Visualization and analysis of these distributed market areas are significantly enhanced by the capabilities of Geographic Information System (GIS) technology and help to support management objectives. Unfortunately, many businesses are unable to utilize GIS due to its complexity and expense. This study develops a decision support tool for tourism planning and marketing that is customized and easy to use, employs open source software to reduce expense, and allows for broad accessibility via web delivery. Users can easily visualize and examine the spatial distribution of their own United States (US) client origins and visitation patterns along with relevant tourism-specific and general demographic information. This functionality can be beneficial in developing or augmenting business plans or marketing strategies, and for informing tourism theory. DA - 2014/10/3/ PY - 2014/10/3/ DO - 10.1080/10548408.2014.890153 VL - 31 IS - 7 SP - 835-853 SN - 1540-7306 KW - Tourism marketing KW - Geographic Information System (GIS) KW - open source KW - web delivery ER - TY - JOUR TI - Spectrum management techniques for elastic optical networks: A survey AU - Talebi, Sahar AU - Alam, Furcian AU - Katib, Lyad AU - Khamis, Mohamed AU - Salama, Reda AU - Rouskas, George N. T2 - OPTICAL SWITCHING AND NETWORKING AB - In recent years, OFDM has been the focus of extensive research efforts in optical transmission and networking, initially as a means to overcome physical impairments in optical communications. However, unlike, say, in wireless LANs or xDSL systems where OFDM is deployed as a transmission technology in a single link, in optical networks it is being considered as the technology underlying the novel elastic network paradigm. Consequently, network-wide spectrum management arises as the key challenge to be addressed in network design and control. In this work, we review and classify a range of spectrum management techniques for elastic optical networks, including offline and online routing and spectrum assignment (RSA), distance-adaptive RSA, fragmentation-aware RSA, traffic grooming, and survivability. DA - 2014/7// PY - 2014/7// DO - 10.1016/j.osn.2014.02.003 VL - 13 SP - 34-48 SN - 1872-9770 KW - Elastic optical networks KW - Spectrum management KW - Routing and spectrum assignment ER - TY - JOUR TI - Lessons on Using Computationally Generated Influence for Shaping Narrative Experiences AU - Roberts, David L. AU - Isbell, Charles L., Jr. T2 - IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES AB - In this paper, we present computational models for generating influence that allow story managers to shape players' decisions in interactive narrative experiences. Our approach uses concepts from social psychology, discourse analysis, and natural language generation. We describe an abstract formalism to operationalize tools of social psychological influence described by Cialdini (Influence: The Psychology of Persuasion, New York, NY, USA: Harper-Collins, 1998) and evaluate two example implementations that enable a storytelling system to generate influence on the fly (with varying degrees of success), thereby adapting stories to realize goals specified by authors. These implementations are used in an interactive story where influence is generated dynamically as players' experiences unfold. We present the results of a user study to characterize the effectiveness of these models. Results did not indicate the presence of any significant differences in players' sense of control over the story with, or without, the use of influence. Further, the use of influence resulted in a set of stories experienced by players that more closely matched the author's goals. DA - 2014/6// PY - 2014/6// DO - 10.1109/tciaig.2013.2287154 VL - 6 IS - 2 SP - 188-202 SN - 1943-0698 KW - Artificial intelligence KW - knowledge-based systems KW - knowledge engineering ER - TY - JOUR TI - Jitter analysis of an MMPP-2 tagged stream in the presence of an MMPP-2 background stream AU - Geleji, G. AU - Perros, H. T2 - APPLIED MATHEMATICAL MODELLING AB - We first consider a single-server queue that serves a tagged MMPP-2 stream and a background MMPP-2 stream in a FIFO manner. The service time is exponentially distributed. For this queueing system, we obtain the CDF of the tagged inter-departure time, from which we can calculate the jitter, defined as a percentile of the inter-departure time. The formulation is exact, but the solution is obtained numerically, which introduces an error that has been found to be negligible. Subsequently, we consider a tandem queueing network consisting of N tandem queues, which is traversed by the MMPP-2 tagged stream, and where each queue also serves a local MMPP-2 background stream. For this queueing network, we obtain an upper bound on the CDF of the inter-departure time from the Nth queue using a heavy traffic approximation, and we verify it by simulation. DA - 2014/7/15/ PY - 2014/7/15/ DO - 10.1016/j.apm.2013.11.055 VL - 38 IS - 14 SP - 3380-3400 SN - 1872-8480 KW - Single queue KW - Tandem queueing network KW - Multi-class KW - Jitter KW - Percentile ER - TY - JOUR TI - Guest Editorial: Computational Narrative and Games AU - Horswill, Ian D. AU - Montfort, Nick AU - Young, R. Michael T2 - IEEE Transactions on Computational Intelligence and AI in Games AB - The eleven articles in this special issue focus on the use of computational modeling in developing the narratives for video programs and online games. Narratives are perceived to be central to cultures, to the ways people communicate, and, many have argued, to cognition itself. The articles in this issue explore these issues and reports on technologies and computer applications that support narrative programming. DA - 2014/6// PY - 2014/6// DO - 10.1109/tciaig.2014.2325879 VL - 6 IS - 2 SP - 93–96 SN - 1943-068X 1943-0698 UR - http://dx.doi.org/10.1109/tciaig.2014.2325879 ER - TY - JOUR TI - Affect and Engagement in Game-Based Learning Environments AU - Sabourin, Jennifer L. AU - Lester, James C. T2 - IEEE TRANSACTIONS ON AFFECTIVE COMPUTING AB - The link between affect and student learning has been the subject of increasing attention in recent years. Affective states such as flow and curiosity tend to have positive correlations with learning while negative states such as boredom and frustration have the opposite effect. Student engagement and motivation have also been shown to be critical in improving learning gains with computer-based learning environments. Consequently, it is a design goal of many computer-based learning environments to encourage positive affect and engagement while students are learning. Game-based learning environments offer significant potential for increasing student engagement and motivation. However, it is unclear how affect and engagement interact with learning in game-based learning environments. This work presents an in-depth analysis of how these phenomena occur in the game-based learning environment, Crystal Island. The findings demonstrate that game-based learning environments can simultaneously support learning and promote positive affect and engagement. DA - 2014/// PY - 2014/// DO - 10.1109/t-affc.2013.27 VL - 5 IS - 1 SP - 45-56 SN - 1949-3045 KW - Games and infotainment KW - human factors ER - TY - JOUR TI - A Supervised Learning Framework for Modeling Director Agent Strategies in Educational Interactive Narrative AU - Lee, Seung Y. AU - Rowe, Jonathan P. AU - Mott, Bradford W. AU - Lester, James C. T2 - IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES AB - Computational models of interactive narrative offer significant potential for creating educational game experiences that are procedurally tailored to individual players and support learning. A key challenge posed by interactive narrative is devising effective director agent models that dynamically sequence story events according to players' actions and needs. In this paper, we describe a supervised machine-learning framework to model director agent strategies in an educational interactive narrative Crystal Island. Findings from two studies with human participants are reported. The first study utilized a Wizard-of-Oz paradigm where human “wizards” directed participants through Crystal Island's mystery storyline by dynamically controlling narrative events in the game environment. Interaction logs yielded training data for machine learning the conditional probabilities of a dynamic Bayesian network (DBN) model of the human wizards' directorial actions. Results indicate that the DBN model achieved significantly higher precision and recall than naive Bayes and bigram model techniques. In the second study, the DBN director agent model was incorporated into the runtime version of Crystal Island, and its impact on students' narrative-centered learning experiences was investigated. Results indicate that machine-learning director agent strategies from human demonstrations yield models that positively shape players' narrative-centered learning and problem-solving experiences. DA - 2014/6// PY - 2014/6// DO - 10.1109/tciaig.2013.2292010 VL - 6 IS - 2 SP - 203-215 SN - 1943-0698 KW - Bayesian networks KW - interactive drama KW - machine learning KW - narrative KW - serious games ER - TY - JOUR TI - A Computational Model of Narrative Generation for Surprise Arousal AU - Bae, Byung-Chull AU - Young, R. Michael T2 - IEEE Transactions on Computational Intelligence and AI in Games AB - This paper describes our effort for a planning-based computational model of narrative generation that is designed to elicit surprise in the reader's mind, making use of two temporal narrative devices: flashback and foreshadowing. In our computational model, flashback provides a backstory to explain what causes a surprising outcome, while foreshadowing gives hints about the surprise before it occurs. Here, we present Prevoyant, a planning-based computational model of surprise arousal in narrative generation, and analyze the effectiveness of Prevoyant. The work here also presents a methodology to evaluate surprise in narrative generation using a planning-based approach based on the cognitive model of surprise causes. The results of the experiments that we conducted show strong support that Prevoyant effectively generates a discourse structure for surprise arousal in narrative. DA - 2014/6// PY - 2014/6// DO - 10.1109/tciaig.2013.2290330 VL - 6 IS - 2 SP - 131-143 J2 - IEEE Trans. Comput. Intell. AI Games OP - SN - 1943-068X 1943-0698 UR - http://dx.doi.org/10.1109/tciaig.2013.2290330 DB - Crossref KW - Artificial intelligence KW - cognitive models KW - interactive narrative KW - surprise generation ER - TY - JOUR TI - The Future of Social Learning in Software Engineering AU - Murphy-Hill, Emerson T2 - COMPUTER AB - Building on time-honored strengths of person-to-person social learning, new technologies can help software developers learn from one another more efficiently and productively. In particular, continuous social screencasting is a promising technique for sharing and learning about new software development tools. DA - 2014/1// PY - 2014/1// DO - 10.1109/mc.2013.406 VL - 47 IS - 1 SP - 48-54 SN - 1558-0814 KW - Software KW - Blogs KW - Communities KW - Servers KW - Computers KW - Companies KW - software engineering KW - social screencasting KW - social learning KW - tool discovery ER - TY - JOUR TI - TaintDroid: An Information Flow Tracking System for Real-Time Privacy Monitoring on Smartphones AU - Enck, William AU - Gilbert, Peter AU - Chun, Byung-Gon AU - Cox, Landon P. AU - Jung, Jaeyeon AU - McDaniel, Patrick AU - Sheth, Anmol N. T2 - COMMUNICATIONS OF THE ACM AB - Today's smartphone operating systems frequently fail to provide users with adequate control over and visibility into how third-party applications use their privacy-sensitive data. We address these shortcomings with TaintDroid, an efficient, systemwide dynamic taint tracking and analysis system capable of simultaneously tracking multiple sources of sensitive data. TaintDroid provides real-time analysis by leveraging Android's virtualized execution environment. Using TaintDroid to monitor the behavior of 30 popular third-party Android applications, we found 68 instances of misappropriation of users' location and device identification information across 20 applications. Monitoring sensitive data with TaintDroid provides informed use of third-party applications for phone users and valuable input for smartphone security service firms seeking to identify misbehaving applications. DA - 2014/3// PY - 2014/3// DO - 10.1145/2494522 VL - 57 IS - 3 SP - 99-106 SN - 1557-7317 ER - TY - JOUR TI - Designing game-based learning environments for elementary science education: A narrative-centered learning perspective AU - Lester, James C. AU - Spires, Hiller A. AU - Nietfeld, John L. AU - Minogue, James AU - Mott, Bradford W. AU - Lobene, Eleni V. T2 - INFORMATION SCIENCES AB - Game-based learning environments hold significant promise for STEM education, yet they are enormously complex. Crystal Island: Uncharted Discovery, is a game-based learning environment designed for upper elementary science education that has been under development in our laboratory for the past four years. This article discusses curricular and narrative interaction design requirements, presents the design of the Crystal Island learning environment, and describes its evolution through a series of pilots and field tests. Additionally, a classroom integration study was conducted to initiate a shift towards ecological validity. Results indicated that Crystal Island produced significant learning gains on both science content and problem-solving measures. Importantly, gains were consistent for gender across studies. This finding is key in light of past studies that revealed disproportionate participation by boys within game-based learning environments. DA - 2014/4/20/ PY - 2014/4/20/ DO - 10.1016/j.ins.2013.09.005 VL - 264 SP - 4-18 SN - 1872-6291 KW - Serious games KW - Game-based learning KW - Narrative-centered learning KW - Science education ER - TY - JOUR TI - Data-Centric OS Kernel Malware Characterization AU - Rhee, Junghwan AU - Riley, Ryan AU - Lin, Zhiqiang AU - Jiang, Xuxian AU - Xu, Dongyan T2 - IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY AB - Traditional malware detection and analysis approaches have been focusing on code-centric aspects of malicious programs, such as detection of the injection of malicious code or matching malicious code sequences. However, modern malware has been employing advanced strategies, such as reusing legitimate code or obfuscating malware code to circumvent the detection. As a new perspective to complement code-centric approaches, we propose a data-centric OS kernel malware characterization architecture that detects and characterizes malware attacks based on the properties of data objects manipulated during the attacks. This framework consists of two system components with novel features: First, a runtime kernel object mapping system which has an un-tampered view of kernel data objects resistant to manipulation by malware. This view is effective at detecting a class of malware that hides dynamic data objects. Second, this framework consists of a new kernel malware detection approach that generates malware signatures based on the data access patterns specific to malware attacks. This approach has an extended coverage that detects not only the malware with the signatures, but also the malware variants that share the attack patterns by modeling the low level data access behaviors as signatures. Our experiments against a variety of real-world kernel rootkits demonstrate the effectiveness of data-centric malware signatures. DA - 2014/1// PY - 2014/1// DO - 10.1109/tifs.2013.2291964 VL - 9 IS - 1 SP - 72-87 SN - 1556-6021 KW - OS kernel malware characterization KW - data-centric malware analysis KW - virtual machine monitor ER - TY - JOUR TI - Catch Me If You Can: Evaluating Android Anti-Malware Against Transformation Attacks AU - Rastogi, Vaibhav AU - Chen, Yan AU - Jiang, Xuxian T2 - IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY AB - Mobile malware threats (e.g., on Android) have recently become a real concern. In this paper, we evaluate the state-of-the-art commercial mobile anti-malware products for Android and test how resistant they are against various common obfuscation techniques (even with known malware). Such an evaluation is important for not only measuring the available defense against mobile malware threats, but also proposing effective, next-generation solutions. We developed DroidChameleon, a systematic framework with various transformation techniques, and used it for our study. Our results on 10 popular commercial anti-malware applications for Android are worrisome: none of these tools is resistant against common malware transformation techniques. In addition, a majority of them can be trivially defeated by applying slight transformation over known malware with little effort for malware authors. Finally, in light of our results, we propose possible remedies for improving the current state of malware detection on mobile devices. DA - 2014/1// PY - 2014/1// DO - 10.1109/tifs.2013.2290431 VL - 9 IS - 1 SP - 99-108 SN - 1556-6021 KW - Mobile KW - malware KW - anti-malware KW - Android ER - TY - JOUR TI - Visualizing likelihood density functions via optimal region projection AU - Canary, Hal AU - Taylor, Russell M., II AU - Quammen, Cory AU - Pratt, Scott AU - Gomez, Facundo A. AU - O'Shea, Brian AU - Healey, Christopher G. T2 - COMPUTERS & GRAPHICS-UK AB - Abstract Effective visualization of high-likelihood regions of parameter space is severely hampered by the large number of parameter dimensions that many models have. We present a novel technique, Optimal Percentile Region Projection, to visualize a high-dimensional likelihood density function that enables the viewer to understand the shape of the high-likelihood region. Optimal Percentile Region Projection has three novel components: first, we select the region of high likelihood in the high-dimensional space before projecting its shadow into a lower-dimensional projected space. Second, we analyze features on the surface of the region in the projected space to select the projection direction that shows the most interesting parameter dependencies. Finally, we use a three-dimensional projection space to show features that are not salient in only two dimensions. The viewer can also choose sets of axes to project along to explore subsets of the parameter space, using either the original parameter axes or principal-component axes. The technique was evaluated by our domain-science collaborators, who found it to be superior to their existing workflow both when there were interesting dependencies between parameters and when there were not. DA - 2014/6// PY - 2014/6// DO - 10.1016/j.cag.2014.02.005 VL - 41 SP - 62-71 SN - 1873-7684 KW - Uncertainty KW - Parameter space analysis KW - Visualization KW - Likelihood density function ER - TY - JOUR TI - Visualizations of coastal terrain time series AU - Tateosian, Laura AU - Mitasova, Helena AU - Thakur, Sidharth AU - Hardin, Eric AU - Russ, Emily AU - Blundell, Bruce T2 - INFORMATION VISUALIZATION AB - In coastal regions, water, wind, gravitation, vegetation, and human activity continuously alter landscape surfaces. Visualizations are important for understanding coastal landscape evolution and its driving processes. Visualizing change in highly dynamic coastal terrain poses a formidable challenge; the combination of natural and anthropogenic forces leads to cycles of retreat and recovery and complex morphology of landforms. In recent years, repeated high-resolution laser terrain scans have generated a time series of point cloud data that represent landscapes at snapshots in time, including the impacts of major storms. In this article, we build on existing approaches for visualizing spatial–temporal data to create a collection of perceptual visualizations to support coastal terrain evolution analysis. We extract terrain features and track their migration; we derive temporal summary maps and heat graphs that quantify the pattern of elevation change and sediment redistribution and use the space–time cube concept to create visualizations of terrain evolution. The space–time cube approach allows us to represent shoreline evolution as an isosurface extracted from a voxel model created by stacking time series of digital elevation models. We illustrate our approach on a series of Light Detection and Ranging surveys of sandy North Carolina barrier islands. Our results reveal terrain changes of shoreline and dune ridge migration, dune breaches and overwash, the formation of new dune ridges, and the construction and destruction of homes, changes which are due to erosion and accretion, hurricanes, and human activities. These events are all visualized within their geographic and temporal contexts. DA - 2014/7// PY - 2014/7// DO - 10.1177/1473871613487086 VL - 13 IS - 3 SP - 266-282 SN - 1473-8724 KW - Visualization of time series KW - temporal visualization KW - geovisualization KW - visual perception KW - visual exploration KW - visualize changes KW - geospatial data KW - three-dimensional visualization KW - spatial data KW - visual exploration KW - space-time cube KW - geographic information systems KW - LiDAR KW - time series KW - terrain elevation KW - land surfaces KW - GIS GRASS ER - TY - JOUR TI - Towards the prioritization of system test cases AU - Srikanth, Hema AU - Banerjee, Sean AU - Williams, Laurie AU - Osborne, Jason T2 - SOFTWARE TESTING VERIFICATION & RELIABILITY AB - SUMMARY During software development, companies are frequently faced with lack of time and resources, which limits their ability to effectively complete testing efforts. This paper presents a system‐level, value‐driven approach to test case prioritization called the Prioritization of Requirements for Test (PORT). PORT involves analysing and assigning value to each requirement using the following four factors: requirements volatility, customer priority, implementation complexity, and fault proneness. System test cases are prioritized such that the test cases for requirements with higher priority are executed earlier during system test. PORT was applied to four student team projects as well as an industrial case study. The results show that PORT improves the rate of detection of severe failures over random prioritization. Additionally, the results indicate that customer priority was the most important contributor towards improved rate of failure detection. Copyright © 2013 John Wiley & Sons, Ltd. DA - 2014/6// PY - 2014/6// DO - 10.1002/stvr.1500 VL - 24 IS - 4 SP - 320-337 SN - 1099-1689 KW - software testing and reliability KW - software quality KW - software quality KW - system-level testing ER - TY - JOUR TI - Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds AU - Du, Juan AU - Dean, Daniel J. AU - Tan, Yongmin AU - Gu, Xiaohui AU - Yu, Ting T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS AB - Software-as-a-service (SaaS) cloud systems enable application service providers to deliver their applications via massive cloud computing infrastructures. However, due to their sharing nature, SaaS clouds are vulnerable to malicious attacks. In this paper, we present IntTest, a scalable and effective service integrity attestation framework for SaaS clouds. IntTest provides a novel integrated attestation graph analysis scheme that can provide stronger attacker pinpointing power than previous schemes. Moreover, IntTest can automatically enhance result quality by replacing bad results produced by malicious attackers with good results produced by benign service providers. We have implemented a prototype of the IntTest system and tested it on a production cloud computing infrastructure using IBM System S stream processing applications. Our experimental results show that IntTest can achieve higher attacker pinpointing accuracy than existing approaches. IntTest does not require any special hardware or secure kernel support and imposes little performance impact to the application, which makes it practical for large-scale cloud systems. DA - 2014/3// PY - 2014/3// DO - 10.1109/tpds.2013.62 VL - 25 IS - 3 SP - 730-739 SN - 1558-2183 KW - Distributed service integrity attestation KW - cloud computing KW - secure distributed data processing ER - TY - JOUR TI - Persistent Homology of Delay Embeddings and its Application to Wheeze Detection AU - Emrani, Saba AU - Gentimis, Thanos AU - Krim, Hamid T2 - IEEE SIGNAL PROCESSING LETTERS AB - We propose a new approach to detect and quantify the periodic structure of dynamical systems using topological methods. We propose to use delay-coordinate embedding as a tool to detect the presence of harmonic structures by using persistent homology for robust analysis of point clouds of delay-coordinate embeddings. To discover the proper delay, we propose an autocorrelation like (ACL) function of the signals, and apply the introduced topological approach to analyze breathing sound signals for wheeze detection. Experiments have been carried out to substantiate the capabilities of the proposed method. DA - 2014/4// PY - 2014/4// DO - 10.1109/lsp.2014.2305700 VL - 21 IS - 4 SP - 459-463 SN - 1558-2361 KW - Algebraic topology algorithms KW - audio analysis KW - biomedical signal processing KW - topological signal analysis ER - TY - JOUR TI - Hello ADIOS: the challenges and lessons of developing leadership class I/O frameworks AU - Liu, Qing AU - Logan, Jeremy AU - Tian, Yuan AU - Abbasi, Hasan AU - Podhorszki, Norbert AU - Choi, Jong Youl AU - Klasky, Scott AU - Tchoua, Roselyne AU - Lofstead, Jay AU - Oldfield, Ron AU - Parashar, Manish AU - Samatova, Nagiza AU - Schwan, Karsten AU - Shoshani, Arie AU - Wolf, Matthew AU - Wu, Kesheng AU - Yu, Weikuan T2 - CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE AB - Applications running on leadership platforms are more and more bottlenecked by storage input/output (I/O). In an effort to combat the increasing disparity between I/O throughput and compute capability, we created Adaptable IO System (ADIOS) in 2005. Focusing on putting users first with a service oriented architecture, we combined cutting edge research into new I/O techniques with a design effort to create near optimal I/O methods. As a result, ADIOS provides the highest level of synchronous I/O performance for a number of mission critical applications at various Department of Energy Leadership Computing Facilities. Meanwhile ADIOS is leading the push for next generation techniques including staging and data processing pipelines. In this paper, we describe the startling observations we have made in the last half decade of I/O research and development, and elaborate the lessons we have learned along this journey. We also detail some of the challenges that remain as we look toward the coming Exascale era. Copyright © 2013 John Wiley & Sons, Ltd. DA - 2014/5// PY - 2014/5// DO - 10.1002/cpe.3125 VL - 26 IS - 7 SP - 1453-1473 SN - 1532-0634 KW - high performance computing KW - high performance I KW - O KW - I KW - O middleware ER - TY - JOUR TI - Degree-of-Knowledge: Modeling a Developer's Knowledge of Code AU - Fritz, Thomas AU - Murphy, Gail C. AU - Murphy-Hill, Emerson AU - Ou, Jingwen AU - Hill, Emily T2 - ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY AB - As a software system evolves, the system's codebase constantly changes, making it difficult for developers to answer such questions as who is knowledgeable about particular parts of the code or who needs to know about changes made. In this article, we show that an externalized model of a developer's individual knowledge of code can make it easier for developers to answer such questions. We introduce a degree-of-knowledge model that computes automatically, for each source-code element in a codebase, a real value that represents a developer's knowledge of that element based on a developer's authorship and interaction data. We present evidence that shows that both authorship and interaction data of the code are important in characterizing a developer's knowledge of code. We report on the usage of our model in case studies on expert finding, knowledge transfer, and identifying changes of interest. We show that our model improves upon an existing expertise-finding approach and can accurately identify changes for which a developer should likely be aware. We discuss how our model may provide a starting point for knowledge transfer but that more refinement is needed. Finally, we discuss the robustness of the model across multiple development sites. DA - 2014/3// PY - 2014/3// DO - 10.1145/2512207 VL - 23 IS - 2 SP - SN - 1557-7392 KW - Human Factors KW - Authorship KW - degree-of-interest KW - degree-of-knowledge KW - expertise KW - onboarding KW - recommendation KW - development environment ER - TY - JOUR TI - The Development of the STEM Career Interest Survey (STEM-CIS) AU - Kier, Meredith W. AU - Blanchard, Margaret R. AU - Osborne, Jason W. AU - Albert, Jennifer L. T2 - RESEARCH IN SCIENCE EDUCATION DA - 2014/6// PY - 2014/6// DO - 10.1007/s11165-013-9389-3 VL - 44 IS - 3 SP - 461-481 SN - 1573-1898 KW - STEM interest KW - Instrument KW - Survey KW - Social cognitive career theory KW - STEM careers KW - Confirmatory factor analysis ER - TY - JOUR TI - Jitter analysis of an IPP tagged traffic stream in an {IPP,M}/M/1 queue AU - Geleji, Geza AU - Perros, Harry T2 - ANNALS OF TELECOMMUNICATIONS DA - 2014/6// PY - 2014/6// DO - 10.1007/s12243-013-0362-y VL - 69 IS - 5-6 SP - 283-294 SN - 1958-9395 KW - Queueing KW - Multi-class KW - Jitter KW - Percentile ER - TY - JOUR TI - Engineering Service Engagements via Commitments AU - Telang, Pankaj R. AU - Kalia, Anup K. AU - Singh, Munindar P. T2 - IEEE INTERNET COMPUTING AB - A service engagement describes how two or more independent parties interact with each other. Traditional approaches specify these interactions as message sequence charts (MSCs), hiding underlying business relationships and, consequently, complicating modification. Comma is a commitment-based approach that produces a business model drawn from an extensible pattern library and yields flexible MSCs. An empirical study shows that models produced via Comma yield superior flexibility, are comprehensible to others, and take less time and effort to produce. The Web extra presents the claims regarding Comma's effectiveness as a set of alternative hypotheses, as well as the complete list of MSCs developed via both traditional and Comma approaches. DA - 2014/// PY - 2014/// DO - 10.1109/mic.2013.86 VL - 18 IS - 3 SP - 46-54 SN - 1941-0131 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84901307448&partnerID=MN8TOARS ER - TY - JOUR TI - Distributed Localization of Coverage Holes Using Topological Persistence AU - Chintakunta, Harish AU - Krim, Hamid T2 - IEEE TRANSACTIONS ON SIGNAL PROCESSING AB - We develop distributed algorithms to detect and localize coverage holes in sensor networks. We neither assume coordinate information of the nodes, neither any distances between the nodes. We use algebraic topological methods to define a coverage hole, and develop provably correct algorithm to detect a hole. We then partition the network into smaller subnetworks, while ensuring that the holes are preserved, and checking for holes in each. We show that repeating this process leads to localizing the coverage holes. We demonstrate the improved complexity of our algorithm using simulations. DA - 2014/5// PY - 2014/5// DO - 10.1109/tsp.2014.2314063 VL - 62 IS - 10 SP - 2531-2541 SN - 1941-0476 KW - Algebraic topology KW - distributed algorithms KW - graph theory KW - sensor networks ER - TY - JOUR TI - Combined-Semantics Equivalence and Minimization of Conjunctive Queries AU - Chirkova, Rada T2 - COMPUTER JOURNAL DA - 2014/5// PY - 2014/5// DO - 10.1093/comjnl/bxt032 VL - 57 IS - 5 SP - 775-795 SN - 1460-2067 KW - combined semantics for query processing KW - query minimization KW - query equivalence ER - TY - JOUR TI - Multipoint Control Protocol With Look-Ahead for Wavelength Division Multiplexed Ethernet Passive Optical Network AU - Liu, Xiaomin AU - Rouskas, George N. AU - He, Feng AU - Xiong, Huagang T2 - JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING AB - We present a simple yet effective enhancement to the operation of the Ethernet passive optical network (EPON) multipoint control protocol (MPCP) for wavelength division multiplexing (WDM) EPON. The enhancement, inspired by our earlier work in a related but different context, allows the optical line terminal (OLT) to perform look-ahead scheduling on each of the upstream channels. The look-ahead operation is fully compatible with the existing standard and may be implemented via software updates to the OLT without affecting the operation of optical network units in EPON. The look-ahead enhanced MPCP achieves significant performance gains across a wide range of traffic loads and opens up new opportunities for the design of sophisticated dynamic bandwidth algorithms to support advanced quality of service capabilities. DA - 2014/2/1/ PY - 2014/2/1/ DO - 10.1364/jocn.6.000104 VL - 6 IS - 2 SP - 104-113 SN - 1943-0639 KW - Look-ahead operation KW - Multipoint control protocol KW - Passive optical network ER - TY - JOUR TI - Licit: Administering Usage Licenses in Federated Environments AU - Kediyal, Prashant C. AU - Singh, Munindar P. T2 - IEEE TRANSACTIONS ON SERVICES COMPUTING AB - We address the problem of usage license administration in federated settings. This problem arises whenever organizations, such as educational or research groups or institutions, share resources for business and scientific reasons. In such settings, each user's usage of a licensed resource is typically supported by the user's organization. License administration involves satisfying legal requirements while applying organizational strategies for effective resource usage, and carrying out suitable accounting and audit controls. We propose an approach, Licit, wherein an agent represents each resource sharing site and administers licenses in collaboration with other agents. We show how to represent a variety of usage licenses formally as executable policies and provide a simple information model using which each party can specify both the attributes involved in its licenses and how to resolve them. Our architecture naturally accommodates a variety of site-specific (i.e., custom) strategies for license administration. Licit has been implemented in a popular open source framework for virtual computing, and yields performance results indicating its practical feasibility. DA - 2014/// PY - 2014/// DO - 10.1109/tsc.2013.1 VL - 7 IS - 1 SP - 96-108 SN - 1939-1374 UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894485743&partnerID=MN8TOARS KW - IT administration KW - grid computing KW - cloud computing KW - usage licenses KW - XACML ER - TY - JOUR TI - ExMin: A routing metric for novel opportunity gain in Delay Tolerant Networks AU - Jeong, Jaeseong AU - Lee, Kyunghan AU - Yi, Yung AU - Rhee, Injong AU - Chong, Song T2 - COMPUTER NETWORKS AB - Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes' probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes' intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet. DA - 2014/2/11/ PY - 2014/2/11/ DO - 10.1016/j.bjp.2013.11.006 VL - 59 SP - 184-196 SN - 1872-7069 KW - Delay Tolerant Networks KW - Opportunistic forwarding KW - Routing ER - TY - JOUR TI - Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain AU - Pei, J. AU - Liu, X. B. AU - Pardalos, P. M. AU - Fan, W. J. AU - Yang, S. L. AU - Wang, L. T2 - International Journal of Advanced Manufacturing Technology DA - 2014/// PY - 2014/// VL - 70 IS - 1-4 SP - 335-348 ER -