Works Published in 2007
Displaying works 21 - 40 of 140 in total
Sorted by most recent date added to the index first, which may not be the same as publication date order.
2007 conference paper
Lower bounds for approximate factorizations via semidefinite programming
In J. Verschelde & S. M. Watt (Eds.), Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation (SNC '07) (pp. 203–204). New York, NY: ACM Press.
Ed(s): J. Verschelde & S. Watt
Event: International Workshop on Symbolic-Numeric Computation at London, Ontario, Canada on July 25-27, 2007
Source: NC State University Libraries
Added: March 26, 2022
2007 article proceedings
G-lambda and EnLIGHTened: Wrapped In Middleware Co-allocating Compute and Network Resources Across Japan and the US
Presented at the 1st International ICST Conference on Networks for Grid Applications.
Event: 1st International ICST Conference on Networks for Grid Applications
TL;DR:
This paper describes innovative architectures and techniques for reserving and coordinating highly distributed resources, a capability required for many large scale applications, in the United States and Japan.
(via Semantic Scholar)
eudl.eu (publisher PDF)
Sources: Crossref, NC State University Libraries
Added: December 16, 2021
2007 article proceedings
EnLIGHTened Computing: An architecture for co-allocating network, compute, and other grid resources for high-end applications
Presented at the 2007 International Symposium on High Capacity Optical Networks and Enabling Technologies.
Event: 2007 International Symposium on High Capacity Optical Networks and Enabling Technologies
TL;DR:
A prototype of this architectural framework on a national-scale testbed implementation has been used to demonstrate a small number of applications and a set of changes for the middleware have been laid out and are being implemented.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 16, 2021
2007 chapter
Performance Analysis of Traffic-Groomed Optical Networks Employing Alternate Routing Techniques
In L. Mason, T. Drwiega, & J. Yan (Eds.), Managing Traffic Performance in Converged Networks. ITC 2007 (pp. 1048–1059).
Ed(s): L. Mason, T. Drwiega & J. Yan
TL;DR:
This paper considers a tandem traffic-groomed optical network, modeled as a multi-level overflow system, where each level represents a wavelength between adjacent nodes, and shows how the decomposition method provides a good approximate analysis of large overflow systems supporting traffic from multiple sources.
(via Semantic Scholar)
Source: Crossref
Added: October 29, 2021
2007 chapter
Analysis and Provisioning of a Circuit-Switched Link with Variable-Demand Customers
In L. Mason, T. Drwirga, & J. Yan (Eds.), Managing Traffic Performance in Converged Networks. ITC 2007 (pp. 890–900).
Ed(s): L. Mason, T. Drwirga & J. Yan
TL;DR:
This work considers a single circuit-switched communication link, depicted by a Erlang multi-class loss queue, where a customer may vary its required bandwidth during its service, and obtains approximately the steady-state blocking probability of each class of customer.
(via Semantic Scholar)
Source: Crossref
Added: October 29, 2021
2007 chapter
Roadmapping Working Group 4 Results
In V. R. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl, & R. W. Selby (Eds.), Empirical Software Engineering Issues. Critical Assessment and Future Directions (pp. 181–183).
Ed(s): V. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl & R. Selby
TL;DR:
The group carefully considered the factors involved with the maturity of the field of Empirical Software Engineering and found that the progress to move linearly along an axis is not proportional to the amount of work that must take place.
(via Semantic Scholar)
Source: Crossref
Added: September 18, 2021
2007 chapter
Industry-Research Collaboration Working Group Results
In V. R. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl, & R. W. Selby (Eds.), Empirical Software Engineering Issues. Critical Assessment and Future Directions (pp. 153–157).
Ed(s): V. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl & R. Selby
TL;DR:
The agreed-upon deliverable from this session was for a subset of the group to submit a longer version of this report to IEEE Software or the Empirical Software Engineering journal as a set of guidelines.
(via Semantic Scholar)
Source: Crossref
Added: September 18, 2021
2007 chapter
Structuring Families of Industrial Case Studies
In V. R. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl, & R. W. Selby (Eds.), Empirical Software Engineering Issues. Critical Assessment and Future Directions (pp. 134–134).
Ed(s): V. Basili, D. Rombach, K. Schneider, B. Kitchenham, D. Pfahl & R. Selby
TL;DR:
Groups of researchers interested in the same research question(s) can customize and evolve an evaluation framework for the technology under study, which consists of templates for specific quantitative measures to collect with associated instructions on what to include/exclude for consistent measurement collection.
(via Semantic Scholar)
Source: Crossref
Added: August 14, 2021
2007 report
Modeling Relations Between Inputs and Dynamic Behavior for General Programs
(No. WM-CS-2007-07). Williamsburg, VA: Computer Science Department, The College of William and Mary.
Source: NC State University Libraries
Added: February 20, 2021
2007 report
CAPS: Contention-Aware Proactive Scheduling for CMPs
(Technical Report No. WM-CS-2007-09). Computer Science Department, The College of William and Mary.
Source: NC State University Libraries
Added: January 30, 2021
2007 report
Study of the Effects of Program Inputs on Co-Scheduling
(Technical Report No. WM-CS-2007-13). Computer Science Department, The College of William and Mary.
Source: NC State University Libraries
Added: January 30, 2021
2007 report
A Hybrid Framework Bridging Locality Analysis and Cache-Aware Scheduling for CMPs
(Technical Report No. WM-CS-2007-01). Computer Science Dept., The College of William and Mary.
Source: NC State University Libraries
Added: January 30, 2021
2007 conference paper
Engaging viewers through nonphotorealistic visualizations
Proceedings of the 5th international symposium on Non-photorealistic animation and rendering - NPAR '07. Presented at the the 5th international symposium.
Event: the 5th international symposium
TL;DR:
Three new visualization techniques that apply painterly rendering styles to vary interpretational complexity (IC), indication and detail (ID), and visual complexity (VC), image properties that are important to aesthetics are presented.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: December 11, 2020
2007 journal article
A performance study on optical burst switched networks: the ring topology
Photonic Network Communications, 14(1), 63–70.
author keywords: optical burst switched networks; performance study
TL;DR:
This paper proposes using multiple receivers or fiber delay lines (FDL) in front of the receivers in order to reduce the receiver blocking probability and indicates that receiver blocking can be almost eliminated by using as little as three receivers and can be reduced by using a FDL of small length.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 13, 2020
2007 journal article
An efficient spatial semi-supervised learning algorithm
International Journal of Parallel, Emergent and Distributed Systems, 22(6), 427–437.
author keywords: Semi-supervised learning; MLC; MAP; EM; Random fields; image analysis; 62M40; 68U10
TL;DR:
This study shows that although, in general, classification accuracy improves with the addition of unlabeled training samples, it is not guaranteed to achieve consistently higher accuracies unless sufficient care is exercised when designing a semi-supervised classifier.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 10, 2020
2007 journal article
Miss Rate Prediction Across Program Inputs and Cache Configurations
IEEE Transactions on Computers, 56(3), 328–343.
author keywords: cache memories; modeling techniques; performance analysis and design aids; compilers; optimization
TL;DR:
An interactive visualization tool that uses a three-dimensional plot to show miss rate changes across program data sizes and cache sizes and its use in evaluating compiler transformations and other uses of this visualization tool include assisting machine and benchmark-set design.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2007 journal article
Predicting locality phases for dynamic memory optimization
Journal of Parallel and Distributed Computing, 67(7), 783–796.
author keywords: program phase prediction; phase hierarchy; locality analysis and optimization; reconfigurable architecture; dynamic optimization
TL;DR:
The accuracy and the granularity of phase and phase-sequence prediction as well as its uses in dynamic data packing, memory remapping, and cache resizing are shown.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2007 conference paper
Locality approximation using time
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '07. Presented at the the 34th annual ACM SIGPLAN-SIGACT symposium.
Event: the 34th annual ACM SIGPLAN-SIGACT symposium
TL;DR:
This work proposes a statistical model that converts cheaply obtained time distance to the more costly reuse distance, and reduces measuring time by a factor of 17, and approximates cache line reuses with over 99% accuracy and the cache miss rate with less than 0.4% average error.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2007 conference paper
Software behavior oriented parallelization
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07. Presented at the the 2007 ACM SIGPLAN conference.
Event: the 2007 ACM SIGPLAN conference
author keywords: speculative parallelization; program behavior
TL;DR:
The main goal of the paper is to demonstrate that the general protection can be made cost effective by three novel techniques: programmable speculation, critical-path minimization, and value-based correctness checking.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education
(OpenAlex)
Sources: Crossref, NC State University Libraries
Added: September 6, 2020
2007 journal article
TARP: Ticket-based address resolution protocol
Computer Networks, 51(15), 4322–4337.
author keywords: network security; ARP security
TL;DR:
TARP implements security by distributing centrally issued secure MAC/IP address mapping attestations through existing ARP messages and improves the costs of implementing ARP security by as much as two orders of magnitude over existing protocols.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries, ORCID
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.
