ppxscal/embedding_network huggingface dataset:
A framework for the validation of processor architecture compliance
Authors: Allon Adir, Sigal Asaf, Laurent Fournier, Itai Jaeger, Ofer Peled
Venue: Proceedings of the 44th annual Design Automation Conference (2007)

We present a framework for validating the compliance of a design with a given architecture. Our approach is centered on the concept of misinterpretations. These include missing behavior, wrong understanding of a behavior, or confusion with similar behavior described in the architecture or elsewhere. We formally capture the architecture behavior in the form of flowcharts and automatically derive a list of architecture misinterpretations from these flowcharts. These misinterpretations constitute the backbone of coverage models targeted by a suite of tests. The suite is automatically generated by a model-based test case generator. A compliance validation system based on these principles has been developed and used in two actual industrial processes of checking compliance with the PowerPC architecture.
Disaster Evacuation Guide: Using a Massively Multiagent Server and GPS Mobile Phones
Authors: Yuu Nakajima, Hironori Shiina, Shohei Yamane, Toru Ishida, Hirofumi Yamaki
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

The ubiquitous environment enables us to build systems that provide individual users with personalized navigation services in cities. In developing such a system, it is necessary to estimate the influence and the movement of its users and to get feedback. However, it is difficult to perform tests on such a system given the large number of human subjects involved and its scale, which matches that of a major city. One possible solution is proposed herein, the augmented experiment; it combines a multiagent simulation with a small-scale experiment performed with human subjects. In the experiment, the movements of agents that simulate users are shown to human subjects in order to give them the impression that the environment is populated with a large number of users. In this research, we build a evacuation guide system based on GPS-capable cellular phones and perform an augmented experiment wherein human subjects and evacuee agents are directed while the status of the simulation is passed to the human subjects. Interviews of the human subjects confirmed that the augmented experiment successfully gave the impression that a large number of users were present.
Towards a Framework for Differential Unit Testing of Object-Oriented Programs
Authors: Tao Xie, Kunal Taneja, Shreyas Kale, Darko Marinov
Venue: Proceedings of the Second International Workshop on Automation of Software Test (2007)

Software developers often face the task of determining how the behaviors of one version of a program unit differ from (or are the same as) the behaviors of a (slightly) dif- ferent version of the same program unit. In such situations, developers would like to generate tests that exhibit the be- havioral differences between the two versions, if any dif- ferences exist. We call this type of testing differential unit testing. Some examples of differential unit testing include regression testing, N-version testing, and mutation testing. We propose a framework, called Diffut, that enables dif- ferential unit testing of object-oriented programs. Diffut en- ables "simultaneous" execution of the pairs of correspond- ing methods from the two versions: methods can receive the same inputs (consisting of the object graph reachable from the receiver and method arguments), and Diffut compares their outputs (consisting of the object graph reachable from the receiver and method return values). Given two versions of a Java class, Diffut automatically synthesizes annota- tions (in the form of preconditions and postconditions) in the Java Modeling Language (JML) and inserts them into the unit under test to allow the simultaneous execution of the corresponding methods.
Experiments on Design Pattern Discovery
Authors: Jing Dong, Yajing Zhao
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Design patterns have been applied in many large software systems to help developers coping with recurring design problems. However, pattern-related information is generally lost in system source code. Discovering design pattern instances from source code can help to understand and analyze the software systems. In this paper, we present several experiments on design pattern discovery using our tool. We also compare the results of our experiments with other approaches and identify the need of benchmarks.
Patients Flow: A Mixed-Effects Modelling Approach to Predicting Discharge Probabilities
Authors: Shola Adeyemi, Thierry Chaussalet, Haifeng Xie, Peter Millard
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

A mixed effects approach is hereby introduced to patients flow and length of stay modelling. In, particular, a class of generalized linear mixed models has been used to demonstrate the usefulness of this approach. This modelling technique is used to capture individual patients experience during the process of care as represented by their pathways through the system. The approach could predict the probability of discharge from the system, as well as detect where the system may be going wrong.
Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs
Authors: Suogang Gao, Jun Guo, Wen Liu
Venue: European Journal of Combinatorics (2007)

