Richard Muntz - Academia.edu (original) (raw)
Papers by Richard Muntz
Proceedings of the 1969 24th national conference on -, 1969
This paper considers the problem of mining closed frequent itemsets over a data stream sliding wi... more This paper considers the problem of mining closed frequent itemsets over a data stream sliding window using limited memory space. We design a synopsis data structure to monitor transactions in the sliding window so that we can output the current closed frequent itemsets at any time. Due to time and memory constraints, the synopsis data structure cannot monitor all possible itemsets. However, monitoring only frequent itemsets will make it impossible to detect new itemsets when they become frequent. In this paper, we introduce a compact data structure, the closed enumeration tree (CET), to maintain a dynamically selected set of itemsets over a sliding window. The selected itemsets contain a boundary between closed frequent itemsets and the rest of the itemsets. Concept drifts in a data stream are reflected by boundary movements in the CET. In other words, a status change of any itemset (e.g., from non-frequent to frequent) must occur through the boundary.
Proceedings RIDE '96. Sixth International Workshop on Research Issues in Data Engineering
High-Density Data Recording and Retrieval Technologies, 1996
ABSTRACT
Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)
Page 1. On Recon guring Query Execution Plans in Distributed Object-Relational DBMS Kenneth W. Ng... more Page 1. On Recon guring Query Execution Plans in Distributed Object-Relational DBMS Kenneth W. Ng y Zhenghao Wang y Richard R. Muntz y Eddie C. Shek z Computer Science Department y Information Sciences Laboratory ...
Lecture Notes in Computer Science, 2002
ABSTRACT In a multi-stage program generation (MSPG) system, a stage-s program generates a stage-s... more ABSTRACT In a multi-stage program generation (MSPG) system, a stage-s program generates a stage-s + 1 program when the values of some variables are known. We call such variables program parameters for stage-s. When program parameters for a stage change during runtime, all later-stage program objects that are generated directly or indirectly based on them need to be dynamically regenerated. We make two contributions. a) We explore a metaobject protocol called reflection across stages (RAS), which allows later-stage program objects to refer back to earlier-stage program objects they originated from. Intercessory procedures can be specified by the earlier-stage program objects to be executed at, e.g., execution of the later stage objects. b) We apply RAS to automating runtime program regeneration, so that affected later-stage programs are automatically regenerated after program parameters change. In an initial experiment, RAS incurred an overhead of 10% when program parameters are invariant. The overhead of RAS plus regeneration is amortized to zero over1.5 executions of the generated program object.
Proceedings of the IEEE, 1975
An overview is presented of queueing theoretic modeling and analysis of interactive computing sys... more An overview is presented of queueing theoretic modeling and analysis of interactive computing systems. While the emphasis is on recent advances, an introduction is given which briefly trices the historical development of this area to put current research in perspective. Models, methods of analysis, and applications to real systems are described. An extensive bibliography provides the references for a more
Journal of the ACM, 1996
Product-form queuing network models have been widely used to model systems with shared resources ... more Product-form queuing network models have been widely used to model systems with shared resources such as computer systems (both centralized and distributed), communication networks, and flexible manufacturing systems. Closed multichain product-form networks are inherently more difficult to analyze than open networks, due to the effect of normalization. Results in workload characterization for closed networks in the literature are often for networks having special structures and only specific performance measures have been considered. In this article, we drive certain properties (insensitivity of conditional state probability distributions and fractional-linearity of Markov reward functions) for a broad class of closed multichain product-form networks. These properties are derived using the most basic flow balance conditions of product-form networks. Then we show how these basic properties can be applied in obtaining error bounds when similar customers are clustered together to speed...
IEEE Transactions on Software Engineering, 1979
IEEE Transactions on Computers, 1969
ACM Computing Surveys, 1978
Journal of The ACM - JACM, 1975
is published quarterly and is distributed to all TC members. Its scope includes the design, imple... more is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters, conference information, and news should be sent to the Editor-in-Chief. Papers for each issue are solicited by and should be sent to the Associate Editor responsible for the issue. Opinions expressed in contributions are those of the authors and do not necessarily reflect the positions of the TC
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), 1999
The Pixelcluster is a system providing real-time rendering capability to large geometric datasets... more The Pixelcluster is a system providing real-time rendering capability to large geometric datasets. By using a cluster of commodity workstations, both spatial and temporal parallelism together can render data at a constant, interactive frame rate. Real-time rendering performed by a single system is limited to displaying each frame at a rate limited by the serial performance of the rendering pipeline. An SNIP platform can increase rendering performance by pipelining the real-time rendering process at the cost of increased input latency. However, effective pipelining is limited by the number of physical processors present and inherent limits to the number of practical pipelining stages in the real-time rendering process. A pipeline depth of three is common for real-time rendering on a single SMP system. The Pixelcluster approaches the real-time rendering problem by using both spatial and temporal parallelism. Spatial parallelism partitions each frame into a set of screen space tiles th...
Proceedings of the international ACM SIGGROUP conference on Supporting group work - GROUP '99, 1999
Performance Evaluation, 1991
ABSTRACT
Interoperating Geographic Information Systems, 1999
Proceedings of the 1969 24th national conference on -, 1969
This paper considers the problem of mining closed frequent itemsets over a data stream sliding wi... more This paper considers the problem of mining closed frequent itemsets over a data stream sliding window using limited memory space. We design a synopsis data structure to monitor transactions in the sliding window so that we can output the current closed frequent itemsets at any time. Due to time and memory constraints, the synopsis data structure cannot monitor all possible itemsets. However, monitoring only frequent itemsets will make it impossible to detect new itemsets when they become frequent. In this paper, we introduce a compact data structure, the closed enumeration tree (CET), to maintain a dynamically selected set of itemsets over a sliding window. The selected itemsets contain a boundary between closed frequent itemsets and the rest of the itemsets. Concept drifts in a data stream are reflected by boundary movements in the CET. In other words, a status change of any itemset (e.g., from non-frequent to frequent) must occur through the boundary.
Proceedings RIDE '96. Sixth International Workshop on Research Issues in Data Engineering
High-Density Data Recording and Retrieval Technologies, 1996
ABSTRACT
Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)
Page 1. On Recon guring Query Execution Plans in Distributed Object-Relational DBMS Kenneth W. Ng... more Page 1. On Recon guring Query Execution Plans in Distributed Object-Relational DBMS Kenneth W. Ng y Zhenghao Wang y Richard R. Muntz y Eddie C. Shek z Computer Science Department y Information Sciences Laboratory ...
Lecture Notes in Computer Science, 2002
ABSTRACT In a multi-stage program generation (MSPG) system, a stage-s program generates a stage-s... more ABSTRACT In a multi-stage program generation (MSPG) system, a stage-s program generates a stage-s + 1 program when the values of some variables are known. We call such variables program parameters for stage-s. When program parameters for a stage change during runtime, all later-stage program objects that are generated directly or indirectly based on them need to be dynamically regenerated. We make two contributions. a) We explore a metaobject protocol called reflection across stages (RAS), which allows later-stage program objects to refer back to earlier-stage program objects they originated from. Intercessory procedures can be specified by the earlier-stage program objects to be executed at, e.g., execution of the later stage objects. b) We apply RAS to automating runtime program regeneration, so that affected later-stage programs are automatically regenerated after program parameters change. In an initial experiment, RAS incurred an overhead of 10% when program parameters are invariant. The overhead of RAS plus regeneration is amortized to zero over1.5 executions of the generated program object.
Proceedings of the IEEE, 1975
An overview is presented of queueing theoretic modeling and analysis of interactive computing sys... more An overview is presented of queueing theoretic modeling and analysis of interactive computing systems. While the emphasis is on recent advances, an introduction is given which briefly trices the historical development of this area to put current research in perspective. Models, methods of analysis, and applications to real systems are described. An extensive bibliography provides the references for a more
Journal of the ACM, 1996
Product-form queuing network models have been widely used to model systems with shared resources ... more Product-form queuing network models have been widely used to model systems with shared resources such as computer systems (both centralized and distributed), communication networks, and flexible manufacturing systems. Closed multichain product-form networks are inherently more difficult to analyze than open networks, due to the effect of normalization. Results in workload characterization for closed networks in the literature are often for networks having special structures and only specific performance measures have been considered. In this article, we drive certain properties (insensitivity of conditional state probability distributions and fractional-linearity of Markov reward functions) for a broad class of closed multichain product-form networks. These properties are derived using the most basic flow balance conditions of product-form networks. Then we show how these basic properties can be applied in obtaining error bounds when similar customers are clustered together to speed...
IEEE Transactions on Software Engineering, 1979
IEEE Transactions on Computers, 1969
ACM Computing Surveys, 1978
Journal of The ACM - JACM, 1975
is published quarterly and is distributed to all TC members. Its scope includes the design, imple... more is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and application of database systems and their technology. Letters, conference information, and news should be sent to the Editor-in-Chief. Papers for each issue are solicited by and should be sent to the Associate Editor responsible for the issue. Opinions expressed in contributions are those of the authors and do not necessarily reflect the positions of the TC
Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), 1999
The Pixelcluster is a system providing real-time rendering capability to large geometric datasets... more The Pixelcluster is a system providing real-time rendering capability to large geometric datasets. By using a cluster of commodity workstations, both spatial and temporal parallelism together can render data at a constant, interactive frame rate. Real-time rendering performed by a single system is limited to displaying each frame at a rate limited by the serial performance of the rendering pipeline. An SNIP platform can increase rendering performance by pipelining the real-time rendering process at the cost of increased input latency. However, effective pipelining is limited by the number of physical processors present and inherent limits to the number of practical pipelining stages in the real-time rendering process. A pipeline depth of three is common for real-time rendering on a single SMP system. The Pixelcluster approaches the real-time rendering problem by using both spatial and temporal parallelism. Spatial parallelism partitions each frame into a set of screen space tiles th...
Proceedings of the international ACM SIGGROUP conference on Supporting group work - GROUP '99, 1999
Performance Evaluation, 1991
ABSTRACT
Interoperating Geographic Information Systems, 1999