University of California, Berkeley Computer Science Division
Overview
Works:  390 works in 422 publications in 1 language and 633 library holdings 

Genres:  Academic theses Handbooks and manuals 
Classifications:  TK7885.A1, 512.50285 
Publication Timeline
.
Most widely held works about
University of California, Berkeley
 Design and evaluation of the SPUR Lisp architecture by George Sabin Taylor( )
 Trust relationships, naming, and secure communication in large distributed computer systems by P. Venkat Rangan( )
 Implementation techniques for continuous media systems and applications by Brian Christopher Smith( )
 Designing VideoBased Interactive Instructions by PeiYu Chi( )
 Reliable multicast congestion control and tree based reliable multicast by Brian Whetten( )
 Leveraging Similar Regions to Improve Genome Data Processing by Kristal Lyn Curtis( )
 Identifying and Resolving Entities in Text by Gregory Christopher Durrett( )
 EndUser Record and Replay for the Web by Shaon Kumar Barman( )
 Variational and Dynamical Perspectives On Learning and Optimization by Andre Yohannes Wibisono( )
 Visual Representations for Finegrained Categorization by Ning Zhang( )
 Abstract Semantics for Software Security Analysis by Zhijie Chen( )
 Understanding Latency Hiding on GPUs by Vasily Volkov( )
 Understanding Memory Configurations for InMemory Analytics by Charles Albert Reiss( )
 Pervasive Wellbeing Technology by Pablo Enrique Paredes Castro( )
 Design of the RISCV Instruction Set Architecture by Andrew Shell Waterman( )
 Fast and accurate quantification and differential analysis of transcriptomes by Harold Joseph Pimentel( )
 Semantics and Pragmatics of Spatial Reference by David Simon Golland( )
 Tapestry : an efficient meshbased display representation for interactive rendering by Maryann Simmons( Book )
 Understanding and Designing Convolutional Networks for Local Recognition Problems by Jonathan Leonard Long( )
 Algorithms for Identifying Syntactic Errors and Parsing with Graph Structured Output by Jonathan Kay Kummerfeld( )
