Results 1  10
of
70
Dear Mr. Nadeau:
, 2015
"... roster, which indicates the members in attendance, is included in Attachment 1. RTCC’s charge is to monitor and review FHWA’s research and technology activities and advise FHWA on (a) the setting of a research agenda and coordination of highway research with states, universities, and other partners; ..."
Abstract
 Add to MetaCart
; (b) strategies for accelerating the deployment and adoption of innovation; and (c) areas in which research may be needed. RTCC’s review includes the process of setting the research agenda, stakeholder involvement, the conduct of research, peer review, and deployment. The committee’s role
kary mway Networks: the Dual of kary ncubes
"... This article presents kary mway networks, multidimensional mesh and tori networks that are viewed as the dual of kary ncube networks. An mway channel is the physical wiring of m router and processor links. An mway router interfaces two channels only, irrespective of the network topology or dim ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This article presents kary mway networks, multidimensional mesh and tori networks that are viewed as the dual of kary ncube networks. An mway channel is the physical wiring of m router and processor links. An mway router interfaces two channels only, irrespective of the network topology
The Isoperimetric Number of ddimensional kary Arrays
"... The ddimensional kary array A d k is the kfold Cartesian product graph of the path P k on k vertices. We show that the (edge) isoperimetric number of A d k is given by i(A d k ) = i(P k ) = 1=b k 2 c for all k and d, and identify the cardinalities and the structure of the isoperimetric set ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
The ddimensional kary array A d k is the kfold Cartesian product graph of the path P k on k vertices. We show that the (edge) isoperimetric number of A d k is given by i(A d k ) = i(P k ) = 1=b k 2 c for all k and d, and identify the cardinalities and the structure of the isoperimetric
The Panpositionable Hamiltonicity of kary ncubes
"... Abstract—The hypercube Qn is one of the most wellknown and popular interconnection networks and the kary ncube Q k n is an enlarged family from Qn that keeps many pleasing properties from hypercubes. In this article, we study the panpositionable hamiltonicity of Q k n for k ≥ 3 and n ≥ 2. Let x, ..."
Abstract
 Add to MetaCart
cycle C of Q k n such that dC(x, y) =l. The result is optimal since the restrictions on l is due to the structure of Q k n by definition. Index Terms—Hamiltonian, panpositionable, bipanpositionable, kary ncube.
Scalable Architectures with kary ncube clusterc Organization
 IN PROC. OF THE SYMPOSIUM OF PARALLEL AND DISTRIBUTED PROCESSING
, 1993
"... Recent advancements in VLSI and packaging technologies demonstrate attractiveness in building scalable parallel systems using clustered configurations while exploiting communication locality. Clustered architectures using buses or MINs as the intercluster interconnection do not satisfy both the ab ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
the above objectives. This paper proposes a new class of kary ncube clusterc scalable architectures by combining the scalability of kary ncube wormholerouted networks with the costeffectiveness of processor cluster designs. This paper focuses on direct cluster interconnection. The interplay between
Analysis of Algorithms for Listing Equivalence Classes of kary Strings
, 1996
"... We give efficient algorithms for listing equivalence classes of kary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest. These algorithms use space O(n) and time O( p kN), where N is the ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We give efficient algorithms for listing equivalence classes of kary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest. These algorithms use space O(n) and time O( p kN), where N
Inclusion dependencies and their interaction with functional dependencies
, 1984
"... Inclusion dependencies, or INDs (which can say, for example, that every manager is an employee) are studied, including their interaction with functional dependencies, or FDs. A simple complete axiomatization for INDs is presented, and the decision problem for INDs is shown to be PSPACEcomplete. (Th ..."
Abstract

Cited by 98 (9 self)
 Add to MetaCart
complete. (The decision problem for INDs is the problem of determining whether or not C logically implies u, given a set Z of INDs and a single IND u). It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although
Panel: Considerations for Effective Remedy Evaluation Authors and Moderators: Steven C. Nadeau, Coordinating Director, Sediment Management Work Group
"... The remedy evaluation process at contaminated sediment sites encompasses a broad range of policy and technical considerations, both preremedy selection and postremedy selection and implementation. The recent U.S. EPA document Contaminated Sediment Remediation Guidance For Hazardous Waste Sites (De ..."
Abstract
 Add to MetaCart
The remedy evaluation process at contaminated sediment sites encompasses a broad range of policy and technical considerations, both preremedy selection and postremedy selection and implementation. The recent U.S. EPA document Contaminated Sediment Remediation Guidance For Hazardous Waste Sites (December 2005) provides a
Issues in Designing Scalable Systems with kary ncube clusterc Organization
, 1994
"... This paper emphasizes on design issues to build scalable systems with the upcoming trend of kary ncube clusterc interconnection. Such organization takes advantage of VLSI integration and advancements in packaging technologies to interconnect multiple processors into a chip or a board in a costef ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper emphasizes on design issues to build scalable systems with the upcoming trend of kary ncube clusterc interconnection. Such organization takes advantage of VLSI integration and advancements in packaging technologies to interconnect multiple processors into a chip or a board in a
Miocene (Preangerian) molluscs from Kari Orang, northern Kutai, East Borneo C.
"... In 1908 H. Witkamp, then with the Royal Dutch Petroleum Company, collected a number of molluscan fossils at a locality near Sungai Kari Orang, on the north flank of the Kari Orang anticline, the locality subsequently being known simply as Kari Orang. It yielded also a few corals which were described ..."
Abstract
 Add to MetaCart
In 1908 H. Witkamp, then with the Royal Dutch Petroleum Company, collected a number of molluscan fossils at a locality near Sungai Kari Orang, on the north flank of the Kari Orang anticline, the locality subsequently being known simply as Kari Orang. It yielded also a few corals which were
Results 1  10
of
70