Works Published in 2011

search works

Displaying works 41 - 60 of 194 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

2011 journal article

Resumption strategies for interrupted programming tasks

Software Quality Journal, 19(1), 5–34.

By: C. Parnin* & S. Rugaber*

author keywords: Interruption; Resumption strategies; Task context; Task knowledge
TL;DR: An exploratory analysis performed on 10,000 recorded sessions of 86 programmers and a survey of 414 programmers to understand the various strategies and coping mechanisms developers use to manage interrupted programming tasks suggests that task resumption is a frequent and persistent problem for developers. (via Semantic Scholar)
Source: Crossref
Added: November 17, 2020

2011 chapter

Array Regrouping on CMP with Non-uniform Cache Sharing

In Languages and Compilers for Parallel Computing (pp. 92–105).

By: Y. Jiang*, E. Zhang*, X. Shen*, Y. Gao* & R. Archambault*

TL;DR: This work proposes cache-sharing-aware reference affinity analysis for identifying data affinity in multithreading applications that consists of affinity-guided thread scheduling and hierarchical reference-vector merging, handles cache sharing among both hyperthreads and cores, and offers hints for array regrouping and the avoidance of false sharing. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020

2011 journal article

Data Mining in Earth System Science (DMESS 2011)

Procedia Computer Science, 4, 1450–1455.

By: F. Hoffman*, J. Larson*, R. Mills*, B. Brooks*, A. Ganguly*, W. Hargrove*, J. Huang*, J. Kumar*, R. Vatsavai*

author keywords: Data mining; remote sensing; high performance computing; segmentation; change detection; synthesis; visualization
TL;DR: This workshop will demonstrate how data mining techniques are applied in the Earth sciences and describe innovative computer science methods that support analysis and discovery in theEarth sciences. (via Semantic Scholar)
UN Sustainable Development Goal Categories
13. Climate Action (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020

2011 journal article

GX-Means: A model-based divide and merge algorithm for geospatial image clustering

Procedia Computer Science, 4, 186–195.

By: R. Vatsavai*, C. Symons*, V. Chandola* & G. Jun*

author keywords: Clustering; EM; GMM; K-means; G-means; X-means
TL;DR: A computationally effcient model-based split and merge clustering algorithm that incrementally finds model parameters and the number of clusters that avoids certain limitations of these well-known clustering algorithms that are pertinent when dealing with geospatial data. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020

2011 journal article

A scalable gaussian process analysis algorithm for biomass monitoring

Statistical Analysis and Data Mining, 4(4), 430–445.

TL;DR: A GP based online time series change detection algorithm is proposed and demonstrated in detecting different types of changes in Normalized Difference Vegetation Index data obtained from a study area in IA, USA and an efficient Toeplitz matrix based solution is proposed which significantly improves the computational complexity and memory requirements of the proposed GP based method. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020

2011 journal article

The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions

IEEE Transactions on Parallel and Distributed Systems, 22(7), 1192–1205.

By: Y. Jiang*, K. Tian*, X. Shen*, J. Zhang n, J. Chen* & R. Tripathi*

author keywords: Co-scheduling; shared cache; CMP scheduling; cache contention; perfect matching; integer programming
TL;DR: The paper uncovers the computational complexity of the determination of optimal job co-schedules, proving its NP-completeness and introduces a set of algorithms, based on graph theory and Integer/Linear Programming, for computing optimal co- schedules or their lower bounds in scenarios with or without job migrations. (via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2011 conference paper

On-the-fly elimination of dynamic irregularities for GPU computing

Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '11. Presented at the the sixteenth international conference.

By: E. Zhang*, Y. Jiang*, Z. Guo*, K. Tian* & X. Shen*

Event: the sixteenth international conference

TL;DR: G-Streamline is presented, as a unified software solution to dynamic irregularities in GPU computing, which treats both types of irregularities at the same time in a holistic fashion, maximizing the whole-program performance by resolving conflicts among optimizations. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

A step towards transparent integration of input-consciousness into dynamic program optimizations

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications - OOPSLA '11. Presented at the the 2011 ACM international conference.

By: K. Tian*, E. Zhang* & X. Shen*

Event: the 2011 ACM international conference

TL;DR: Experiments on a number of Java programs demonstrate the effectiveness of the techniques in enabling input-consciousness for dynamic optimizations, revealing the feasibility and potential benefits of the new optimization paradigm in some basic settings. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

Correctly Treating Synchronizations in Compiling Fine-Grained SPMD-Threaded Programs for CPU

2011 International Conference on Parallel Architectures and Compilation Techniques. Presented at the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT).

By: Z. Guo*, E. Zhang* & X. Shen*

Event: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT)

TL;DR: A systematic dependence analysis specially designed for handling implicit synchronizations in SPMD-threaded programs is described, unveiling the relations between inter-thread data dependences and correct treatment to synchronizations and presents a dependence-based solution to the problem. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 conference paper

Enhancing Data Locality for Dynamic Simulations through Asynchronous Data Transformations and Adaptive Control

2011 International Conference on Parallel Architectures and Compilation Techniques. Presented at the 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT).