more
fewer
Most widely held works by
University of California, Berkeley
Parallel numerical linear algebra by
James W Demmel(
Book
)
2 editions published between 1992 and 1993 in English and held by 11 WorldCat member libraries worldwide
2 editions published between 1992 and 1993 in English and held by 11 WorldCat member libraries worldwide
A new interface specification methodology and its application to transducer synthesis by
Gaetano Borriello(
Book
)
2 editions published in 1988 in English and held by 8 WorldCat member libraries worldwide
Janus uses a novel approach, based on a small set of templates, to synthesize mixed asynchronous and synchronous control logic. The synthesis algorithm, called Suture, first constructs a skeletal circuit and then locally modifies the design to meet interface timing constraints and eliminate internal race conditions. Optimizations of the resulting sequential logic yield transducers that are compatible in both size and performance to those generated by experienced designers. Three practical examples are used to demonstrate this result
2 editions published in 1988 in English and held by 8 WorldCat member libraries worldwide
Janus uses a novel approach, based on a small set of templates, to synthesize mixed asynchronous and synchronous control logic. The synthesis algorithm, called Suture, first constructs a skeletal circuit and then locally modifies the design to meet interface timing constraints and eliminate internal race conditions. Optimizations of the resulting sequential logic yield transducers that are compatible in both size and performance to those generated by experienced designers. Three practical examples are used to demonstrate this result
The differencing method of set partitioning by Narendra Karmarkar(
Book
)
1 edition published in 1982 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1982 in English and held by 8 WorldCat member libraries worldwide
A study of the parametric uniform Bspline curve and surface representations by
Brian A Barsky(
Book
)
2 editions published in 1983 in English and held by 8 WorldCat member libraries worldwide
This paper explains the parametric uniform Bspline curve and surface representations. The parametric representation is discussed, the properties of the Bspline basis functions is presented. Various end conditions and boundary conditions are described in order to enable the Bspline user to select which of the many options would be appropriate for a particular application. Efficient algorithms are designed and analyzed for Bspline basis function evaluation, and for the evaluation and perturbation of both Bspline curves and surfaces. Finally, difference techniques to accomplish this are also developed
2 editions published in 1983 in English and held by 8 WorldCat member libraries worldwide
This paper explains the parametric uniform Bspline curve and surface representations. The parametric representation is discussed, the properties of the Bspline basis functions is presented. Various end conditions and boundary conditions are described in order to enable the Bspline user to select which of the many options would be appropriate for a particular application. Efficient algorithms are designed and analyzed for Bspline basis function evaluation, and for the evaluation and perturbation of both Bspline curves and surfaces. Finally, difference techniques to accomplish this are also developed
The condition number of similarities that diagonalize matrices by
James W Demmel(
Book
)
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
How illconditioned must a matrix S be if it (block) diagonalizes a given matrix T, i.e. if S 1 TS is block diagonal? The answer depends on how the diagonal blocks partition T's spectrum; the condition number of S is bounded below by a function of the norms of the projection matrices determined by the partitioning. In the case of two diagonal blocks we compute an S which attains this lower bound, and we describe almost best conditioned S's for dividing T into more blocks. We apply this result to bound the error in an algorithms to compute analytic functions of matrices, for instance exp(T). Our techniques also produce bounds for submatrices that appear in the squarerootfree Choleskt and in the GramSchmidt orthogonalization algorithms
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
How illconditioned must a matrix S be if it (block) diagonalizes a given matrix T, i.e. if S 1 TS is block diagonal? The answer depends on how the diagonal blocks partition T's spectrum; the condition number of S is bounded below by a function of the norms of the projection matrices determined by the partitioning. In the case of two diagonal blocks we compute an S which attains this lower bound, and we describe almost best conditioned S's for dividing T into more blocks. We apply this result to bound the error in an algorithms to compute analytic functions of matrices, for instance exp(T). Our techniques also produce bounds for submatrices that appear in the squarerootfree Choleskt and in the GramSchmidt orthogonalization algorithms
Inverse currying transformation on attribute grammars by
R Wilhelm(
Book
)
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation of the condition can be detected as soon as the semantic information used in the condition is computed. It thereby takes into account the evaluation order chosen for the attribute grammar. Inverse currying transformations can be used to enhance context sensitive parsing using predicates on attributes, to eliminate sources of backtrack when parsing according to ambiguous grammars, and to facilitate semanticssupported error correction
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation of the condition can be detected as soon as the semantic information used in the condition is computed. It thereby takes into account the evaluation order chosen for the attribute grammar. Inverse currying transformations can be used to enhance context sensitive parsing using predicates on attributes, to eliminate sources of backtrack when parsing according to ambiguous grammars, and to facilitate semanticssupported error correction
Process migration in DEMOS/MP by Michael L Powell(
Book
)
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Process migration has been added to the DEMOS/MP operating system. A process can be moved during its execution, and continue on another processor, with continuous access to all its resources. Messages are correctly delivered to the process's new location. No centralized algorithms are necessary to move a process
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Process migration has been added to the DEMOS/MP operating system. A process can be moved during its execution, and continue on another processor, with continuous access to all its resources. Messages are correctly delivered to the process's new location. No centralized algorithms are necessary to move a process
Crystal, a timing analyzer for nMOS VLSI circuits by
John K Ousterhout(
Book
)
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Crystal is a timing analyzer for nMOS circuits designed in the MeadConway style. Based on the circuit extracted from a mask set, Crystal determines the length of each clock phase and pinpoints the longest paths. The analysis is independent of specific data values and uses critical path techniques along with s simple RC model of delays. Several additional techniques are used to improve the speed and accuracy of the program, including separate up/down timing, static level assignment, flow control for pass transistors, and precharging
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
Crystal is a timing analyzer for nMOS circuits designed in the MeadConway style. Based on the circuit extracted from a mask set, Crystal determines the length of each clock phase and pinpoints the longest paths. The analysis is independent of specific data values and uses critical path techniques along with s simple RC model of delays. Several additional techniques are used to improve the speed and accuracy of the program, including separate up/down timing, static level assignment, flow control for pass transistors, and precharging
Performance analysis of several backend database architectures by
Berkeley University of California(
Book
)
2 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
The approach in this reasearch consists of constructing several variants of an existing relational database system, INGRES, that partition the database system software into two parts, and assigning these two parts to two computers connected by a local area network. For the purposes of this experiment, six different variants of the database system software were constructed to test the six most interesting functional subdivisions. Each variant was then benchmarked using two different databases and query streams. The communication medium and software were also benchmarked to measure their contribution to the performance of each configuration
2 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
The approach in this reasearch consists of constructing several variants of an existing relational database system, INGRES, that partition the database system software into two parts, and assigning these two parts to two computers connected by a local area network. For the purposes of this experiment, six different variants of the database system software were constructed to test the six most interesting functional subdivisions. Each variant was then benchmarked using two different databases and query streams. The communication medium and software were also benchmarked to measure their contribution to the performance of each configuration
Two problems in concrete complexity : cycle detection and parallel prefix computation by
Faith Ellen(
)
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
The cycle detection problem is to find a repetition in the sequence obtained by applying a function repeatedly to a starting value in its domain. Structural properties of cycle detection algorithms and lower bounds on the number of function evaluations they perform are obtained under the assumption that there is a bound on the amount of memory available. For several classes of algorithms, including those which use two memory locations, optimal or near optimal results are achieved
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
The cycle detection problem is to find a repetition in the sequence obtained by applying a function repeatedly to a starting value in its domain. Structural properties of cycle detection algorithms and lower bounds on the number of function evaluations they perform are obtained under the assumption that there is a bound on the amount of memory available. For several classes of algorithms, including those which use two memory locations, optimal or near optimal results are achieved
Database support for programming environments by Michael L Powell(
Book
)
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
In this paper, we show how to represent programs in the relational model and how traditional programming tasks such as symbol table management are simplified through use of a database. We suggest extensions to relational systems to support more efficient access of recursive data structures, queries involving transitive closure and allow applicationspecific detection of triggers. These extensions can be used for applications other than programming environments
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
In this paper, we show how to represent programs in the relational model and how traditional programming tasks such as symbol table management are simplified through use of a database. We suggest extensions to relational systems to support more efficient access of recursive data structures, queries involving transitive closure and allow applicationspecific detection of triggers. These extensions can be used for applications other than programming environments
Effects of underflow on solving linear systems by
James W Demmel(
Book
)
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
In this paper we examine the effects of underflow on solving systems of linear equations using Gaussian Elimination. Our goal is to decide if reliable software for solving linear in the presence of underflow can be written at reasonable cost. We contrast the utilities of gradual underflow and "store zero", and show that only by using gradual underflow can we achieve reliability easily
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
In this paper we examine the effects of underflow on solving systems of linear equations using Gaussian Elimination. Our goal is to decide if reliable software for solving linear in the presence of underflow can be written at reasonable cost. We contrast the utilities of gradual underflow and "store zero", and show that only by using gradual underflow can we achieve reliability easily
A machine vision based surveillance system for California roads by J Malik(
Book
)
1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 6 WorldCat member libraries worldwide
An interval algorithm for solving systems of linear equations to prespecified accuracy by
James W Demmel(
Book
)
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
We describe an interval arithmetic algorithm for solving a special class of simulataneous linear equations. This class includes but is not limited to systems Ax=b where A and b have integer entries. The algorithm uses fixed point arithemetic, and has two properties which distinguish it from earlier algorithms: given the absolute accuracy e desired, the algorithm uses only as much precision as needed to achieve it, and the algorithm can adjust its own parameters to minimize computation time
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
We describe an interval arithmetic algorithm for solving a special class of simulataneous linear equations. This class includes but is not limited to systems Ax=b where A and b have integer entries. The algorithm uses fixed point arithemetic, and has two properties which distinguish it from earlier algorithms: given the absolute accuracy e desired, the algorithm uses only as much precision as needed to achieve it, and the algorithm can adjust its own parameters to minimize computation time
A new MonteCarlo method for estimating the failure probability of an ncomponent system by
Richard M Karp(
Book
)
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
A new formula for the probability of a union of events is used to express the failure probability fo an ncomponent system. A very simple MonteCarlo algorithm based on the new probability formula is presented. The input to the algorithm gives the failure probabilities of the n components of the system and a list of the failure sets of the system. The output is an unbiased estimator of the failure probability of the system. We show that the average value of the estimator over many runs of the algorthm tends to converge quickly to the failure Probability of the system. The overall time to estimate the failure probability with high accuracy compares very favorably with the execution times of other methods used for solving this problem
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
A new formula for the probability of a union of events is used to express the failure probability fo an ncomponent system. A very simple MonteCarlo algorithm based on the new probability formula is presented. The input to the algorithm gives the failure probabilities of the n components of the system and a list of the failure sets of the system. The output is an unbiased estimator of the failure probability of the system. We show that the average value of the estimator over many runs of the algorthm tends to converge quickly to the failure Probability of the system. The overall time to estimate the failure probability with high accuracy compares very favorably with the execution times of other methods used for solving this problem
A simplified version of H.W. Lenstra's integer programming algorithm and some applications by
A Paz(
Book
)
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
A very interesting algorithm has been recently suggested by H.W. Lenstra, Jr. [1] for solving integer programming problems. One part of that algorithm was further improved in [2]. The algorithm was shown to be polynomial in the length of the input, for a fixed number of variables. On the other hand the algorithm is impractical for a large number of variables and its implementation is not clear even for a small number of variables. We suggest here a few simplifications and improvements to that algorithm, making its implementation easy (though still impractical for a great number of variables). As a byproduct we show how to solve diophantine linear equations over the nonnegative integers. For a small number of variables (3 or 4) a practical and fast algorithm for solving such equation results
1 edition published in 1983 in English and held by 6 WorldCat member libraries worldwide
A very interesting algorithm has been recently suggested by H.W. Lenstra, Jr. [1] for solving integer programming problems. One part of that algorithm was further improved in [2]. The algorithm was shown to be polynomial in the length of the input, for a fixed number of variables. On the other hand the algorithm is impractical for a large number of variables and its implementation is not clear even for a small number of variables. We suggest here a few simplifications and improvements to that algorithm, making its implementation easy (though still impractical for a great number of variables). As a byproduct we show how to solve diophantine linear equations over the nonnegative integers. For a small number of variables (3 or 4) a practical and fast algorithm for solving such equation results
The design and assessment of a hypermedia course on semiconductor manufacturing by Patricia K Schank(
Book
)
1 edition published in 1993 in English and held by 6 WorldCat member libraries worldwide
This article describes the design and evaluation of an ICHIP, a multimedia course on integrated circuit manufacturing (Schank & Rowe, 1992). Subjects browsed the course via standard hypermedia links or linear paths. Learning effects were assessed based on navigation method (hyperlinks vs. path), prior knowledge (low vs. high), and other factors (e.g., subjects' stated interests in semiconductors, and kinds and number of course nodes viewed (by media type and topic area), were also assessed. Results suggest that subjects who browsed via hypermedia links tended to more often bridge topic areas rather than explore them in depth, but there were little or no learning differences by knowledge or navigation group, and neither prior interest nor nodes viewed (by number, topic area, or media type) were correlated with learning. These results and future work are discussed
1 edition published in 1993 in English and held by 6 WorldCat member libraries worldwide
This article describes the design and evaluation of an ICHIP, a multimedia course on integrated circuit manufacturing (Schank & Rowe, 1992). Subjects browsed the course via standard hypermedia links or linear paths. Learning effects were assessed based on navigation method (hyperlinks vs. path), prior knowledge (low vs. high), and other factors (e.g., subjects' stated interests in semiconductors, and kinds and number of course nodes viewed (by media type and topic area), were also assessed. Results suggest that subjects who browsed via hypermedia links tended to more often bridge topic areas rather than explore them in depth, but there were little or no learning differences by knowledge or navigation group, and neither prior interest nor nodes viewed (by number, topic area, or media type) were correlated with learning. These results and future work are discussed
UNIX programmer's manual by K Thompson(
Book
)
4 editions published between 1979 and 1983 in English and held by 5 WorldCat member libraries worldwide
4 editions published between 1979 and 1983 in English and held by 5 WorldCat member libraries worldwide
Evaluation of single and multiple processor office workstations by Robert David Selinger(
)
2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1983 in English and held by 5 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Demmel, James W. Author
 Ousterhout, John K. Author
 Karp, Richard M. 1935 Author
 Powell, Michael L. Author
 University of California, Berkeley Institute of Transportation Studies
 Partners for Advanced Transit and Highways (Calif.)
 University of California, Berkeley
 Vorst, H. A. van der 1944
 Heath, Michael T.
 California Department of Transportation
Associated Subjects
Algebras, Linear AutomobilesAutomatic control Compiling (Electronic computers) Computer algorithms Computer architecture Computer graphics Computer interfaces Computer network protocols Computer networks Computer programming Computers ComputersAccess control ComputersReliability Computer vision Database management Data protection Difference sets Electronic data processingDistributed processing Hypertext systems Image processing Image processingDigital techniques Information storage and retrieval systems Integrated circuitsVery large scale integration Interactive multimedia Linear systems Manufacturing processesStudy and teaching Multimedia systems Numerical analysis Numerical calculations Operating systems (Computers) Partitions (Mathematics) Programming languages (Electronic computers) SemiconductorsStudy and teaching Set theory Timesharing computer systems Transducers University of California, Berkeley.Computer Science Division UNIX (Computer file)
Alternative Names
University of California, Berkeley
CSD
UCB CSD
University of California Berkeley, Calif Computer Science Division
University of California, Berkeley Computer Science Division
University of California, Berkeley Computer Sciences Division
University of California Berkeley Department of Electrical Engineering and Computer Science Computer Science Division
University of California, Berkeley. Department of Electrical Engineering and Computer Sciences. Computer Sciences Division
University of California, Berkeley. Dept. of Electrical Engineering and Computer Sciences. Computer Science Division
Languages