TY - CONF
TI - MAST: triage for market-scale mobile malware analysis
AU - Chakradeo, Saurabh
AU - Reaves, Bradley
AU - Traynor, Patrick
AU - Enck, William
T2 - ACM
C2 - 2013///
C3 - Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
DA - 2013///
SP - 13-24
ER -
TY - CONF
TI - WHYPER: towards automating risk assessment of mobile applications
AU - Pandita, Rahul
AU - Xiao, Xusheng
AU - Yang, Wei
AU - Enck, William
AU - Xie, Tao
C2 - 2013///
C3 - Proceedings of the 22nd USENIX Security Symposium, Washington DC, USA
DA - 2013///
SP - 14-16
ER -
TY - CONF
TI - Preventing accidental data disclosure in modern operating systems
AU - Nadkarni, Adwait
AU - Enck, William
T2 - ACM
C2 - 2013///
C3 - Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
DA - 2013///
SP - 1029-1042
ER -
TY - CHAP
TI - Automatic Security Analysis of Android Applications
AU - Rastogi, Vaibhav
AU - Chen, Yan
AU - Enck, William
T2 - Android Security and Mobile Cloud Computing
PY - 2013///
PB - Springer
ER -
TY - CONF
TI - AppsPlayground: automatic security analysis of smartphone applications
AU - Rastogi, Vaibhav
AU - Chen, Yan
AU - Enck, William
T2 - ACM
C2 - 2013///
C3 - Proceedings of the third ACM conference on Data and application security and privacy
DA - 2013///
SP - 209-220
ER -
TY - CONF
TI - A comparative evaluation of static analysis actionable alert identification techniques
AU - Heckman, Sarah
AU - Williams, Laurie
C2 - 2013///
C3 - Proceedings of the 9th International Conference on Predictive Models in Software Engineering
DA - 2013///
SP - 1-10
ER -
TY - CONF
TI - Joint Meeting of the European Software Engineering Conference and
the ACM SIGSOFT Symposium on the Foundations of Software Engineering,
ESEC/FSE'13, Saint Petersburg, Russian Federation, August 18-26, 2013
A2 - Meyer, Bertrand
A2 - Baresi, Luciano
A2 - Mezini, Mira
C2 - 2013///
DA - 2013///
PB - ACM
UR - http://dl.acm.org/citation.cfm?id=2491411
ER -
TY - CONF
TI - SPLat: lightweight dynamic analysis for reducing combinatorics in
testing configurable systems
AB - Many programs can be configured through dynamic and/or static selection of configuration variables. A software product line (SPL), for example, specifies a family of programs where each program is defined by a unique combination of features. Systematically testing SPL programs is expensive as it can require running each test against a combinatorial number of configurations. Fortunately, a test is often independent of many configuration variables and need not be run against every combination. Configurations that are not required for a test can be pruned from execution. This paper presents SPLat, a new way to dynamically prune irrelevant configurations: the configurations to run for a test can be determined during test execution by monitoring accesses to configuration variables. SPLat achieves an optimal reduction in the number of configurations and is lightweight compared to prior work that used static analysis and heavyweight dynamic execution. Experimental results on 10 SPLs written in Java show that SPLat substantially reduces the total test execution time in many cases. Moreover, we demonstrate the scalability of SPLat by applying it to a large industrial code base written in Ruby on Rails.
C2 - 2013///
C3 - Joint Meeting of the European Software Engineering Conference and
the ACM SIGSOFT Symposium on the Foundations of Software Engineering,
ESEC/FSE'13, Saint Petersburg, Russian Federation, August 18-26, 2013
DA - 2013///
DO - 10.1145/2491411.2491459
SP - 257-267
UR - http://doi.acm.org/10.1145/2491411.2491459
ER -
TY - CONF
TI - Entropy-based test generation for improved fault localization
AU - Campos, José
AU - Abreu, Rui
AU - Fraser, Gordon
AU - d’Amorim, Marcelo
AB - Spectrum-based Bayesian reasoning can effectively rank candidate fault locations based on passing/failing test cases, but the diagnostic quality highly depends on the size and diversity of the underlying test suite. As test suites in practice often do not exhibit the necessary properties, we present a technique to extend existing test suites with new test cases that optimize the diagnostic quality. We apply probability theory concepts to guide test case generation using entropy, such that the amount of uncertainty in the diagnostic ranking is minimized. Our ENTBUG prototype extends the search-based test generation tool EVOSUITE to use entropy in the fitness function of its underlying genetic algorithm, and we applied it to seven real faults. Empirical results show that our approach reduces the entropy of the diagnostic ranking by 49% on average (compared to using the original test suite), leading to a 91% average reduction of diagnosis candidates needed to inspect to find the true faulty one.
C2 - 2013///
C3 - 2013 28th IEEE/ACM International Conference on Automated Software
Engineering, ASE 2013, Silicon Valley, CA, USA, November 11-15,
2013
DA - 2013///
DO - 10.1109/ASE.2013.6693085
SP - 257-267
UR - https://doi.org/10.1109/ASE.2013.6693085
ER -
TY - CONF
TI - 2013 28th IEEE/ACM International Conference on Automated Software
Engineering, ASE 2013, Silicon Valley, CA, USA, November 11-15,
2013
A2 - Denney, Ewen
A2 - Bultan, Tevfik
A2 - Zeller, Andreas
C2 - 2013///
DA - 2013///
PB - IEEE
UR - http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6684409
ER -
TY - CONF
TI - Scheduling mixed-criticality workloads upon unreliable processors
AU - French, Alexandra
AU - Guo, Zhishan
AU - Baruah, Sanjoy
T2 - 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)
C2 - 2013/6//
C3 - The 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)
CY - Pont a Mousson, France
DA - 2013/6//
PY - 2013/6//
ER -
TY -
ER -
TY -
ER -
TY -
ER -
TY -
ER -
TY -
ER -
TY -
ER -
TY - CONF
TI - Parallel algorithms for graph optimization using tree decompositions
AU - Sullivan, B.D.
AU - Weerapurage, D.
AU - Groer, C.
AB - Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.
C2 - 2013///
C3 - Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
DA - 2013///
DO - 10.1109/IPDPSW.2013.242
SP - 1838-1847
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899764118&partnerID=MN8TOARS
ER -
TY - JOUR
TI - On a conjecture of Andrica and Tomescu
AU - Sullivan, B.D.
T2 - Journal of Integer Sequences
DA - 2013///
PY - 2013///
VL - 16
IS - 3
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS
ER -
TY - CONF
TI - Tree-Like Structure in Large Social and Information Networks
AU - Adcock, Aaron B.
AU - Sullivan, Blair D.
AU - Mahoney, Michael W.
AB - Although large social and information networks are often thought of as having hierarchical or tree-like structure, this assumption is rarely tested. We have performed a detailed empirical analysis of the tree-like properties of realistic informatics graphs using two very different notions of tree-likeness: Gromov's d-hyperbolicity, which is a notion from geometric group theory that measures how tree-like a graph is in terms of its metric structure, and tree decompositions, tools from structural graph theory which measure how tree-like a graph is in terms of its cut structure. Although realistic informatics graphs often do not have meaningful tree-like structure when viewed with respect to the simplest and most popular metrics, e.g., the value of d or the tree width, we conclude that many such graphs do have meaningful tree-like structure when viewed with respect to more refined metrics, e.g., a size-resolved notion of d or a closer analysis of the tree decompositions. We also show that, although these two rigorous notions of tree-likeness capture very different tree-like structures in worst-case, for realistic informatics graphs they empirically identify surprisingly similar structure. We interpret this tree-like structure in terms of the recently-characterized "nested core-periphery" property of large informatics graphs, and we show that the fast and scalable k-core heuristic can be used to identify this tree-like structure.
C2 - 2013/12//
C3 - 2013 IEEE 13th International Conference on Data Mining
DA - 2013/12//
DO - 10.1109/icdm.2013.77
SP - 1-10
PB - IEEE
UR - http://dx.doi.org/10.1109/icdm.2013.77
ER -
TY - CONF
TI - User modelling and adaptive, natural interaction for conflict resolution
AU - Karpouzis, K.
AU - Yannakakis, G.
AU - Paiva, A.
AU - Nielsen, J.H.
AU - Vasalou, A.
AU - Jhala, A.
AB - Modern school environments are usually populated with children from diverse ethnic, cultural and social backgrounds, bringing in different social norms and skills, diverse behaviours and often contradicting cooperation strategies. As a result, conflicts are inevitable and should be resolved as quickly and painlessly as possible, making sure that school life and the learning process continue as intended. The Siren serious game aims to educate 10-14 year old students on conflict management and resolution, presenting them with user- and culture-adaptive mini game scenarios, based on popular game genres and taking into account their affective expressivity and in-game behaviour to adjust the intensity of the conflict to better suit their needs and competencies.
C2 - 2013///
C3 - Proceedings - 2013 Humaine Association Conference on Affective Computing and Intelligent Interaction, ACII 2013
DA - 2013///
DO - 10.1109/ACII.2013.131
SP - 719-721
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84893286100&partnerID=MN8TOARS
KW - serious games
KW - conflict resolution
KW - user modelling
KW - cross-cultural user studies
KW - affective interaction
KW - adaptation
ER -
TY - CONF
TI - Synthetic photographs for learning aesthetic preferences
AU - Morgens, S.-M.
AU - Jhala, A.
C2 - 2013///
C3 - AAAI Workshop - Technical Report
DA - 2013///
VL - WS-13-17
SP - 83-85
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84898902152&partnerID=MN8TOARS
ER -
TY - CONF
TI - Inferring performer skill from aesthetic quality features in a dance game gesture corpus
AU - Maraffi, C.
AU - Ishikawa, S.
AU - Jhala, A.
C2 - 2013///
C3 - AAAI Workshop - Technical Report
DA - 2013///
VL - WS-13-19
SP - 17-24
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84898846949&partnerID=MN8TOARS
ER -
TY - JOUR
TI - The eighth AAAI conference on artificial intelligence and interactive digital entertainment
AU - Riedl, M.
AU - Sukthankar, G.
AU - Jhala, A.
AU - Zhu, J.
AU - Ontanón, S.
AU - Buro, M.
AU - Churchill, D.
T2 - AI Magazine
DA - 2013///
PY - 2013///
VL - 34
IS - 1
SP - 87-89
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84876194291&partnerID=MN8TOARS
ER -
TY - CONF
TI - AI authoring for virtual characters in conflict
AU - Gomes, P.
AU - Jhala, A.
C2 - 2013///
C3 - Proceedings of the 9th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2013
DA - 2013///
SP - 135-141
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84916941876&partnerID=MN8TOARS
ER -
TY - CONF
TI - Reinforcement learning for spatial reasoning in strategy games
AU - Leece, M.
AU - Jhala, A.
C2 - 2013///
C3 - Proceedings of the 9th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2013
DA - 2013///
SP - 156-162
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84916931832&partnerID=MN8TOARS
ER -
TY - CONF
TI - Teaching strategies when students have access to solution manuals
C2 - 2013///
C3 - Proceedings of the ASEE 2013 Annual Conference and Exposition
DA - 2013///
ER -
TY - CHAP
TI - Factorization of multivariate polynomials
AU - Kaltofen, Erich
AU - Lecerf, Grégoire
T2 - Handbook of Finite Fields
A2 - Mullen, Gary L.
A2 - Panario, Daniel
PY - 2013///
SP - 382–392
PB - CRC Press, Taylor & Francis Group
ER -
TY - CONF
TI - Evaluation of the Exertion and Motivation Factors of a Virtual Reality Exercise Game for Children with Autism
AU - Finkelstein, Samantha
AU - Barnes, Tiffany
AU - Wartell, Zachary
AU - Suma, Evan
T2 - 2013 1st Workshop on Virtual and Augmented Assistive Technology (VAAT)
AB - Children with autism experience significant positive behavioral and health benefits from exercise, though many of these children tend to lead sedentary lifestyles. Video games that incorporate physical activity, known as exergames, may help to motivate such children to engage in vigorous exercise, thus leading to more healthy lifestyles and reducing the likelihood of obesity. In this paper, we present a study of physical activity and motivation level for ten children with autism as they played an immersive virtual reality exergame that involved fast-paced full-body movement. Our results showed that most children, including non-verbal participants, were able to achieve vigorous activity levels, with several of them maintaining very high levels of exertion. Furthermore, the children reported high levels of enjoyment and indicated they would exercise more often if such games were routinely available. These encouraging findings suggest that exergames are a promising way to empower the families of children with autism with tools to help improve their child's health and quality of life.
C2 - 2013///
C3 - 2013 1st Workshop on Virtual and Augmented Assistive Technology (VAAT)
CY - Lake Buena Vista, Florida, USA
DA - 2013///
PY - 2013/3/17/
DO - 10.1109/VAAT.2013.6786186
PB - IEEE
ER -
TY - CONF
TI - Exploring Player Behavior with Visual Analytics.
AU - Eagle, Michael
AU - Johnson, Matthew
AU - Barnes, Tiffany
AU - Boyce, Acey
T2 - 8th ACM Foundations of Digital Games
C2 - 2013///
C3 - 8th ACM Foundations of Digital Games
DA - 2013///
PY - 2013///
SP - 380–383
ER -
TY - CONF
TI - Effective Practices in Game Tutorial Systems
AU - Shannon, Amy
AU - Boyce, Acey
AU - Gadwal, Chitra
AU - Barnes, Tiffany
T2 - 8th ACM Foundations of Digital Games
C2 - 2013///
C3 - 8th ACM Foundations of Digital Games
DA - 2013///
PY - 2013///
SP - 338–345
ER -
TY - CONF
TI - Building Technology Fluency: Fostering Agents of Change
AU - Eugene, Wanda
AU - Daily, Shaundra
AU - Burns, Richard
AU - Barnes, Tiffany
T2 - 120th ASEE Conference (ASEE 2013)
AB - Abstract Building Technology Fluency: Fostering Agents of Change Technological fluency, the ability to create and express through technology, rather than technicalfamiliarity, is becoming increasingly necessary to be a functioning member of our global society.In this paper we present the experiences of two interventions, one in the Birmingham, Alabama,and another in the Republic of Haiti, where technology fluency learning is driven by communityengagement and revitalization. In both locations, students’ solutions to important community-based problems such in healthcare, accessible water, and personal finances, were expressed usingtechnology. More specifically, Scratch, a visual-based programming language designed at theMIT Media Lab, was used in both interventions where students demonstrated their interactivepresentations, campaigns, and business ideas.During the summer of 2008 students in Birmingham, Alabama between the ages of 7 and 11worked with community health educators, teachers, and camp facilitators to learn aboutimportant healthcare topics such as obesity, diabetes, and drug abuse. After a brief introductionto the topics and structured lessons in Scratch, students selected a topic of interest, conductedresearch through various on and offline sources, and created educational campaigns for their owncommunities about the topic. During the following summer, students, also from the Birminghamcommunity, conducted research in a local business district. Then, after conceptualizing an ideafor a business, the students interacted with community leaders, venture capitalists, and businessowners to assess the feasibility of their idea and understand how it might be received in thecommunity. Their lessons learned were built into animated Scratch projects.In Spring 2012, students and faculty from the STARS Alliance visited the Republic of Haiti andworked with 24 young women mentors (ages 18-32) to develop their technology fluency. Thesementors taught computer classes after-school, on XO laptops to children in grades 3-5 (ages 8-15) about 6 hours per week at three northern rural schools. The mentors lead the children tocreate animations, but the learning had little connection to their schoolwork or daily lives.Through the STARS outreach project, mentors were taught to begin to think about how thecomputer classes could be integrated to help serve greater community needs. The mentorsbrainstormed on community problems, such as energy, schooling, water, food, and healthcare,and then worked together to create Scratch stories to better illustrate these problems to oneanother and to people outside their communities. The hope was for the mentors to integratetechnology into their explanations of and solutions to the challenges associated with, solvingcommunity problems. The mentors then conducted the same classes with elementary agechildren. Across these settings, a culminating event was an opportunity for participants to presenttheir project ideas to the community.Embedded in these interventions is the belief that enabling students to imagine approaches tobuilding their communities will plant the seeds for them to see themselves as agents of changewithin the community. By incorporating the development of technological fluency into theapproach, skills, important to future careers are cultivated.
C2 - 2013///
CY - Atlanta, GA
DA - 2013///
PY - 2013/6/23/
DO - 10.18260/1-2--19275
ER -
TY - CONF
TI - Determining problem selection for a logic proof tutor
AU - Mostafavi, Behrooz
AU - Barnes, Tiffany
T2 - EDM 2013
C2 - 2013///
C3 - Educational Data Mining
DA - 2013///
PY - 2013///
SP - 387–389
ER -
TY - CONF
TI - Evaluation of automatically generated hint feedback
AU - Eagle, Michael
AU - Barnes, Tiffany
T2 - EDM 2013
C2 - 2013///
C3 - Educational Data Mining
DA - 2013///
PY - 2013///
SP - 372–374
ER -
TY - CONF
TI - An Algorithm for Reducing the Complexity of Interaction Networks
AU - Johnson, Matthew
AU - Eagle, Michael
AU - Barnes, Tiffany
AU - Stamper, John
T2 - EDM 2013
C2 - 2013///
C3 - Educational Data Mining
DA - 2013///
PY - 2013///
SP - 248–251
ER -
TY - CONF
TI - InVis: An Interactive Visualization Tool for Exploring Interaction Networks Educational Data Mining
AU - Johnson, Matthew
AU - Eagle, Michael
AU - Barnes, Tiffany
T2 - EDM 2013
C2 - 2013///
C3 - Proceedings of the 6th International Conference on Educational Data Mining (EDM 2013)
DA - 2013///
PY - 2013///
SP - 82–89
ER -
TY - JOUR
TI - Experimental Evaluation of Automatic Hint Generation for a Logic Tutor
AU - Stamper, John
AU - Eagle, Michael
AU - Barnes, Tiffany
AU - Croy, Marvin
T2 - International Journal of Artificial Intelligence in Education (IJAIED)
DA - 2013///
PY - 2013///
VL - 22
IS - 1-2
SP - 3–17
ER -
TY - JOUR
TI - An improved adaptive binary Harmony Search algorithm
AU - Wang, L.
AU - Yang, R.
AU - Xu, Y.
AU - Niu, Q.
AU - Pardalos, P.M.
AU - Fei, M.
T2 - Information Sciences
AB - Harmony Search (HS), inspired by the music improvisation process, is a new meta-heuristic optimization method and has been successfully used to tackle the optimization problems in discrete or continuous space. Although the standard HS algorithm is able to solve binary-coded optimization problems, the pitch adjustment operator of HS is degenerated in the binary space, which spoils the performance of the algorithm. Based on the analysis of the drawback of the standard HS, an improved adaptive binary Harmony Search (ABHS) algorithm is proposed in this paper to solve the binary-coded problems more effectively. Various adaptive mechanisms are examined and investigated, and a scalable adaptive strategy is developed for ABHS to enhance its search ability and robustness. The experimental results on the benchmark functions and 0–1 knapsack problems demonstrate that the proposed ABHS is efficient and effective, which outperforms the binary Harmony Search, the novel global Harmony Search algorithm and the discrete binary Particle Swarm Optimization in terms of the search accuracy and convergence speed.
DA - 2013///
PY - 2013///
DO - 10.1016/j.ins.2012.12.043
VL - 232
SP - 58-87
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84875444050&partnerID=MN8TOARS
KW - Harmony Search
KW - Binary Harmony Search
KW - Meta-heuristic
KW - Knapsack problem
ER -
TY - JOUR
TI - An adaptive fuzzy controller based on harmony search and its application to power plant control
AU - Wang, L.
AU - Yang, R.
AU - Pardalos, P.M.
AU - Qian, L.
AU - Fei, M.
T2 - International Journal of Electrical Power and Energy Systems
AB - Considering the reliability and safety requirements of power stations, a novel adaptive fuzzy controller is presented to implement non-overshoot control in power plants in which the Lyapunov-based adaptive law is employed to guarantee the stability of the controller while a modified Adaptive Binary Harmony Search (ABHS) algorithm is utilized to search the optimal control parameters to improve the dynamic performance. Two strategies are analyzed and used with ABHS to guarantee the non-overshoot of control. Furthermore, a simple but efficient repair operation is developed to deal with the time-varying characteristic of the thermal process. Finally, the proposed ABHS-based Adaptive Fuzzy Control (ABHSAFC) method is applied to the bed temperature control of the Circulating Fluidized Bed Boiler (CFBB). The experimental results demonstrate that ABHSAFC can implement the expected non-overshoot control efficiently and outperforms the classical Lyapunov-based adaptive fuzzy control, ABHS-based fuzzy control and ABHS-based PID control. Considering the characteristics of the easy implementation, robustness and the guaranteed stability, ABHSAFC promises a favorable engineering application prospect.
DA - 2013///
PY - 2013///
DO - 10.1016/j.ijepes.2013.05.015
VL - 53
IS - 1
SP - 272-278
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84878279947&partnerID=MN8TOARS
KW - Adaptive fuzzy control
KW - Harmony search
KW - Power plant
KW - Binary Harmony Search
ER -
TY - JOUR
TI - Exploring the Implications of Tutor Negativity Towards a Synthetic Agent in a Learning-by-Teaching Environment
AU - Rodrigo, M.M.T.
AU - Geli, R.I.A.M.
AU - Ong, A.
AU - Vitug, G.J.G.
AU - Bringula, R.
AU - Basa, R.S.
AU - Dela Cruz, C
AU - Matsuda, N.
T2 - Philippine Computing Journal
DA - 2013/12//
PY - 2013/12//
VL - 8
IS - 1
SP - 15–20
ER -
TY - CONF
TI - Cataloging and Comparing Logging Mechanism Specifications for Electronic Health Record Systems
AU - King, Jason
AU - Williams, Laurie
C2 - 2013///
C3 - Proceedings of the 2013 USENIX Conference on Safety, Security, Privacy and Interoperability of Health Information Technologies
CY - Berkeley, CA, USA
DA - 2013///
SP - 4-4
PB - USENIX Association
UR - http://dl.acm.org/citation.cfm?id=2696523.2696527
ER -
TY - JOUR
TI - Guest editorial for the Special Section on BEST PAPERS from the 2011 conference on Predictive Models in Software Engineering (PROMISE)
AU - Menzies, Tim
T2 - Information and Software Technology
AB - The measurement of Function Points is based on Base Functional Components. The process of identifying and weighting Base Functional Components is hardly automatable, due to the informality of both the Function Point method and the requirements documents being measured. So, Function Point measurement generally requires a lengthy and costly process.We investigate whether it is possible to take into account only subsets of Base Functional Components so as to obtain functional size measures that simplify Function Points with the same effort estimation accuracy as the original Function Points measure. Simplifying the definition of Function Points would imply a reduction of measurement costs and may help spread the adoption of this type of measurement practices. Specifically, we empirically investigate the following issues: whether available data provide evidence that simplified software functionality measures can be defined in a way that is consistent with Function Point Analysis; whether simplified functional size measures by themselves can be used without any appreciable loss in software development effort prediction accuracy; whether simplified functional size measures can be used as software development effort predictors in models that also use other software requirements measures.We analyze the relationships between Function Points and their Base Functional Components. We also analyze the relationships between Base Functional Components and development effort. Finally, we built effort prediction models that contain both the simplified functional measures and additional requirements measures.Significant statistical models correlate Function Points with Base Functional Components. Basic Functional Components can be used to build models of effort that are equivalent, in terms of accuracy, to those based on Function Points. Finally, simplified Function Points measures can be used as software development effort predictors in models that also use other requirements measures.The definition and measurement processes of Function Points can be dramatically simplified by taking into account a subset of the Base Functional Components used in the original definition of the measure, thus allowing for substantial savings in measurement effort, without sacrificing the accuracy of software development effort estimates.
DA - 2013/8//
PY - 2013/8//
DO - 10.1016/J.INFSOF.2013.03.006
VL - 55
IS - 8
SP - 1477-1478
J2 - Information and Software Technology
LA - en
OP -
SN - 0950-5849
UR - http://dx.doi.org/10.1016/J.INFSOF.2013.03.006
DB - Crossref
ER -
TY - CHAP
TI - Agent Communication
AU - Chopra, Amit K.
AU - Singh, Munindar P.
T2 - Multiagent Systems
A2 - Weiss, Gerhard
PY - 2013///
ET - 2nd
SP - 101–141
PB - MIT Press
ER -
TY - CHAP
TI - The Uses of Norms
AU - Singh, Munindar P.
AU - Arrott, Matthew
AU - Balke, Tina
AU - Chopra, Amit K.
AU - Christiaanse, Rob
AU - Cranefield, Stephen
AU - Dignum, Frank
AU - Eynard, Davide
AU - Farcas, Emilia
AU - Fornara, Nicoletta
AU - Gandon, Fabien
AU - Governatori, Guido
AU - Dam, Hoa Khanh
AU - Hulstijn, Joris
AU - Krüger, Ingolf
AU - Lam, Ho-Pun
AU - Meisinger, Michael
AU - Noriega, Pablo
AU - Savarimuthu, Bastin Tony Roy
AU - Tadanki, Kartik
AU - Verhagen, Harko
AU - Villata, Serena
T2 - Normative Multi-Agent Systems
A2 - Andrighetto, Giulia
A2 - Governatori, Guido
A2 - Noriega, Pablo
A2 - Torre, Leendert W.N.
AB - This chapter presents a variety of applications of norms. These applications include governance in sociotechnical systems, data licensing and data collection, understanding software development teams, requirements engineering, assurance, natural resource allocation, wireless grids, autonomous vehicles, serious games, and virtual worlds.
PY - 2013///
DO - 10.4230/DFU.Vol4.12111.191
VL - 4
SP - 191–229
PB - Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
ER -
TY - CHAP
TI - Regulated MAS: Social Perspective
AU - Noriega, Pablo
AU - Chopra, Amit K.
AU - Fornara, Nicoletta
AU - Cardoso, Henrique Lopes
AU - Singh, Munindar P.
T2 - Normative Multi-Agent Systems
A2 - Andrighetto, Giulia
A2 - Governatori, Guido
A2 - Noriega, Pablo
A2 - Torre, Leendert W.N.
AB - Munindar Singh’s effort was partially supported by the U.S. Army Research Office under grant W911NF-08-1-0105. The content of this paper does not necessarily reflect the position or policy of the U.S. Government; no official endorsement should be inferred or implied. Nicoletta Fornara’s effort is supported by the Hasler Foundation project nr. 11115-KG and
by the SER project nr. C08.0114 within the COST Action IC0801 Agreement Technologies. Henrique Lopes Cardoso’s effort is supported by Fundacao para a Ciencia e a Tecnologia (FCT), under project PTDC/EIA-EIA/104420/2008. Pablo Noriega’s effort has been partially supported by the Spanish Ministry of Science and Technology through the Agreement Technologies CONSOLIDER project under contract CSD2007-0022, and the Generalitat of Catalunya grant 2009-SGR-1434.
PY - 2013///
DO - 10.4230/DFU.Vol4.12111.93
VL - 4
SP - 93–133
PB - Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
ER -
TY - CONF
TI - Positron: Composing Commitment Protocols
AU - Gerard, Scott N.
AU - Telang, Pankaj R.
AU - Kalia, Anup K.
AU - Singh, Munindar P.
T2 - International Workshop on Engineering Multiagent Systems
C2 - 2013/5//
C3 - Proceedings of the 1st International Workshop on Engineering Multiagent Systems (EMAS)
CY - St. Paul, MN
DA - 2013/5//
PY - 2013/5/6/
ER -
TY - CONF
TI - Towards an Argumentation-Based Model of Social Interaction
AU - Sklar, Elizabeth I.
AU - Parsons, Simon D.
AU - Singh, Munindar P.
T2 - International Workshop on Argumentation in Multi-Agent Systems
C2 - 2013/5//
C3 - Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems (ArgMAS)
CY - St. Paul, MN
DA - 2013/5//
ER -
TY - CONF
TI - Trustworthy Decision Making via Commitments
AU - Kalia, Anup K.
AU - Zhang, Zhe
AU - Singh, Munindar P.
T2 - International Joint Conference on Autonomous Agents and Multiagent Systems
C2 - 2013/5//
C3 - Proceedings of the 15th AAMAS Workshop on Trust in Agent Societies (Trust)
CY - St. Paul, MN
DA - 2013/5//
SP - 24–35
ER -
TY - JOUR
TI - Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU
AU - Wu, Bo
AU - Zhao, Zhijia
AU - Zhang, Eddy Zheng
AU - Jiang, Yunlian
AU - Shen, Xipeng
T2 - ACM SIGPLAN Notices
AB - The performance of Graphic Processing Units (GPU) is sensitive to irregular memory references. Some recent work shows the promise of data reorganization for eliminating non-coalesced memory accesses that are caused by irregular references. However, all previous studies have employed simple, heuristic methods to determine the new data layouts to create. As a result, they either do not provide any performance guarantee or are effective to only some limited scenarios. This paper contributes a fundamental study to the problem. It systematically analyzes the inherent complexity of the problem in various settings, and for the first time, proves that the problem is NP-complete. It then points out the limitations of existing techniques and reveals that in practice, the essence for designing an appropriate data reorganization algorithm can be reduced to a tradeoff among space, time, and complexity. Based on that insight, it develops two new data reorganization algorithms to overcome the limitations of previous methods. Experiments show that an assembly composed of the new algorithms and a previous algorithm can circumvent the inherent complexity in finding optimal data layouts, making it feasible to minimize non-coalesced memory accesses for a variety of irregular applications and settings that are beyond the reach of existing techniques.
DA - 2013/8/23/
PY - 2013/8/23/
DO - 10.1145/2517327.2442523
VL - 48
IS - 8
SP - 57
J2 - SIGPLAN Not.
LA - en
OP -
SN - 0362-1340
UR - http://dx.doi.org/10.1145/2517327.2442523
DB - Crossref
KW - Performance
KW - Experimentation
KW - GPGPU
KW - Memory coalescing
KW - Computational complexity
KW - Thread-data remapping
KW - Runtime optimizations
KW - Data transformation
ER -
TY - BOOK
TI - Agents and Data Mining Interaction
T2 - Lecture Notes in Computer Science
A3 - Cao, Longbing
A3 - Zeng, Yifeng
A3 - Symeonidis, Andreas L.
A3 - Gorodetsky, Vladimir I.
A3 - Yu, Philip S.
A3 - Singh, Munindar P
AB - This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on Agents and Data Mining Interaction, ADMI 2012, held in Valencia, Spain, in June 2012. The 1
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-36288-0
VL - 7607
M1 - 7607
PB - Springer
SN - 9783642362873 9783642362880
UR - http://dx.doi.org/10.1007/978-3-642-36288-0
ER -
TY - CONF
TI - Geometric Separators and the Parabolic Lift
AU - Sheehy, Donald R.
T2 - Canadian Conference in Computational Geometry
C2 - 2013///
C3 - CCCG: The Canadian Conference in Computational Geometry
CY - Waterloo, Ontario
DA - 2013///
PY - 2013/8/8/
ER -
TY - CHAP
TI - Knowledge-Assisted Ontology-Based Requirements Evolution
AU - Ghaisas, Smita
AU - Ajmeri, Nirav
T2 - Managing Requirements Knowledge (MaRK)
A2 - Maalej, Walid
A2 - Thurimella, Anil Kumar
PY - 2013///
SP - 143-167
PB - Springer Berlin Heidelberg
UR - https://research-information.bris.ac.uk/en/publications/9d328913-4eb3-4403-bf6f-bbf20ed08017
ER -
TY - CONF
TI - Argumentation, Evidence, and Schemes: Abstract
AU - Hang, Chung-Wei
AU - Ajmeri, Nirav
AU - Singh, Munindar P.
AU - Parsons, Simon
T2 - International Workshop on Argumentation in Multi-Agent Systems
C2 - 2013/5//
C3 - Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems
CY - St. Paul, MN
DA - 2013/5//
PY - 2013/5/6/
SP - 37
UR - https://research-information.bris.ac.uk/en/publications/3b00f0ba-3768-4e45-94f5-93d1a4661f2b
ER -
TY - CHAP
TI - Fine-Grained Treatment to Synchronizations in GPU-to-CPU Translation
AU - Guo, Ziyu
AU - Shen, Xipeng
T2 - Languages and Compilers for Parallel Computing
AB - GPU-to-CPU translation may extend Graphics Processing Units (GPU) programs executions to multi-/many-core CPUs, and hence enable cross-device task migration and promote whole-system synergy. This paper describes some of our findings in treatment to GPU synchronizations during the translation process. We show that careful dependence analysis may allow a fine-grained treatment to synchronizations and reveal redundant computation at the instruction-instance level. Based on thread-level dependence graphs, we present a method to enable such fine-grained treatment automatically. Experiments demonstrate that compared to existing translations, the new approach can yield speedup of a factor of integers.
PY - 2013///
DO - 10.1007/978-3-642-36036-7_12
SP - 171-184
OP -
PB - Springer Berlin Heidelberg
SN - 9783642360350 9783642360367
UR - http://dx.doi.org/10.1007/978-3-642-36036-7_12
DB - Crossref
ER -
TY - CHAP
TI - Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors
AU - Tian, Kai
AU - Jiang, Yunlian
AU - Shen, Xipeng
AU - Mao, Weizhen
T2 - Job Scheduling Strategies for Parallel Processing
AB - On-chip resource sharing among sibling cores causes resource contention on Chip Multiprocessors (CMP), considerably degrading program performance and system fairness. Job co-scheduling attempts to alleviate the problem by assigning jobs to cores intelligently. Despite many heuristics-based empirical explorations, studies on optimal co-scheduling and its inherent complexity start only recently, and all have concentrated on the minimization of total performance degradations. There is another important criterion for scheduling, makespan, which determines the finish time of a job set. Its importance for job co-scheduling on CMP is increasingly recognized, especially with the rise of CMP-based compute cloud, data centers, and server farms. However, optimal co-scheduling for makespan minimization still remains unexplored. This work compares makespan minimization problem with previously studied cost minimization (or degradation minimization) problem, revealing these connections as well as significant differences. It uncovers the computational complexity of the makespan minimization problem, and proposes a series of algorithms to either compute or approximate the optimal schedules. It proves that the problem is NP-complete in a general setting, but for a special case (dual-core without job migrations), the problem is solvable in O(n 2.5·logn) time (n is the number of jobs). In addition, this paper presents a series of algorithms to compute or approximate the optimal schedules in the general setting. Experiments on both real and synthetic problems verify the optimality of the optimal co-scheduling algorithms, and demonstrate the reasonable accuracy and scalability of the approximation algorithms. The findings may advance the current understanding of optimal co-scheduling, facilitate the evaluation of real co-scheduling systems, and provide insights for the development of practical co-scheduling algorithms.
PY - 2013///
DO - 10.1007/978-3-642-35867-8_7
SP - 114-133
OP -
PB - Springer Berlin Heidelberg
SN - 9783642358661 9783642358678
UR - http://dx.doi.org/10.1007/978-3-642-35867-8_7
DB - Crossref
ER -
TY - JOUR
TI - HPar
AU - Zhao, Zhijia
AU - Bebenita, Michael
AU - Herman, Dave
AU - Sun, Jianhua
AU - Shen, Xipeng
T2 - ACM Transactions on Architecture and Code Optimization
AB - Parallelizing HTML parsing is challenging due to the complexities of HTML documents and the inherent dependencies in its parsing algorithm. As a result, despite numerous studies in parallel parsing, HTML parsing remains sequential today. It forms one of the final barriers for fully parallelizing browser operations to minimize the browser’s response time—an important variable for user experiences, especially on portable devices. This article provides a comprehensive analysis on the special complexities of parallel HTML parsing and presents a systematic exploration in overcoming those difficulties through specially designed speculative parallelizations. This work develops, to the best of our knowledge, the first pipelining and data-level parallel HTML parsers. The data-level parallel parser, named HPar , achieves up to 2.4× speedup on quadcore devices. This work demonstrates the feasibility of efficient, parallel HTML parsing for the first time and offers a set of novel insights for parallel HTML parsing
DA - 2013/12/1/
PY - 2013/12/1/
DO - 10.1145/2541228.2555301
VL - 10
IS - 4
SP - 1-25
J2 - TACO
LA - en
OP -
SN - 1544-3566
UR - http://dx.doi.org/10.1145/2541228.2555301
DB - Crossref
ER -
TY - CHAP
TI - Simple Profile Rectifications Go a Long Way
AU - Wu, Bo
AU - Zhou, Mingzhou
AU - Shen, Xipeng
AU - Gao, Yaoqing
AU - Silvera, Raul
AU - Yiu, Graham
T2 - ECOOP 2013 – Object-Oriented Programming
AB - Feedback-driven program optimization (FDO) is common in modern compilers, including Just-In-Time compilers increasingly adopted for object-oriented or scripting languages. This paper describes a systematic study in understanding and alleviating the effects of sampling errors on the usefulness of the obtained profiles for FDO. Taking a statistical approach, it offers a series of counter-intuitive findings, and identifies two kinds of profile errors that affect FDO critically, namely zero-count errors and inconsistency errors. It further proposes statistical profile rectification, a simple approach to correcting profiling errors by leveraging statistical patterns in a profile. Experiments show that the simple approach enhances the effectiveness of sampled profile-based FDO dramatically, increasing the average FDO speedup from 1.16X to 1.3X, around 92% of what full profiles can yield.
PY - 2013///
DO - 10.1007/978-3-642-39038-8_27
SP - 654-678
OP -
PB - Springer Berlin Heidelberg
SN - 9783642390371 9783642390388
UR - http://dx.doi.org/10.1007/978-3-642-39038-8_27
DB - Crossref
ER -
TY - CHAP
TI - Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
AU - Damgård, Ivan
AU - Scafuro, Alessandra
T2 - Advances in Cryptology - ASIACRYPT 2013
AB - We present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security [9]. We exemplify the usefulness of our compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on (malicious) PUFs [36] and stateless tamper-proof hardware tokens [26], therefore achieving the first unconditionally UC-secure commitment with malicious PUFs and stateless tokens, respectively. Our constructions are secure for adversaries creating arbitrarily malicious stateful PUFs/tokens.Previous results with malicious PUFs used either computational assumptions to achieve UC-secure commitments or were unconditionally secure but only in the indistinguishability sense [36]. Similarly, with stateless tokens, UC-secure commitments are known only under computational assumptions [13,24,15], while the (not UC) unconditional commitment scheme of [23] is secure only in a weaker model in which the adversary is not allowed to create stateful tokens.Besides allowing us to prove feasibility of unconditional UC-security with (malicious) PUFs and stateless tokens, our compiler can be instantiated with any ideal straight-line extractable commitment scheme, thus allowing the use of various setup assumptions which may better fit the application or the technology available.
PY - 2013///
DO - 10.1007/978-3-642-42045-0_6
SP - 100-119
OP -
PB - Springer Berlin Heidelberg
SN - 9783642420443 9783642420450
UR - http://dx.doi.org/10.1007/978-3-642-42045-0_6
DB - Crossref
ER -
TY - CHAP
TI - Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
AU - Ostrovsky, Rafail
AU - Scafuro, Alessandra
AU - Visconti, Ivan
AU - Wadia, Akshay
T2 - Advances in Cryptology – EUROCRYPT 2013
AB - Physically Uncloneable Functions (PUFs) [28] are noisy physical sources of randomness. As such, they are naturally appealing for cryptographic applications, and have caught the interest of both theoreticians and practitioners. A major step towards understanding and securely using PUFs was recently taken in [Crypto 2011] where Brzuska, Fischlin, Schröder and Katzenbeisser model PUFs in the Universal Composition (UC) framework of Canetti [FOCS 2001]. A salient feature of their model is that it considers trusted PUFs only; that is, PUFs which have been produced via the prescribed manufacturing process and are guaranteed to be free of any adversarial influence. However, this does not accurately reflect real-life scenarios, where an adversary could be able to create and use malicious PUFs. The goal of this work is to extend the model proposed in [Crypto 2011] in order to capture such a real-world attack. The main contribution of this work is the study of the Malicious PUFs model. To this end, we first formalize the notion of “malicious” PUFs, and extend the UC formulation of Brzuska et al. to allow the adversary to create PUFs with arbitrary adversarial behaviour. Then, we provide positive results in this, more realistic, model. We show that, under computational assumptions, it is possible to UC-securely realize any functionality.
PY - 2013///
DO - 10.1007/978-3-642-38348-9_41
SP - 702-718
OP -
PB - Springer Berlin Heidelberg
SN - 9783642383472 9783642383489
UR - http://dx.doi.org/10.1007/978-3-642-38348-9_41
DB - Crossref
ER -
TY - CHAP
TI - Revisiting Lower and Upper Bounds for Selective Decommitments
AU - Ostrovsky, Rafail
AU - Rao, Vanishree
AU - Scafuro, Alessandra
AU - Visconti, Ivan
T2 - Theory of Cryptography
AB - In [6,7], Dwork et al. posed the fundamental question of existence of commitment schemes that are secure against selective opening attacks (SOA, for short). In [2] Bellare, Hofheinz, and Yilek, and Hofheinz in [13] answered it affirmatively by presenting a scheme which is based solely on the non-black-box use of a one-way permutation needing a super-constant number of rounds. This result however opened other challenging questions about achieving a better round complexity and obtaining fully black-box schemes using underlying primitives and code of the adversary in a black-box manner.Recently, in TCC 2011, Xiao ([23]) investigated on how to achieve (nearly) optimal SOA-secure commitment schemes where optimality is in the sense of both the round complexity and the black-box use of cryptographic primitives. The work of Xiao focuses on a simulation-based security notion of SOA. Moreover, the various results in [23] focus only on either parallel or concurrent SOA.In this work we first point out various issues in the claims of [23] that actually re-open several of the questions left open in [2,13]. Then, we provide new lower bounds and concrete constructions that produce a very different state-of-the-art compared to the one claimed in [23].
PY - 2013///
DO - 10.1007/978-3-642-36594-2_31
SP - 559-578
OP -
PB - Springer Berlin Heidelberg
SN - 9783642365935 9783642365942
UR - http://dx.doi.org/10.1007/978-3-642-36594-2_31
DB - Crossref
ER -
TY - CHAP
TI - Linear Logic Programming for Narrative Generation
AU - Martens, Chris
AU - Bosser, Anne-Gwenn
AU - Ferreira, João F.
AU - Cavazza, Marc
T2 - Logic Programming and Nonmonotonic Reasoning
AB - In this paper, we explore the use of Linear Logic programming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. This approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms.
PY - 2013///
DO - 10.1007/978-3-642-40564-8_42
SP - 427-432
OP -
PB - Springer Berlin Heidelberg
SN - 9783642405631 9783642405648
UR - http://dx.doi.org/10.1007/978-3-642-40564-8_42
DB - Crossref
ER -
TY - JOUR
TI - Discovering how end-user programmers and their communities use public repositories: A study on Yahoo! Pipes
AU - Stolee, Kathryn T.
AU - Elbaum, Sebastian
AU - Sarma, Anita
T2 - Information and Software Technology
AB - End-user programmers are numerous, write software that matters to an increasingly large number of users, and face software engineering challenges that are similar to their professionals counterparts. Yet, we know little about how these end-user programmers create and share artifacts in repositories as part of a community. This work aims to gain a better understanding of end-user programmer communities, the characteristics of artifacts in community repositories, and how authors evolve over time. An artifact-based analysis of 32,000 mashups from the Yahoo! Pipes repository was performed. The popularity, configurability, complexity, and diversity of the artifacts were measured. Additionally, for the most prolific authors, we explore their submission trends over time. Similar to other online communities, there is great deal of attrition but authors who persevere tend to improve over time, creating pipes that are more configurable, diverse, complex, and popular. We also discovered, however, that end-user programmers do not effectively reuse existing programs, submit pipes that are highly similar to others already in the repository, and in most cases do not have an awareness of the community or the richness of artifacts that exist in repositories. There is a need for better end-user programmer support in several stages of the software lifecycle, including development, maintenance, search, and program understanding. Without such support, the community repositories will continue to be cluttered with highly-similar artifacts and authors may not be able to take full advantage of the community resources.
DA - 2013/7//
PY - 2013/7//
DO - 10.1016/j.infsof.2012.10.004
VL - 55
IS - 7
SP - 1289-1303
J2 - Information and Software Technology
LA - en
OP -
SN - 0950-5849
UR - http://dx.doi.org/10.1016/j.infsof.2012.10.004
DB - Crossref
KW - End-user programmers
KW - Community analysis
KW - Artifact repositories
KW - Web mashups
KW - Diversity analysis
ER -
TY - JOUR
TI - In-execution dynamic malware analysis and detection by mining information in process control blocks of Linux OS
AU - Shahzad, Farrukh
AU - Shahzad, M.
AU - Farooq, Muddassar
T2 - Information Sciences
AB - Run-time behavior of processes – running on an end-host – is being actively used to dynamically detect malware. Most of these detection schemes build model of run-time behavior of a process on the basis of its data flow and/or sequence of system calls. These novel techniques have shown promising results but an efficient and effective technique must meet the following performance metrics: (1) high detection accuracy, (2) low false alarm rate, (3) small detection time, and (4) the technique should be resilient to run-time evasion attempts. To meet these challenges, a novel concept of genetic footprint is proposed, by mining the information in the kernel process control blocks (PCB) of a process, that can be used to detect malicious processes at run time. The genetic footprint consists of selected parameters – maintained inside the PCB of a kernel for each running process – that define the semantics and behavior of an executing process. A systematic forensic study of the execution traces of benign and malware processes is performed to identify discriminatory parameters of a PCB (task_struct is PCB in case of Linux OS). As a result, 16 out of 118 task structure parameters are short listed using the time series analysis. A statistical analysis is done to corroborate the features of the genetic footprint and to select suitable machine learning classifiers to detect malware. The scheme has been evaluated on a dataset that consists of 105 benign processes and 114 recently collected malware processes for Linux. The results of experiments show that the presented scheme achieves a detection accuracy of 96% with 0% false alarm rate in less than 100 ms of the start of a malicious activity. Last but not least, the presented technique utilizes partial knowledge that is available at a given time while the process is still executing; as a result, the kernel of OS can devise mitigation strategies. It is also shown that the presented technique is robust to well known run-time evasion attempts.
DA - 2013/5//
PY - 2013/5//
DO - 10.1016/j.ins.2011.09.016
VL - 231
SP - 45-63
J2 - Information Sciences
LA - en
OP -
SN - 0020-0255
UR - http://dx.doi.org/10.1016/j.ins.2011.09.016
DB - Crossref
KW - Intrusion detection system
KW - Kernel task structure
KW - Malware forensic
KW - Operating system security
KW - Malicious process detection
ER -
TY - CHAP
TI - Validating Library Usage Interactively
AU - Harris, William R.
AU - Jin, Guoliang
AU - Lu, Shan
AU - Jha, Somesh
T2 - Computer Aided Verification
AB - Programmers who develop large, mature applications often want to optimize the performance of their program without changing its semantics. They often do so by changing how their program invokes a library function or a function implemented in another module of the program. Unfortunately, once a programmer makes such an optimization, it is difficult for him to validate that the optimization does not change the semantics of the original program, because the original and optimized programs are equivalent only due to subtle, implicit assumptions about library functions called by the programs.In this work, we present an interactive program analysis that a programmer can apply to validate that his optimization does not change his program’s semantics. Our analysis casts the problem of validating an optimization as an abductive inference problem in the context of checking program equivalence. Our analysis solves the abductive equivalence problem by interacting with the programmer so that the programmer implements a solver for a logical theory that models library functions invoked by the program. We have used our analysis to validate optimizations of real-world, mature applications: the Apache software suite, the Mozilla Suite, and the MySQL database.
PY - 2013///
DO - 10.1007/978-3-642-39799-8_56
SP - 796-812
OP -
PB - Springer Berlin Heidelberg
SN - 9783642397981 9783642397998
UR - http://dx.doi.org/10.1007/978-3-642-39799-8_56
DB - Crossref
ER -
TY - JOUR
TI - Software effort models should be assessed via leave-one-out validation
AU - Kocaguneli, Ekrem
AU - Menzies, Tim
T2 - Journal of Systems and Software
AB - More than half the literature on software effort estimation (SEE) focuses on model comparisons. Each of those requires a sampling method (SM) to generate the train and test sets. Different authors use different SMs such as leave-one-out (LOO), 3Way and 10Way cross-validation. While LOO is a deterministic algorithm, the N-way methods use random selection to build their train and test sets. This introduces the problem of conclusion instability where different authors rank effort estimators in different ways. To reduce conclusion instability by removing the effects of a sampling method's random test case generation. Calculate bias and variance (B&V) values following the assumption that a learner trained on the whole dataset is taken as the true model; then demonstrate that the B&V and runtime values for LOO are similar to N-way by running 90 different algorithms on 20 different SEE datasets. For each algorithm, collect runtimes, B&V values under LOO, 3Way and 10Way. We observed that: (1) the majority of the algorithms have statistically indistinguishable B&V values under different SMs and (2) different SMs have similar run times. In terms of their generated B&V values and runtimes, there is no reason to prefer N-way over LOO. In terms of reproducibility, LOO removes one cause of conclusion instability (the random selection of train and test sets). Therefore, we depreciate N-way and endorse LOO validation for assessing effort models.
DA - 2013/7//
PY - 2013/7//
DO - 10.1016/J.JSS.2013.02.053
VL - 86
IS - 7
SP - 1879-1890
J2 - Journal of Systems and Software
LA - en
OP -
SN - 0164-1212
UR - http://dx.doi.org/10.1016/J.JSS.2013.02.053
DB - Crossref
KW - Software cost estimation
KW - Prediction system
KW - Bias
KW - Variance
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 - Carson, L.
AU - Cottrell, L.
AU - Menzies, T.
T2 - Journal of Nutrition Education and Behavior
AB - Develop and disseminate effective, sustainable, multi-level pediatric obesity prevention strategies. Project Components: 1) multi-level assessment of behavioral and environmental contributors to early childhood obesity, 2) implementation of a community-, school-, and home-level intervention, and 4) assessment of intervention efficacy. Cohort one study population: 151 families with children in HeadStart/pre-kindergarten in two West Virginia counties. Outcomes will be assessed as change in physical activity and eating behavior in children and families from the pre- to post intervention. Pre-intervention assessment indicated 37% of study children were overweight or obese. To be determined based on post-intervention analyses.
DA - 2013/7//
PY - 2013/7//
DO - 10.1016/J.JNEB.2013.04.271
VL - 45
IS - 4
SP - S92
J2 - Journal of Nutrition Education and Behavior
LA - en
OP -
SN - 1499-4046
UR - http://dx.doi.org/10.1016/J.JNEB.2013.04.271
DB - Crossref
ER -
TY - JOUR
TI - Predictive models in software engineering
AU - Menzies, Tim
AU - Koru, Gunes
T2 - Empirical Software Engineering
AB - Welcome to the Empirical Software Engineering’s special issue on predictive models in software engineering. The goal of such methods is repeatable, refutable (and possibly improvable) results in software engineering. Many of the recent papers in SE literature are based on data from on-line repositories such as http://promisedata.googlecode.com. This introduces a kind of selection in the kinds of papers published at this venue. Our first paper pushes past that bias to explore a very rich time-based data set. In “Predicting the Flow of Defect Correction Effort using a Bayesian Network Model”, Schulz et al. use a Bayes net to explore the effects of removing defects at different stages of the software lifecycle. Their work shows how to calibrate general models to the particulars of a company’s local particulars. Our next paper “The Limited Impact of Individual Developer Data on Software Defect Prediction” by Bell et concludes there is no added value to reasoning on some aspects of social aspects of programmer teams working on a code. This is a timely counterpoint to other research that eschews code measures for other approaches based only on social metrics. Our last paper explores the complicated issue of parameter tuning. In “Using Tabu Search to Configure Support Vector Regression for Effort Estimation”, Corazza et al. offers automated guidance for setting the parameters that control a learner. This is a matter of critical importance since even the best learner can perform poorly if its operator uses the wrong settings. A special issue like this is only possible due to the hard work of a dedicated set of authors are reviewers. We would like to express our gratitude to all authors who submitted their papers this special issue. We would also like to thank our reviewers for their meticulous evaluation of the submissions. The success of special issues such as this one largely stands on their shoulders. Empir Software Eng (2013) 18:433–434 DOI 10.1007/s10664-013-9252-1
DA - 2013/4/12/
PY - 2013/4/12/
DO - 10.1007/S10664-013-9252-1
VL - 18
IS - 3
SP - 433-434
J2 - Empir Software Eng
LA - en
OP -
SN - 1382-3256 1573-7616
UR - http://dx.doi.org/10.1007/S10664-013-9252-1
DB - Crossref
ER -
TY - JOUR
TI - Complex biomarker discovery in neuroimaging data: Finding a needle in a haystack
AU - Atluri, Gowtham
AU - Padmanabhan, Kanchana
AU - Fang, Gang
AU - Steinbach, Michael
AU - Petrella, Jeffrey R.
AU - Lim, Kelvin
AU - MacDonald, Angus, III
AU - Samatova, Nagiza F.
AU - Doraiswamy, P. Murali
AU - Kumar, Vipin
T2 - NeuroImage: Clinical
AB - Neuropsychiatric disorders such as schizophrenia, bipolar disorder and Alzheimer's disease are major public health problems. However, despite decades of research, we currently have no validated prognostic or diagnostic tests that can be applied at an individual patient level. Many neuropsychiatric diseases are due to a combination of alterations that occur in a human brain rather than the result of localized lesions. While there is hope that newer imaging technologies such as functional and anatomic connectivity MRI or molecular imaging may offer breakthroughs, the single biomarkers that are discovered using these datasets are limited by their inability to capture the heterogeneity and complexity of most multifactorial brain disorders. Recently, complex biomarkers have been explored to address this limitation using neuroimaging data. In this manuscript we consider the nature of complex biomarkers being investigated in the recent literature and present techniques to find such biomarkers that have been developed in related areas of data mining, statistics, machine learning and bioinformatics.
DA - 2013///
PY - 2013///
DO - 10.1016/J.NICL.2013.07.004
VL - 3
SP - 123-131
J2 - NeuroImage: Clinical
LA - en
OP -
SN - 2213-1582
UR - http://dx.doi.org/10.1016/J.NICL.2013.07.004
DB - Crossref
ER -
TY - CHAP
TI - ALACRITY: Analytics-Driven Lossless Data Compression for Rapid In-Situ Indexing, Storing, and Querying
AU - Jenkins, John
AU - Arkatkar, Isha
AU - Lakshminarasimhan, Sriram
AU - Boyuka, David A., II
AU - Schendel, Eric R.
AU - Shah, Neil
AU - Ethier, Stephane
AU - Chang, Choong-Seock
AU - Chen, Jackie
AU - Kolla, Hemanth
AU - Klasky, Scott
AU - Ross, Robert
AU - Samatova, Nagiza F.
T2 - Transactions on Large-Scale Data- and Knowledge-Centered Systems X
AB - High-performance computing architectures face nontrivial data processing challenges, as computational and I/O components further diverge in performance trajectories. For scientific data analysis in particular, methods based on generating heavyweight access acceleration structures, e.g. indexes, are becoming less feasible for ever-increasing dataset sizes. We present ALACRITY, demonstrating the effectiveness of a fused data and index encoding of scientific, floating-point data in generating lightweight data structures amenable to common types of queries used in scientific data analysis. We exploit the representation of floating-point values by extracting significant bytes, using the resulting unique values to bin the remaining data along fixed-precision boundaries. To optimize query processing, we use an inverted index, mapping each generated bin to a list of records contained within, allowing us to optimize query processing with attribute range constraints. Overall, the storage footprint for both index and data is shown to be below numerous configurations of bitmap indexing, while matching or outperforming query performance.
PY - 2013///
DO - 10.1007/978-3-642-41221-9_4
SP - 95-114
OP -
PB - Springer Berlin Heidelberg
SN - 9783642412202 9783642412219
UR - http://dx.doi.org/10.1007/978-3-642-41221-9_4
DB - Crossref
ER -
TY - JOUR
TI - A graph-based approach to find teleconnections in climate data
AU - Kawale, Jaya
AU - Liess, Stefan
AU - Kumar, Arjun
AU - Steinbach, Michael
AU - Snyder, Peter
AU - Kumar, Vipin
AU - Ganguly, Auroop R.
AU - Samatova, Nagiza F.
AU - Semazzi, Fredrick
T2 - Statistical Analysis and Data Mining
AB - Pressure dipoles are important long distance climate phenomena (teleconnection) characterized by pressure anomalies of the opposite polarity appearing at two different locations at the same time. Such dipoles have been proven important for understanding and explaining the variability in climate in many regions of the world, e.g. the El Niño Southern Oscillation (ENSO) climate phenomenon, which is described by opposite pressure anomalies between the west and east Pacific and is known to be responsible for precipitation and temperature anomalies worldwide. This paper presents a graph-based approach called shared reciprocal nearest neighbor approach that considers only reciprocal positive and negative edges in the shared nearest neighbor graph to find the dipoles. One crucial aspect of our approach to the analysis of such networks is a careful treatment of negative correlations, whose proper consideration is critical for finding the dipoles. Further, our work shows the importance of modeling the time-dependent patterns of the dipoles in a changing climate in order to better capture the impact of important climate phenomena on the globe. To show the utility of finding dipoles using our approach, we show that the data driven dynamic climate indices generated from our algorithm generally perform better than static indices formed from the fixed locations used by climate scientists in terms of capturing impact on global temperature and precipitation. Our approach can generate a single snapshot picture of all the dipole interconnections on the globe in a given dataset and thus makes it possible to study the changes in dipole interactions and movements. As teleconnections are crucial in the understanding of the global climate system, there is a pressing need to better understand the behavior and interactions of these atmospheric processes as well as to capture them precisely. Our systematic graph-based approach to find the teleconnections in climate data is an attempt in that direction. © 2012 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 6: 158–179, 2013
DA - 2013/4/17/
PY - 2013/4/17/
DO - 10.1002/SAM.11181
VL - 6
IS - 3
SP - 158-179
J2 - Statistical Analy Data Mining
LA - en
OP -
SN - 1932-1864
UR - http://dx.doi.org/10.1002/SAM.11181
DB - Crossref
KW - graph algorithm
KW - teleconnections
KW - dipole discovery
ER -
TY - CHAP
TI - VIA - Visualizing Individual Actions to Develop a Sustainable Community Culture through Cycling
AU - Watson, Benjamin
AU - Berube, David
AU - Hristov, Nickolay
AU - Strohecker, Carol
AU - Betz, Scott
AU - Allen, Louise
AU - Burczyk, Matthew
AU - Howard, Amber
AU - McGee, William Anthony
AU - Gymer, Matthew
AU - Cañas, Daniel
AU - Kirstner, Mark
T2 - Distributed, Ambient, and Pervasive Interactions
AB - Improving the sustainability of our society requires significant change in our collective behavior. But today, individuals in our society have no regular way of seeing that collective behavior, or how their own behavior compares to it. We are creating a research network that will study how new technologies such as mobiles and visualization can encourage individuals to change their behavior to improve sustainability. In Winston-Salem NC, network members will use new technologies to engage the community about its use of transportation—especially biking—and study how that communication affects sustainability awareness and behavior.
PY - 2013///
DO - 10.1007/978-3-642-39351-8_35
SP - 316-325
OP -
PB - Springer Berlin Heidelberg
SN - 9783642393501 9783642393518
UR - http://dx.doi.org/10.1007/978-3-642-39351-8_35
DB - Crossref
ER -
TY - CHAP
TI - Metrics for Character Believability in Interactive Narrative
AU - Gomes, Paulo
AU - Paiva, Ana
AU - Martinho, Carlos
AU - Jhala, Arnav
T2 - Interactive Storytelling
AB - The concept of character believability is often used in interactive narrative research hypothesis. In this paper we define believability metrics using perceived believability dimensions and discuss how they can be accessed. The proposed dimensions are: behavior coherence, change with experience, awareness, behavior understandability, personality, visual impact, predictability, social and emotional expressiveness.
PY - 2013///
DO - 10.1007/978-3-319-02756-2_27
VL - 8230 LNCS
SP - 223-228
OP -
PB - Springer International Publishing
SN - 9783319027555 9783319027562
UR - http://dx.doi.org/10.1007/978-3-319-02756-2_27
DB - Crossref
ER -
TY - BOOK
TI - Personalizing embedded assessment sequences in narrative-centered learning environments: A collaborative filtering approach
AU - Min, W.
AU - Rowe, J.P.
AU - Mott, B.W.
AU - Lester, J.C.
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-39112-5-38
VL - 7926 LNAI
SE - 369-378
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84880007122&partnerID=MN8TOARS
ER -
TY - CHAP
TI - SkyPackage: From Finding Items to Finding a Skyline of Packages on the Semantic Web
AU - Sessoms, Matthew
AU - Anyanwu, Kemafor
T2 - Semantic Technology
AB - Enabling complex querying paradigms over the wealth of available Semantic Web data will significantly impact the relevance and adoption of Semantic Web technologies in a broad range of domains. While the current predominant paradigm is to retrieve a list of items, in many cases the actual intent is satisfied by reviewing the lists and assembling compatible items into lists or packages of resources such that each package collectively satisfies the need, such as assembling different collections of places to visit during a vacation. Users may place constraints on individual items, and the compatibility of items within a package is based on global constraints placed on packages, like total distance or time to travel between locations in a package. Finding such packages using the traditional item-querying model requires users to review lists of possible multiple queries and assemble and compare packages manually. In this paper, we propose three algorithms for supporting such a package query model as a first class paradigm. Since package constraints may involve multiple criteria, several competing packages are possible. Therefore, we propose the idea of computing a skyline of package results as an extension to a popular query model for multi-criteria decision-making called skyline queries, which to date has only focused on computing item skylines. We formalize the semantics of the logical query operator, Sky-Package, and propose three algorithms for the physical operator implementation. A comparative evaluation of the algorithms over real world and synthetic-benchmark RDF datasets is provided.
PY - 2013///
DO - 10.1007/978-3-642-37996-3_4
SP - 49-64
OP -
PB - Springer Berlin Heidelberg
SN - 9783642379956 9783642379963
UR - http://dx.doi.org/10.1007/978-3-642-37996-3_4
DB - Crossref
ER -
TY - CONF
TI - Augmenting introductory computer science classes with GameMaker and mobile apps
AU - Barnes, Tiffany
AU - Boyce, Acey
AU - Catete, Veronica
AU - Doran, Katelyn
AU - Hicks, Andrew G
AU - Keller, Leslie
AB - Students often take computing classes because they are eager to create games, to learn to create meaningful and useful software, or both. Connecting computing to real, cutting-edge applications has been shown to increase engagement of women and minorities. The new CS Principles curriculum, a pilot Advanced Placement course, seeks to broaden the participation in computing to a larger and more diverse audience. This curriculum emphasizes that computing is a creative activity where people work together to solve relevant problems. In this workshop, we introduce free software and curricula to enable novice high school and college students in a first computing course to learn basic game and mobile phone development. We discuss how these activities facilitate teaching high school and non-major (CS0) course topics, but they can also be used to illustrate more advanced topics. Participants will learn GameMaker and mobile phone programming using AppInventor, and/or Touch Develop. These tools allow students to create and have fun with computing while teaching object-oriented and event-driven programming and game architectures. If possible, Windows 7 phones will be provided for use during the workshop. We will provide links to curricular modules for the CS Principles: Beauty and Joy of Computing course, as well as links to the GameMaker, AppInventor, and Touch Develop platforms and tutorials. Participants must bring a network-connected laptop with a modern browser, and the latest version of Java (ideally with AppInventor installed), and may optionally bring an Android or Windows 7 phone.
C2 - 2013///
C3 - Proceeding of the 44th ACM technical symposium on Computer science education
DA - 2013///
DO - 10.1145/2445196.2445532
SP - 767-767
ER -
TY - JOUR
TI - Modeling and Algorithms for QoS-Aware Service Composition in Virtualization-Based Cloud Computing
T2 - IEICE Transactions on Communications
AB - Cloud computing is an emerging computing paradigm that may have a significant impact on various aspects of the development of information infrastructure. In a Cloud environment, different types of network resources need to be virtualized as a series of service components by network virtualization, and these service components should be further composed into Cloud services provided to end users. Therefore Quality of Service (QoS) aware service composition plays a crucial role in Cloud service provisioning. This paper addresses the problem on how to compose a sequence of service components for QoS guaranteed service provisioning in a virtualization-based Cloud computing environment. The contributions of this paper include a system model for Cloud service provisioning and two approximation algorithms for QoS-aware service composition. Specifically, a system model is first developed to characterize service provisioning behavior in virtualization-based Cloud computing, then a novel approximation algorithm and a variant of a well-known QoS routing procedure are presented to resolve QoS-aware service composition. Theoretical analysis shows that these two algorithms have the same level of time complexity. Comparison study conducted based on simulation experiments indicates that the proposed novel algorithm achieves better performance in time efficiency and scalability without compromising quality of solution. The modeling technique and algorithms developed in this paper are general and effective; thus are applicable to practical Cloud computing systems.
DA - 2013///
PY - 2013///
DO - 10.1587/transcom.e96.b.10
UR - http://dx.doi.org/10.1587/transcom.e96.b.10
KW - cloud service provisioning
KW - network virtualization
KW - quality of service
KW - service composition
KW - approximation algorithm
ER -
TY - JOUR
TI - An integer programming approach for the view and index selection problem
AU - Asgharzadeh Talebi, Zohreh
AU - Chirkova, Rada
AU - Fathi, Yahya
T2 - Data & Knowledge Engineering
AB - The view- and index-selection problem is a combinatorial optimization problem that arises in the context of on-line analytical processing (OLAP) in database-management systems. We propose an integer programming (IP) model for this problem and study the properties of the views and indexes that appear in the optimal solution for this model. We then use these properties to remove a number of variables and constraints from the corresponding IP model and obtain a model that is significantly smaller, yet its optimal solution is guaranteed to be optimal for the original problem. This allows us to solve realistic-size instances of the problem in reasonable time using commercial IP solvers. Subsequently, we propose heuristic strategies to further reduce the size of this IP model and dramatically reduce its execution time, although we no longer guarantee that the reduced IP model offers a globally optimal solution for the original problem. Finally, we carry out an extensive computational study to evaluate the effectiveness of these IP models for solving the OLAP view- and index-selection problem.
DA - 2013/1//
PY - 2013/1//
DO - 10.1016/j.datak.2012.11.001
VL - 83
SP - 111-125
J2 - Data & Knowledge Engineering
LA - en
OP -
SN - 0169-023X
UR - http://dx.doi.org/10.1016/j.datak.2012.11.001
DB - Crossref
KW - Business intelligence
KW - Data warehouse and repository
KW - OLAP
KW - Materialized views
KW - View and index selection
KW - Integer programming
KW - Heuristics
ER -
TY - JOUR
TI - Query optimization in information integration
AU - Chen, Dongfeng
AU - Chirkova, Rada
AU - Sadri, Fereidoon
AU - Salo, Tiia J.
T2 - Acta Informatica
DA - 2013/4/9/
PY - 2013/4/9/
DO - 10.1007/S00236-013-0179-1
VL - 50
IS - 4
SP - 257-287
J2 - Acta Informatica
LA - en
OP -
SN - 0001-5903 1432-0525
UR - http://dx.doi.org/10.1007/S00236-013-0179-1
DB - Crossref
ER -
TY - CHAP
TI - Two-Stage Stochastic View Selection for Data-Analysis Queries
AU - Huang, Rong
AU - Chirkova, Rada
AU - Fathi, Yahya
T2 - Advances in Intelligent Systems and Computing
AB - We consider the problem of selecting an optimal set of views to answer a given collection of queries at the present time (stage 1) as well as several collections of queries in the future (stage 2), with a given probability of occurrence associated with each collection, so as to minimize the expected value of the corresponding query response time, while keeping the total size of the views within a given limit. We formulate this problem as a two-stage stochastic programming problem. We show that this model is equivalent to an integer programming (IP) model that can be solved via various commercial IP solvers. We also study the relationship between the queries and the views in this context and use this relationship to reduce the size of the corresponding IP model, hence increase the scalability of our proposed approach.
PY - 2013///
DO - 10.1007/978-3-642-32741-4_11
SP - 115-123
OP -
PB - Springer Berlin Heidelberg
SN - 9783642327407 9783642327414
UR - http://dx.doi.org/10.1007/978-3-642-32741-4_11
DB - Crossref
ER -
TY - CHAP
TI - Activity Video Analysis via Operator-Based Local Embedding
AU - Bian, Xiao
AU - Krim, Hamid
T2 - Lecture Notes in Computer Science
AB - High dimensional data sequences, such as video clips, can be modeled as trajectories in a high dimensional space, and usually exhibit a low dimensional structure intrinsic to each distinct class of data sequence [1]. In this paper, we proposed a novel geometric framework to investigate the temporal relations as well as spatial features in a video sequence. Important visual features are preserved by mapping a high dimensional video sequence to operators in a circulant operator space (image operator space). The corresponding operator sequence is subsequently embedded into a low dimensional space, in which the temporal dynamics of each sequence is well preserved. In addition, an algorithm for human activity video classification is implemented by employing Markov models in the low dimensional embedding space, and illustrating examples and classification performance are presented.
PY - 2013///
DO - 10.1007/978-3-642-40020-9_95
SP - 845-852
OP -
PB - Springer Berlin Heidelberg
SN - 9783642400193 9783642400209
UR - http://dx.doi.org/10.1007/978-3-642-40020-9_95
DB - Crossref
ER -
TY - CHAP
TI - A Subspace Learning of Dynamics on a Shape Manifold: A Generative Modeling Approach
AU - Yi, Sheng
AU - Krim, Hamid
T2 - Lecture Notes in Computer Science
AB - In this paper, we propose a novel subspace learning of shape dynamics. In comparison with the previous works, our method is invertible and better characterises the nonlinear geometry of a shape manifold while being computationally more efficient. In this work, with 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 the starting frame). Given the parallelism of the frame and ensured by a Levi-Civita connection, 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.
PY - 2013///
DO - 10.1007/978-3-642-40020-9_8
SP - 84-91
OP -
PB - Springer Berlin Heidelberg
SN - 9783642400193 9783642400209
UR - http://dx.doi.org/10.1007/978-3-642-40020-9_8
DB - Crossref
ER -
TY - CHAP
TI - Towards Minimal Barcodes
AU - González-Díaz, Rocío
AU - Jiménez, María-José
AU - Krim, Hamid
T2 - Graph-Based Representations in Pattern Recognition
AB - In the setting of persistent homology computation, a useful tool is the persistence barcode representation in which pairs of birth and death times of homology classes are encoded in the form of intervals. Starting from a polyhedral complex K (an object subdivided into cells which are polytopes) and an initial order of the set of vertices, we are concerned with the general problem of searching for filters (an order of the rest of the cells) that provide a minimal barcode representation in the sense of having minimal number of “k-significant” intervals, which correspond to homology classes with life-times longer than a fixed number k. As a first step, in this paper we provide an algorithm for computing such a filter for k = 1 on the Hasse diagram of the poset of faces of K.
PY - 2013///
DO - 10.1007/978-3-642-38221-5_20
SP - 184-193
OP -
PB - Springer Berlin Heidelberg
SN - 9783642382208 9783642382215
UR - http://dx.doi.org/10.1007/978-3-642-38221-5_20
DB - Crossref
ER -
TY - CHAP
TI - Optimal Operator Space Pursuit: A Framework for Video Sequence Data Analysis
AU - Bian, Xiao
AU - Krim, Hamid
T2 - Computer Vision – ACCV 2012
AB - High dimensional data sequences, such as video clips, can be modeled as trajectories in a high dimensional space and, and usually exhibit a low dimensional structure intrinsic to each distinct class of data sequence [1]. In this paper, we exploit a fibre bundle formalism to model various realizations of each trajectory, and characterize these high dimensional data sequences by an optimal operator subspace. Each operator is calculated as a matched filter corresponding to a standard Gaussian output with the data as input. The low dimensional structure intrinsic to the data is further explored, by minimizing the dimension of the operator space under data driven constraints. The dimension minimization problem is reformulated as a convex nuclear norm minimization problem, and an associated algorithm is proposed. Moreover, a fast method with superior performance for video based human activity classification is implemented by searching for an optimal operator space and adapted to the data. Illustrating examples demonstrating the performance of this approach are presented.
PY - 2013///
DO - 10.1007/978-3-642-37444-9_59
SP - 760-769
OP -
PB - Springer Berlin Heidelberg
SN - 9783642374432 9783642374449
UR - http://dx.doi.org/10.1007/978-3-642-37444-9_59
DB - Crossref
ER -
TY - JOUR
TI - Understanding and Predicting Student Self-Regulated Learning Strategies in Game-Based Learning Environments
AU - Sabourin, Jennifer L.
AU - Shores, Lucy R.
AU - Mott, Bradford W.
AU - Lester, James C.
T2 - International Journal of Artificial Intelligence in Education
AB - Self-regulated learning behaviors such as goal setting and monitoring have been found to be crucial to students’ success in computer-based learning environments. Consequently, understanding students’ self-regulated learning behavior has been the subject of increasing attention. Unfortunately, monitoring these behaviors in real-time has proven challenging. This paper presents an initial investigation into self-regulated learning in a game-based learning environment. Evidence of goal setting and monitoring behaviors is examined through students’ text-based responses to update their ‘status’ in an in-game social network. Students are then classified into SRL-use categories. This article describes the methodology used to classify students and discusses analyses demonstrating the learning and gameplay behaviors across students in different SRL-use categories. Finally, machine learning models capable of predicting these classes early in students’ interaction are presented.
DA - 2013/10/22/
PY - 2013/10/22/
DO - 10.1007/S40593-013-0004-6
VL - 23
IS - 1-4
SP - 94-114
J2 - Int J Artif Intell Educ
LA - en
OP -
SN - 1560-4292 1560-4306
UR - http://dx.doi.org/10.1007/S40593-013-0004-6
DB - Crossref
KW - Self-regulated learning
KW - Metacognition
KW - Machine learning
ER -
TY - CHAP
TI - Personalizing Embedded Assessment Sequences in Narrative-Centered Learning Environments: A Collaborative Filtering Approach
AU - Min, Wookhee
AU - Rowe, Jonathan P.
AU - Mott, Bradford W.
AU - Lester, James C.
T2 - Lecture Notes in Computer Science
AB - A key challenge posed by narrative-centered learning environments is dynamically tailoring story events to individual students. This paper investigates techniques for sequencing story-centric embedded assessments—a particular type of story event that simultaneously evaluates a student’s knowledge and advances an interactive narrative’s plot—in narrative-centered learning environments. We present an approach for personalizing embedded assessment sequences that is based on collaborative filtering. We examine personalized event sequencing in an edition of the Crystal Island narrative-centered learning environment for literacy education. Using data from a multi-week classroom study with 850 students, we compare two model-based collaborative filtering methods, including probabilistic principal component analysis (PPCA) and non-negative matrix factorization (NMF), to a memory-based baseline model, k-nearest neighbor. Results suggest that PPCA provides the most accurate predictions on average, but NMF provides a better balance between accuracy and run-time efficiency for predicting student performance on story-centric embedded assessment sequences.
PY - 2013///
DO - 10.1007/978-3-642-39112-5_38
SP - 369-378
OP -
PB - Springer Berlin Heidelberg
SN - 9783642391118 9783642391125
UR - http://dx.doi.org/10.1007/978-3-642-39112-5_38
DB - Crossref
ER -
TY - CHAP
TI - Discovering Behavior Patterns of Self-Regulated Learners in an Inquiry-Based Learning Environment
AU - Sabourin, Jennifer
AU - Mott, Bradford
AU - Lester, James
T2 - Lecture Notes in Computer Science
AB - Inquiry-based learning has been proposed as a natural and authentic way for students to engage with science. Inquiry-based learning environments typically require students to guide their own learning and inquiry processes as they gather data, make and test hypotheses and draw conclusions. Some students are highly self-regulated learners and are able to guide and monitor their own learning activities effectively. Unfortunately, many students lack these skills and are consequently less successful in open-ended, inquiry-based environments. This work examines differences in inquiry behavior patterns in an open-ended, game-based learning environment, Crystal Island. Differential sequence mining is used to identify meaningful behavior patterns utilized by Low, Medium, and High self-regulated learners. Results indicate that self-regulated learners engage in more effective problem solving behaviors and demonstrate different patterns of use of the provided cognitive tools. The identified patterns help provide further insight into the role of SRL in inquiry-based learning and inform future approaches for scaffolding.
PY - 2013///
DO - 10.1007/978-3-642-39112-5_22
SP - 209-218
OP -
PB - Springer Berlin Heidelberg
SN - 9783642391118 9783642391125
UR - http://dx.doi.org/10.1007/978-3-642-39112-5_22
DB - Crossref
ER -
TY - CHAP
TI - A Markov Decision Process Model of Tutorial Intervention in Task-Oriented Dialogue
AU - Mitchell, Christopher M.
AU - Boyer, Kristy Elizabeth
AU - Lester, James C.
T2 - Lecture Notes in Computer Science
AB - Designing dialogue systems that engage in rich tutorial dialogue has long been a goal of the intelligent tutoring systems community. A key challenge for these systems is determining when to intervene during student problem solving. Although intervention strategies have historically been hand-authored, utilizing machine learning to automatically acquire corpus-based intervention policies that maximize student learning holds great promise. To this end, this paper presents a Markov Decision Process (MDP) framework to learn an intervention policy capturing the most effective tutor turn-taking behaviors in a task-oriented learning environment with textual dialogue. The model and its learned policy highlight important design considerations, including maintaining tutor engagement during student problem solving and avoiding multiple consecutive interventions.
PY - 2013///
DO - 10.1007/978-3-642-39112-5_123
SP - 828-831
OP -
PB - Springer Berlin Heidelberg
SN - 9783642391118 9783642391125
UR - http://dx.doi.org/10.1007/978-3-642-39112-5_123
DB - Crossref
ER -
TY - CHAP
TI - Embodied Affect in Tutorial Dialogue: Student Gesture and Posture
AU - Grafsgaard, Joseph F.
AU - Wiggins, Joseph B.
AU - Boyer, Kristy Elizabeth
AU - Wiebe, Eric N.
AU - Lester, James C.
T2 - Lecture Notes in Computer Science
AB - Recent years have seen a growing recognition of the central role of affect and motivation in learning. In particular, nonverbal behaviors such as posture and gesture provide key channels signaling affective and motivational states. Developing a clear understanding of these mechanisms will inform the development of personalized learning environments that promote successful affective and motivational outcomes. This paper investigates posture and gesture in computer-mediated tutorial dialogue using automated techniques to track posture and hand-to-face gestures. Annotated dialogue transcripts were analyzed to identify the relationships between student posture, student gesture, and tutor and student dialogue. The results indicate that posture and hand-to-face gestures are significantly associated with particular tutorial dialogue moves. Additionally, two-hands-to-face gestures occurred significantly more frequently among students with low self-efficacy. The results shed light on the cognitive-affective mechanisms that underlie these nonverbal behaviors. Collectively, the findings provide insight into the interdependencies among tutorial dialogue, posture, and gesture, revealing a new avenue for automated tracking of embodied affect during learning.
PY - 2013///
DO - 10.1007/978-3-642-39112-5_1
SP - 1-10
OP -
PB - Springer Berlin Heidelberg
SN - 9783642391118 9783642391125
UR - http://dx.doi.org/10.1007/978-3-642-39112-5_1
DB - Crossref
ER -
TY - CHAP
TI - Utilizing Dynamic Bayes Nets to Improve Early Prediction Models of Self-regulated Learning
AU - Sabourin, Jennifer
AU - Mott, Bradford
AU - Lester, James
T2 - User Modeling, Adaptation, and Personalization
AB - Student engagement and motivation during learning activities is tied to better learning behaviors and outcomes and has prompted the development of learner-guided environments. These systems attempt to personalize learning by allowing students to select their own tasks and activities. However, recent evidence suggests that not all students are equally capable of guiding their own learning. Some students are highly self-regulated learners and are able to select learning goals, identify appropriate tasks and activities to achieve these goals and monitor their progress resulting in improved learning and motivational benefits over traditional learning tasks. Students who lack these skills are markedly less successful in self-guided learning environments and require additional scaffolding to be able to navigate them successfully. Prior work has examined these phenomena within the learner-guided environment, Crystal Island, and identified the need for early prediction of students’ self-regulated learning abilities. This work builds upon these findings and presents a dynamic Bayesian approach that significantly improves the classification accuracy of student self-regulated learning skills.
PY - 2013///
DO - 10.1007/978-3-642-38844-6_19
SP - 228-241
OP -
PB - Springer Berlin Heidelberg
SN - 9783642388439 9783642388446
UR - http://dx.doi.org/10.1007/978-3-642-38844-6_19
DB - Crossref
ER -
TY - CHAP
TI - Math Fluency through Game Design
AU - Eugene, Wanda
AU - Barnes, Tiffany
AU - Wilson, Jennifer
T2 - Design, User Experience, and Usability. Health, Learning, Playing, Cultural, and Cross-Cultural User Experience
AB - Our goal in this research is to create a comprehensive framework establishing guidelines for the design of math fluency games for adult learners. Our user-centered design approach consisted of focus groups with students, faculty, and administrators from a two-year and a four-year institution to probe more deeply into the ways students perceive the value of math in everyday activities. Using our comprehensive focus group protocol, we evaluated users’ perception and understanding of culture-based mathematics to determine value-laden game designs that will promote math fluency among developmental math students. During these sessions, we collected quantitative and qualitative data in the form of survey data, play-test data, and field notes. The data speak to various issues such as games as a learning tool, interests and mismatches between designers and the target audience. Moving forward, our research will provide future directions for defining holistic usability by integrating user-centered design and game design.
PY - 2013///
DO - 10.1007/978-3-642-39241-2_22
SP - 189-198
OP -
PB - Springer Berlin Heidelberg
SN - 9783642392405 9783642392412
UR - http://dx.doi.org/10.1007/978-3-642-39241-2_22
DB - Crossref
ER -
TY - CHAP
TI - Formative Feedback in Interactive Learning Environments
AU - Goldin, Ilya M.
AU - Martin, Taylor
AU - Baker, Ryan
AU - Aleven, Vincent
AU - Barnes, Tiffany
T2 - Lecture Notes in Computer Science
AB - Educators and researchers have long recognized the importance of formative feedback for learning. Formative feedback helps learners understand where they are in a learning process, what the goal is, and how to reach that goal. While experimental and observational research has illuminated many aspects of feedback, modern interactive learning environments provide new tools to understand feedback and its relation to various learning outcomes.
PY - 2013///
DO - 10.1007/978-3-642-39112-5_158
SP - 946-946
OP -
PB - Springer Berlin Heidelberg
SN - 9783642391118 9783642391125
UR - http://dx.doi.org/10.1007/978-3-642-39112-5_158
DB - Crossref
ER -
TY - CHAP
TI - Hypergeometric Identities Associated with Statistics on Words
AU - Andrews, George E.
AU - Savage, Carla D.
AU - Wilf, Herbert S.
T2 - Advances in Combinatorics
PY - 2013///
DO - 10.1007/978-3-642-30979-3_4
SP - 77-100
OP -
PB - Springer Berlin Heidelberg
SN - 9783642309786 9783642309793
UR - http://dx.doi.org/10.1007/978-3-642-30979-3_4
DB - Crossref
ER -
TY - JOUR
TI - Studying the effect of a competitive game show in a learning by teaching environment
AU - Matsuda, N.
AU - Yarzebinski, E.
AU - Keiser, V.
AU - Raizada, R.
AU - Stylianides, G.J.
AU - Koedinger, K.R.
T2 - International Journal of Artificial Intelligence in Education
AB - In this paper we investigate how competition among tutees in the context of learning by teaching affects tutors’ engagement as well as tutor learning. We conducted this investigation by incorporating a competitive Game Show feature into an online learning environment where students learn to solve algebraic equations by teaching a synthetic peer, called SimStudent. In the Game Show, pairs of SimStudents trained by students beforehand competed against each other by solving challenging problems to attain higher ratings. The results of a classroom study with 141 7th through 9th grade students showed the following: (1) Students improved their proficiency to solve equations after teaching SimStudent, but there was no observed improvement in their conceptual understanding. (2) Overall, the competitive Game Show promoted students’ extrinsic and intrinsic motivations—when the competitive Game Show was available, students’ engagement in tutoring (intrinsic motivation) was increased; students who arguably had a higher desire to win strategically selected opponents with lower proficiency for an easy win (extrinsic motivation). (3) The availability of the competitive Game Show did not affect tutor learning; there was no notable correlation between students’ motivation (intrinsic or extrinsic) and tutor learning. Based on these findings, we propose design improvements to increase tutor learning.
DA - 2013///
PY - 2013///
DO - 10.1007/s40593-013-0009-1
VL - 23
IS - 1-4
SP - 1-21
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84902484678&partnerID=MN8TOARS
KW - Learning by teaching
KW - Teachable agent
KW - Motivation and engagement
KW - SimStudent
KW - Algebra
ER -
TY - CONF
TI - Toward a reflective SimStudent: Using experience to avoid generalization errors
AU - MacLellan, C.J.
AU - Matsuda, N.
AU - Koedinger, K.R.
C2 - 2013///
C3 - CEUR Workshop Proceedings
DA - 2013///
VL - 1009
SP - 51-60
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84924980730&partnerID=MN8TOARS
ER -
TY - CONF
TI - Impact of prior knowledge and teaching strategies on learning by teaching
AU - Rodrigo, Ma.M.T.
AU - Ong, A.
AU - Bringula, R.
AU - Basa, R.S.
AU - Dela Cruz, C.
AU - Matsuda, N.
C2 - 2013///
C3 - CEUR Workshop Proceedings
DA - 2013///
VL - 1009
SP - 71-80
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84924982067&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Cognitive anatomy of tutor learning: Lessons learned with SimStudent.
AU - Matsuda, Noboru
AU - Yarzebinski, Evelyn
AU - Keiser, Victoria
AU - Raizada, Rohan
AU - Cohen, William W.
AU - Stylianides, Gabriel J.
AU - Koedinger, Kenneth R.
T2 - Journal of Educational Psychology
AB - This article describes an advanced learning technology used to investigate hypotheses about learning by teaching. The proposed technology is an instance of a teachable agent, called SimStudent, that learns skills (e.g., for solving linear equations) from examples and from feedback on performance. SimStudent has been integrated into an online, gamelike environment in which students act as “tutors” and can interactively teach SimStudent by providing it with examples and feedback. We conducted 3 classroom “in vivo” studies to better understand how and when students learn (or fail to learn) by teaching. One of the strengths of interactive technologies is their ability to collect detailed process data on the nature and timing of student activities. The primary purpose of this article is to provide an in-depth analysis across 3 studies to understand the underlying cognitive and social factors that contribute to tutor learning by making connections between outcome and process data. The results show several key cognitive and social factors that are correlated with tutor learning. The accuracy of students’ responses (i.e., feedback and hints), the quality of students’ explanations during tutoring, and the appropriateness of tutoring strategy (i.e., problem selection) all positively affected SimStudent’s learning, which further positively affected students’ learning. The results suggest that implementing adaptive help for students on how to tutor and solve problems is a crucial component for successful learning by teaching.
DA - 2013///
PY - 2013///
DO - 10.1037/a0031955
VL - 105
IS - 4
SP - 1152-1163
J2 - Journal of Educational Psychology
LA - en
OP -
SN - 1939-2176 0022-0663
UR - http://dx.doi.org/10.1037/a0031955
DB - Crossref
KW - learning by teaching
KW - machine learning
KW - SimStudent
KW - teachable agent
KW - tutor learning
ER -
TY - JOUR
TI - Adiabatic quantum programming: minor embedding with hard faults
AU - Klymko, Christine
AU - Sullivan, Blair D.
AU - Humble, Travis 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 - 2013/11/20/
PY - 2013/11/20/
DO - 10.1007/S11128-013-0683-9
VL - 13
IS - 3
SP - 709-729
J2 - Quantum Inf Process
LA - en
OP -
SN - 1570-0755 1573-1332
UR - http://dx.doi.org/10.1007/S11128-013-0683-9
DB - Crossref
KW - Quantum computing
KW - Adiabatic quantum optimization
KW - Graph embedding
KW - Fault-tolerant computing
ER -
TY - CHAP
TI - Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity
AU - Adcock, Aaron B.
AU - Sullivan, Blair D.
AU - Hernandez, Oscar R.
AU - Mahoney, Michael W.
T2 - OpenMP in the Era of Low Power Devices and Accelerators
AB - We describe using OpenMP to compute δ-hyperbolicity, a quantity of interest in social and information network analysis, at a scale that uses up to 1000 threads. By considering both OpenMP workshare and tasking models to parallelize the computations, we find that multiple task levels permits finer grained tasks at runtime and results in better performance at scale than worksharing constructs. We also characterize effects of task inflation, load balancing, and scheduling overhead in this application, using both GNU and Intel compilers. Finally, we show how OpenMP 3.1 tasking clauses can be used to mitigate overheads at scale.
PY - 2013///
DO - 10.1007/978-3-642-40698-0_6
VL - 8122 LNCS
SP - 71-83
OP -
PB - Springer Berlin Heidelberg
SN - 9783642406973 9783642406980
UR - http://dx.doi.org/10.1007/978-3-642-40698-0_6
DB - Crossref
ER -
TY - JOUR
TI - Linear-Size Approximations to the Vietoris–Rips Filtration
AU - Sheehy, Donald R.
T2 - Discrete & Computational Geometry
AB - The Vietoris–Rips filtration is a versatile tool in topological data analysis. It is a sequence of simplicial complexes built on a metric space to add topological structure to an otherwise disconnected set of points. It is widely used because it encodes useful information about the topology of the underlying metric space. This information is often extracted from its so-called persistence diagram. Unfortunately, this filtration is often too large to construct in full. We show how to construct an $$O(n)$$ -size filtered simplicial complex on an $$n$$ -point metric space such that its persistence diagram is a good approximation to that of the Vietoris–Rips filtration. This new filtration can be constructed in $$O(n\log n)$$ time. The constant factors in both the size and the running time depend only on the doubling dimension of the metric space and the desired tightness of the approximation. For the first time, this makes it computationally tractable to approximate the persistence diagram of the Vietoris–Rips filtration across all scales for large data sets. We describe two different sparse filtrations. The first is a zigzag filtration that removes points as the scale increases. The second is a (non-zigzag) filtration that yields the same persistence diagram. Both methods are based on a hierarchical net-tree and yield the same guarantees.
DA - 2013/5/25/
PY - 2013/5/25/
DO - 10.1007/s00454-013-9513-1
VL - 49
IS - 4
SP - 778-796
J2 - Discrete Comput Geom
LA - en
OP -
SN - 0179-5376 1432-0444
UR - http://dx.doi.org/10.1007/s00454-013-9513-1
DB - Crossref
KW - Persistent Homology
KW - Vietoris-Rips filtration
KW - Net-trees
ER -
TY - CONF
TI - Zigzag zoology
AU - Oudot, Steve Y.
AU - Sheehy, Donald R.
T2 - the 29th annual symposium
AB - For 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. 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 (non-zigzag) 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. We give methods for reversing arrows and removing spaces from a zigzag while controlling the changes occurring in its barcode. We also discuss factoring zigzags and a kind of interleaving of two zigzags that allows their barcodes to be compared. 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.
C2 - 2013///
C3 - Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13
DA - 2013///
DO - 10.1145/2462356.2462371
PB - ACM Press
SN - 9781450320313
UR - http://dx.doi.org/10.1145/2462356.2462371
DB - Crossref
ER -
TY - CONF
TI - A fast algorithm for well-spaced points and approximate delaunay graphs
AU - Miller, Gary L.
AU - Sheehy, Donald R.
AU - Velingker, Ameya
T2 - the 29th annual symposium
AB - We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time O(2O(d)(n log n + m)), where n is the input size, m is the output point set size, and d is the ambient dimension. The constants only depend on the desired element quality bounds.
C2 - 2013///
C3 - Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13
DA - 2013///
DO - 10.1145/2462356.2462404
PB - ACM Press
SN - 9781450320313
UR - http://dx.doi.org/10.1145/2462356.2462404
DB - Crossref
ER -
TY - CONF
TI - A new approach to output-sensitive voronoi diagrams and delaunay triangulations
AU - Miller, Gary L.
AU - Sheehy, Donald R.
T2 - the 29th annual symposium
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 Δ) where f is the output complexity of the Voronoi diagram and Δ 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.
C2 - 2013///
C3 - Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13
DA - 2013///
DO - 10.1145/2462356.2462372
PB - ACM Press
SN - 9781450320313
UR - http://dx.doi.org/10.1145/2462356.2462372
DB - Crossref
ER -
TY - JOUR
TI - Profmig: A framework for flexible migration of program profiles across software versions
AU - Zhou, Mingzhou
AU - Wu, Bo
AU - Ding, Yufei
AU - Shen, Xipeng
T2 - Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
AB - Offline program profiling is costly, especially when software update is frequent. In this paper, we initiate a systematic exploration in cross-version program profile migration, which tries to effectively reuse the valid part of the behavior profiles of an old version of a software for a new version. We explore the effects imposed on profile reusability by the various factors in program behaviors, profile formats, and impact analysis, and introduce ProfMig, a framework for flexible migrations of various profiles. We demonstrate the effectiveness of the techniques on migrating loop trip-count profiles and dynamic call graphs. The migration saves significant (48-67% on average) profiling time with less than 10% accuracy compromised for most programs.
DA - 2013/2//
PY - 2013/2//
DO - 10.1109/cgo.2013.6494984
ER -
TY - CONF
TI - Exploring Hybrid Memory for GPU Energy Efficiency through Software-Hardware Co-Design
AU - Wang, Bin
AU - Wu, Bo
AU - Li, Dong
AU - Shen, Xipeng
AU - Yu, Weikuan
AU - Jiao, Yizheng
AU - Vetter, Jeffrey
T2 - PACT
AB - Hybrid memory designs, such as DRAM plus Phase Change Memory (PCM), have shown some promise for alleviating power and density issues faced by traditional memory systems. But previous studies have concentrated on CPU systems with a modest level of parallelism. This work studies the problem in a massively parallel setting. Specifically, it investigates the special implications to hybrid memory imposed by the massive parallelism in GPU. It empirically shows that, contrary to promising results demonstrated for CPU, previous designs of PCM-based hybrid memory result in significant degradation to the energy efficiency of GPU. It reveals that the fundamental reason comes from a multi-facet mismatch between those designs and the massive parallelism in GPU. It presents a solution that centers around a close cooperation between compiler-directed data placement and hardware-assisted runtime adaptation. The co-design approach helps tap into the full potential of hybrid memory for GPU without requiring dramatic hardware changes over previous designs, yielding 6% and 49% energy saving on average compared to pure DRAM and pure PCM respectively, and keeping performance loss less than 2%.
C2 - 2013///
C3 - Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques
CY - Edinburgh, Scotland
DA - 2013///
PY - 2013/9/7/
DO - 10.1109/pact.2013.6618807
PB - IEEE
ER -
TY - CONF
TI - Platys: User-centric place recognition
AU - Hang, C.-W.
AU - Murukannaiah, P.K.
AU - Singh, M.P.
C2 - 2013///
C3 - AAAI Workshop - Technical Report
DA - 2013///
VL - WS-13-05
SP - 14-20
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84898908253&partnerID=MN8TOARS
ER -
TY - CONF
TI - Monitoring commitments in people-driven service engagements
AU - Kalia, A.K.
AU - Motahari-Nezhad, H.R.
AU - Bartolini, C.
AU - Singh, M.P.
AB - People-driven service engagements involve communication over channels such as chat and email. Such engagements should be understood at the level of the commitments that the participants create and manipulate. Doing so provides a grounding for the communications and yields a business-level accounting of the progress of a service engagement. Existing work on commitment-based service engagements is limited to design-time model creation and verification. In contrast, we present a novel approach for capturing commitment-based engagements that are created dynamically in conversations. We monitor commitments identifying their creation, delegation, completion, or cancellation in the conversations. We have developed a prototype and evaluated it on real-world chat and email datasets. Our prototype captures commitments with a high F-measure of 90% in emails (Enron email corpus) and 80% in chats (HP IT support chat dataset) and provides promising results for capturing additional commitment operations.
C2 - 2013///
C3 - Proceedings - IEEE 10th International Conference on Services Computing, SCC 2013
DA - 2013///
DO - 10.1109/SCC.2013.62
SP - 160-167
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891910428&partnerID=MN8TOARS
ER -
TY - CONF
TI - Macau: A basis for evaluating reputation systems
AU - Hazard, C.J.
AU - Singh, M.P.
C2 - 2013///
C3 - IJCAI International Joint Conference on Artificial Intelligence
DA - 2013///
SP - 191-197
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896061643&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
AU - Yu, P.S.
AU - Singh, M.P.
AU - Cao, L.
AU - Zeng, Y.
AU - Symeonidis, A.L.
AU - Gorodetsky, V.
DA - 2013///
PY - 2013///
VL - 7607 LNAI
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84873816963&partnerID=MN8TOARS
ER -
TY - CONF
TI - Hierarchical planning about goals and commitments
AU - Telang, P.R.
AU - Meneguzzi, F.
AU - Singh, M.P.
C2 - 2013///
C3 - 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013
DA - 2013///
VL - 2
SP - 877-884
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899450331&partnerID=MN8TOARS
ER -
TY - CONF
TI - Evolving protocols and agents in multiagent systems
AU - Gerard, S.N.
AU - Singh, M.P.
C2 - 2013///
C3 - 12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013
DA - 2013///
VL - 2
SP - 997-1004
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84899458246&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Identifying business tasks and commitments from email and chat conversations
AU - Kalia, A.
AU - Nezhad, H.R.M.
AU - Bartolini, C.
AU - Singh, M.
T2 - HP Laboratories Technical Report
DA - 2013///
PY - 2013///
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84874818269&partnerID=MN8TOARS
ER -
TY - BOOK
TI - Can't we all just get along? Agreement technologies and the science of security
AU - Singh, M.P.
AB - The science of security has been garnering much attention among researchers and practitioners tired of the ad hoc nature of much of existing work on cybersecurity. I motivate the science of security as an application area for agreement technologies, surveying some key challenges and foundational agreement technologies that provide the relevant representations and reasoning techniques.
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-39860-5_1
VL - 8068 LNAI
SE - 1-3
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84881128894&partnerID=MN8TOARS
ER -
TY - CONF
TI - Adaptive process execution in a service cloud: Service selection and scheduling based on machine learning
AU - Kang, D.S.
AU - Liu, H.
AU - Singh, M.P.
AU - Sun, T.
AB - Given a process specification, it is a complex task to dynamically select constituent services and compose them in an execution plan to satisfy users' non-functional preferences. Process scheduling approaches assume users can clearly specify their non-functional preferences and there are formulas (e.g., utility functions) to compute process level QoS from the QoS of constituent services and their connections. However, these assumptions are not always true. Users' preferences can be subjective, implicit, vague, mixed and different for various types of processes. Besides, not all the preferences for example easy-to-use can be computed using formulas. We proposed a machine learning based approach to evolutionarily learn user preferences according to their ratings on historical execution plans, recommend existing or generate new execution plans for business processes that adapt to user preferences.
C2 - 2013///
C3 - Proceedings - IEEE 20th International Conference on Web Services, ICWS 2013
DA - 2013///
DO - 10.1109/ICWS.2013.51
SP - 324-331
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891779162&partnerID=MN8TOARS
ER -
TY - CONF
TI - An argumentation-based approach to handling trust in distributed decision making
AU - Parsons, S.
AU - Sklar, E.
AU - Singh, M.
AU - Levitt, K.
AU - Rowe, J.
C2 - 2013///
C3 - AAAI Spring Symposium - Technical Report
DA - 2013///
VL - SS-13-07
SP - 66-71
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84883375594&partnerID=MN8TOARS
ER -
TY - CONF
TI - A first-order formalization of commitments and goals for planning
AU - Meneguzzi, F.
AU - Telang, P.R.
AU - Singh, M.P.
C2 - 2013///
C3 - Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013
DA - 2013///
SP - 697-703
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84893411920&partnerID=MN8TOARS
ER -
TY - CHAP
TI - Mechanics and mental change
AU - Doyle, J.
T2 - Evolution of Semantic Systems
PY - 2013///
DO - 10.1007/978-3-642-34997-3
SP - 127-150
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84948111228&partnerID=MN8TOARS
ER -
TY - CONF
TI - Integrating communication skills in data structures and algorithms courses
AU - Eberle, William
AU - Karro, John
AU - Lerner, Neal
AU - Stallmann, Matthias
T2 - IEEE
C2 - 2013///
C3 - 2013 IEEE Frontiers in Education Conference (FIE)
DA - 2013///
SP - 1503-1509
ER -
TY - CONF
TI - GSK: universally accessible graph sketching
AU - Balik, Suzanne P
AU - Mealin, Sean P
AU - Stallmann, Matthias F
AU - Rodman, Robert D
T2 - ACM
C2 - 2013///
C3 - Proceeding of the 44th ACM technical symposium on Computer science education
DA - 2013///
SP - 221-226
ER -
TY - JOUR
TI - Mechanics and Mental Change
AU - Doyle, Jon
T2 - Evolution of Semantic Systems
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-34997-3_7
SP - 127-150
ER -
TY - JOUR
TI - Knowledge-Assisted Ontology-Based Requirements Evolution
AU - Ghaisas, S.
AU - Ajmeri, N.
T2 - Managing Requirements Knowledge
DA - 2013///
PY - 2013///
DO - 10.1007/978-3-642-34419-0_7
SP - 143-167
ER -
TY - JOUR
TI - Agile requirements prioritization in large-scale outsourced system projects: An empirical study
AU - Daneva, Maya
AU - Veen, Egbert
AU - Amrit, Chintan
AU - Ghaisas, Smita
AU - Sikkel, Klaas
AU - Kumar, Ramesh
AU - Ajmeri, Nirav
AU - Ramteerthkar, Uday
AU - Wieringa, Roel
T2 - Journal of Systems and Software
AB - The application of agile practices for requirements prioritization in distributed and outsourced projects is a relatively recent trend. Hence, not all of its facets are well-understood. This exploratory study sets out to uncover the concepts that practitioners in a large software organization use in the prioritization process and the practices that they deem good. We seek to provide a rich analysis and a deep understanding of three cases in an exploratory study that was carried out in a large and mature company, widely recognized for its excellence and its engagement in outsourced software development. We used in-depth interviews for data collection and grounded theory techniques for data analysis. Our exploration efforts yielded the following findings: (i) understanding requirements dependencies is of paramount importance for the successful deployment of agile approaches in large outsourced projects. (ii) Next to business value, the most important prioritization criterion in the setting of outsourced large agile projects is risk. (iii) The software organization has developed a new artefact that seems to be a worthwhile contribution to agile software development in the large: ‘delivery stories’, which complement user stories with technical implications, effort estimation and associated risk. The delivery stories play a pivotal role in requirements prioritization. (iv) The vendor's domain knowledge is a key asset for setting up successful client-developer collaboration. (v) The use of agile prioritization practices depends on the type of project outsourcing arrangement. Our findings contribute to the empirical software engineering literature by bringing a rich analysis of cases in agile and distributed contexts, from a vendor's perspective. We also discuss the possible implications of the results for research and in practice.
DA - 2013///
PY - 2013///
DO - 10.1016/j.jss.2012.12.046
VL - 86
IS - 5
SP - 1333-1353
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84875238853&partnerID=MN8TOARS
KW - Agile requirements engineering
KW - Requirements prioritization
KW - Outsourced software development
KW - Requirements dependencies
KW - Large projects
KW - Distributed project management
KW - Qualitative research
KW - Case study
ER -
TY - CONF
TI - Sparse multivariate function recovery from values with noise and outlier errors
AU - Kaltofen, Erich L.
AU - Yang, Zhengfeng
T2 - the 38th international symposium
AB - Error-correcting decoding is generalized to multivariate sparse rational function recovery from evaluations that can be numerically inaccurate and where several evaluations can have severe errors ("outliers"). The generalization of the Berlekamp-Welch decoder to exact Cauchy interpolation of univariate rational functions from values with faults is by Kaltofen and Pernet in 2012. We give a different univariate solution based on structured linear algebra that yields a stable decoder with floating point arithmetic. Our multivariate polynomial and rational function interpolation algorithm combines Zippel's symbolic sparse polynomial interpolation technique [Ph.D. Thesis MIT 1979] with the numeric algorithm by Kaltofen, Yang, and Zhi [Proc. SNC 2007], and removes outliers ("cleans up data") through techniques from error correcting codes. Our multivariate algorithm can build a sparse model from a number of evaluations that is linear in the sparsity of the model.
C2 - 2013///
C3 - Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation - ISSAC '13
DA - 2013///
DO - 10.1145/2465506.2465524
PB - ACM Press
SN - 9781450320597
UR - http://dx.doi.org/10.1145/2465506.2465524
DB - Crossref
ER -
TY - CONF
TI - Presenting a new cascade structure for multiclass problems
AU - Behroozi, M.
AU - Boostani, R.
AB - Designing a robust and accurate classifier is one of the most important goals in the machine learning society. This issue becomes crucial in the case of multi-class problems. In this research, a new architecture of cascaded classifiers is proposed to handle multi-class tasks. The stages of the proposed cascade are broken into some sub-stages; each contains a number of classifiers. Here, LogitBoost is used as the base classifier due to its low sensitivity to the noisy samples. To assess the proposed method, other cascade structures are implemented and eleven datasets derived from UCI repository are selected as the benchmark. Experimental results imply on the effectiveness of the proposed cascade approach compared to LogitBoost as one of the most successful parallel ensemble structure.
C2 - 2013///
C3 - 2013 International Conference on Electronics, Computer and Computation, ICECCO 2013
DA - 2013///
DO - 10.1109/ICECCO.2013.6718261
SP - 192-195
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84894120576&partnerID=MN8TOARS
ER -
TY - CONF
TI - Teaching strategies when students have access to solution manuals
AU - Gehringer, Edward F.
AU - Peddycord III, Barry W.
T2 - ASEE 2013 Annual Conference and Exposition
C2 - 2013///
C3 - Proceedings of the ASEE 2013 Annual Conference and Exposition
CY - Atlanta, GA
DA - 2013///
PY - 2013/6/23/
ER -
TY - CONF
TI - Determining review coverage by extracting topic sentences using a graph-based clustering approach
AU - Ramachandran, Lakshmi
AU - Ravindran, Balaraman
AU - Gehringer, Edward F.
T2 - EDM 2013: Sixth International Conference on Educational Data Mining
C2 - 2013///
C3 - Proceedings of EDM 2013: Sixth International Conference on Educational Data Mining
CY - Memphis, TN
DA - 2013///
PY - 2013/7/6/
ER -
TY - CONF
TI - Graph-structures matching for review relevance identification
AU - Ramanchandran, Lakshmi
AU - Gehringer, Edward F.
T2 - TextGraphs-8: 2013 Workshop
C2 - 2013///
C3 - Proceedings of TextGraphs-8: 2013 Workshop
CY - Seattle, WA
DA - 2013///
PY - 2013/10//
ER -
TY - JOUR
TI - Experience with Online and Open-Web Exams
AU - Gehringer, Edward
AU - Peddycord III, Barry
T2 - Journal of Instructional Research
DA - 2013/5/18/
PY - 2013/5/18/
DO - 10.9743/jir.2013.2.12
VL - 2
SP - 10-18
J2 - JIR
OP -
SN - 2159-0281
UR - http://dx.doi.org/10.9743/jir.2013.2.12
DB - Crossref
ER -
TY - CONF
TI - The inverted-lecture model
AU - Gehringer, Edward F.
AU - Peddycord, Barry W., III
T2 - Proceeding of the 44th ACM technical symposium
AB - This paper reports on an experience in using the inverted-lecture model ("flipping the classroom") in computer architecture. The first author concurrently taught two courses in computer architecture. One of these courses was CSC/ECE 506: Architecture of Parallel Computers, an introductory Graduate-level course, taught via lecture both residentially and distance-ed. The other was the CSC 456: Computer Architecture and Multiprocessing, a senior-level undergraduate course which was "flipped." Students in the inverted-lecture class exhibited high levels of engagement. Their performance on exams was not quite up to the level of the students in the graduate class, but the difference was not wide. From this experience, we offer observations and suggestions about inverted classes in general.
C2 - 2013///
C3 - Proceeding of the 44th ACM technical symposium on Computer science education - SIGCSE '13
DA - 2013///
DO - 10.1145/2445196.2445343
PB - ACM Press
SN - 9781450318686
UR - http://dx.doi.org/10.1145/2445196.2445343
DB - Crossref
ER -
TY - JOUR
TI - Constructing next generation academic cloud services
AU - Vouk, M. A.
AU - Averitt, S. F.
AU - Dreher, P.
AU - Kekas, D. H.
AU - Kurth, A.
AU - Hoit, M. A.
AU - Mugge, P.
AU - Peeler, A.
AU - Schaffer, H. E.
AU - Sills, E. D.
AU - Stein, S.
AU - Streck, J.
AU - Thompson, J.
AU - Wright, D.
T2 - International Journal of Cloud Computing
AB - NC State University (NCSU) is embarked on an ambitious vision to change the paradigm for higher education and research by ‘virtualising’ its award-winning Centennial Campus (creating so called vCentennial). Centennial Campus is a small city made up of NCSU research, teaching and outreach facilities, entrepreneurs, academic entities, private firms, and government agencies. NCSU wants the ability to replicate services and functionality of this physical environment and its virtual avatars ‘anywhere, anytime’ in the world using a cloud of clouds computing platform. The initial operating system for this platform is NCSU’s open source Virtual Computing Laboratory (VCL) technology. This paper provides an overview of the vision and discusses several vCentennial pilot projects.
DA - 2013///
PY - 2013///
DO - 10.1504/ijcc.2013.055290
VL - 2
IS - 2/3
SP - 104-122
ER -
TY - BOOK
TI - Designing for network and service continuity in wireless mesh networks
AU - Pathak, P. H.
AU - Dutta, Rudra
AB - “Designing for Network and Service Continuity in Wireless Mesh Networks” describes performance predictability of the new wireless mesh network paradigm, and describes considerations in designing netwo
DA - 2013///
PY - 2013///
DO - 10.1007/978-1-4614-4627-9
PB - New York: Springer
ER -
TY - BOOK
TI - Computing for ordinary mortals
AU - St. Amant, R.
DA - 2013///
PY - 2013///
PB - New York, NY: Oxford University Press
ER -
TY - BOOK
TI - Android malware
AU - Jiang, X.
AU - Zhou, Y.
AB - Mobile devices, such as smart phones, have achieved computing and networking capabilities comparable to traditional personal computers. Their successful consumerization has also become a source of pai
DA - 2013///
PY - 2013///
DO - 10.1007/978-1-4614-7394-7
PB - New York: Springer
ER -
TY - CONF
TI - A generic high-performance method for deinterleaving scientific data
AU - Schendel, E. R.
AU - Harenberg, S.
AU - Tang, H. J.
AU - Vishwanath, V.
AU - Papka, M. E.
AU - Samatova, N. F.
AB - High-performance and energy-efficient data management applications are a necessity for HPC systems due to the extreme scale of data produced by high fidelity scientific simulations that these systems support. Data layout in memory hugely impacts the performance. For better performance, most simulations interleave variables in memory during their calculation phase, but deinterleave the data for subsequent storage and analysis. As a result, efficient data deinterleaving is critical; yet, common deinterleaving methods provide inefficient throughput and energy performance. To address this problem, we propose a deinterleaving method that is high performance, energy efficient, and generic to any data type. To the best of our knowledge, this is the first deinterleaving method that 1) exploits data cache prefetching, 2) reduces memory accesses, and 3) optimizes the use of complete cache line writes. When evaluated against conventional deinterleaving methods on 105 STREAM standard micro-benchmarks, our method always improved throughput and throughput/watt on multi-core systems. In the best case, our deinterleaving method improved throughput up to 26.2x and throughput/watt up to 7.8x.
C2 - 2013///
C3 - Euro-par 2013 parallel processing
DA - 2013///
DO - 10.1007/978-3-642-40047-6_58
VL - 8097
SP - 571-582
ER -
TY - JOUR
TI - SUMMARY VISUALIZATIONS FOR COASTAL SPATIAL-TEMPORAL DYNAMICS
AU - Thakur, Sidharth
AU - Tateosian, Laura
AU - Mitasova, Helena
AU - Hardin, Eric
AU - Overton, Margery
T2 - INTERNATIONAL JOURNAL FOR UNCERTAINTY QUANTIFICATION
AB - Digital scans of dynamic terrains such as coastal regions are now being gathered at high spatial and temporal resolution. Although standard tools based on geographic information systems (GIS) are indispensable for analyzing geospatial data, they have limited support to display time-dependent changes in data and information such as statistical distributions and uncertainty in data. We present a set of techniques for visually summarizing the dynamics of coastal dunes. We visualize summary statistics of important data attributes and risk or vulnerability indices as functions of both spatial and temporal dimensions in our data and represent uncertainty in the data set. We apply standard techniques, the space time cube and clustering, in novel ways to the domain of geomorphology. We combine surface-mapping and imagery with summary visualizations to retain important geographical context in the visualizations and reduce clutter due to direct plotting of statistical data in displays of geospatial information. We also address some issues pertaining to visualization of summary statistics for geographical regions at varying scales. We demonstrate visualization tools on time series of elevation models from the Outer Banks of North Carolina and observe temporal-spatial trends therein.
DA - 2013///
PY - 2013///
DO - 10.1615/int.j.uncertaintyquantification.2012003969
VL - 3
IS - 3
SP - 241-253
SN - 2152-5099
KW - uncertainty
KW - visualization
KW - geovisualization
KW - glyph-based visualization
KW - spatial-temporal analysis
KW - space-time cube
KW - coastal terrain
KW - geomorphology
KW - GRASS GIS
KW - Outer Banks
ER -
TY - JOUR
TI - Serious Games Get Smart: Intelligent Game-Based Learning Environments
AU - Lester, James C.
AU - Ha, Eun Y.
AU - Lee, Seung Y.
AU - Mott, Bradford W.
AU - Rowe, Jonathan P.
AU - Sabourin, Jennifer L.
T2 - AI MAGAZINE
AB - Intelligent game‐based learning environments integrate commercial game technologies with AI methods from intelligent tutoring systems and intelligent narrative technologies. This article introduces the Crystal Island intelligent game‐based learning environment, which has been under development in the authors' laboratory for the past seven years. After presenting Crystal Island, the principal technical problems of intelligent game‐based learning environments are discussed: narrative‐centered tutorial planning, student affect recognition, student knowledge modeling, and student goal recognition. Solutions to these problems are illustrated with research conducted with the Crystal Island learning environment
DA - 2013///
PY - 2013///
DO - 10.1609/aimag.v34i4.2488
VL - 34
IS - 4
SP - 31-45
SN - 0738-4602
ER -
TY - CONF
TI - Why don't software developers use static analysis tools to find bugs?
AU - Johnson, B.
AU - Song, Y.
AU - Murphy-Hill, E.
AU - Bowdidge, R.
AB - Using static analysis tools for automating code inspections can be beneficial for software engineers. Such tools can make finding bugs, or software defects, faster and cheaper than manual inspections. Despite the benefits of using static analysis tools to find bugs, research suggests that these tools are underused. In this paper, we investigate why developers are not widely using static analysis tools and how current tools could potentially be improved. We conducted interviews with 20 developers and found that although all of our participants felt that use is beneficial, false positives and the way in which the warnings are presented, among other things, are barriers to use. We discuss several implications of these results, such as the need for an interactive mechanism to help developers fix defects.
C2 - 2013///
C3 - Proceedings of the 35th International Conference on software engineering (ICSE 2013)
DA - 2013///
DO - 10.1109/icse.2013.6606613
SP - 672-681
ER -
TY - CONF
TI - The synergy of human and artificial intelligence in software engineering
AU - Xie, T.
AB - To reduce human efforts and burden on human intelligence in software-engineering activities, Artificial Intelligence (AI) techniques have been employed to assist or automate these activities. On the other hand, human's domain knowledge can serve as starting points for designing AI techniques. Furthermore, the results of AI techniques are often interpreted or verified by human users. Such user feedback could be incorporated to further improve the AI techniques, forming a continuous feedback loop. We recently proposed cooperative testing and analysis including human-tool cooperation (consisting of human-assisted computing and human-centric computing) and human-human cooperation. In this paper, we present example software-engineering problems with solutions that leverage the synergy of human and artificial intelligence, and illustrate how cooperative testing and analysis can help realize such synergy.
C2 - 2013///
C3 - International workshop on realizing artificial intelligence synergies in
DA - 2013///
DO - 10.1109/raise.2013.6615197
SP - 4-6
ER -
TY - CONF
TI - The design of bug fixes
AU - Murphy-Hill, E.
AU - Zimmermann, T.
AU - Bird, C.
AU - Nagappan, N.
AB - When software engineers fix bugs, they may have several options as to how to fix those bugs. Which fix they choose has many implications, both for practitioners and researchers: What is the risk of introducing other bugs during the fix? Is the bug fix in the same code that caused the bug? Is the change fixing the cause or just covering a symptom? In this paper, we investigate alternative fixes to bugs and present an empirical study of how engineers make design choices about how to fix bugs. Based on qualitative interviews with 40 engineers working on a variety of products, data from 6 bug triage meetings, and a survey filled out by 326 engineers, we found a number of factors, many of them non-technical, that influence how bugs are fixed, such as how close to release the software is. We also discuss several implications for research and practice, including ways to make bug prediction and localization more accurate.
C2 - 2013///
C3 - Proceedings of the 35th International Conference on software engineering (ICSE 2013)
DA - 2013///
DO - 10.1109/icse.2013.6606579
SP - 332-341
ER -
TY - CONF
TI - Real-time traffic congestion management and deadlock avoidance for vehicular ad hoc networks
AU - Hussain, S. R.
AU - Odeh, A.
AU - Shivakumar, A.
AU - Chauhan, S.
AU - Harfoush, K.
AB - Traffic congestion is common in heavily populated cities. In this paper, we introduce a novel protocol to guide vehicles to their destinations while managing congestion and avoiding deadlock situations in urban city grids. The protocol relies on vehicle-to-infrastructure (V2I) communication, infrastructure-to-infrastructure (I2I) communication as well as GPS information to disseminate congestion information to city grid intersections. Our proposal pro-actively aims at avoiding congestion scenarios and reacts to arising congestion in case it happens due to unpredictable events such as collisions. Simulation results reveal that vehicles enjoy reduced travel times even during rush hours and in the presence of collisions.
C2 - 2013///
C3 - 2013 10th International Conference on High Capacity Optical Networks and Enabling Technologies (HONET-CNS)
DA - 2013///
DO - 10.1109/honet.2013.6729791
SP - 223-227
ER -
TY - CONF
TI - Performance analysis of iSCSI with data center bridging suite of protocols
AU - Chaudhry, M.
AU - Malibiradar, P.
AU - Mathur, V.
AU - Chugh, R.
AU - Harfoush, K.
AB - Storage Area Networks (SAN) are the leading storage infrastructure in modern data centers. A traditional SAN deployment relies on the Fibre Channel Protocol (FCP) over an over-engineered and expensive Fibre Channel network to provide lossless communication and predictable performance. Alternatives were proposed to reduce the deployment cost: (1)iSCSI over Ethernet, and (2) Fibre Channel over Ethernet (FCoE). The former recovers from packet losses relying on the services of TCP in the TCP/IP stack, and the latter enjoys lossless transport using the Data Center Bridging (DCB) suite of protocols. Running iSCSI over existing IP networks is desirable as it is easier to implement and maintain. However, packet losses and TCP retransmissions in best effort IP networks, tend to make the performance of iSCSI non-deterministic. In this paper, we investigate the benefits of running iSCSI over DCB enhanced Ethernet as compared to iSCSI over traditional Ethernet to overcome its performance limitations.
C2 - 2013///
C3 - 2013 10th International Conference on High Capacity Optical Networks and Enabling Technologies (HONET-CNS)
DA - 2013///
DO - 10.1109/honet.2013.6729782
SP - 179-183
ER -
TY - CONF
TI - Novice understanding of program analysis tool notifications
AU - Johnson, B.
C2 - 2013///
C3 - Proceedings of the 35th International Conference on software engineering (ICSE 2013)
DA - 2013///
SP - 1432-1434
ER -
TY - CONF
TI - Measuring the Forensic-ability of Audit Logs for Nonrepudiation
AU - King, Jason
C2 - 2013///
C3 - Proceedings of the 2013 International Conference on Software Engineering
CY - Piscataway, NJ, USA
DA - 2013///
SP - 1419-1422
PB - IEEE Press
UR - http://dl.acm.org/citation.cfm?id=2486788.2487022
ER -
TY - CONF
TI - Implementing database access control policy from unconstrained natural language text
AU - Slankas, J.
AB - Although software can and does implement access control at the application layer, failure to enforce data access at the data layer often allows uncontrolled data access when individuals bypass application controls. The goal of this research is to improve security and compliance by ensuring access controls rules explicitly and implicitly defined within unconstrained natural language texts are appropriately enforced within a system's relational database. Access control implemented in both the application and data layers strongly supports a defense in depth strategy. We propose a tool-based process to 1) parse existing, unaltered natural language documents; 2) classify whether or not a statement implies access control and whether or not the statement implies database design; and, as appropriate, 3) extract policy elements; 4) extract database design; 5) map data objects found in the text to a database schema; and 6) automatically generate the necessary SQL commands to enable the database to enforce access control. Our initial studies of the first three steps indicate that we can effectively identify access control sentences and extract the relevant policy elements.
C2 - 2013///
C3 - Proceedings of the 35th International Conference on software engineering (ICSE 2013)
DA - 2013///
DO - 10.1109/icse.2013.6606716
SP - 1357-1360
ER -
TY - CONF
TI - Educational software engineering: Where software engineering, education, and gaming meet
AU - Xie, T.
AU - Tillmann, N.
AU - Halleux, J.
AB - We define and advocate the subfield of educational software engineering (i.e., software engineering for education), which develops software engineering technologies (e.g., software testing and analysis, software analytics) for general educational tasks, going beyond educational tasks for software engineering. In this subfield, gaming technologies often play an important role together with software engineering technologies. We expect that researchers in educational software engineering would be among key players in the education domain and in the coming age of Massive Open Online Courses (MOOCs). Educational software engineering can and will contribute significant solutions to address various critical challenges in education especially MOOCs such as automatic grading, intelligent tutoring, problem generation, and plagiarism detection. In this position paper, we define educational software engineering and illustrate Pex for Fun (in short as Pex4Fun), one of our recent examples on leveraging software engineering and gaming technologies to address educational tasks on teaching and learning programming and software engineering skills.
C2 - 2013///
C3 - 2013 3rd International Workshop on Games and Software Engineering: Engineering Computer Games to Enable Positive, Progressive Change (GAS)
DA - 2013///
DO - 10.1109/gas.2013.6632588
SP - 36-39
ER -
TY - JOUR
TI - Automatically Recognizing Facial Indicators of Frustration: A Learning-Centric Analysis
AU - Grafsgaard, Joseph F.
AU - Wiggins, Joseph B.
AU - Boyer, Kristy Elizabeth
AU - Wiebe, Eric N.
AU - Lester, James C.
T2 - 2013 HUMAINE ASSOCIATION CONFERENCE ON AFFECTIVE COMPUTING AND INTELLIGENT INTERACTION (ACII)
AB - Affective and cognitive processes form a rich substrate on which learning plays out. Affective states often influence progress on learning tasks, resulting in positive or negative cycles of affect that impact learning outcomes. Developing a detailed account of the occurrence and timing of cognitive-affective states during learning can inform the design of affective tutorial interventions. In order to advance understanding of learning-centered affect, this paper reports on a study to analyze a video corpus of computer-mediated human tutoring using an automated facial expression recognition tool that detects fine-grained facial movements. The results reveal three significant relationships between facial expression, frustration, and learning: (1) Action Unit 2 (outer brow raise) was negatively correlated with learning gain, (2) Action Unit 4 (brow lowering) was positively correlated with frustration, and (3) Action Unit 14 (mouth dimpling) was positively correlated with both frustration and learning gain. Additionally, early prediction models demonstrated that facial actions during the first five minutes were significantly predictive of frustration and learning at the end of the tutoring session. The results represent a step toward a deeper understanding of learning-centered affective states, which will form the foundation for data-driven design of affective tutoring systems.
DA - 2013///
PY - 2013///
DO - 10.1109/acii.2013.33
SP - 159-165
SN - 2156-8103
KW - affect
KW - frustration
KW - learning
KW - computer-mediated tutoring
KW - facial expression recognition
KW - facial action units
KW - intensity
ER -
TY - CONF
TI - A characteristic study on failures of production distributed data-parallel programs
AU - Li, S. H.
AU - Zhou, H. C.
AU - Lin, H. X.
AU - Xiao, T.
AU - Lin, H. B.
AU - Lin, W.
AU - Xie, T.
AB - SCOPE is adopted by thousands of developers from tens of different product teams in Microsoft Bing for daily web-scale data processing, including index building, search ranking, and advertisement display. A SCOPE job is composed of declarative SQL-like queries and imperative C# user-defined functions (UDFs), which are executed in pipeline by thousands of machines. There are tens of thousands of SCOPE jobs executed on Microsoft clusters per day, while some of them fail after a long execution time and thus waste tremendous resources. Reducing SCOPE failures would save significant resources. This paper presents a comprehensive characteristic study on 200 SCOPE failures/fixes and 50 SCOPE failures with debugging statistics from Microsoft Bing, investigating not only major failure types, failure sources, and fixes, but also current debugging practice. Our major findings include (1) most of the failures (84.5%) are caused by defects in data processing rather than defects in code logic; (2) table-level failures (22.5%) are mainly caused by programmers' mistakes and frequent data-schema changes while row-level failures (62%) are mainly caused by exceptional data; (3) 93% fixes do not change data processing logic; (4) there are 8% failures with root cause not at the failure-exposing stage, making current debugging practice insufficient in this case. Our study results provide valuable guidelines for future development of data-parallel programs. We believe that these guidelines are not limited to SCOPE, but can also be generalized to other similar data-parallel platforms.
C2 - 2013///
C3 - Proceedings of the 35th International Conference on software engineering (ICSE 2013)
DA - 2013///
DO - 10.1109/icse.2013.6606646
SP - 963-972
ER -
TY - CONF
TI - RSVM: A region-based software virtual memory for GPU
AU - Ji, F.
AU - Lin, H. S.
AU - Ma, X. S.
C2 - 2013///
C3 - International conference on parallel architectures and compilation
DA - 2013///
SP - 269-278
ER -
TY - CONF
TI - Proposing regulatory-driven automated test suites for electronic health record systems
AU - Morrison, P.
AU - Holmgreen, C.
AU - Massey, A.
AU - Williams, L.
AB - In regulated domains such as finance and health care, failure to comply with regulation can lead to financial, civil and criminal penalties. While systems vary from organization to organization, regulations apply across organizations. We propose the use of Behavior-Driven-Development (BDD) scenarios as the basis of an automated compliance test suite for standards such as regulation and interoperability. Such test suites could become a shared asset for use by all systems subject to these regulations and standards. Each system, then, need only create their own system-specific test driver code to automate their compliance checks. The goal of this research is to enable organizations to compare their systems to regulation in a repeatable and traceable way through the use of BDD. To evaluate our proposal, we developed an abbreviated HIPAA test suite and applied it to three open-source electronic health record systems. The scenarios covered all security behavior defined by the selected regulation. The system-specific test driver code covered all security behavior defined in the scenarios, and identified where the tested system lacked such behavior.
C2 - 2013///
C3 - 2013 5th international workshop on software engineering in health care (sehc)
DA - 2013///
DO - 10.1109/sehc.2013.6602477
SP - 46-49
ER -
TY - CONF
TI - Machine learning based posture estimation for a wireless canine machine interface
AU - Brugarolas, R.
AU - Roberts, D.
AU - Sherman, B.
AU - Bozkurt, A.
AB - Effective training and accurate interpretation of canine behaviors are essential for dog welfare and to obtain the maximum benefits provided by working dogs. We are developing a canine body area network based interface to incorporate electronic sensing and computational behavior modeling into canine training, where computers will be able to provide real time feedback to trainers about canine behavior. In this study, we investigated the accuracy of machine learning algorithms in identifying canine posture through wireless inertial sensing with 3-axis accelerometers and 3-axis gyroscopes. Data was collected from two dogs performing a sequence of 5 postures (sit, stand, lie, stand on two legs, and eat off the ground). A two-stage cascade learning technique was used: one for differentiating samples of behaviors of interest from transitions between behaviors, and one for posture classification of the behaviors. The algorithms achieved high posture classification accuracies demonstrating potential to enable a real time canine computer interface.
C2 - 2013///
C3 - Ieee topical conference on biomedical wireless technologies networks and
DA - 2013///
DO - 10.1109/biowireless.2013.6613658
SP - 10-12
ER -
TY - JOUR
TI - FChain: Toward Black-box Online Fault Localization for Cloud Systems
AU - Nguyen, Hiep
AU - Shen, Zhiming
AU - Tan, Yongmin
AU - Gu, Xiaohui
T2 - 2013 IEEE 33RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS)
AB - Distributed applications running inside cloud systems are prone to performance anomalies due to various reasons such as resource contentions, software bugs, and hardware failures. One big challenge for diagnosing an abnormal distributed application is to pinpoint the faulty components. In this paper, we present a black-box online fault localization system called FChain that can pinpoint faulty components immediately after a performance anomaly is detected. FChain first discovers the onset time of abnormal behaviors at different components by distinguishing the abnormal change point from many change points caused by normal workload fluctuations. Faulty components are then pinpointed based on the abnormal change propagation patterns and inter-component dependency relationships. FChain performs runtime validation to further filter out false alarms. We have implemented FChain on top of the Xen platform and tested it using several benchmark applications (RUBiS, Hadoop, and IBM System S). Our experimental results show that FChain can quickly pinpoint the faulty components with high accuracy within a few seconds. FChain can achieve up to 90% higher precision and 20% higher recall than existing schemes. FChain is non-intrusive and light-weight, which imposes less than 1% overhead to the cloud system.
DA - 2013///
PY - 2013///
DO - 10.1109/icdcs.2013.26
SP - 21-30
SN - 1063-6927
ER -
TY - CONF
TI - Dynamic adaptive anti-jamming via controlled mobility
AU - He, X. F.
AU - Dai, H. Y.
AU - Ning, P.
AB - In this work, 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 one intelligent mobile jammer 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.
C2 - 2013///
C3 - 2013 IEEE Conference on Communications and Network Security (CNS)
DA - 2013///
DO - 10.1109/cns.2013.6682686
SP - 1-9
ER -
TY - JOUR
TI - Coupled Heterogeneous Association Rule Mining (CHARM): Application toward Inference of Modulatory Climate Relationships
AU - Gonzalez, Doel L., II
AU - Pendse, Saurabh V.
AU - Padmanabhan, Kanchana
AU - Angus, Michael P.
AU - Tetteh, Isaac K.
AU - Srinivas, Shashank
AU - Villanes, Andrea
AU - Semazzi, Fredrick
AU - Kumar, Vipin
AU - Samatova, Nagiza F.
T2 - 2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM)
AB - The complex dynamic climate system often exhibits hierarchical modularity of its organization and function. Scientists have spent decades trying to discover and understand the driving mechanisms behind western African Sahel summer rainfall variability, mostly via hypothesis-driven and/or first-principles based research. Their work has furthered theory regarding the connections between various climate patterns, but the key relationships are still not fully understood. We present Coupled Heterogeneous Association Rule Mining (CHARM), a computationally efficient methodology that mines higher-order relationships between these subsystems' anomalous temporal phases with respect to their effect on the system's response. We apply this to climate science data, aiming to infer putative pathways/cascades of modulating events and the modulating signs that collectively define the network of pathways for the rainfall anomaly in the Sahel. Experimental results are consistent with fundamental theories of phenomena in climate science, especially physical processes that best describe sub-regional climate.
DA - 2013///
PY - 2013///
DO - 10.1109/icdm.2013.142
SP - 1055-1060
SN - 1550-4786
KW - association rules
KW - climate
KW - data coupling
KW - discovery
ER -
TY - CONF
TI - Converging choice and service in future commodity optical networks using traffic grooming
AU - Dutta, Rudra
AU - Rouskas, George
AU - Baldiney, I.
AB - The problem of providing an agile, energy-aware, flexible optical network architecture is one of the challenges in optical networking in the coming decade. A key element in this challenge is the balancing of the benefits to customer and provider, and creating an agile system capable of reflecting both provider and customer interests on an ongoing basis as network conditions change. In this paper, we articulate how the traditional optical networking research area of traffic grooming may be combined with recent advances in Internet architecture, specifically a proposed Future Internet architecture called ChoiceNet, and empowered by the recently emerged concept of software defined networking, to make some key contributions to this problem.
C2 - 2013///
C3 - 2013 15th international conference on transparent optical networks (icton 2013)
DA - 2013///
DO - 10.1109/icton.2013.6602954
ER -
TY - CONF
TI - Automated extraction of non-functional requirements in available documentation
AU - Slankas, J.
AU - Williams, L.
AB - While all systems have non-functional requirements (NFRs), they may not be explicitly stated in a formal requirements specification. Furthermore, NFRs may also be externally imposed via government regulations or industry standards. As some NFRs represent emergent system proprieties, those NFRs require appropriate analysis and design efforts to ensure they are met. When the specified NFRs are not met, projects incur costly re-work to correct the issues. The goal of our research is to aid analysts in more effectively extracting relevant non-functional requirements in available unconstrained natural language documents through automated natural language processing. Specifically, we examine which document types (data use agreements, install manuals, regulations, request for proposals, requirements specifications, and user manuals) contain NFRs categorized to 14 NFR categories (e.g. capacity, reliability, and security). We measure how effectively we can identify and classify NFR statements within these documents. In each of the documents evaluated, we found NFRs present. Using a word vector representation of the NFRs, a support vector machine algorithm performed twice as effectively compared to the same input to a multinomial naïve Bayes classifier. Our k-nearest neighbor classifier with a unique distance metric had an F1 measure of 0.54, outperforming in our experiments the optimal naïve Bayes classifier which had a F1 measure of 0.32. We also found that stop word lists beyond common determiners had no minimal performance effect.
C2 - 2013///
C3 - 2013 1st International Workshop on Natural Language Analysis in Software Engineering (NaturaLiSE)
DA - 2013///
DO - 10.1109/naturalise.2013.6611715
SP - 9-16
ER -
TY - JOUR
TI - Proposing Regulatory-Driven Automated Test Suites
AU - Morrison, Patrick
AU - Holmgreen, Casper
AU - Massey, Aaron
AU - Williams, Laurie
T2 - 2013 AGILE CONFERENCE (AGILE)
AB - In regulated domains such as finance and health care, failure to comply with regulation can lead to financial, civil and criminal penalties. While systems vary from organization to organization, the same regulations apply for all systems. As a result, efficiencies could be gained if the commonalities between systems could be captured in public, shared, test suites for regulations. We propose the use of Behavior-Driven-Development (BDD) technology to create these test suites. With BDD, desired system behavior with respect to regulatory requirements can be captured as constrained natural language 'scenarios'. The scenarios can then be automated through system-specific test drivers. The goal of this research is to enable organizations to compare their systems to regulation in a repeatable and traceable way through the use of BDD. To evaluate our approach, we developed seven scenarios based on the HITECH Act Meaningful Use (MU) regulations for healthcare. We then created system-specific code for three open-source electronic health record systems. We found that it was possible to create scenarios and system-specific code supporting scenario execution on three systems, that iTrust can be shown to be noncompliant, and that emergency access procedures are not defined clearly enough by the regulation to determine compliance or non-compliance.
DA - 2013///
PY - 2013///
DO - 10.1109/agile.2013.8
SP - 11-21
KW - Behavior-Driven-Development
KW - Healthcare IT
KW - Regulatory Compliance
KW - Security
KW - Software Engineering
KW - Software Testing
ER -
TY - CONF
TI - Conducting interview studies: Challenges, lessons learned, and open questions
AU - Witschey, J.
AU - Murphy-Hill, E.
AU - Xiao, S. D.
AB - Our recent work uses sociological theories and interview techniques to discover why so few developers use tools that help them write secure code. In this experience report, we describe nine challenges we encountered in planning and conducting an interview study with industrial practitioners, from choosing a population of interest to presenting the work in a way that resonates with the research community. In doing so, we aim to spur discussion in the software engineering research community about common challenges in empirical research and ways to address them.
C2 - 2013///
C3 - 2013 1st International Workshop on Conducting Empirical Studies in Industry (CESI)
DA - 2013///
DO - 10.1109/cesi.2013.6618471
SP - 51-54
ER -
TY - CONF
TI - QuickSense: Fast and energy-efficient channel sensing for dynamic spectrum access networks
AU - Yoon, S.
AU - Li, L. E.
AU - Liew, S. C.
AU - Choudhury, R. R.
AU - Rhee, I.
AU - Tan, K.
AB - Spectrum sensing, the task of discovering spectrum usage at a given location, is a fundamental problem in dynamic spectrum access networks. While sensing in narrow spectrum bands is well studied in previous work, wideband spectrum sensing is challenging since a wideband radio is generally too expensive and power consuming for mobile devices. Sequential scan, on the other hand, can be very slow if the wide spectrum band contains many narrow channels. In this paper, we propose an analog-filter based spectrum sensing technique, which is much faster than sequential scan and much cheaper than using a wideband radio. The key insight is that, if the sum of energy on a contiguous band is low, we can conclude that all channels in this band are clear with just one measurement. Based on this insight, we design an intelligent search algorithm to minimize the number of total measurements. We prove that the algorithm has the same asymptotic complexity as compressed sensing while our design is much simpler and easily implementable in the real hardware. We show the availability of our technique using hardware devices that include analog filters and analog energy detectors. Our extensive evaluation using real TV “white space” signals shows the effectiveness of our technique.
C2 - 2013///
C3 - 2013 proceedings ieee infocom
DA - 2013///
DO - 10.1109/infcom.2013.6567028
SP - 2247-2255
ER -
TY - CONF
TI - Characteristic studies of loop problems for structural test generation via symbolic execution
AU - Xiao, X. S.
AU - Li, S. H.
AU - Xie, T.
AU - Tillmann, N.
C2 - 2013///
C3 - 2013 28th ieee/acm international conference on automated software engineering (ase)
DA - 2013///
SP - 246-256
ER -
TY - JOUR
TI - Access Control Policy Extraction from Unconstrained Natural Language Text
AU - Slankas, John
AU - Williams, Laurie
T2 - 2013 ASE/IEEE INTERNATIONAL CONFERENCE ON SOCIAL COMPUTING (SOCIALCOM)
AB - While access control mechanisms have existed in computer systems since the 1960s, modern system developers often fail to ensure appropriate mechanisms are implemented within particular systems. Such failures allow for individuals, both benign and malicious, to view and manipulate information that they should not otherwise be able to access. The goal of our research is to help developers improve security by extracting the access control policies implicitly and explicitly defined in natural language project artifacts. Developers can then verify and implement the extracted access control policies within a system. We propose a machine-learning based process to parse existing, unaltered natural language documents, such as requirement or technical specifications to extract the relevant subjects, actions, and resources for an access control policy. To evaluate our approach, we analyzed a public requirements specification. We had a precision of 0.87 with a recall of 0.91 in classifying sentences as access control or not. Through a bootstrapping process utilizing dependency graphs, we correctly identified the subjects, actions, and objects elements of the access control policies with a precision of 0.46 and a recall of 0.54.
DA - 2013///
PY - 2013///
DO - 10.1109/socialcom.2013.68
SP - 435-440
KW - access control
KW - documentation
KW - machine learning
KW - natural language processing
KW - relation extraction
KW - security
ER -
TY - CONF
TI - Non-operational testing of software for security issues
AU - Subramani, S.
AU - Vouk, M.
AU - Williams, L.
AB - We are studying extension of the classical Software Reliability Engineering (SRE) methodology into the security space. We combine “classical” reliability modeling, when applied to reported vulnerabilities found under “normal” operational profile conditions, with safety oriented fault management processes. We illustrate with open source Fedora software.
C2 - 2013///
C3 - 2013 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)
DA - 2013///
DO - 10.1109/issrew.2013.6688857
SP - 21-22
ER -
TY - JOUR
TI - Efficient and robust model fitting with unknown noise scale
AU - Heinrich, S. B.
T2 - Image and Vision Computing
DA - 2013///
PY - 2013///
VL - 31
IS - 10
SP - 735-747
ER -
TY - JOUR
TI - An Ordered Relatedness Metric for Relevance Identification
AU - Ramachandran, Lakshmi
AU - Gehringer, Edward F.
T2 - 2013 IEEE SEVENTH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC 2013)
AB - In this paper we introduce a WordNet relations-based metric to determine semantic relatedness. Semantic relatedness is used to identify the degree of relevance between a review's text and a submission's text in order to determine whether the review pertains to the right submission. We use only Word Net since using additional corpuses or knowledge resources to determine similarity would be time consuming, especially when the metric is used to perform token-based pair wise comparison across documents. We compare our semantic relatedness metric with path and content-based measures that use only Word Net. We show that our metric is better than the other relatedness metrics at identifying relevance of academic reviews from Expertiza, a collaborative web-based learning application. We also show that our semantic relatedness metric produces higher correlations than most of the other metrics on the WordSim353 and Rubenstein & Good enough datasets.
DA - 2013///
PY - 2013///
DO - 10.1109/icsc.2013.23
SP - 86-89
SN - 2325-6516
ER -
TY - CONF
TI - Simplifying the homology of networks via strong collapses
AU - Wilkerson, A. C.
AU - Moore, T. J.
AU - Swami, A.
AU - Krim, H.
AB - There has recently been increased interest in applications of topology to areas ranging from control and sensing, to social network analysis, to high-dimensional point cloud data analysis. Here we use simplicial complexes to represent the group relationship structure in a network. We detail a novel algorithm for simplifying homology and “hole location” computations on a complex by reducing it to its core using a strong collapse. We show that the homology and hole locations are preserved and provide motivation for interest in this reduction technique with applications in sensor and social networks. Since the complexity of finding “holes” is quintic in the number of simplices, the proposed reduction leads to significant savings in complexity.
C2 - 2013///
C3 - International conference on acoustics speech and signal processing
DA - 2013///
DO - 10.1109/icassp.2013.6638666
SP - 5258-5262
ER -
TY - CONF
TI - Scaling concurrency of personalized semantic search over large RDF data
AU - Fu, H. Z.
AU - Kim, H.
AU - Anyanwu, K.
AB - Recent keyword search techniques on Semantic Web are moving away from shallow, information retrieval-style approaches that merely find “keyword matches” towards more interpretive approaches that attempt to induce structure from keyword queries. The process of query interpretation is usually guided by structures in data, and schema and is often supported by a graph exploration procedure. However, graph exploration-based interpretive techniques are impractical for multi-tenant scenarios for large databases because separate expensive graph exploration states need to be maintained for different user queries. This leads to significant memory overhead in situations of large numbers of concurrent requests. This limitation could negatively impact the possibility of achieving the ultimate goal of personalizing search. In this paper, we propose a lightweight interpretation approach that employs indexing to improve throughput and concurrency with much less memory overhead. It is also more amenable to distributed or partitioned execution. The approach is implemented in a system called “SKI” and an experimental evaluation of SKI's performance on the DBPedia and Billion Triple Challenge datasets shows orders-of-magnitude performance improvement over existing techniques.
C2 - 2013///
C3 - 2013 IEEE International Conference on Big Data
DA - 2013///
DO - 10.1109/bigdata.2013.6691622
ER -
TY - CONF
TI - Optimizing queries over semantically integrated datasets on mapreduce platforms
AU - Kim, H.
AU - Anyanwu, K.
AB - Life science databases generally consist of multiple heterogeneous datasets that have been integrated using complex ontologies. Querying such databases typically involves complex graph patterns, and evaluating such patterns poses challenges when MapReduce-based platforms are used to scale up processing, translating to long execution workflows with large amount of disk and network I/O costs. In this poster, we focus on optimizing UNION queries (e.g., unions of conjunctives for inference) and present an algebraic interpretation of the query rewritings which are more amenable to efficient processing on MapReduce.
C2 - 2013///
C3 - 2013 IEEE International Conference on Big Data
DA - 2013///
DO - 10.1109/bigdata.2013.6691788
ER -
TY - JOUR
TI - On the Matrix Berlekamp-Massey Algorithm
AU - Kaltofen, Erich
AU - Yuhasz, George
T2 - ACM TRANSACTIONS ON ALGORITHMS
AB - We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing linear generators of scalar sequences. The Matrix Berlekamp/Massey algorithm computes a minimal matrix generator of a linearly generated matrix sequence and has been first introduced by Rissanen [1972a], Dickinson et al. [1974], and Coppersmith [1994]. Our version of the algorithm makes no restrictions on the rank and dimensions of the matrix sequence. We also give new proofs of correctness and complexity for the algorithm, which is based on self-contained loop invariants and includes an explicit termination criterion for a given determinantal degree bound of the minimal matrix generator.
DA - 2013/9//
PY - 2013/9//
DO - 10.1145/2500122
VL - 9
IS - 4
SP -
SN - 1549-6333
KW - Linear generated sequences
KW - matrix polynomials
KW - minimal generators
KW - vector Berlekamp/Massey algorithm
KW - multivariable linear control
ER -
TY - JOUR
TI - On the Critical Delays of Mobile Networks Under Levy Walks and Levy Flights
AU - Lee, Kyunghan
AU - Kim, Yoora
AU - Chong, Song
AU - Rhee, Injong
AU - Yi, Yung
AU - Shroff, Ness B.
T2 - IEEE-ACM TRANSACTIONS ON NETWORKING
AB - Delay-capacity tradeoffs for mobile networks have been analyzed through a number of research works. However, Lévy mobility known to closely capture human movement patterns has not been adopted in such work. Understanding the delay-capacity tradeoff for a network with Lévy mobility can provide important insights into understanding the performance of real mobile networks governed by human mobility. This paper analytically derives an important point in the delay-capacity tradeoff for Lévy mobility, known as the critical delay. The critical delay is the minimum delay required to achieve greater throughput than what conventional static networks can possibly achieve (i.e., O(1/√n) per node in a network with n nodes). The Lévy mobility includes Lévy flight and Lévy walk whose step-size distributions parametrized by α ∈ (0,2] are both heavy-tailed while their times taken for the same step size are different. Our proposed technique involves: 1) analyzing the joint spatio-temporal probability density function of a time-varying location of a node for Lévy flight, and 2) characterizing an embedded Markov process in Lévy walk, which is a semi-Markov process. The results indicate that in Lévy walk, there is a phase transition such that for α ∈ (0,1), the critical delay is always Θ(n [1/2] ), and for α ∈ [1,2] it is Θ(n [(α)/2] ). In contrast, Lévy flight has the critical delay Θ(n [(α)/2] ) for α ∈ (0,2].
DA - 2013/10//
PY - 2013/10//
DO - 10.1109/tnet.2012.2229717
VL - 21
IS - 5
SP - 1621-1635
SN - 1558-2566
KW - Critical delay
KW - delay-capacity tradeoff
KW - human mobility
KW - Levy mobility
KW - network performance scaling
ER -
TY - CONF
TI - Grading by experience points: An example from computer ethics
AU - Gehringer, Edward
AU - Peddycord, Barry
T2 - 2013 IEEE Frontiers in Education Conference (FIE)
AB - In most of education, courses are graded based on percentages-a certain percentage is required for each letter grade. Students often see this as a negative, in which they can only lose points, not gain points, and put their class average at risk with each new assignment. This contrasts with the world of online gaming, where they gain “experience points” from each new activity, and their score monotonically increases toward a desired goal. In Fall 2012, the lead author switched to grading by experience points in his Ethics in Computing class. Students earned points for a variety of activities, mainly performing ethical analyses of various issues related to computing, and participating in debates on ethics-related topics. The students appreciated the ability to earn extra points by performing extra activities. But they were less likely to complete analyses after signing up to do them than were students in a traditionally-graded class. At semester's end, the number of peer reviews increased, as students strove to top off their point total. The grade distribution was bimodal, with clusters at both ends (A+ and F). Students' greatest concern was rapid grading turnaround, so they would know where they stood in the class at all times.
C2 - 2013/10//
C3 - 2013 IEEE Frontiers in Education Conference (FIE)
DA - 2013/10//
DO - 10.1109/fie.2013.6685097
PB - IEEE
SN - 9781467352611
UR - http://dx.doi.org/10.1109/fie.2013.6685097
DB - Crossref
ER -
TY - JOUR
TI - Contextualized information-centric home network
AU - Biswas, T.
AU - Chakraborti, A.
AU - Ravindran, R.
AU - Zhang, X. W.
AU - Wang, G. Q.
T2 - Computer Communication Review
DA - 2013///
PY - 2013///
VL - 43
IS - 4
SP - 461-462
ER -
TY - JOUR
TI - An improved hop-by-hop interest shaper for congestion control in named data networking
AU - Wang, Y. G.
AU - Rozhnova, N.
AU - Narayanan, A.
AU - Oran, D.
AU - Rhee, I.
T2 - Computer Communication Review
AB - Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.
DA - 2013///
PY - 2013///
DO - 10.1145/2491224.2491233
VL - 43
IS - 4
ER -
TY - CONF
TI - A community college blended learning classroom experience through Artificial Intelligence in Games
AU - Barik, Titus
AU - Everett, Michael
AU - Cardona-Rivera, Rogelio E.
AU - Roberts, David L.
AU - Gehringer, Edward F.
T2 - 2013 IEEE Frontiers in Education Conference (FIE)
AB - We report on the experience of teaching an industry-validated course on Artificial Intelligence in Computer Games within the Simulation and Game Design department at a two-year community college during a 16-week semester. The course format used a blended learning just-in-time teaching approach, which included active learning programming exercises and one-on-one student interactions. Moskal's Attitudes Toward Computer Science survey showed a positive and significant increase in students in both interest (W(10) = 25, p = 0.011) and professional (W(10) = 49.5, p = 0.037) constructs. The Felder-Soloman Index of Learning Styles (n = 14) failed to identify any statistically significant differences in learning styles when compared to a four-year CS1 class. In the final class evaluation, 8 out of 13 students (62%) strongly or very strongly preferred the blended learning approach. We validated this course through four semi-structured interviews with game companies. The interview results suggest that companies are strongly favorable to the course content and structure. The results of this work serve as a template that community colleges can adopt for their curriculum.
C2 - 2013/10//
C3 - 2013 IEEE Frontiers in Education Conference (FIE)
DA - 2013/10//
DO - 10.1109/fie.2013.6685093
PB - IEEE
SN - 9781467352611
UR - http://dx.doi.org/10.1109/fie.2013.6685093
DB - Crossref
ER -
TY - JOUR
TI - The Effects of Career Calling and Perceived Overqualification on Work Outcomes for Primary and Secondary School Teachers
AU - Lobene, Eleni V.
AU - Meade, Adam W.
T2 - JOURNAL OF CAREER DEVELOPMENT
AB - While perceived overqualification (POQ) has received increased research attention in recent years, the identification of variables that moderate POQ-outcome relationships is critical to our understanding of how the construct affects career outcomes. This study, involving 170 full-time primary and secondary school educators in a suburban mid-Atlantic school system, found that POQ is negatively related to job satisfaction and affective commitment while positively related to turnover intentions and desire to turnover. While POQ was not significantly related to performance or continuance organizational commitment, the relationships between POQ and both performance and continuance organizational commitment were significantly moderated by the experience of career calling orientation. Generally, the relationship between POQ and performance was stronger, and the relationship between POQ and continuance organizational commitment was weaker, for those with high calling. Additionally, the effects of career calling were considerably stronger than those of POQ for all criteria. The implications surrounding these results, and opportunities for future investigation, are discussed.
DA - 2013/12//
PY - 2013/12//
DO - 10.1177/0894845313495512
VL - 40
IS - 6
SP - 508-530
SN - 1556-0856
KW - perceived overqualification
KW - calling
KW - performance
KW - moderation
ER -
TY - JOUR
TI - Prediction of flow stress in cadmium using constitutive equation and artificial neural network approach
AU - Sarkar, A.
AU - Chakravartty, J. K.
T2 - Journal of Materials Engineering and Performance
DA - 2013///
PY - 2013///
VL - 22
IS - 10
SP - 2982-2989
ER -
TY - JOUR
TI - PARLO: PArallel Run-time Layout Optimization for Scientific Data Explorations with Heterogeneous Access Patterns
AU - Gong, Zhenhuan
AU - Boyuka, David A., II
AU - Zou, Xiaocheng
AU - Liu, Qing
AU - Podhorszki, Norbert
AU - Klasky, Scott
AU - Ma, Xiaosong
AU - Samatova, Nagiza F.
T2 - PROCEEDINGS OF THE 2013 13TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID 2013)
AB - The size and scope of cutting-edge scientific simulations are growing much faster than the I/O and storage capabilities of their run-time environments. The growing gap is exacerbated by exploratory, data-intensive analytics, such as querying simulation data with multivariate, spatio-temporal constraints, which induces heterogeneous access patterns that stress the performance of the underlying storage system. Previous work addresses data layout and indexing techniques to improve query performance for a single access pattern, which is not sufficient for complex analytics jobs. We present PARLO a parallel run-time layout optimization framework, to achieve multi-level data layout optimization for scientific applications at run-time before data is written to storage. The layout schemes optimize for heterogeneous access patterns with user-specified priorities. PARLO is integrated with ADIOS, a high-performance parallel I/O middleware for large-scale HPC applications, to achieve user-transparent, light-weight layout optimization for scientific datasets. It offers simple XML-based configuration for users to achieve flexible layout optimization without the need to modify or recompile application codes. Experiments show that PARLO improves performance by 2 to 26 times for queries with heterogeneous access patterns compared to state-of-the-art scientific database management systems. Compared to traditional post-processing approaches, its underlying run-time layout optimization achieves a 56% savings in processing time and a reduction in storage overhead of up to 50%. PARLO also exhibits a low run-time resource requirement, while also limiting the performance impact on running applications to a reasonable level.
DA - 2013///
PY - 2013///
DO - 10.1109/ccgrid.2013.58
SP - 343-351
SN - 2376-4414
ER -
TY - JOUR
TI - Norms as a Basis for Governing Sociotechnical Systems
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - We understand a sociotechnical system as a multistakeholder cyber-physical system. We introduce governance as the administration of such a system by the stakeholders themselves. In this regard, governance is a peer-to-peer notion and contrasts with traditional management, which is a top-down hierarchical notion. Traditionally, there is no computational support for governance and it is achieved through out-of-band interactions among system administrators. Not surprisingly, traditional approaches simply do not scale up to large sociotechnical systems. We develop an approach for governance based on a computational representation of norms in organizations. Our approach is motivated by the Ocean Observatory Initiative, a thirty-year $400 million project, which supports a variety of resources dealing with monitoring and studying the world's oceans. These resources include autonomous underwater vehicles, ocean gliders, buoys, and other instrumentation as well as more traditional computational resources. Our approach has the benefit of directly reflecting stakeholder needs and assuring stakeholders of the correctness of the resulting governance decisions while yielding adaptive resource allocation in the face of changes in both stakeholder needs and physical circumstances.
DA - 2013/12//
PY - 2013/12//
DO - 10.1145/2542182.2542203
VL - 5
IS - 1
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84891809035&partnerID=MN8TOARS
KW - Algorithms
KW - Design
KW - Governance
KW - sociotechnical systems
KW - adaptation
ER -
TY - JOUR
TI - Deriving common malware behavior through graph clustering
AU - Park, Younghee
AU - Reeves, Douglas S.
AU - Stamp, Mark
T2 - COMPUTERS & SECURITY
AB - Detection of malicious software (malware) continues to be a problem as hackers devise new ways to evade available methods. The proliferation of malware and malware variants requires new advanced methods to detect them. This paper proposes a method to construct a common behavioral graph representing the execution behavior of a family of malware instances. The method generates one common behavioral graph by clustering a set of individual behavioral graphs, which represent kernel objects and their attributes based on system call traces. The resulting common behavioral graph has a common path, called HotPath, which is observed in all the malware instances in the same family. The proposed method shows high detection rates and false positive rates close to 0%. The derived common behavioral graph is highly scalable regardless of new instances added. It is also robust against system call attacks.
DA - 2013/11//
PY - 2013/11//
DO - 10.1016/j.cose.2013.09.006
VL - 39
SP - 419-430
SN - 1872-6208
KW - Malware
KW - Dynamic analysis
KW - Graph clustering
KW - Intrusion detection
KW - Virtualization
ER -
TY - JOUR
TI - Augmented Reality Interfaces
AU - Singh, Mona
AU - Singh, Munindar P.
T2 - IEEE INTERNET COMPUTING
AB - Technological advances, exploding amounts of information, and user receptiveness are fueling augmented reality's (AR) rapid expansion from a novelty concept to potentially the default interface paradigm in coming years. This article briefly describes AR in terms of its application in natural Web interfaces. The authors discuss key concepts involved in AR, and the technical and social challenges that remain.
DA - 2013///
PY - 2013///
DO - 10.1109/mic.2013.107
VL - 17
IS - 6
SP - 66-70
SN - 1941-0131
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84890959306&partnerID=MN8TOARS
KW - usability
KW - augmented reality
KW - mobile applications
KW - mobile computing
KW - user experience
KW - user interfaces
ER -
TY - JOUR
TI - Ally Friendly Jamming: How to Jam Your Enemy and Maintain Your Own Wireless Connectivity at the Same Time
AU - Shen, Wenbo
AU - Ning, Peng
AU - He, Xiaofan
AU - Dai, Huaiyu
T2 - 2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP)
AB - This paper presents a novel mechanism, called Ally Friendly Jamming, which aims at providing an intelligent jamming capability that can disable unauthorized (enemy) wireless communication but at the same time still allow authorized wireless devices to communicate, even if all these devices operate at the same frequency. The basic idea is to jam the wireless channel continuously but properly control the jamming signals with secret keys, so that the jamming signals are unpredictable interference to unauthorized devices, but are recoverable by authorized ones equipped with the secret keys. To achieve the ally friendly jamming capability, we develop new techniques to generate ally jamming signals, to identify and synchronize with multiple ally jammers. This paper also reports the analysis, implementation, and experimental evaluation of ally friendly jamming on a software defined radio platform. Both the analytical and experimental results indicate that the proposed techniques can effectively disable enemy wireless communication and at the same time maintain wireless communication between authorized devices.
DA - 2013///
PY - 2013///
DO - 10.1109/sp.2013.22
SP - 174-188
SN - 1081-6011
KW - Wireless
KW - friendly jamming
KW - interference cancellation
ER -
TY - CONF
TI - A vision for SPARQL multi-query optimization on MapReduce
AU - Anyanwu, K.
AB - MapReduce has emerged as a key component of large scale data analysis in the cloud. However, it presents challenges for SPARQL query processing because of the absence of traditional join optimization machinery like statistics, indexes and techniques for translation of join-intensive workloads to efficient MapReduce workflows. Further, MapReduce is primarily a batch processing paradigm. Therefore, it is plausible that many workloads will include a batch of queries or new queries could be generated from given queries e.g. due to query rewriting of inferencing queries. Consequently, the issue of multi-query optimization deserves some focus and this paper lays out a vision for rule-based multi-query optimization based on a recently proposed data model and algebra, Nested TripleGroup Data Model and Algebra, for efficient SPARQL query processing on MapReduce.
C2 - 2013///
C3 - 2013 ieee 29th international conference on data engineering workshops (icdew)
DA - 2013///
DO - 10.1109/icdew.2013.6547420
SP - 25–26
ER -
TY - JOUR
TI - A Survey of VBR Video Traffic Models
AU - Tanwir, Savera
AU - Perros, Harry
T2 - IEEE COMMUNICATIONS SURVEYS AND TUTORIALS
AB - We have seen a phenomenal growth in video applications in the past few years. An accurate traffic model of VBR video is necessary for performance evaluation of a network design and also for creating synthetic loads that can be used for benchmarking a network. In view of this, various models for VBR video traffic have been proposed in the literature. In this paper, we classify and survey these models. In addition, we implemented four representative video traffic models and compared them using the H.264 AVC video traces available at the Arizona State University video traces library. These models are: the Markov Modulated Gamma (MMG) model, the Discrete Autoregressive (DAR) model, the second order Autoregressive AR(2) model, and a wavelet-based model. The results show that the MMG and the wavelet-based models are suitable for both video conference and IPTV, while the DAR model is good for video conference traffic only. According to our results, the AR(2) model is not suitable for generating any type of H.264 video. A brief overview of SVC, HD, and 3D video is also provided.
DA - 2013///
PY - 2013///
DO - 10.1109/surv.2013.010413.00071
VL - 15
IS - 4
SP - 1778-1802
SN - 1553-877X
KW - VBR video
KW - Video traffic model
KW - H.264
ER -
TY - JOUR
TI - Vision for TOIT
AU - Singh, Munindar P.
T2 - ACM Transactions on Internet Technology
AB - No abstract available.
DA - 2013///
PY - 2013///
DO - 10.1145/2499926.2499929
VL - 12
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896953416&partnerID=MN8TOARS
ER -
TY - CONF
TI - VIA - visualizing individual actions to develop a sustainable community culture through cycling
AU - Watson, B.
AU - Berube, D.
AU - Hristov, N.
AU - Strohecker, C.
AU - Betz, S.
AU - Allen, L.
AU - Burczyk, M.
AU - Howard, A.
AU - McGee, W. A.
AU - Gymer, M
AU - Canas, D.
AU - Kirstner, M.
C2 - 2013///
C3 - Lecture Notes in Computer Science. Lecture Notes in Artificial Intelligence
DA - 2013///
VL - 8028
SP - 316-325
ER -
TY - JOUR
TI - TOIT administrative updates
AU - Singh, Munindar P.
T2 - ACM Transactions on Internet Technology
AB - No abstract available.
DA - 2013///
PY - 2013///
DO - 10.1145/2499926.2499930
VL - 12
IS - 4
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84896985959&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Discovery of extreme events-related communities in contrasting groups of physical system networks
AU - Chen, Zhengzhang
AU - Hendrix, William
AU - Guan, Hang
AU - Tetteh, Isaac K.
AU - Choudhary, Alok
AU - Semazzi, Fredrick
AU - Samatova, Nagiza F.
T2 - DATA MINING AND KNOWLEDGE DISCOVERY
AB - The latent behavior of a physical system that can exhibit extreme events such as hurricanes or rainfalls, is complex. Recently, a very promising means for studying complex systems has emerged through the concept of complex networks. Networks representing relationships between individual objects usually exhibit community dynamics. Conventional community detection methods mainly focus on either mining frequent subgraphs in a network or detecting stable communities in time-varying networks. In this paper, we formulate a novel problem—detection of predictive and phase-biased communities in contrasting groups of networks, and propose an efficient and effective machine learning solution for finding such anomalous communities. We build different groups of networks corresponding to different system’s phases, such as higher or low hurricane activity, discover phase-related system components as seeds to help bound the search space of community generation in each network, and use the proposed contrast-based technique to identify the changing communities across different groups. The detected anomalous communities are hypothesized (1) to play an important role in defining the target system’s state(s) and (2) to improve the predictive skill of the system’s states when used collectively in the ensemble of predictive models. When tested on the two important extreme event problems—identification of tropical cyclone-related and of African Sahel rainfall-related climate indices—our algorithm demonstrated the superior performance in terms of various skill and robustness metrics, including 8–16 % accuracy increase, as well as physical interpretability of detected communities. The experimental results also show the efficiency of our algorithm on synthetic datasets.
DA - 2013/9//
PY - 2013/9//
DO - 10.1007/s10618-012-0289-3
VL - 27
IS - 2
SP - 225-258
SN - 1573-756X
KW - Spatio-temporal data mining
KW - Complex network analysis
KW - Community detection
KW - Comparative analysis
KW - Networkmotif detection
KW - Extreme event prediction
ER -
TY - JOUR
TI - A comparison of the efficiency and effectiveness of vulnerability discovery techniques
AU - Austin, Andrew
AU - Holmgreen, Casper
AU - Williams, Laurie
T2 - INFORMATION AND SOFTWARE TECHNOLOGY
AB - Security vulnerabilities discovered later in the development cycle are more expensive to fix than those discovered early. Therefore, software developers should strive to discover vulnerabilities as early as possible. Unfortunately, the large size of code bases and lack of developer expertise can make discovering software vulnerabilities difficult. A number of vulnerability discovery techniques are available, each with their own strengths. The objective of this research is to aid in the selection of vulnerability discovery techniques by comparing the vulnerabilities detected by each and comparing their efficiencies. We conducted three case studies using three electronic health record systems to compare four vulnerability discovery techniques: exploratory manual penetration testing, systematic manual penetration testing, automated penetration testing, and automated static analysis. In our case study, we found empirical evidence that no single technique discovered every type of vulnerability. We discovered that the specific set of vulnerabilities identified by one tool was largely orthogonal to that of other tools. Systematic manual penetration testing found the most design flaws, while automated static analysis found the most implementation bugs. The most efficient discovery technique in terms of vulnerabilities discovered per hour was automated penetration testing. The results show that employing a single technique for vulnerability discovery is insufficient for finding all types of vulnerabilities. Each technique identified only a subset of the vulnerabilities, which, for the most part were independent of each other. Our results suggest that in order to discover the greatest variety of vulnerability types, at least systematic manual penetration testing and automated static analysis should be performed.
DA - 2013/7//
PY - 2013/7//
DO - 10.1016/j.infsof.2012.11.007
VL - 55
IS - 7
SP - 1279-1288
SN - 1873-6025
KW - Security
KW - Vulnerability
KW - Static analysis
KW - Penetration testing
KW - Black box testing
KW - White box testing
ER -
TY - JOUR
TI - Wheeze detection and location using spectro-temporal analysis of lung sounds
AU - Emrani, Saba
AU - Krim, Hamid
T2 - 29TH SOUTHERN BIOMEDICAL ENGINEERING CONFERENCE (SBEC 2013)
AB - Wheezes are abnormal lung sounds, which usually imply obstructive airways diseases. The objective of this study is to design an automatic wheeze detector for a wearable health monitoring system, which is able to locate the wheezes inside the respiratory cycle with high accuracy, and low computational complexity. We compute important features of wheezes, which we classify as temporal and spectral characteristics and employed to analyze recorded lung sounds including wheezes from patients with asthma. Time-frequency (TF) technique as well as wavelet packet decomposition (WPD) is used for this purpose. Experimental results verify the promising performance of described methods.
DA - 2013///
PY - 2013///
DO - 10.1109/sbec.2013.27
SP - 37-38
SN - 1086-4105
ER -
TY - JOUR
TI - Stereo rendering of rain in real-time
AU - Hussain, Syed A.
AU - McAllister, David F.
T2 - STEREOSCOPIC DISPLAYS AND APPLICATIONS XXIV
AB - The rendering of photorealistic rain has been previously studied for monoscopic viewing. We extend the monoscopic statistical rain models to simulate the behavior and distribution of falling rain for stereo viewing. Our goal is to be able to render in real-time frame rates. In this investigation we ignore the complex issues of scene illumination and concentrate on the parameters that produce a realistic rain distribution. Using the concept of retinal persistence we render a visible falling raindrop as a linear streak. To speed rendering we use pre-computed images of such rain streaks. Rain streak positions for the left- and right-eye views are created by generating random numbers that depend on the view volume of the scene. We permit interactive but controlled modification of rain parameters such as density and wind gusts. We compare our approach to the use of existing 2D-3D conversion methods. The results demonstrate that using commercial 2D-3D converters are not sufficient in producing realistic stereo rain effects. Future research will concentrate on including complex lighting interactions.
DA - 2013///
PY - 2013///
DO - 10.1117/12.2001308
VL - 8648
SP -
SN - 1996-756X
KW - Rain
KW - photorealistic
KW - real-time
KW - 2D-3D conversion
KW - stereo
KW - 3D
ER -
TY - JOUR
TI - Probable maximum precipitation and climate change
AU - Kunkel, Kenneth E.
AU - Karl, Thomas R.
AU - Easterling, David R.
AU - Redmond, Kelly
AU - Young, John
AU - Yin, Xungang
AU - Hennon, Paula
T2 - GEOPHYSICAL RESEARCH LETTERS
AB - Probable maximum precipitation (PMP) is the greatest accumulation of precipitation for a given duration meteorologically possible for an area. Climate change effects on PMP are analyzed, in particular, maximization of moisture and persistent upward motion, using both climate model simulations and conceptual models of relevant meteorological systems. Climate model simulations indicate a substantial future increase in mean and maximum water vapor concentrations. For the RCP8.5 scenario, the changes in maximum values for the continental United States are approximately 20%–30% by 2071–2100. The magnitudes of the maximum water vapor changes follow temperature changes with an approximate Clausius‐Clapeyron relationship. Model‐simulated changes in maximum vertical and horizontal winds are too small to offset water vapor changes. Thus, our conclusion is that the most scientifically sound projection is that PMP values will increase in the future due to higher levels of atmospheric moisture content and consequent higher levels of moisture transport into storms.
DA - 2013/4/16/
PY - 2013/4/16/
DO - 10.1002/grl.50334
VL - 40
IS - 7
SP -
SN - 1944-8007
ER -
TY - CONF
TI - Priority inversion and queue management for 802.11 priority WLANs
AU - Formyduval, W. L.
AU - Thuente, D. J.
AB - All priority-based IEEE 802.11 networks use the 802.11e standard or one of its variants to improve the quality of service (QoS). An enhanced data link layer, which services packets in a manner that is consistent with their priority, is proposed by the standard. Buffer management and packet scheduling are two key components of a QoS mechanism operating at this layer. The 802.11e standard includes a well-defined packet scheduler, but it does not specify a buffer management policy. Buffer management policies determine which packets are discarded during network congestion. The drop tail algorithm is the traditional approach to buffer management and is both computationally simple and widely implemented. However, we show that drop tail can significantly reduce the throughput of a typical wireless network and lead to a priority inversion. We present the reasons for this performance degradation, propose several remedies, and recommend a new buffer management policy for 802.11e networks.
C2 - 2013///
C3 - 2013 IEEE Consumer Communications and Networking Conference (CCNC)
DA - 2013///
DO - 10.1109/ccnc.2013.6488500
SP - 565-573
ER -
TY - JOUR
TI - Hybrid FRR/p-cycle design for link and node protection in MPLS networks
AU - Cao, Chang
AU - Rouskas, George N.
AU - Wang, Jianquan
AU - Tang, Xiongyan
T2 - AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS
AB - Survivable MPLS technologies are crucial in ensuring reliable communication services. The fast reroute (FRR) mechanism has been standardized to achieve fast local repair of label switched paths (LSPs) in the event of link or node failures. We present a suite of hybrid protection schemes for MPLS networks that combine the well-known p-cycle method with FRR technology. Whereas with pure FRR backup paths are planned by each node individually, the hybrid schemes employ a set of p-cycles that may be selected using techniques that take a holistic view of the network so as to share protection bandwidth effectively. The hybrid FRR/p-cycle methods are fully RFC 4090-compliant, yet allow network operators to leverage a large existing body of p-cycle design techniques. Numerical results on realistic network topologies indicate that the hybrid approach is successful in combining the advantages of p-cycle design and FRR.
DA - 2013///
PY - 2013///
DO - 10.1016/j.aeue.2012.11.005
VL - 67
IS - 6
SP - 470-478
SN - 1618-0399
KW - Multi-protocol label switching
KW - Fast reroute
KW - Pre-configure cycle
ER -
TY - JOUR
TI - Hemlock woolly adelgid (Adelges tsugae) infestation affects water and carbon relations of eastern hemlock (Tsuga canadensis) and Carolina hemlock (Tsuga caroliniana)
AU - Domec, Jean-Christophe
AU - Rivera, Laura N.
AU - King, John S.
AU - Peszlen, Ilona
AU - Hain, Fred
AU - Smith, Benjamin
AU - Frampton, John
T2 - NEW PHYTOLOGIST
AB - Summary Hemlock woolly adelgid ( HWA ) is an exotic insect pest causing severe decimation of native hemlock trees. Extensive research has been conducted on the ecological impacts of HWA , but the exact physiological mechanisms that cause mortality are not known. Water relations, anatomy and gas exchange measurements were assessed on healthy and infested eastern ( T suga canadensis ) and C arolina ( T suga caroliniana ) hemlock trees. These data were then used in a mechanistic model to test whether the physiological responses to HWA infestation were sufficiently significant to induce changes in whole‐plant water use and carbon uptake. The results indicated coordinated responses of functional traits governing water relations in infested relative to healthy trees. In response to HWA , leaf water potential, carbon isotope ratios, plant hydraulic properties and stomatal conductance were affected, inducing a reduction in tree water use by > 40% and gross primary productivity by 25%. Anatomical changes also appeared, including the activation of traumatic cells. HWA infestation had a direct effect on plant water relations. Despite some leaf compensatory mechanisms, such as an increase in leaf hydraulic conductance and nitrogen content, tree water use and carbon assimilation were diminished significantly in infested trees, which could contribute to tree mortality.
DA - 2013/7//
PY - 2013/7//
DO - 10.1111/nph.12263
VL - 199
IS - 2
SP - 452-463
SN - 1469-8137
KW - carbon isotope
KW - hydraulic conductivity
KW - mortality
KW - soil-plant-atmosphere model
KW - stomatal conductance
KW - traumatic resin canals
KW - water potential
KW - wood anatomy
ER -
TY - JOUR
TI - Best papers, IPDPS 2011
AU - Mueller, Frank
T2 - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
DA - 2013/7//
PY - 2013/7//
DO - 10.1016/j.jpdc.2013.05.001
VL - 73
IS - 7
SP - 939-939
SN - 0743-7315
ER -
TY - JOUR
TI - A fraction free Matrix Berlekamp/Massey algorithm
AU - Kaltofen, Erich
AU - Yuhasz, George
T2 - LINEAR ALGEBRA AND ITS APPLICATIONS
AB - We describe a fraction free version of the Matrix Berlekamp/Massey algorithm. The algorithm computes a minimal matrix generator of linearly generated square matrix sequences in an integral domain. The algorithm performs all operations in the integral domain, so all divisions performed are exact. For scalar sequences, the matrix algorithm specializes to a different algorithm than the algorithm currently in the literature. This new scalar algorithm has smaller intermediate values than the known fraction free Berlekamp/Massey algorithm.
DA - 2013/11/1/
PY - 2013/11/1/
DO - 10.1016/j.laa.2013.06.016
VL - 439
IS - 9
SP - 2515-2526
SN - 1873-1856
KW - Exact division
KW - Linear recurrences
KW - Matrix recurrences
KW - Block Hankel systems
KW - Block Toeplitz systems
KW - Integer sequences
ER -
TY - JOUR
TI - Variable selection in high-dimensional quantile varying coefficient models
AU - Tang, Y. L.
AU - Song, X. Y.
AU - Wang, H. J.
AU - Zhu, Z. Y.
T2 - Journal of Multivariate Analysis
DA - 2013///
PY - 2013///
VL - 122
SP - 115-132
ER -
TY - CONF
TI - On the efficacy of WDM virtual topology design strategies
AU - Ma, X. Z.
AU - Harfoush, K.
AB - Existing WDM virtual topology models mainly aim at maximizing the network throughput by optimizing predetermined objective functions. While the literature is rich in variants of such objective functions, they share a few deficiencies. Specifically, they abstract the problem with one fixed objective assuming that the throughput hindrance is uniform across the network, and do not consider node structure nor router utilization. These factors, when considered, affect network bottlenecks limiting a network throughput. As a result, none of the existing models fits all ISP networks. In this paper, we introduce a novel algorithm to determine a network bottleneck based on the 1) physical topology, 2) traffic demand and 3) technology constraints, and a topology model leading to optimized network throughput.
C2 - 2013///
C3 - 2013 international conference on computing, networking and communications (icnc)
DA - 2013///
DO - 10.1109/iccnc.2013.6504115
ER -
TY - JOUR
TI - Lattice point generating functions and symmetric cones
AU - Beck, Matthias
AU - Bliem, Thomas
AU - Braun, Benjamin
AU - Savage, Carla D.
T2 - JOURNAL OF ALGEBRAIC COMBINATORICS
AB - We show that a recent identity of Beck–Gessel–Lee–Savage on the generating function of symmetrically constrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a finite reflection group. We obtain general expressions for the multivariate generating functions of such cones, and work out their general form more specifically for all symmetry groups of type A (previously known) and types B and D (new). We obtain several applications of these expressions in type B, including identities involving permutation statistics and lecture hall partitions.
DA - 2013/11//
PY - 2013/11//
DO - 10.1007/s10801-012-0414-9
VL - 38
IS - 3
SP - 543-566
SN - 1572-9192
KW - Lattice point generating function
KW - Polyhedral cone
KW - Finite reflection group
KW - Coxeter group
KW - Symmetrically constrained composition
KW - Permutation statistics
KW - Lecture hall partition
ER -
TY - JOUR
TI - Comparative meta-analysis between human and mouse cancer microarray data reveals critical pathways
AU - Chopra, P.
AU - Kang, J.
AU - Hong, S. M.
T2 - International Journal of Data Mining and Bioinformatics
DA - 2013///
PY - 2013///
VL - 8
IS - 3
SP - 349-365
ER -
TY - JOUR
TI - Adoption and use of Java generics
AU - Parnin, Chris
AU - Bird, Christian
AU - Murphy-Hill, Emerson
T2 - EMPIRICAL SOFTWARE ENGINEERING
DA - 2013/12//
PY - 2013/12//
DO - 10.1007/s10664-012-9236-6
VL - 18
IS - 6
SP - 1047-1089
SN - 1573-7616
KW - Generics
KW - Annotations
KW - Java
KW - Languages
KW - Post-mortem analysis
ER -
TY - JOUR
TI - Traffic grooming in optical networks: Decomposition and partial linear programming (LP) relaxation
AU - Wang, H.
AU - Rouskas, G. N.
T2 - Journal of Optical Communications and Networking
AB - We consider the traffic grooming problem, a fundamental network design problem in optical networks. We review a typical integer linear program formulation considered in the literature, and we identify two challenges related to this formulation in terms of scalability and wavelength fragmentation. We then propose a new (to our knowledge) solution approach that decomposes the traffic grooming problem into two subproblems that are solved sequentially: 1) the virtual topology and traffic routing (VTTR) subproblem, which does not take into account physical topology constraints, and 2) the routing and wavelength assignment subproblem, which reconciles the virtual topology determined by VTTR with the physical topology. The decomposition is exact when the network is not wavelength limited. We also propose an algorithm that uses a partial linear programming relaxation technique driven by lightpath utilization information to solve the VTTR subproblem efficiently. Our approach delivers a desirable tradeoff between running time and quality of the final solution.
DA - 2013///
PY - 2013///
DO - 10.1364/jocn.5.000825
VL - 5
IS - 8
SP - 825–835
ER -
TY - JOUR
TI - Research directions in agent communication
AU - Chopra, Amit K.
AU - Artikis, Alexander
AU - Bentahar, Jamal
AU - Colombetti, Marco
AU - Dignum, Frank
AU - Fornara, Nicoletta
AU - Jones, Andrew J. I.
AU - Singh, Munindar P.
AU - Yolum, Pinar
T2 - ACM Transactions on Intelligent Systems and Technology
AB - Increasingly, software engineering involves open systems consisting of autonomous and heterogeneous participants or agents who carry out loosely coupled interactions. Accordingly, understanding and specifying communications among agents is a key concern. A focus on ways to formalize meaning distinguishes agent communication from traditional distributed computing: meaning provides a basis for flexible interactions and compliance checking. Over the years, a number of approaches have emerged with some essential and some irrelevant distinctions drawn among them. As agent abstractions gain increasing traction in the software engineering of open systems, it is important to resolve the irrelevant and highlight the essential distinctions, so that future research can be focused in the most productive directions. This article is an outcome of extensive discussions among agent communication researchers, aimed at taking stock of the field and at developing, criticizing, and refining their positions on specific approaches and future challenges. This article serves some important purposes, including identifying (1) points of broad consensus; (2) points where substantive differences remain; and (3) interesting directions of future work.
DA - 2013/3/1/
PY - 2013/3/1/
DO - 10.1145/2438653.2438655
VL - 4
IS - 2
SP - 1-23
J2 - TIST
LA - en
OP -
SN - 2157-6904
UR - http://dx.doi.org/10.1145/2438653.2438655
DB - Crossref
KW - Theory
KW - Communication
ER -
TY - JOUR
TI - Providing DoS resistance for signature-based broadcast authentication in sensor networks
AU - Dong, Q.
AU - Liu, D. G.
AU - Ning, P.
T2 - ACM Transactions on Embedded Computing Systems
AB - Recent studies have demonstrated that it is feasible to perform public key cryptographic operations on resource-constrained sensor platforms. However, the significant energy consumption introduced by public key operations makes any public key-based protocol an easy target of Denial-of-Service (DoS) attacks. For example, if digital signature schemes such as ECDSA are used directly for broadcast authentication without further protection, an attacker can simply broadcast fake messages and force the receiving nodes to perform a huge number of unnecessary signature verifications, eventually exhausting their battery power. This paper shows how to mitigate such DoS attacks when digital signatures are used for broadcast authentication in sensor networks. Specifically, this paper first presents two filtering techniques, the group-based filter and the key chain-based filter , to handle the DoS attacks against signature verification. Both methods can significantly reduce the number of unnecessary signature verifications when a sensor node is under DoS attacks. This paper then combines these two filters and proposes a hybrid solution to further improve the performance.
DA - 2013///
PY - 2013///
DO - 10.1145/2442116.2442123
VL - 12
IS - 3
ER -
TY - JOUR
TI - Introduction to Special Section on Trust in Multiagent Systems
AU - Falcone, Rino
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - No abstract available.
DA - 2013/3//
PY - 2013/3//
DO - 10.1145/2438653.2438658
VL - 4
IS - 2
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84876152255&partnerID=MN8TOARS
KW - Theory
KW - Trust
ER -
TY - JOUR
TI - High-Throughput RNA Sequencing of Pseudomonas-Infected Arabidopsis Reveals Hidden Transcriptome Complexity and Novel Splice Variants
AU - Howard, Brian E.
AU - Hu, Qiwen
AU - Babaoglu, Ahmet Can
AU - Chandra, Manan
AU - Borghi, Monica
AU - Tan, Xiaoping
AU - He, Luyan
AU - Winter-Sederoff, Heike
AU - Gassmann, Walter
AU - Veronese, Paola
AU - Heber, Steffen
T2 - PLOS ONE
AB - We report the results of a genome-wide analysis of transcription in Arabidopsis thaliana after treatment with Pseudomonas syringae pathovar tomato. Our time course RNA-Seq experiment uses over 500 million read pairs to provide a detailed characterization of the response to infection in both susceptible and resistant hosts. The set of observed differentially expressed genes is consistent with previous studies, confirming and extending existing findings about genes likely to play an important role in the defense response to Pseudomonas syringae. The high coverage of the Arabidopsis transcriptome resulted in the discovery of a surprisingly large number of alternative splicing (AS) events--more than 44% of multi-exon genes showed evidence for novel AS in at least one of the probed conditions. This demonstrates that the Arabidopsis transcriptome annotation is still highly incomplete, and that AS events are more abundant than expected. To further refine our predictions, we identified genes with statistically significant changes in the ratios of alternative isoforms between treatments. This set includes several genes previously known to be alternatively spliced or expressed during the defense response, and it may serve as a pool of candidate genes for regulated alternative splicing with possible biological relevance for the defense response against invasive pathogens.
DA - 2013/10/1/
PY - 2013/10/1/
DO - 10.1371/journal.pone.0074183
VL - 8
IS - 10
SP -
SN - 1932-6203
ER -
TY - JOUR
TI - HMM-Based Malicious User Detection for Robust Collaborative Spectrum Sensing
AU - He, Xiaofan
AU - Dai, Huaiyu
AU - Ning, Peng
T2 - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
AB - Collaborative spectrum sensing improves the spectrum state estimation accuracy but is vulnerable to the potential attacks from malicious secondary cognitive radio (CR) users, and thus raises security concerns. One promising malicious user detection method is to identify their abnormal statistical spectrum sensing behaviors. From this angle, two hidden Markov models (HMMs) corresponding to honest and malicious users respectively are adopted in this paper to characterize their different sensing behaviors, and malicious user detection is achieved via detecting the difference in the corresponding HMM parameters. To obtain the HMM estimates, an effective inference algorithm that can simultaneously estimate two HMMs without requiring separated training sequences is also developed. By using these estimates, high malicious user detection accuracy can be achieved at the fusion center, leading to more robust and reliable collaborative spectrum sensing performance (substantially enlarged operational regions) in the presence of malicious users, as compared to the baseline approaches. Different fusion methods are also discussed and compared.
DA - 2013/11//
PY - 2013/11//
DO - 10.1109/jsac.2013.131119
VL - 31
IS - 11
SP - 2196-2208
SN - 1558-0008
KW - Cognitive radio network
KW - security
KW - collaborative spectrum sensing
KW - malicious user detection
KW - Byzantine attacks
KW - HMM
ER -
TY - JOUR
TI - Formalizing and Verifying Protocol Refinements
AU - Gerard, Scott N.
AU - Singh, Munindar P.
T2 - ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY
AB - A (business) protocol describes, in high-level terms, a pattern of communication between two or more participants, specifically via the creation and manipulation of the commitments between them. In this manner, a protocol offers both flexibility and rigor: a participant may communicate in any way it chooses as long as it discharges all of its activated commitments. Protocols thus promise benefits in engineering cross-organizational business processes. However, software engineering using protocols presupposes a formalization of protocols and a notion of the refinement of one protocol by another. Refinement for protocols is both intuitively obvious (e.g., PayViaCheck is clearly a kind of Pay ) and technically nontrivial (e.g., compared to Pay , PayViaCheck involves different participants exchanging different messages). This article formalizes protocols and their refinement. It develops Proton, an analysis tool for protocol specifications that overlays a model checker to compute whether one protocol refines another with respect to a stated mapping. Proton and its underlying theory are evaluated by formalizing several protocols from the literature and verifying all and only the expected refinements.
DA - 2013/3//
PY - 2013/3//
DO - 10.1145/2438653.2438656
VL - 4
IS - 2
SP -
SN - 2157-6912
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84876124077&partnerID=MN8TOARS
KW - Algorithms
KW - Languages
KW - Theory
KW - Verification
KW - Commitments
KW - agent communication
KW - verification of multiagent systems
ER -
TY - JOUR
TI - Interactive ambient visualizations for soft advice
AU - Murphy-Hill, Emerson
AU - Barik, Titus
AU - Black, Andrew P.
T2 - INFORMATION VISUALIZATION
AB - Some software packages offer the user soft advice: recommendations that are intended to help the user create high-quality artifacts but which may turn out to be bad advice. It is left to the user to determine whether the soft advice really will improve quality and to decide whether to adopt it. Visualizations can help the user in making this decision, but we believe that conventional visualizations are less than ideal. In this article, we describe an interactive ambient visualization to help users identify, understand, and interpret soft advice. Our visualization was developed to help programmers interpret code smells, which are indications that a software project may be suffering from design problems. We describe a laboratory experiment with 12 programmers that tests several hypotheses about our visualization. The findings suggest that our tool helps programmers to identify smells more effectively and to make more informed judgments about the design of the program under development. We then describe an application of our visualization technique in another domain: an English style and grammar advisor. This second application suggests that our technique can be applied to several domains and also suggests how the technique must be varied to make it domain specific.
DA - 2013/4//
PY - 2013/4//
DO - 10.1177/1473871612469020
VL - 12
IS - 2
SP - 107-132
SN - 1473-8724
KW - Software
KW - refactoring
KW - code smells
KW - design
KW - soft advice
KW - visualization
KW - ambient
KW - grammar
KW - style
ER -
TY - JOUR
TI - Global Alignment of Pairwise Protein Interaction Networks for Maximal Common Conserved Patterns
AU - Tian, Wenhong
AU - Samatova, Nagiza F.
T2 - INTERNATIONAL JOURNAL OF GENOMICS
AB - A number of tools for the alignment of protein-protein interaction (PPI) networks have laid the foundation for PPI network analysis. Most of alignment tools focus on finding conserved interaction regions across the PPI networks through either local or global mapping of similar sequences. Researchers are still trying to improve the speed, scalability, and accuracy of network alignment. In view of this, we introduce a connected-components based fast algorithm, HopeMap, for network alignment. Observing that the size of true orthologs across species is small comparing to the total number of proteins in all species, we take a different approach based on a precompiled list of homologs identified by KO terms. Applying this approach to S. cerevisiae (yeast) and D. melanogaster (fly), E. coli K12 and S. typhimurium, E. coli K12 and C. crescenttus, we analyze all clusters identified in the alignment. The results are evaluated through up-to-date known gene annotations, gene ontology (GO), and KEGG ortholog groups (KO). Comparing to existing tools, our approach is fast with linear computational cost, highly accurate in terms of KO and GO terms specificity and sensitivity, and can be extended to multiple alignments easily.
DA - 2013///
PY - 2013///
DO - 10.1155/2013/670623
VL - 2013
SP -
SN - 2314-4378
ER -
TY - JOUR
TI - Locating Need-to-Externalize Constant Strings for Software Internationalization with Generalized String-Taint Analysis
AU - Wang, Xiaoyin
AU - Zhang, Lu
AU - Xie, Tao
AU - Mei, Hong
AU - Sun, Jiasu
T2 - IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
AB - Nowadays, a software product usually faces a global market. To meet the requirements of different local users, the software product must be internationalized. In an internationalized software product, user-visible hard-coded constant strings are externalized to resource files so that local versions can be generated by translating the resource files. In many cases, a software product is not internationalized at the beginning of the software development process. To internationalize an existing product, the developers must locate the user-visible constant strings that should be externalized. This locating process is tedious and error-prone due to 1) the large number of both user-visible and non-user-visible constant strings and 2) the complex data flows from constant strings to the Graphical User Interface (GUI). In this paper, we propose an automatic approach to locating need-to-externalize constant strings in the source code of a software product. Given a list of precollected API methods that output values of their string argument variables to the GUI and the source code of the software product under analysis, our approach traces from the invocation sites (within the source code) of these methods back to the need-to-externalize constant strings using generalized string-taint analysis. In our empirical evaluation, we used our approach to locate need-to-externalize constant strings in the uninternationalized versions of seven real-world open source software products. The results of our evaluation demonstrate that our approach is able to effectively locate need-to-externalize constant strings in uninternationalized software products. Furthermore, to help developers understand why a constant string requires translation and properly translate the need-to-externalize strings, we provide visual representation of the string dependencies related to the need-to-externalize strings.
DA - 2013/4//
PY - 2013/4//
DO - 10.1109/tse.2012.40
VL - 39
IS - 4
SP - 516-536
SN - 1939-3520
KW - Software internationalization
KW - need-to-externalize constant strings
KW - string-taint analysis
ER -
TY - JOUR
TI - Comparing approaches to analyze refactoring activity on software repositories
AU - Soares, Gustavo
AU - Gheyi, Rohit
AU - Murphy-Hill, Emerson
AU - Johnson, Brittany
T2 - JOURNAL OF SYSTEMS AND SOFTWARE
AB - Some approaches have been used to investigate evidence on how developers refactor their code, whether refactorings activities may decrease the number of bugs, or improve developers’ productivity. However, there are some contradicting evidence in previous studies. For instance, some investigations found evidence that if the number of refactoring changes increases in the preceding time period the number of defects decreases, different from other studies. They have used different approaches to evaluate refactoring activities. Some of them identify committed behavior-preserving transformations in software repositories by using manual analysis, commit messages, or dynamic analysis. Others focus on identifying which refactorings are applied between two programs by using manual inspection or static analysis. In this work, we compare three different approaches based on manual analysis, commit message (Ratzinger's approach) and dynamic analysis (SafeRefactor's approach) to detect whether a pair of versions determines a refactoring, in terms of behavioral preservation. Additionally, we compare two approaches (manual analysis and Ref-Finder) to identify which refactorings are performed in each pair of versions. We perform both comparisons by evaluating their accuracy, precision, and recall in a randomly selected sample of 40 pairs of versions of JHotDraw, and 20 pairs of versions of Apache Common Collections. While the manual analysis presents the best results in both comparisons, it is not as scalable as the automated approaches. Ratzinger's approach is simple and fast, but presents a low recall; differently, SafeRefactor is able to detect most applied refactorings, although limitations in its test generation backend results for some kinds of subjects in low precision values. Ref-Finder presented a low precision and recall in our evaluation.
DA - 2013/4//
PY - 2013/4//
DO - 10.1016/j.jss.2012.10.040
VL - 86
IS - 4
SP - 1006-1022
SN - 1873-1228
KW - Refactoring
KW - Repository
KW - Manual analysis
KW - Automated analysis
ER -
TY - JOUR
TI - resilient self-compressive monitoring for large-scale hosting infrastructures
AU - Tan, Y. M.
AU - Venkatesh, V.
AU - Gu, X. H.
T2 - IEEE Transactions on Parallel and Distributed Systems
AB - Large-scale hosting infrastructures have become the fundamental platforms for many real-world systems such as cloud computing infrastructures, enterprise data centers, and massive data processing systems. However, it is a challenging task to achieve both scalability and high precision while monitoring a large number of intranode and internode attributes (e.g., CPU usage, free memory, free disk, internode network delay). In this paper, we present the design and implementation of a Resilient self-Compressive Monitoring (RCM) system for large-scale hosting infrastructures. RCM achieves scalable distributed monitoring by performing online data compression to reduce remote data collection cost. RCM provides failure resilience to achieve robust monitoring for dynamic distributed systems where host and network failures are common. We have conducted extensive experiments using a set of real monitoring data from NCSU's virtual computing lab (VCL), PlanetLab, a Google cluster, and real Internet traffic matrices. The experimental results show that RCM can achieve up to 200 percent higher compression ratio and several orders of magnitude less overhead than the existing approaches.
DA - 2013///
PY - 2013///
DO - 10.1109/tpds.2012.167
VL - 24
IS - 3
SP - 576-586
ER -
TY - JOUR
TI - Stimulus features, resetting curves, and the dependence on adaptation
AU - Arthur, Joseph G.
AU - Burton, Shawn D.
AU - Ermentrout, G. Bard
T2 - JOURNAL OF COMPUTATIONAL NEUROSCIENCE
AB - We derive a formula that relates the spike-triggered covariance (STC) to the phase resetting curve (PRC) of a neural oscillator. We use this to show how changes in the shape of the PRC alter the sensitivity of the neuron to different stimulus features, which are the eigenvectors of the STC. We compute the PRC and STC for some biophysical models. We compare the STCs and their spectral properties for a two-parameter family of PRCs. Surprisingly, the skew of the PRC has a larger effect on the spectrum and shape of the STC than does the bimodality of the PRC (which plays a large role in synchronization properties). Finally, we relate the STC directly to the spike-triggered average and apply this theory to an olfactory bulb mitral cell recording.
DA - 2013/6//
PY - 2013/6//
DO - 10.1007/s10827-012-0433-5
VL - 34
IS - 3
SP - 505-520
SN - 0929-5313
KW - Spike-triggered covariance
KW - Neural oscillator
KW - Phase resetting curve
KW - Perturbation
KW - Adaptation
ER -
TY - JOUR
TI - Shin: Generalized Trust Propagation with Limited Evidence
AU - Hang, Chung-Wei
AU - Zhang, Zhe
AU - Singh, Munindar P.
T2 - COMPUTER
AB - Shin incorporates a probabilistic method for revising trust estimates in trustees, yielding higher prediction accuracy than traditional approaches that base trust exclusively on a series of referrals culminating with the trustee.
DA - 2013/3//
PY - 2013/3//
DO - 10.1109/MC.2012.116
VL - 46
IS - 3
SP - 78-85
SN - 1558-0814
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-84875836507&partnerID=MN8TOARS
ER -
TY - JOUR
TI - Network Virtualization: Technologies, Perspectives, and Frontiers
AU - Wang, Anjing
AU - Iyer, Mohan
AU - Dutta, Rudra
AU - Rouskas, George N.
AU - Baldine, Ilia
T2 - JOURNAL OF LIGHTWAVE TECHNOLOGY
AB - Network virtualization refers to a broad set of technologies. Commercial solutions have been offered by the industry for years, while more recently the academic community has emphasized virtualization as an enabler for network architecture research, deployment, and experimentation. We review the entire spectrum of relevant approaches with the goal of identifying the underlying commonalities. We offer a unifying definition of the term “network virtualization” and examine existing approaches to bring out this unifying perspective. We also discuss a set of challenges and research directions that we expect to come to the forefront as network virtualization technologies proliferate.
DA - 2013/2/15/
PY - 2013/2/15/
DO - 10.1109/jlt.2012.2213796
VL - 31
IS - 4
SP - 523-537
SN - 1558-2213
KW - Network architecture
KW - network virtualization
ER -
TY - JOUR
TI - Integration of Climate and Weather Information for Improving 15-Day-Ahead Accumulated Precipitation Forecasts
AU - Wang, Hui
AU - Sankarasubramanian, A.
AU - Ranjithan, Ranji S.
T2 - JOURNAL OF HYDROMETEOROLOGY
AB - Abstract Skillful medium-range weather forecasts are critical for water resources planning and management. This study aims to improve 15-day-ahead accumulated precipitation forecasts by combining biweekly weather and disaggregated climate forecasts. A combination scheme is developed to combine reforecasts from a numerical weather model and disaggregated climate forecasts from ECHAM4.5 for developing 15-day-ahead precipitation forecasts. Evaluation of the skill of the weather–climate information (WCI)-based biweekly forecasts under leave-five-out cross validation shows that WCI-based forecasts perform better than reforecasts in many grid points over the continental United States. Correlation between rank probability skill score (RPSS) and disaggregated ECHAM4.5 forecast errors reveals that the lower the error in the disaggregated forecasts, the better the performance of WCI forecasts. Weights analysis from the combination scheme also shows that the biweekly WCI forecasts perform better by assigning higher weights to the better-performing candidate forecasts (reforecasts or disaggregated ECHAM4.5 forecasts). Particularly, WCI forecasts perform better during the summer months during which reforecasts have limited skill. Even though the disaggregated climate forecasts do not perform well over many grid points, the primary reason WCI-based forecasts perform better than the reforecasts is due to the reduction in the overconfidence of the reforecasts. Since the disaggregated climate forecasts are better dispersed than the reforecasts, combining them with reforecasts results in reduced uncertainty in predicting the 15-day-ahead accumulated precipitation.
DA - 2013/2//
PY - 2013/2//
DO - 10.1175/jhm-d-11-0128.1
VL - 14
IS - 1
SP - 186-202
SN - 1525-7541
ER -
TY - JOUR
TI - ISABELA for effective in situ compression of scientific data
AU - Lakshminarasimhan, Sriram
AU - Shah, Neil
AU - Ethier, Stephane
AU - Ku, Seung-Hoe
AU - Chang, C. S.
AU - Klasky, Scott
AU - Latham, Rob
AU - Ross, Rob
AU - Samatova, Nagiza F.
T2 - CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
AB - SUMMARY Exploding dataset sizes from extreme‐scale scientific simulations necessitates efficient data management and reduction schemes to mitigate I/O costs. With the discrepancy between I/O bandwidth and computational power, scientists are forced to capture data infrequently, thereby making data collection an inherently lossy process. Although data compression can be an effective solution, the random nature of real‐valued scientific datasets renders lossless compression routines ineffective. These techniques also impose significant overhead during decompression, making them unsuitable for data analysis and visualization, which require repeated data access. To address this problem, we propose an effective method for In situ Sort‐And‐B‐spline Error‐bounded Lossy Abatement (ISABELA) of scientific data that is widely regarded as effectively incompressible. With ISABELA, we apply a pre‐conditioner to seemingly random and noisy data along spatial resolution to achieve an accurate fitting model that guarantees a ⩾0.99 correlation with the original data. We further take advantage of temporal patterns in scientific data to compress data by ≈ 85%, while introducing only a negligible overhead on simulations in terms of runtime. ISABELA significantly outperforms existing lossy compression methods, such as wavelet compression, in terms of data reduction and accuracy. We extend upon our previous paper by additionally building a communication‐free, scalable parallel storage framework on top of ISABELA‐compressed data that is ideally suited for extreme‐scale analytical processing. The basis for our storage framework is an inherently local decompression method (it need not decode the entire data), which allows for random access decompression and low‐overhead task division that can be exploited over heterogeneous architectures. Furthermore, analytical operations such as correlation and query processing run quickly and accurately over data in the compressed space. Copyright © 2012 John Wiley & Sons, Ltd.
DA - 2013///
PY - 2013///
DO - 10.1002/cpe.2887
VL - 25
IS - 4
SP - 524-540
SN - 1532-0634
KW - lossy compression
KW - B-spline
KW - in situ processing
KW - data-intensive application
KW - high performance computing
ER -
TY - CONF
TI - HiDP: A hierarchical data parallel language
AU - Zhang, Y. P.
AU - Mueller, F.
C2 - 2013///
C3 - Proceedings of the 2013 ieee/acm international symposium on code generation and optimization (cgo)
DA - 2013///
SP - 171-181
ER -
TY - CONF
TI - Fast, scalable detection of "piggybacked" mobile applications
AU - Zhou, W.
AU - Zhou, Y.
AU - Grace, M.
AU - Jiang, X.
AU - Zou, S.
AB - Mobile applications (or apps) are rapidly growing in number and variety. These apps provide useful features, but also bring certain privacy and security risks. For example, malicious authors may attach destructive payloads to legitimate apps to create so-called "piggybacked" apps and advertise them in various app markets to infect unsuspecting users. To detect them, existing approaches typically employ pair-wise comparison, which unfortunately has limited scalability. In this paper, we present a fast and scalable approach to detect these apps in existing Android markets. Based on the fact that the attached payload is not an integral part of a given app's primary functionality, we propose a module decoupling technique to partition an app's code into primary and non-primary modules. Also, noticing that piggybacked apps share the same primary modules as the original apps, we develop a feature fingerprint technique to extract various semantic features (from primary modules) and convert them into feature vectors. We then construct a metric space and propose a linearithmic search algorithm (with O(n log n) time complexity) to efficiently and scalably detect piggybacked apps. We have implemented a prototype and used it to study 84,767 apps collected from various Android markets in 2011. Our results show that the processing of these apps takes less than nine hours on a single machine. In addition, among these markets, piggybacked apps range from 0.97% to 2.7% (the official Android Market has 1%). Further investigation shows that they are mainly used to steal ad revenue from the original developers and implant malicious payloads (e.g., for remote bot control). These results demonstrate the effectiveness and scalability of our approach.
C2 - 2013///
C3 - ACM Conference on Data and Application Security and Privacy
DA - 2013///
DO - 10.1145/2435349.2435377
SP - 185-195
ER -
TY - JOUR
TI - Bayesian update method for contaminant source characterization in water distribution systems
AU - Wang, H.
AU - Harrison, K. W.
T2 - Journal of Water Resources Planning and Management
DA - 2013///
PY - 2013///
VL - 139
IS - 1
SP - 13-22
ER -
TY - JOUR
TI - Autogeneration and Autotuning of 3D Stencil Codes on Homogeneous and Heterogeneous GPU Clusters
AU - Zhang, Yongpeng
AU - Mueller, Frank
T2 - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
AB - This paper develops and evaluates search and optimization techniques for autotuning 3D stencil (nearest neighbor) computations on GPUs. Observations indicate that parameter tuning is necessary for heterogeneous GPUs to achieve optimal performance with respect to a search space. Our proposed framework takes a most concise specification of stencil behavior from the user as a single formula, autogenerates tunable code from it, systematically searches for the best configuration and generates the code with optimal parameter configurations for different GPUs. This autotuning approach guarantees adaptive performance for different generations of GPUs while greatly enhancing programmer productivity. Experimental results show that the delivered floating point performance is very close to previous handcrafted work and outperforms other autotuned stencil codes by a large margin. Furthermore, heterogeneous GPU clusters are shown to exhibit the highest performance for dissimilar tuning parameters leveraging proportional partitioning relative to single-GPU performance.
DA - 2013/3//
PY - 2013/3//
DO - 10.1109/tpds.2012.160
VL - 24
IS - 3
SP - 417-427
SN - 1558-2183
KW - Accelerators
KW - GPGPU programming
KW - stencil codes
KW - GPU clusters
ER -
TY - JOUR
TI - Algebraic Optimization for Processing Graph Pattern Queries in the Cloud
AU - Anyanwu, Kemafor
AU - Kim, HyeongSik
AU - Ravindra, Padmashree
T2 - IEEE INTERNET COMPUTING
AB - MapReduce platforms such as Hadoop are now the de facto standard for large-scale data processing, but they have significant limitations for join-intensive workloads typical in Semantic Web processing. This article overviews an algebraic optimization approach based on a Nested TripleGroup Data Model and Algebra (NTGA) that minimizes overall processing costs by reducing the number of MapReduce cycles. It also presents an approach for integrating NTGA-based processing of graph pattern queries into Apache Pig and compares it to execution plans using relational-style algebra operators.
DA - 2013///
PY - 2013///
DO - 10.1109/mic.2012.22
VL - 17
IS - 2
SP - 52-61
SN - 1941-0131
ER -
TY - JOUR
TI - Rational lecture hall polytopes and inflated Eulerian polynomials
AU - Pensyl, ThomasW.
AU - Savage, Carla D.
T2 - RAMANUJAN JOURNAL
DA - 2013/6//
PY - 2013/6//
DO - 10.1007/s11139-012-9393-7
VL - 31
IS - 1-2
SP - 97-114
SN - 1382-4090
KW - Lecture hall partitions
KW - Eulerian polynomials
KW - Ehrhart theory
ER -
TY - JOUR
TI - Protecting Sensitive Labels in Social Network Data Anonymization
AU - Yuan, Mingxuan
AU - Chen, Lei
AU - Yu, Philip S.
AU - Yu, Ting
T2 - IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
AB - Privacy is one of the major concerns when publishing or sharing social network data for social science research and business analysis. Recently, researchers have developed privacy models similar to k-anonymity to prevent node reidentification through structure information. However, even when these privacy models are enforced, an attacker may still be able to infer one's private information if a group of nodes largely share the same sensitive labels (i.e., attributes). In other words, the label-node relationship is not well protected by pure structure anonymization methods. Furthermore, existing approaches, which rely on edge editing or node clustering, may significantly alter key graph properties. In this paper, we define a k-degree-l-diversity anonymity model that considers the protection of structural information as well as sensitive labels of individuals. We further propose a novel anonymization methodology based on adding noise nodes. We develop a new algorithm by adding noise nodes into the original graph with the consideration of introducing the least distortion to graph properties. Most importantly, we provide a rigorous analysis of the theoretical bounds on the number of noise nodes added and their impacts on an important graph property. We conduct extensive experiments to evaluate the effectiveness of the proposed technique.
DA - 2013/3//
PY - 2013/3//
DO - 10.1109/tkde.2011.259
VL - 25
IS - 3
SP - 633-647
SN - 1558-2191
KW - Social networks
KW - privacy
KW - anonymous
ER -
TY - JOUR
TI - Mobile Data Offloading: How Much Can WiFi Deliver?
AU - Lee, Kyunghan
AU - Lee, Joohyun
AU - Yi, Yung
AU - Rhee, Injong
AU - Chong, Song
T2 - IEEE-ACM TRANSACTIONS ON NETWORKING
AB - This paper presents a quantitative study on the performance of 3G mobile data offloading through WiFi networks. We recruited 97 iPhone users from metropolitan areas and collected statistics on their WiFi connectivity during a two-and-a-half-week period in February 2010. Our trace-driven simulation using the acquired whole-day traces indicates that WiFi already offloads about 65% of the total mobile data traffic and saves 55% of battery power without using any delayed transmission. If data transfers can be delayed with some deadline until users enter a WiFi zone, substantial gains can be achieved only when the deadline is fairly larger than tens of minutes. With 100-s delays, the achievable gain is less than only 2%-3%, whereas with 1 h or longer deadlines, traffic and energy saving gains increase beyond 29% and 20%, respectively. These results are in contrast to the substantial gain (20%-33%) reported by the existing work even for 100-s delayed transmission using traces taken from transit buses or war-driving. In addition, a distribution model-based simulator and a theoretical framework that enable analytical studies of the average performance of offloading are proposed. These tools are useful for network providers to obtain a rough estimate on the average performance of offloading for a given WiFi deployment condition.
DA - 2013/4//
PY - 2013/4//
DO - 10.1109/tnet.2012.2218122
VL - 21
IS - 2
SP - 536-550
SN - 1558-2566
KW - Delayed transmission
KW - experimental networks
KW - mobile data offloading
KW - mobility
ER -
TY - JOUR
TI - A Generalized Markov Graph Model: Application to Social Network Analysis
AU - Wang, Tian
AU - Krim, Hamid
AU - Viniotis, Yannis
T2 - IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
AB - In this paper we propose a generalized Markov Graph model for social networks and evaluate its application in social network synthesis, and in social network classification. The model reveals that the degree distribution, the clustering coefficient distribution as well as a newly discovered feature, a crowding coefficient distribution, are fundamental to characterizing a social network. The application of this model to social network synthesis leads to a capacity to generate networks dominated by the degree distribution and the clustering coefficient distribution. Another application is a new social network classification method based on comparing the statistics of their degree distributions and clustering coefficient distributions as well as their crowding coefficient distributions. In contrast to the widely held belief that a social network graph is solely defined by its degree distribution, the novelty of this paper consists in establishing the strong dependence of social networks on the degree distribution, the clustering coefficient distribution and the crowding coefficient distribution, and in demonstrating that they form minimal information to classify social networks as well as to design a new social network synthesis tool. We provide numerous experiments with published data and demonstrate very good performance on both counts.
DA - 2013/4//
PY - 2013/4//
DO - 10.1109/jstsp.2013.2246767
VL - 7
IS - 2
SP - 318-332
SN - 1941-0484
KW - Complex networks
KW - pattern recognition
KW - classification
KW - Markov graph model
ER -
TY - JOUR
TI - Can traditional fault prediction models be used for vulnerability prediction?
AU - Shin, Yonghee
AU - Williams, Laurie
T2 - EMPIRICAL SOFTWARE ENGINEERING
DA - 2013/2//
PY - 2013/2//
DO - 10.1007/s10664-011-9190-8
VL - 18
IS - 1
SP - 25-59
SN - 1573-7616
KW - Software metrics
KW - Complexity metrics
KW - Fault prediction
KW - Vulnerability prediction
KW - Open source project
KW - Automated text classification
ER -