Works Published in 2003

search works

Displaying works 81 - 100 of 122 in total

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

2003 chapter

Agent communication languages: Rethinking the principles

In Communication in multiagent systems: Agent communication languages and conversation policies (Vol. 2650, pp. 37–50).

By: M. Singh n

TL;DR: The author proposes a conceptual shift from individual agent representations to social interaction and looks at the underlying reasons why agents from different vendors--or even different research projects--cannot communicate with each other. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

A computational model as neurodecoder based on synchronous oscillation in the visual cortex

Neural Computation, 15(10), 2399–2418.

By: S. Zhao, X. Xiong, G. Yao & Z. Fu

Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

The impact of timing knowledge on the session problem

SIAM JOURNAL ON COMPUTING, 32(4), 1007–1039.

By: I. Rhee* & J. Welch

author keywords: session problem; partially synchronous models; timing information; distributed computing; upper bounds; lower bounds
TL;DR: A modular proof technique for obtaining asymptotically tight bounds on the time complexity of the session problem for the four shared memory models and the 16 message passing models is presented. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Optimal quantization of periodic task requests on multiple identical processors

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 14(8), 795–806.

Contributors: L. Jackson n & G. Rouskas n

author keywords: multiprocessor scheduling; periodic tasks scheduling; quantization
TL;DR: This work defines the periodic task quantization problem with deterministic input (PTQ-D) and presents an optimal polynomial time dynamic programming solution, and presents a fast online algorithm that schedules quantized periodic tasks. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2003 journal article

Optimal one-page tree embeddings in linear time

INFORMATION PROCESSING LETTERS, 87(2), 59–66.

By: R. Hochberg & M. Stallmann*

author keywords: algorithms; optimal embedding; one-page embedding; anchored tree
TL;DR: This work presents a linear-time algorithm for finding the optimal embedding (arrangement) in a restricted but important class of embeddings called one-page embeddeddings. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2003 journal article

On the physical and logical topology design of large-scale optical networks

Journal of Lightwave Technology, 21(4), 904–915.

By: Y. Xin, G. Rouskas & H. Perros

Contributors: H. Perros, G. Rouskas & Y. Xin

Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018

2003 chapter

Image registration and segmentation by maximizing the Jensen-Renyi divergence

In M. F. A. Rangarajan & J. Zerubia (Eds.), Energy minimization methods in computer vision and pattern recognition (Vol. 2683, pp. 147–163).

Ed(s): M. A. Rangarajan & J. Zerubia

TL;DR: This paper analyzes the theoretical properties of the Jensen-Renyi divergence which is defined between any arbitrary number of probability distributions and derives its maximum value, and also some performance upper bounds in terms of the Bayes risk and the asymptotic error of the nearest neighbor classifier. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

Delay-based congestion avoidance for TCP

IEEE-ACM TRANSACTIONS ON NETWORKING, 11(3), 356–369.

By: J. Martin*, A. Nilsson n & I. Rhee n

author keywords: TCP congestion control; delay-based congestion avoidance (DCA); TCP/Vegas; loss and round-trip time (RTT) correlation patterns
TL;DR: This research focuses on delay-based congestion avoidance algorithms (DCA), like TCP/Vegas, which attempt to utilize the congestion information contained in packet round-trip time (RTT) samples, and shows evidence suggesting that a single deployment of DCA is not a viable enhancement to TCP over high-speed paths. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 chapter

Asynchronous genetic algorithms for heterogenous networks using course-grained dataflow

In Genetic and evolutionary computation--GECCO 2003: Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003: Proceedings (Vol. 2723, pp. 730–741).

By: J. Baugh n & S. Kumar*

TL;DR: A new approach for implementing asynchronous GAs based on the dataflow model of computation is presented -- an approach that retains the functional properties of a global parallel GA and can be substantially improved through dataflow-based asynchrony. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

A reduction-graph model of precedent in legal analysis

Artificial Intelligence (New York, N.Y. : 1970), 150(02-Jan), 59–95.

Source: NC State University Libraries
Added: August 6, 2018

2003 article

Precluding incongruous behavior by aligning software requirements with security and privacy policies

Anton, A. I., Earp, J. B., & Carter, R. A. (2003, November 1). INFORMATION AND SOFTWARE TECHNOLOGY, Vol. 45, pp. 967–977.

By: A. Anton n, J. Earp n & R. Carter*

