Results 1  10
of
4,970,884
CyclicCubes: A New Family of Interconnection Networks of Even FixedDegrees
 IEEE Transaction on Parallel and Distributed Systems
, 1998
"... We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to 4. We call the proposed graphs cycliccubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to 4. We call the proposed graphs cycliccubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have
A Note on the Confinement Problem
, 1973
"... This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified. ..."
Abstract

Cited by 532 (0 self)
 Add to MetaCart
This not explores the problem of confining a program during its execution so that it cannot transmit information to any other program except its caller. A set of examples attempts to stake out the boundaries of the problem. Necessary conditions for a solution are stated and informally justified.
Lectures on Etale Cohomology
, 2008
"... These are the notes for a course taught at the University of Michigan in 1989 and 1998. In comparison with my book, the emphasis is on heuristic arguments rather than formal proofs and on varieties rather than schemes. The notes also discuss the proof of the Weil conjectures (Grothendieck and Delig ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
These are the notes for a course taught at the University of Michigan in 1989 and 1998. In comparison with my book, the emphasis is on heuristic arguments rather than formal proofs and on varieties rather than schemes. The notes also discuss the proof of the Weil conjectures (Grothendieck
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 728 (81 self)
 Add to MetaCart
) and to speedaccuracy paradigms; results are found to provide a basis for comparison of these paradigms. It is noted that neural network models can be interfaced to the retrieval theory with little difficulty and that semantic memory models may benefit from such a retrieval scheme.
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
Characteristics of a human cell line transformed by DNA from human adenovirus type 5
, 1977
"... Human embryonic kidney cells have been transformed by exposing cells to sheared fragments of adenovirus type 5 DNA. The transformed cells (designated 293 cells) exhibited many of the characteristics of transformation including the elaboration of a virusspecific tumour antigen. Analysis of the polyp ..."
Abstract

Cited by 671 (14 self)
 Add to MetaCart
polypeptide analogous to the 25o K (LETS) glycoprotein was noted. Hybridization of labelled cellular RNA with restriction fragments of adenovirus type 5 DNA indicated transcription of a portion of the adenovirus genome at the conventional left hand end.
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind
LatticeBased Access Control Models
, 1993
"... The objective of this article is to give a tutorial on latticebased access control models for computer security. The paper begins with a review of Denning's axioms for information flow policies, which provide a theoretical foundation for these models. The structure of security labels in the ..."
Abstract

Cited by 1485 (56 self)
 Add to MetaCart
in the military and government sectors, and the resulting lattice is discussed. This is followed by a review of the BellLaPadula model, which enforces information flow policies by means of its simplesecurity and *properties. It is noted that information flow through covert channels is beyond the scope
Results 1  10
of
4,970,884