Let @C be a d-bounded distance-regular graph with d>=3. Suppose that P(x) is a set of strongly closed subgraphs containing x and that P(x,i) is a subset of P(x) consisting of the elements of P(x) with diameter i. Let L(x,i) be the set generated by the intersection of the elements in P(x,i). On ordering L(x,i) by inclusion or reverse inclusion, L(x,i) is denoted by L"O(x,i) or L"R(x,i). We prove that L"O(x,i) and L"R(x,i) are both finite atomic lattices, and give the conditions for them both being geometric lattices. We also give the eigenpolynomial of P(x) on ordering P(x) by inclusion or reverse inclusion.
A Neural Networks Approach for Software Risk Analysis
Authors: Hu Yong, Chen Juhua, Rong Zhenbang, Mei Liu, Xie Kang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Software project development has always been associated with high failure rate. In this paper, we identify the key software risk factors responsible in achieving successful outcome and use a neural network approach to establish a model for minimizing the risks attributed to failed projects. Input of the model is software risk factors that were obtained through interview, and output of the model describes the final outcome of the project. The data for analysis is from real software projects collected through questionnaires. In order to enhance model performance, principal component analysis and genetic algorithm are employed. The experimental result indicates that the software risk analysis can be improved through these methods and that the risk analysis model is effective.
S-T Connectivity on Digraphs with a Known Stationary Distribution
Authors: Kai-Min Chung, Omer Reingold, Salil Vadhan
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We present a deterministic logspace algorithm for solving S-T CONNECTIVITY on directed graphs if (i) we are given a stationary distribution for random walk on the graph and (ii) the random walk which starts at the source vertex s has polynomial mixing time. This result generalizes the recent deterministic logspace algorithm for S-T CONNECTIVITY on undirected graphs [15]. It identifies knowledge of the stationary distribution as the gap between the S-T CONNECTIVITY problems we know how to solve in logspace (L) and those that capture all of randomized logspace (RL).
A data-driven Bayesian sampling scheme for unsupervised image segmentation
Authors: E. Clark
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A Bayesian scheme for fully unsupervised still image segmentation is described. The likelihood function is constructed by assuming that the grey level at each pixel site is a realization of a Gaussian random variable of unknown parameters, there being an uncertain number of distinct Gaussian classes in the image. Spatial connectivity between pixels is encouraged via a Markov random field prior. The task of identifying the model parameters and recovering the underlying class label at each site (i.e. segmentation) is accomplished using a novel reversible jump Markov chain Monte Carlo (MCMC) scheme. This scheme explores the space of possible segmentations via proposals that are driven by the actual image realization-so-called data-driven proposals. The aim is to (i) induce good mixing in regions of high probability, and (ii) to optimize the acceptance probability of the proposals. A key development is a stochastic version of a recursive labeling algorithm which has been used in previous work for fast image region splitting. In the current stochastic context, it yields fast and effective split and merge proposals. The performance of the novel MCMC scheme is illustrated in simulation.
Assessing the maturity of capstone engineering project courses
Authors: M. J. Fain
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

One of the critical issues facing engineering education today is assessment. Engineering departments are asked to determine their program goals then how students meet the outcomes specified. This assessment is driven by the requirement that data be collected that guides changes to the program based on a determination of the difference between goal and outcome. Assessment offers a new approach to modifying engineering education. The major question to be asked in how well engineering educators will meet the challenges posed. Design projects offer a particular challenging area for assessment. Capstone design projects, are an integral part of engineering education at most institutions. The capstone course is typically taken during the final year of study and involves a one or two semester project, typically involving groups. As engineering programs move to adopt assessment there is an increased need to develop methods to assist faculty in understanding the project course, the outcomes actually realized by the project course, and how to structure improvements. The goal of our project is to provide a framework for determining the capability of an engineering project course.
Emergence of Smooth Pursuit using Chaos
Authors: Boris Duran, Giorgio Metta, Giulio Sandini
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

The task of tracking an object has been fully studied and many solutions presented before. However, it is a perfect test bed for the study of a novel model using Coupled Chaos Systems. Once an object appears in front of a camera, we demonstrate that the visual input is enough for the self-organization of the torques applied to each of the axes controlling the motion of a simulated eye. No learning or specific coding of the task is needed beforehand, which results in a very fast adaptation to perturbations.
Design and Implementation of a Middleware for Data Storage in Opportunistic Grids
Authors: Raphael Y. De Camargo, Fabio Kon
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Shared machines in opportunistic grids typically have large quantities of unused disk space. These resources could be used to store application and checkpointing data when the machines are idle, allowing those machines to share not only computational cycles, but also disk space. In this paper, we present the design and implementation of OppStore, a middleware that provides reliable distributed data storage using the free disk space from shared grid ma- chines. The system utilizes a two-level peer-to-peer orga- nization to connect grid machines in a scalable and fault- tolerant way. Finally, we use the concept of virtual ids to deal with resource heterogeneity, enabling heterogeneity- aware load-balancing selection of storage sites.
What pre-exam and post-exam quizzes can tell us about test construction
Authors: C. F. Yokomoto, R. Ware
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

