Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Mathematics (22)
- Logic and Foundations (21)
- Computer Engineering (13)
- Engineering (13)
- Software Engineering (10)
-
- Computer and Systems Architecture (8)
- OS and Networks (6)
- Databases and Information Systems (5)
- Statistics and Probability (5)
- Theory and Algorithms (5)
- Probability (3)
- Digital Communications and Networking (2)
- Programming Languages and Compilers (2)
- Social and Behavioral Sciences (2)
- Artificial Intelligence and Robotics (1)
- Arts and Humanities (1)
- Communication (1)
- Discrete Mathematics and Combinatorics (1)
- Earth Sciences (1)
- Geology (1)
- Graphics and Human Computer Interfaces (1)
- Multivariate Analysis (1)
- Other Philosophy (1)
- Philosophy (1)
- Science and Technology Studies (1)
- Keyword
-
- Information Theory (17)
- Probabilistic graphical modeling (17)
- Data mining (16)
- Multivariate analysis discrete multivariate modeling (16)
- Reconstructability Analysis (16)
-
- System theory (8)
- Adaptive computing systems (5)
- Electronic data processing -- Distributed processing (5)
- Functional programming (Computer science) (5)
- Streaming technology (Telecommunications) (5)
- Computer architecture -- Design (4)
- Parallel processing (Electronic computers) (4)
- Software architecture (4)
- System analysis (4)
- Application software -- Development (3)
- Computer architecture (3)
- Computer software -- Development (3)
- Information theory (3)
- Log-linear models (3)
- Multivariate analysis (3)
- Neural networks (Computer science) (3)
- Neural networks -- Structure (3)
- Computer multitasking (2)
- Database management (2)
- Fourier transformations (2)
- Functional programming languages (2)
- Microcomputer workstations (2)
- Middleware (2)
- Multimedia systems (2)
- Multimedia systems - Design (2)
- Publication Year
- Publication
- Publication Type
Articles 31 - 60 of 71
Full-Text Articles in Systems Architecture
Is Parallel Programming Hard, And If So, Why?, Paul E. Mckenney, Maged M. Michael, Manish Gupta, Philip William Howard, Josh Triplett, Jonathan Walpole
Is Parallel Programming Hard, And If So, Why?, Paul E. Mckenney, Maged M. Michael, Manish Gupta, Philip William Howard, Josh Triplett, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Of the 200+ parallel-programming languages and environments created in the 1990s, almost all are now defunct. Given that parallel systems are now well within the budget of the typical hobbyist or graduate student, it is not unreasonable to expect a new cohort in excess of several thousand parallel languages and environments to appear in the 2010s. If this expected new cohort is to have more practical impact than did its 1990s counterpart, a robust and widely applicable framework will be required that encompasses exactly what, if anything, is hard about parallel programming. This paper revisits the fundamental precepts of concurrent …
A Pattern Language For Extensible Program Representation, Andrew P. Black, Daniel Vainsencher
A Pattern Language For Extensible Program Representation, Andrew P. Black, Daniel Vainsencher
Computer Science Faculty Publications and Presentations
For the last 15 years, implementors of multiple view programming environments have sought a single code model that would form a suitable basis for all of the program analyses and tools that might be applied to the code. They have been unsuccessful. The consequences are a tendency to build monolithic, single-purpose tools, each of which implements its own specialized analyses and optimized representation. This restricts the availability of the analyses, and also limits the reusability of the representation by other tools. Unintegrated tools also produce inconsistent views, which reduce the value of multiple views. This article describes a set of …
Application Of Information-Theoretic Data Mining Techniques In A National Ambulatory Practice Outcomes Research Network, Adam Wright, Thomas N. Ricciardi, Martin Zwick
Application Of Information-Theoretic Data Mining Techniques In A National Ambulatory Practice Outcomes Research Network, Adam Wright, Thomas N. Ricciardi, Martin Zwick
Complex Systems Faculty Publications and Presentations
The Medical Quality Improvement Consortium data warehouse contains de-identified data on more than 3.6 million patients including their problem lists, test results, procedures and medication lists. This study uses reconstructability analysis, an information-theoretic data mining technique, on the MQIC data warehouse to empirically identify risk factors for various complications of diabetes including myocardial infarction and microalbuminuria. The risk factors identified match those risk factors identified in the literature, demonstrating the utility of the MQIC data warehouse for outcomes research, and RA as a technique for mining clinical data warehouses.
Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick
Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick
Complex Systems Faculty Publications and Presentations
Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) Reconstructibility Analysis, is presented. It is shown that in some cases while 3-variable NPN-classified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using Modified Reconstructibility Analysis (MRA). Also, it is shown that whenever a decomposition of 3-variable NPN-classified Boolean functions exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. A comparison of the corresponding complexities for Ashenhurst-Curtis decompositions, and Modified Reconstructibility Analysis (MRA) is also presented. While both AC and MRA decompose some but …
A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick
A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick
Complex Systems Faculty Publications and Presentations
Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.
State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson
State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson
Complex Systems Faculty Publications and Presentations
Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. While Jones and his colleagues extended the original variable‐based formulation of RA to encompass models defined in terms of system states, their focus was the analysis and approximation of real‐valued functions. In this paper, we separate two ideas that Jones had merged together: the “g to k” transformation and state‐based modeling. We relate the idea of state‐based modeling to established variable‐based RA concepts and methods, including structure lattices, search strategies, metrics of model quality, and the statistical evaluation of model fit for analyses based …
Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick
Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick
Complex Systems Faculty Publications and Presentations
Modified Reconstructability Analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.
Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick
Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick
Complex Systems Faculty Publications and Presentations
A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do …
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais
Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais
Complex Systems Faculty Publications and Presentations
The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information-theoretic reconstructability analysis can be used to decide on optimal gene ordering.
Using Reconstructability Analysis To Select Input Variables For Artificial Neural Networks, Stephen Shervais, Martin Zwick
Using Reconstructability Analysis To Select Input Variables For Artificial Neural Networks, Stephen Shervais, Martin Zwick
Complex Systems Faculty Publications and Presentations
We demonstrate the use of Reconstructability Analysis to reduce the number of input variables for a neural network. Using the heart disease dataset we reduce the number of independent variables from 13 to two, while providing results that are statistically indistinguishable from those of NNs using the full variable set. We also demonstrate that rule lookup tables obtained directly from the data for the RA models are almost as effective as NNs trained on model variables.
Multi-Level Decomposition Of Probabilistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski
Multi-Level Decomposition Of Probabilistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski
Complex Systems Faculty Publications and Presentations
Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.
Thread Transparency In Information Flow Middleware, Rainer Koster, Andrew P. Black, Jie Huang, Jonathan Walpole, Calton Pu
Thread Transparency In Information Flow Middleware, Rainer Koster, Andrew P. Black, Jie Huang, Jonathan Walpole, Calton Pu
Computer Science Faculty Publications and Presentations
Existing middleware is based on control-flow centric interaction models such as remote method invocations, poorly matching the structure of applications that process continuous information flows. Difficulties cultiesin building this kind of application on conventional platforms include flow-specific concurrency and timing requirements, necessitating explicit management of threads, synchronization, and timing by the application programmer. We propose Infopipes as a high-level abstraction for information flows, and we are developing a middleware framework that supports this abstraction. Infopipes transparently handle complexities associated with control flow and multi-threading. From high-level configuration descriptions the platform determines what parts of a pipeline require separate threads or …
Wholes And Parts In General Systems Methodology, Martin Zwick
Wholes And Parts In General Systems Methodology, Martin Zwick
Complex Systems Faculty Publications and Presentations
Reconstructability analysis (RA) decomposes wholes, namely data in the form either of set-theoretic relations or multivariate probability distributions, into parts, namely relations or distributions involving subsets of variables. Data is modeled and compressed by variablebased decomposition, by more general state-based decomposition, or by the use of latent variables. Models, which specify the interdependencies among the variables, are selected to minimize error and complexity.
State-Based Reconstructability Modeling For Decision Analysis, Michael S. Johnson, Martin Zwick
State-Based Reconstructability Modeling For Decision Analysis, Michael S. Johnson, Martin Zwick
Complex Systems Faculty Publications and Presentations
Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. Jones and his colleagues extended the original variable-based formulation of RA to encompass models defined in terms of system states (Jones 1982; Jones 1985; Jones 1985; Jones 1986; Jones 1989). In this paper, we demonstrate that Jones’ previous work comprises two separable ideas: the “g to k” transformation and state-based modeling. We relate the concept of state-based modeling to established variable-based RA methods (Klir 1985; Krippendorff 1986), and demonstrate that statebased modeling, when applied to event and decision tree models, is a valuable adjunct …
Work In Progress: Automating Proportion/Period Scheduling, David Steere, Jonathan Walpole, Calton Pu
Work In Progress: Automating Proportion/Period Scheduling, David Steere, Jonathan Walpole, Calton Pu
Computer Science Faculty Publications and Presentations
The recent effort to define middleware capable of supporting real-time applications creates the opportunity to raise the level of abstraction presented to the programmer. We propose that proportion/period is a better abstraction for specifying resource needs and allocation than priorities. We are currently investigating techniques to address some issues that are restricting use of proportion/period scheduling to research real-time prototypes. In particular, we are investigating techniques to automate the task of selecting proportion and period, and that allow proportion/period to incorporate job importance under overload conditions.
Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, George G. Lendaris, Thaddeus T. Shannon, Martin Zwick
Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, George G. Lendaris, Thaddeus T. Shannon, Martin Zwick
Complex Systems Faculty Publications and Presentations
We consider the problem of matching domain-specific statistical structure to neural-network (NN) architecture. In past work we have considered this problem in the function approximation context; here we consider the pattern classification context. General Systems Methodology tools for finding problem-domain structure suffer exponential scaling of computation with respect to the number of variables considered. Therefore we introduce the use of Extended Dependency Analysis (EDA), which scales only polynomially in the number of variables, for the desired analysis. Based on EDA, we demonstrate a number of NN pre-structuring techniques applicable for building neural classifiers. An example is provided in which EDA …
Feedback Based Dynamic Proportion Allocation For Disk I/O, Dan Revel, Dylan Mcnamee, Calton Pu, David Steere, Jonathan Walpole
Feedback Based Dynamic Proportion Allocation For Disk I/O, Dan Revel, Dylan Mcnamee, Calton Pu, David Steere, Jonathan Walpole
Computer Science Faculty Publications and Presentations
In this paper we propose to use feedback control to automatically allocate disk bandwidth in order to match the rate of disk I/O to the real-rate needs of applications. We describe a model for adaptive resource management based on measuring the relative progress of stages in a producer-consumer pipeline. We show how to use prefetching to transform a passive disk into an active data producer whose progress can be controlled via feedback. Our progress-based framework allows the integrated control of multiple resources. The resulting system automatically adapts to varying application rates as well as to varying device latencies.
Synthetic Files: Enabling Low-Latency File I/O For Qos-Adaptive Applications, Dylan Mcnamee, Dan Revel, Calton Pu, David Steere, Jonathan Walpole
Synthetic Files: Enabling Low-Latency File I/O For Qos-Adaptive Applications, Dylan Mcnamee, Dan Revel, Calton Pu, David Steere, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Files are a tried and true operating system abstraction. They present a simple byte-stream model of I/O that has proven intuitive for application programmers and efficient for operating system builders. However, current file systems do not provide good support for adaptive continuous media (CM) applications - an increasingly important class of applications that exhibit complex access patterns and are particularly sensitive to variations in I/O performance. To address these problems we propose synthetic files. Synthetic files are specialized views of underlying regular files, and convert complex file access patterns into simple sequential synthetic file access patterns. Synthetic file construction can …
Adaptation Space: Surviving Non-Maskable Failures, Crispin Cowan, Lois Delcambre, Anne-Francoise Le Meur, Ling Liu, David Maier, Dylan Mcnamee, Michael Miller, Calton Pu, Perry Wagle, Jonathan Walpole
Adaptation Space: Surviving Non-Maskable Failures, Crispin Cowan, Lois Delcambre, Anne-Francoise Le Meur, Ling Liu, David Maier, Dylan Mcnamee, Michael Miller, Calton Pu, Perry Wagle, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Some failures cannot be masked by redundancies, because an unanticipated situation occurred, because fault-tolerance measures were not adequate, or because there was a security breach (which is not amenable to replication). Applications that wish to continue to offer some service despite nonmaskable failure must adapt to the loss of resources. When numerous combinations of non-maskable failure modes are considered, the set of possible adaptations becomes complex. This paper presents adaptation spaces, a formalism for navigating among combinations of adaptations. An adaptation space describes a collection of possible adaptations of a software component or system, and provides a uniform way of …
Adaptive Prefetching For Device-Independent File I/O, Dan Revel, Dylan Mcnamee, David Steere, Jonathan Walpole
Adaptive Prefetching For Device-Independent File I/O, Dan Revel, Dylan Mcnamee, David Steere, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Device independent I/O has been a holy grail to operating system designers since the early days of UNIX. Unfortunately, existing operating systems fall short of this goal for multimedia applications. Techniques such as caching and sequential read-ahead can help mask I/O latency in some cases, but in others they increase latency and add substantial jitter. Multimedia applications, such as video players, are sensitive to vagaries in performance since I/O latency and jitter affect the quality of presentation. Our solution uses adaptive prefetching to reduce both latency and jitter. Applications submit file access plans to the prefetcher, which then generates I/O …
Complexity And Decomposability Of Relations, Martin Zwick
Complexity And Decomposability Of Relations, Martin Zwick
Complex Systems Faculty Publications and Presentations
A discrete multivariate relation, defined set-theoretically, is a subset of a cartesian product of sets which specify the possible values of a number of variables. Where three or more variables are involved, the highest order relation, namely the relation between all the variables, may or may not be decomposable without loss into sets of lower order relations which involve subsets of the variables. In a completely parallel manner, the highest order relation defined information-theoretically, namely the joint probability distribution involving all the variables, may or may not be decomposed without loss into lower-order distributions involving subsets of the variables. Decomposability …
Cheetahs Are Fast, But Nearly Irrelevant, Calton Pu, Jonathan Walpole, Charles Consel
Cheetahs Are Fast, But Nearly Irrelevant, Calton Pu, Jonathan Walpole, Charles Consel
Computer Science Faculty Publications and Presentations
A brief paper submitted to the NSF Workshop on New Challenges and Directions for Systems Research, held in St. Louis, Mo., July 31-August 1, 1997. Outlines the case for more cooperation among software system architects, and a less reductionistic approach to software development.
Predictable File Access Latency For Multimedia, Dan Revel, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole
Predictable File Access Latency For Multimedia, Dan Revel, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Multimedia applications are sensitive to I/O latency and jitter when accessing data in secondary storage. Transparent adaptive prefetching (TAP) uses software feedback to provide multimedia applications with file system quality of service (QoS) guarantees. We are investigating how QoS requirements can be communicated and how they can be met by adaptive resource management. A preliminary test of adaptive prefetching is presented.
A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole
A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Shared, multi-user, workstation networks are characterized by unpredictable variability in system load. Further, the concept of workstation ownership is typically present. For efficient and unobtrusive computing in such environments, applications must not only overlap their computation with communication but also redistribute their computations adaptively based on changes in workstation availability and load. Managing these issues at application level leads to programs that are difficult to write and debug. In this paper, we present a system that manages this dynamic multi-processor environment while exporting a simple message-based programming model of a dedicated, distributed memory multiprocessor to applications. Programmers are thus insulated …
Control Uniqueness In Reconstructability Analysis, Martin Zwick
Control Uniqueness In Reconstructability Analysis, Martin Zwick
Complex Systems Faculty Publications and Presentations
When the reconstructability analysis of a directed system yields a structure in which a generated variable appears in more than one subsystem, information from all of the subsystems can be used in modeling the relationship between generating and generated variables. The conceptualization and procedure proposed here is discussed in relation to Klir's concept of control uniqueness.
Adaptive Methods For Distributed Video Presentation, Crispin Cowan, Shanwei Cen, Jonathan Walpole, Carlton Pu
Adaptive Methods For Distributed Video Presentation, Crispin Cowan, Shanwei Cen, Jonathan Walpole, Carlton Pu
Computer Science Faculty Publications and Presentations
This paper describes problems and solutions for delivering real-time, multi-media presentations across the Internet. A key characteristic of presentations of continuous media datatypes, such as digital video and audio, is their need for predictable real-time data delivery. For example, an NTSC quality video presentation requires video frames to be displayed every 1/30th of a second. Variations in this display rate can be observable as stalls or glitches in the video stream and reduce the quality of the presentation [6]. Delivering such presentations across the Internet is difficult because highly variable band- width and latency make it difficult to predict the …
Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole
Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole
Computer Science Faculty Publications and Presentations
We are currently involved in research to enable PVM to take advantage of shared networks of workstations (NOWs) more effectively. In such a computing environment, it is important to utilize workstations unobtrusively and recover from machine failures. Towards this goal, we have enhanced PVM with transparent task migration, checkpointing, and global scheduling. These enhancements are part of the MIST project which takes an open systems approach in developing a cohesive, distributed parallel computing environment. This open systems approach promotes plug-and-play integration of independently developed modules, such as Condor, DQS, A VS, Prospero, XPVM, PIOUS, Ptools, etc. Transparent task migration, in …
Set-Theoretic Reconstructability Of Elementary Cellular Automata, Martin Zwick, Hui Shu
Set-Theoretic Reconstructability Of Elementary Cellular Automata, Martin Zwick, Hui Shu
Complex Systems Faculty Publications and Presentations
Set-theoretic reconstructability analysis is used to characterize the structures of the mappings of elementary cellular automata. The minimum complexity structure for each ECA mapping, indexed by parameter σ, is more effective than the λ parameter of Langton as a predictor of chaotic dynamics.
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Parallel environments consisting of a network of heterogeneous workstations introduce an inherently dynamic environment that differs from multicomputers. Workstations are usually considered “shared” resources while multicomputers provide dedicated processing power. The number of workstations available for use is continually changing; the parallel machine presented by the network is in effect continually reconfiguring itself. Application programs must effectively adapt to the changing number of processing nodes while maintaining computational efficiency. This paper examines methods for adapting to this dynamic environment within the framework of explicit message passing under the data parallel programming model. We present four requirements which we feel a …
Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole
Comet: A Synthetic Benchmark For Message-Passing Architectures, Nalini Ganapati, Steve Otto, Jonathan Walpole
Computer Science Faculty Publications and Presentations
Rapid advances in hardware technology have led to wide diversity in parallel computer architectures. This diversity makes it difficult to evaluate or compare the performance of different parallel computers. Existing benchmarks tend either to be too architecture-specific, or too high-level. Both problems can result in benchmarks that not only provide insufficient information on the performance characteristics of the computer being tested, but are also difficult to port. New benchmarking approaches are needed for new architectural classes, particularly distributed-memory, message-passing computers. This paper focuses on benchmarking distributed-memory message-passing computers. A synthetic benchmark called CoMet (COmmunication METrics), is presented. CoMet is based …