Works Published in 2011

search works

Displaying works 181 - 194 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

Making DRAM refresh predictable

REAL-TIME SYSTEMS, 47(5), 430–453.

By: B. Bhat n & F. Mueller n

author keywords: Real-time systems; DRAM; Worst-case execution time; Timing analysis; DRAM refresh; Timing predictability
Source: Web Of Science
Added: August 6, 2018

2011 journal article

A practical fair queuing scheduler: Simplification through quantization

COMPUTER NETWORKS, 55(10), 2392–2406.

By: Z. Dwekat* & G. Rouskas n

Contributors: Z. Dwekat* & G. Rouskas n

author keywords: Packet scheduling; Fair queuing; Tiered service
TL;DR: TSFQ is presented, a new scheduler that exploits certain properties of Internet traffic to speed up the bottleneck operations related to virtual time computation and packet sorting and it is believed that, for network operators, deploying TSFQ scheduling has the potential to enhance their ability to offer and guarantee a wide range of services. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2011 journal article

Online algorithms for advance resource reservations

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 71(7), 963–973.

By: C. Castillo*, G. Rouskas n & K. Harfoush n

Contributors: C. Castillo*, K. Harfoush n & G. Rouskas n

author keywords: Grid computing; Advance reservations; Scheduling; Resource allocation; Resource management
TL;DR: This work uses concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies, and develops efficient implementations of the scheduling algorithms that scale to large Grids. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2011 journal article

Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 8(3), 434–449.

author keywords: Network-level security and protection; intrusion tracing; correlation; stepping stone
TL;DR: This paper is the first that identifies accurate quantitative tradeoffs between the achievable correlation effectiveness and the defining characteristics of the timing perturbation; and a provable upper bound on the number of packets needed to achieve a desired correlation effectiveness, given the amount of timing perturgation. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2011 journal article

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

JOURNAL OF COMBINATORIAL OPTIMIZATION, 21(2), 151–158.

author keywords: Multi-MCT; Multi-MCST; W-hierarchy; Parameterized complexity; Computational complexity
TL;DR: This paper proves parameterized complexity hardness results for the different parameterized versions of the Multi-MCT and Multi-MCST problem under isomorphic embeddings. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2011 article

Digital privacy: theory, policies and technologies

Anton, A. I., Breaux, T. D., Gritzalis, S., & Mylopoulos, J. (2011, March). REQUIREMENTS ENGINEERING, Vol. 16, pp. 1–2.

By: A. Anton n, T. Breaux*, S. Gritzalis* & J. Mylopoulos*

TL;DR: This special issue of the Springer’s RequirementsEngineering journal aims at providing researchers and professionals with insights into the state-of-the-art in Digital Privacy from the views of Theory, Policies andTechnologies. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2011 journal article

Commitment analysis to operationalize software requirements from privacy policies

Requirements Engineering, 16(1), 33–46.

By: J. Young n

author keywords: Requirement; Privacy policy; Compliance; Privacy aware; Commitment; Privilege; Right
TL;DR: This paper presents a methodology for obtaining requirements from privacy policies based on the theory of commitments, privileges, and rights, which was developed through a grounded theory approach. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Crossref, NC State University Libraries
Added: August 6, 2018

2011 journal article

A Probabilistic Approach for Maintaining Trust Based on Evidence

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 40, 221–267.

By: Y. Wang, C. Hang* & M. Singh*

Contributors: Y. Wang, C. Hang* & M. Singh*

TL;DR: This paper builds on a formal model that considers probability and certainty as two dimensions of trust and proposes a mechanism using which an agent can update the amount of trust it places in other agents on an ongoing basis. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2011 journal article

Trustworthy Service Selection and Composition

ACM Transactions on Autonomous and Adaptive Systems, 6(1), 1–17.

By: C. Hang n & M. Singh n

Contributors: C. Hang n & M. Singh n

author keywords: Algorithms; Experimentation; Trust; probabilistic modeling; service-oriented computing
TL;DR: This work proposes two distributed trust-aware service selection approaches: one based on Bayesian networks and the other on a beta-mixture model and shows that both approaches accurately punish and reward services in terms of the qualities they offer, and further that the approaches are effective despite incomplete observations regarding the services under consideration. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries, Crossref
Added: August 6, 2018

2011 journal article

Transparent runtime parallelization of the R scripting language

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 71(2), 157–168.

By: J. Li*, X. Ma n, S. Yoginath*, G. Kora* & N. Samatova n

author keywords: Runtime parallelization; Incremental analysis; Scripting languages
Source: Web Of Science
Added: August 6, 2018

2011 journal article

SeCA: A framework for Secure Channel Assignment in wireless mesh networks

COMPUTER COMMUNICATIONS, 34(4), 567–576.

author keywords: Secure channel assignment; Multi-channel multi-radio; Wireless mesh networks; Relay attack resistance; Misbehavior resistance
TL;DR: This paper addresses the threats to channel assignment in WMNs resulting from node misbehaviors and presents a generic verification framework to detect such misbehavior detection and develops a concrete verification scheme based on this framework and an existing distributed channel assignment scheme. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2011 journal article

Data-intensive document clustering on graphics processing unit (GPU) clusters

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 71(2), 211–224.

By: Y. Zhang, F. Mueller*, X. Cui & T. Potok

author keywords: High-performance computing; Accelerators; Data-intensive computing
TL;DR: The benefits of exploiting the computational power of graphics processing units to study two fundamental problems in document mining, namely to calculate the term frequency-inverse document frequency (TF-IDF) and cluster a large set of documents are assessed. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2011 journal article

Coordinating Computation and I/O in Massively Parallel Sequence Search

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 22(4), 529–543.

author keywords: Scheduling; parallel I/O; bioinformatics; parallel genomic sequence search; BLAST
TL;DR: This study reveals that the lack of coordination between computation scheduling and I/O optimization could result in severe performance issues, and proposes an integrated scheduling approach that effectively improves sequence-search throughput by gracefully coordinating the dynamic load balancing of computation and high-performance noncontiguous I/o. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2011 journal article

P(2)DAP - Sybil Attacks Detection in Vehicular Ad Hoc Networks

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 29(3), 582–594.

author keywords: Coarse-grained hash; fine-grained hash; privacy; security; Sybil attack; vehicular ad hoc network
TL;DR: A lightweight and scalable protocol to detect Sybil attacks in a distributed manner through passive overhearing by s set of fixed nodes called road-side boxes (RSBs), which sees the scheme being able to detectSybil attacks at low overhead and delay, while preserving privacy of vehicles. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

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.