We describe a study of an instructor's ability to write short problems that are effective measures of learning, using the traditional exam which uses formal problems as the standard for comparison. Pre-exam and post-exam quizzes containing short problems were administered in addition to the formal exam. Post-exam quizzes were written after the formal exam was graded, allowing the instructor some insight into the strengths and weaknesses of the students' knowledge, while pre-exam quizzes were written with no a priori knowledge of student capabilities. Correlations and regression analysis were used to compare the pre-exam and post-exam quiz scores with the standard, the formal exam. The results of the analyses suggest that short problems must be carefully written if they are to reflect learning as measured by traditional problem solving exams which use longer problems to measure learning.
Storage-based intrusion detection: watching storage activity for suspicious behavior
Authors: Adam G. Pennington, John D. Strunk, John Linwood Griffin, Craig A. N. Soules, Garth R. Goodson, Gregory R. Ganger
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Storage-based intrusion detection allows storage systems to watch for data modifications characteristic of system intrusions. This enables storage systems to spot several common intruder actions, such as adding backdoors, inserting Trojan horses, and tampering with audit logs. Further, an intrusion detection system (IDS) embedded in a storage device continues to operate even after client systems are compromised. This paper describes a number of specific warning signs visible at the storage interface. Examination of 18 real intrusion tools reveals that most (15) can be detected based on their changes to stored files. We describe and evaluate a prototype storage IDS, embedded in an NFS server, to demonstrate both feasibility and efficiency of storage-based intrusion detection. In particular, both the performance overhead and memory required (152KB for 4730 rules) are minimal.
The Community Cyber Security Maturity Model
Authors: Gregory B. White
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

There have been an increasing number of articles in the press related to various threats and attacks on computer systems and networks. The critical infrastructures upon which our communities, states, and nation rely are increasingly dependent on computer systems and networks and are thus also increasingly vulnerable to cyber attacks upon them. Communities understand their responsibility in terms of being prepared to prevent, detect, and respond to most natural and man-made disasters but few understand what is involved in defending against cyber attacks. The Community Cyber Security Maturity Model provides a structure which communities and states can use to determine their level of preparedness and to create a plan to improve their security posture and enhance their chances of successfully preventing or detecting and responding to a cyber attack.
A paralleled element-free Galerkin analysis for structures with cyclic symmetry
Authors: Ling Liu, Haitian Yang
Venue: Engineering with Computers (2007)

This paper presents a paralleled element-free Galerkin (EFG) algorithm to analyze the structure with cyclic symmetry. The global EFG equation system is proved to be block-circulant under a corresponding symmetry-adapted coordinate system, and is partitioned into a number of smaller independent sub-problems, which are solved simultaneously on a multiprocessor parallel computer in parallel virtual machine. Numerical examples are given to illustrate the correctness, speedup, and efficiency of the proposed algorithm.
Scalable, fault-tolerant management in a service oriented architecture
Authors: Harshawardhan Gadgil, Geoffrey Fox, Shrideep Pallickara, Marlon Pierce
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large number of loosely coupled services. While this has opened up new avenues for building large, complex applications, it has made the management of the application components a non-trivial task. Management is further complicated when services exist on different platforms, are written in different languages, present in varying administrative domains restricted by firewalls and are susceptible to failure. This paper investigates problems that emerge when there is a need to uniformly manage a set of distributed services. We present a scalable, fault-tolerant management framework. Our empirical evaluation shows that the architecture adds an acceptable number of additional resources making the approach feasible.
Workflow automation for processing plasma fusion simulation data
Authors: Norbert Podhorszki, Bertram Ludaescher, Scott A. Klasky
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

The Center for Plasma Edge Simulation project aims to automate the tedious tasks of monitoring the simulation, archiving and post-processing the output. This paper describes the tasks and requirements, the several components developed within the Kepler workflow system to provide the required functionality and the automated workflow solution. Besides functionality, the focus is on the robust execution of the workflow. A user-level checkpoint/restart model has been developed that allows the workflow to restart, moreover, it also performs operations that failed during the previous run.
Using Simulated Fault Injection for Fault Tolerance Assessment of Quantum Circuits
Authors: Oana Boncalo, Mihai Udrescu, Lucian Prodan, Mircea Vladutiu, Alexandru Amaricai
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