By: B. Wu*, E. Zhang* & X. Shen*

Event: 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT)

TL;DR: This work examines the implications that modern heterogeneous Chip Multiprocessors (CMP) architecture imposes on the optimization paradigm, and develops three techniques to enhance the optimizations, including an asynchronous data transformation algorithm, named TLayout, designed specially to take advantage of modern throughput-oriented processors. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 5, 2020

2011 chapter

Intelligent Machinima Generation for Visual Storytelling

In Artificial Intelligence for Computer Games (pp. 151–170).

By: A. Jhala* & R. Young

Contributors: A. Jhala* & R. Young

TL;DR: This chapter describes Darshak, an end-to-end system that automatically generates camera shot sequences for generation from a given story and visualization goals by an execution module implemented on the game engine. (via Semantic Scholar)
Sources: Crossref, ORCID
Added: August 28, 2020

2011 chapter

Escape from Monkey Island: Evading High-Interaction Honeyclients

In Detection of Intrusions and Malware, and Vulnerability Assessment (pp. 124–143).

TL;DR: This paper examines the security model that high-interaction honeyclients use and evaluates their weaknesses in practice, and presents a number of possible attacks that evade the detection of these tools, while successfully attacking regular visitors of malicious web pages. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 journal article

Learning patterns of university student retention

Expert Systems with Applications, 38(12), 14984–14996.

By: A. Nandeshwar*, T. Menzies* & A. Nelson*

author keywords: Data mining; Student retention; Predictive modeling; Financial aid
TL;DR: Using these techniques, for the goal of predicting if students will remain for the first three years of an undergraduate degree, the following factors were found to be informative: family background and family's social-economic status, high school GPA and test scores. (via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: August 28, 2020

2011 journal article

Empirically evaluating the application of reinforcement learning to the induction of effective and adaptive pedagogical strategies

User Modeling and User-Adapted Interaction, 21(1-2), 137–180.

By: M. Chi*, K. VanLehn*, D. Litman* & P. Jordan*

author keywords: Reinforcement learning; Pedagogical strategy; Machine learning; Human learning
TL;DR: This paper addresses the technical challenges in applying RL to Cordillera, a Natural Language Tutoring System teaching students introductory college physics and shows that the RL-induced policies improved students’ learning gains significantly. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 chapter

A Method for Transferring Probabilistic User Models between Environments

In Interactive Storytelling (pp. 43–54).

By: D. Roberts n & F. Roberts*

TL;DR: A theoretically grounded technique to transfer an observed user model from one domain to another, answering the question: "How can a model obtained from observations of one environment inform a model for another environment?" (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 journal article

Quantitative proteomic analyses of the response of acidophilic microbial communities to different pH conditions

The ISME Journal, 5(7), 1152–1161.

author keywords: acid mine drainage; communities; genotyping; perturbation; proteomics
MeSH headings : Acids / analysis; Bacteria / genetics; Bacteria / growth & development; Bacteria / metabolism; Bacterial Proteins / analysis; Biofilms; Genotype; Hydrogen-Ion Concentration; Proteome / analysis; Proteome / metabolism; Proteomics / methods
TL;DR: The results confirm the importance of pH and related geochemical factors in fine-tuning acidophilic microbial community structure and function at the species and strain level, and demonstrate the broad utility of proteomics in laboratory community studies. (via Semantic Scholar)
UN Sustainable Development Goal Categories
15. Life on Land (OpenAlex)
Source: Crossref
Added: August 28, 2020

2011 chapter

Compressing the Incompressible with ISABELA: In-situ Reduction of Spatio-temporal Data

In Euro-Par 2011 Parallel Processing (pp. 366–379).

By: S. Lakshminarasimhan n, N. Shah n, S. Ethier*, S. Klasky*, R. Latham*, R. Ross*, N. Samatova n

TL;DR: This work proposes 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 and significantly outperforms existing lossy compression methods, such as Wavelet compression. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 chapter

Lessons Learned from Exploring the Backtracking Paradigm on the GPU

In Euro-Par 2011 Parallel Processing (pp. 425–437).

TL;DR: The backtracking paradigm with properties seen as sub-optimal for GPU architectures is explored, using as a case study the maximal clique enumeration problem, and it is found that the presence of these properties limit GPU performance to approximately 1.4-2.25 times a single CPU core. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 chapter

On the Expressiveness of Return-into-libc Attacks

In Lecture Notes in Computer Science (pp. 121–141).

By: M. Tran n, M. Etheridge n, T. Bletsch n, X. Jiang n, V. Freeh n & P. Ning n

TL;DR: This paper presents a generalized R ILC attack called Turing complete RILC (TC-RILC) that allows for arbitrary computations and demonstrates that TC-R ILC satisfies formal requirements of Turing-completeness. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

2011 chapter

Taming Information-Stealing Smartphone Applications (on Android)

In Trust and Trustworthy Computing (pp. 93–107).

TL;DR: A system called TISSA is developed that implements a new privacy mode in smartphones that can empower users to flexibly control in a fine-grained manner what kinds of personal information will be accessible to an application. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.