author keywords: privacy policy; security policy; requirements alignment
TL;DR: Validated techniques to identify conflicts between system requirements and the governing security and privacy policies are presented and are generalizable to other domains, in which systems contain sensitive information. (via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Jumpstart just-in-time signaling protocol: a formal description using extended finite state machines

Optical Engineering, 42(2), 568–585.

By: A. Zaim, I. Baldine, M. Cassada, G. Rouskas, H. Perros & D. Stevenson

Contributors: I. Baldine, M. Cassada, H. Perros, G. Rouskas, D. Stevenson & A. Zaim

TL;DR: An eight-tuple extended finite state machine (EFSM) model is applied to formally specify the protocol for a just-in-time (JIT) signaling scheme running over a core dense wavelength division multiplexing (DWDM) network that utilizes optical burst switches (OBSs). (via Semantic Scholar)
Sources: ORCID, NC State University Libraries, NC State University Libraries
Added: August 6, 2018

2003 journal article

Trustworthy service composition: Challenges and research questions

Lecture Notes in Computer Science, 2631, 39–52.

By: M. Singh n

Contributors: M. Singh n

TL;DR: This work applies multiagent systems techniques to model interactions among principals and draws attention to a variety of important settings where Web services would be composed, leading to superior methods through which trust can be evolved and managed in realistic service-composition settings. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018

2003 chapter

The PEPS software tool

In W. H. S. P. Kemper (Ed.), Computer performance evaluation: Modelling techniques and tools: 13th international conference, TOOLS 2003, Urbana, IL, USA, September 2-5, 2003 (Vol. 2794, pp. 98–115).

Ed(s): W. P. Kemper

TL;DR: This paper presents the numerical techniques included in version 2003 of the Peps software, the basics of its interface and three practical examples. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

Target detection and localization in visual search: A dual systems perspective

Perception & Psychophysics, 65(5), 678–694.

By: G. Liu*, C. Healey n & J. Enns*

MeSH headings : Adult; Female; Goals; Humans; Male; Reaction Time; Signal Detection, Psychological; Space Perception; Visual Perception
TL;DR: The results indicated that target detection was influenced more by orientation differences in 3-D space than by 2-D pictorial differences, and target localization was more accurate for direct than for indirect pointing, and there were performance costs for indirect localization when it followed target detection, but not for direct localization. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 chapter

Pair learning: With an eye toward future success

In Extreme programming and agile methods: XP/Agile Universe 2003: Third XP Agile Universe Conference, New Orleans, LA, USA, August 10-13, 2003 (Vol. 2753, pp. 185–198).

TL;DR: An experiment was run at North Carolina State University to assess the efficacy of pair programming as an alternative educational technique in an introductory programming course and found that the retention rate of the students in the introductory programming courses is equal to or better than that of theStudents in the solo programming courses. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

2003 journal article

Optical layer multicast: Rationale, building blocks, and challenges

IEEE NETWORK, 17(1), 60–65.

By: G. Rouskas n

Contributors: G. Rouskas n

TL;DR: The underlying principles and essential components for a practical optical multicast service are examined and a set of key research challenges are presented along with a survey of the literature. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2003 article

Early termination in sparse interpolation algorithms

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 365–400.

By: E. Kaltofen n & E. Lee*

author keywords: early termination; sparse polynomial; black box polynomial; interpolation; sparse interpolation; randomized algorithm
TL;DR: Based on early termination, racing algorithms execute simultaneously dense and sparse algorithms that can be embedded as the univariate interpolation substep within Zippel's multivariate method. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2003 journal article

Discovering calendar-based temporal association rules

DATA & KNOWLEDGE ENGINEERING, 44(2), 193–218.

By: Y. Li*, P. Ning n, X. Wang* & S. Jajodia*

author keywords: knowledge discovery; temporal data mining; association rule; time granularity
Source: Web Of Science
Added: August 6, 2018

2003 chapter

Construction of reliable software in resource-constrained environments

In W. R. Blischke & D. N. P. Murthy (Eds.), Case studies in reliability and maintenance (Wiley series in probability and statistics).

By: M. Vouk n & A. Rivers

Ed(s): . W. R. Blischke & D. Murthy

TL;DR: It is interesting to note that there are experimental results showing that testing efficiency can be improved over longer periods of time through process improvement, and that software quality does appear to be positively correlated with an increase in the average testing efficiency that stems from process improvements. (via Semantic Scholar)
Source: NC State University Libraries
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.