Works Published in 2009

search works

Displaying works 41 - 60 of 189 in total

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

2009 report

Streamlining GPU Applications On the Fly – Thread Divergence Elimination through Runtime Thread-Data Remapping

(No. WM-CS-2009-08). Williamsburg, VA: Computer Science Department, The College of William and Mary.

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

Source: NC State University Libraries
Added: February 20, 2021

2009 report

Co-Run Locality Prediction for Proactive Shared-Cache Management

(Technical Report No. WM-CS-2009-03). Computer Science Department, The College of William and Mary.

By: X. Shen & Y. Jiang

Source: NC State University Libraries
Added: January 30, 2021

2009 report

A Systematic Measurement of the Influence of Non-Uniform Cache Sharing on the Performance of Modern Multithreaded Programs

(Technical Report No. WM-CS-2009-04). Computer Science Department, The College of William and Mary.

By: E. Zhang, Y. Jiang & X. Shen

Source: NC State University Libraries
Added: January 30, 2021

2009 report

Program Seminal Behaviors: Automating Input Characterization for Large-Scope Proactive Behavior Prediction

(Technical Report No. WM-CS-2009-07). Computer Science Department, The College of William and Mary.

By: X. Shen, Y. Jiang, E. Zhang, K. Tan, F. Mao & M. Gethers

Source: NC State University Libraries
Added: January 30, 2021

2009 conference paper

Selecting Trustworthy Services: Learning a Bayesian Network

Workshop on Trust in Agent Societies, Seventh International Conference on Autonomous Agents & Multi-Agent Systems. Presented at the Seventh International Conference on Autonomous Agents & Multi-Agent Systems, Budapest, Hungary.

By: C. Hang & M. Singh

Event: Seventh International Conference on Autonomous Agents & Multi-Agent Systems at Budapest, Hungary on May 11, 2009

Source: NC State University Libraries
Added: January 23, 2021

2009 journal article

Finding robust solutions in requirements models

Automated Software Engineering, 17(1), 87–116.

By: G. Gay, T. Menzies*, O. Jalali*, G. Mundy*, B. Gilkerson*, M. Feather*, J. Kiper*

TL;DR: In experiments with real-world requirements engineering models, it is shown that KEYS2 can generate decision ordering diagrams in O(N2) and out-performs other search algorithms (simulated annealing, ASTAR, MaxWalkSat) when assessed in terms of reducing inference times, increasing solution quality, and decreasing variance. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: January 21, 2021

2009 conference paper

Influence of program inputs on the selection of garbage collectors

Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments - VEE '09. Presented at the the 2009 ACM SIGPLAN/SIGOPS international conference.

By: F. Mao*, E. Zhang* & X. Shen*

Event: the 2009 ACM SIGPLAN/SIGOPS international conference

TL;DR: The predictability of the minimum possible heap size is demonstrated, indicating the potential feasibility of the input-specific selection of garbage collectors. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: January 5, 2021

2009 chapter

Incremental Clustering Algorithm for Earth Science Data Mining

In G. Allen, J. Nabrzyski, E. Seidel, G. D. van Albada, J. Dongarra, & P. M. A. Sloot (Eds.), Computational Science – ICCS 2009 (pp. 375–384).

By: R. Vatsavai*

Ed(s): G. Allen, J. Nabrzyski, E. Seidel, G. van Albada, J. Dongarra & P. Sloot

TL;DR: This paper provides an extension of G-means algorithm which automatically learns the number of clusters present in the data and avoids over estimation of thenumber of clusters. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 28, 2020

2009 conference paper

A cross-input adaptive framework for GPU program optimizations

2009 IEEE International Symposium on Parallel & Distributed Processing. Presented at the Distributed Processing (IPDPS).

By: Y. Liu*, E. Zhang* & X. Shen*

Event: Distributed Processing (IPDPS)

TL;DR: An input-adaptive optimization framework, namely G-ADAPT, is developed to address the influence of program inputs by constructing cross-input predictive models for automatically predicting the (near-)optimal configurations for an arbitrary input to a GPU program. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 7, 2020

2009 conference paper

A study on optimally co-scheduling jobs of different lengths on chip multiprocessors

Proceedings of the 6th ACM conference on Computing frontiers - CF '09. Presented at the the 6th ACM conference.

By: K. Tian*, Y. Jiang* & X. Shen*

Event: the 6th ACM conference