This paper addresses the problem of evaluating the Fault Tolerance Algorithms and Methodologies (FTAMs) designed for quantum systems, by adopting the Simulated Fault Injection methodology from classical computation. Due to their wide spectrum of applications (including quantum circuit simulation) and hierarchical features, the HDLs were employed for performing fault injection, as prescribed by the guidelines of the QUERIST project. At the same time, the injection techniques taken from classical circuit simulation had to be adapted to quantum computation requirements, including the specific quantum error models. The experimental simulated fault injection campaigns are thoroughly described along with the experimental results, which confirm the analytical expectations.
Design and analysis of capacity-achieving codes and optimal receivers with low complexity
Authors: Achilleas Anastasopoulos
Venue:  (2006)

High performance channel coding schemes for digital communication systems with low computational complexity are considered under two scenarios. Firstly, when the channel is a memoryless binary-input output-symmetric (MBIOS) channel, we design and analyze channel codes defined on factor graphs that can operate reliably and arbitrarily close to the channel capacity. We show that punctured low-density parity-check (LDPC) codes can achieve capacity on any MBIOS channel under maximum-likelihood (ML) decoding. Moreover, we prove that puncturing preserves the multiplicative gap to capacity of the original LDPC codes with a small enough rate, a fact that suggests high potential of using punctured LDPC codes in rate-compatible coding. The open problem of whether codes with state nodes can achieve capacity on general MBIOS channels with bounded graphical complexity is investigated next. Nonsystematic irregular repeat-accumulate (NIRA) codes are viewed as potential candidates and their ML decoding performance is analyzed. Unable to assert the capacity-achieving capability of NIRA codes, we propose a new family of codes, namely the low-density parity-check and generator matrix codes, and prove that they can achieve capacity on any MBIOS channel using ML decoding and on any binary erasure channel (BEC) using belief propagation decoding with bounded graphical complexity. Motivated by the need to analytically characterize the iterative decoding performance of codes on general MBIOS channels, we give tight performance lower and upper bounds for LDPC codes with iterative decoding. Furthermore, we use these bounds to show that multi-edge type LDPC codes, including nearly all known codes defined on graphs, have the best iterative decoding performance on the BEC among all MBIOS channels with the same uncoded bit error probability, and similarly, have the worst iterative decoding performance on the BEC among all MBIOS channels with the same Bhattacharyya parameter. In the second scenario, more complicated channels with memory are considered. We focus on the channel with additive white Gaussian noise (AWGN) and frequence/phase-jitter, and the flat-fading channel under the block independent assumption to characterize the channel dynamics. We propose polynomial complexity algorithms for optimal detection/decoding without channel state information at the receiver. This result challenges the traditionally believed exponential complexity demand for both uncoded and two-state trellis-coded transmissions.
Secure, Resilient Computing Clusters: Self-Cleansing Intrusion Tolerance with Hardware Enforced Security (SCIT/HES)
Authors: David Arsenault, Arun Sood, Yih Huang
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The formidable difficulty in securing systems stems in large part from the increasing complexity of the systems we build but also the degree to which we now depend on information systems. Complex systems cannot be fully verified under all possible conditions. Self-Cleansing Intrusion Tolerance (SCIT) servers go through periodic cleaning. SCIT can be used to create secure and robust cluster of servers without the impossible requirement of having perfect security on each server in the cluster. In this paper, we identify six SCIT security primitives that must be satisfied. We present a SCIT hardware enhanced (SCIT/HES) implementation that guarantees the incorruptibility of SCIT operations.
Fault diagnosis of a GHz CMOS LNA using high-speed ADC-based BIST
Authors: J. Liobe, M. Margala
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

This paper presents a fault isolation method using the digital signatures from a LNA BIST solution. The fault localization capabilities of the functional test and data analysis methods are demonstrated by circuit level simulation. Also a discussion of the efficacy of this method is given. Results showed that only 16% of the resistive faults examined here cannot be mapped to its specification location in the LNA.
High-order error feedback for noise reduction in state-space digital filters
Authors: T. Hinamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper considers the problem of designing the optimal coefficients of high-order error feedback schemes for state-space digital filters. A technique for the reduction of the output noise variance in state-space digital filters is developed by means of the high-order error feedback consisting of a FIR digital filter. The optimal error feedback structure using all the elements of the coefficient matrices in the FIR digital filter is derived. A numerical example is also given to illustrate the utility of the proposed technique.