TL;DR: This work proposes an A*-based approach to accelerating the search for optimal schedules by as much as several orders of magnitude, and designs and evaluates two approximation algorithms to effectively approximate the optimal schedules with good accuracy and high scalability. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 7, 2020

2009 conference paper

The Centervertex Theorem for Wedge Depth

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Vancouver, British Columbia, Canada.

By: G. Miller, T. Phillips & D. Sheehy

Event: Canadian Conference in Computational Geometry at Vancouver, British Columbia, Canada on August 17-19, 2009

Source: NC State University Libraries
Added: November 15, 2020

2009 journal article

ASR: anonymous and secure reporting of traffic forwarding activity in mobile ad hoc networks

Wireless Networks, 15(4), 525–539.

author keywords: MANET; Security; Anonymity; Packet forwarding; Monitoring; Secure link layer acknowledgment; Secure reporting protocol
TL;DR: A protocol that uses nodes on the data path to securely produce packet-forwarding reports and the integrity and authenticity of reports are preserved through the use of secure link layer acknowledgments and monitoring reports. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID
Added: November 7, 2020

2009 chapter

Practical Quality Assessment of Microarray Data by Simulation of Differential Gene Expression

In Bioinformatics Research and Applications (pp. 18–27).

By: B. Howard n, B. Sick* & S. Heber n

TL;DR: A novel quality assessment method is described that is designed to identify chips that should be discarded from an experiment and assesses whether discarding each chip enhances or obscures the recovery of this known set. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 8, 2020

2009 chapter

Analysis of Cis-Regulatory Motifs in Cassette Exons by Incorporating Exon Skipping Rates

In Bioinformatics Research and Applications (pp. 272–283).

TL;DR: This study provides a dictionary of sequence motifs involved in the regulation of alternative splicing in CNS tissues, and a novel tool to detect such motifs, by applying a two-step approach to identify k-mer seed motifs. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 8, 2020

2009 chapter

Mining of cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing

In Bioinformatics Research and Applications (pp. 260–271).

TL;DR: This paper uses distribution-based quantitative association rule mining to find combinatorial cis -regulatory motifs and to investigate the effect of motif pairs, and shows that motifs that occur in motif pairs typically occur in clusters. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 8, 2020

2009 journal article

The study and handling of program inputs in the selection of garbage collectors

ACM SIGOPS Operating Systems Review, 43(3), 48.

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

TL;DR: Experimental results demonstrate that with regression and classification techniques, it is possible to predict the best garbage collector (along with the minimum possible heap size) with reasonable accuracy given an arbitrary input to an application. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2009 journal article

Program locality analysis using reuse distance

ACM Transactions on Programming Languages and Systems, 31(6), 1–39.

author keywords: Measurement; Languages; Algorithms; Program locality; reuse distance; stack distance; training-based analysis
TL;DR: Two techniques are presented, among the first to enable quantitative analysis of whole-program locality in general sequential code, that predict how the locality of a program changes with its input. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2009 conference paper

Cross-Input Learning and Discriminative Prediction in Evolvable Virtual Machines

2009 International Symposium on Code Generation and Optimization. Presented at the 2009 7th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO).

By: F. Mao* & X. Shen*

Event: 2009 7th Annual IEEE/ACM International Symposium on Code Generation and Optimization (CGO)

author keywords: Cross-Input Learning; Java Virtual Machine; Evolvable Computing; Adaptive Optimization; Input-Centric Optimization; Discriminative Prediction
TL;DR: This work develops a set of techniques that make a virtual machine evolve across production runs, and employs an enriched extensible specification language to resolve the complexities in program inputs. (via Semantic Scholar)
UN Sustainable Development Goal Categories
10. Reduced Inequalities (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2009 conference paper

Speculation with Little Wasting: Saving Cost in Software Speculation through Transparent Learning

2009 15th International Conference on Parallel and Distributed Systems. Presented at the 2009 15th International Conference on Parallel and Distributed Systems.

By: Y. Jiang*, F. Mao* & X. Shen*

Event: 2009 15th International Conference on Parallel and Distributed Systems

TL;DR: Transparent statistical learning is proposed to make speculation cross-input adaptive by learning across iterations and executions, permitting arbitrary depth of speculations, applicable to both loop-level and function-level parallelism. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020

2009 journal article

Proactive Mediation in Plan-Based Narrative Environments

IEEE Transactions on Computational Intelligence and AI in Games, 1(3), 233–244.

By: J. Harris* & R. Young n

author keywords: Games; intelligent systems; interactive computing
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.