ppxscal/embedding_network huggingface dataset:
Estimation of Execution times on Heterogeneous Supercomputer Architectures
Authors: Jaehyung Yang, Ishfaq Ahmad, Arif Ghafoor
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

For managing tasks efficiently in a Distributed Het erogeneous Supercomputing System (DHSS) , we re quire a thorough understanding of applications and their intelligent scheduling within the system. For this purpose, an accurate estimation of the execu tion time of applications on various architectures is needed. In this paper we present a framework to ad dress this issue. We propose two techniques, called augmented code profiling and augmented analytical benchmarking, to characterize applications and archi tectures in a DHSS, respectively. These techniques are based on code profiling and analytical benchmarking, respectively and provide a detailed architectural-dependent characterization of DHSS applications.
Secure object sharing in java card
Authors: Michael Montgomery, Ksheerabdhi Krishna
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Since the invention of the Java Card, the issue of code and data sharing has been a topic of great interest. Early Java Cards shared data via files secured with access control lists. Java Card 2.1 specification introduced a method of object sharing, allowing access to methods of server applets using Shareable Interface Objects (SIO). However, this SIO approach can be improved. It permits access to all interfaces of the SIO, whereas some interfaces may be intended only for particular clients. AID impersonation could be used to gain access to services unless the card authenticates all applets. Access to a SIO by future applets may be impossible. Passing object data between applets is quite cumbersome. An approach to object sharing based on delegates is described, which provides needed improvements with minimal modifications to Java Card 2.1. Using the delegate approach, only the desired methods of an applet are exposed, and each method can be protected by any security policy the applet wishes to implement. A shared secret security policy is described, using challenge/response phrases to avoid revealing the shared secret. Such a security policy does not require applet authentication to avoid AID impersonation, and lends itself readily to access by any future applets that may be written.
Corporate Blogging: Building community through persistent digital talk
Authors: Anne Jackson, JoAnne Yates, Wanda Orlikowski
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Blogging has grown exponentially on the Internet; however, the role of blogs within the enterprise remains ambiguous. Why and how do individuals use internal corporate blogs? What results do both individuals and the corporation realize from internal blogs? Our exploratory study of a large global IT corporation's internal blogging system analyzed usage statistics, interviews, and the results of an anonymous, web-based survey. We found that benefits to users were social as well as informational, and that connecting with their community was an important value sought by all types of users. Heavy users of the system realized the greatest benefits, but they also constituted the core of an online community that provided important benefits to medium users as well.
Performance Analysis of a Middleware Demultiplexing Pattern
Authors: U. Praphamontripong, S. Gokhale, Aniruddha Gokhale, Jeff Gray
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A key enabler of the recently adopted, assembly-centric development approach for distributed real-time software systems is QoS-enabled middleware, which provides reusable building blocks in the form of design patterns that codify solutions to commonly recurring problems. These patterns can be customized by choosing an appropriate set of configuration parameters. The configuration options of a pattern exert a strong influence on system performance, which especially for real-time systems is of paramount importance. Despite this significant influence, currently there are no techniques available to analyze performance at design time, prior to the use of a pattern in a system. Many software systems are based on an event-driven paradigm, primarily because it fosters evolvability and composability. The event demultiplexing and dispatching capabilities that are uniformacross such systems are encapsulated in the Reactor pattern, which can be used to facilitate their development. Design-time performance analysis of these event-driven systems thus requires a model of the Reactor pattern. In this paper, we present a performance model of the Reactor pattern based on the Stochastic Reward Net (SRN) modeling paradigm. We discuss how the model can be used to obtain performance metrics such as throughput, loss probability and upper and lower bounds on the response time. We illustrate the use of the model to guide the selection of configuration options and for sensitivity analysis using a case study of a handheld mobile device. We also validate the performance estimates obtained from the model using simulation.
The Water Table: a fluid exhibit for the Carnegie Science Center
Authors: L. J. Oms
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

In the summer of 1995 the Carnegie Science Center, USA, a science museum for children, asked the Engineering Design Research Center (EDRC), a research and educational organization within Carnegie Mellon University, to assist them in the design of educational fluid exhibits. Among the ideas developed by the students working in the program was "The Water Table", a water channel display of variable speed water flow. This exhibit allows children to interactively play with a stimulating display while gaining insight into the flow behaviour. Specifically, children can compare and contrast laminar and turbulent flows, observe vortex shedding and flow separation as water travels around different shaped objects interrupting the flow. Several factors, both cognitive and technical, have been considered during the design process and have contributed to the learning experience. The educational goals of this project are most tangible when one looks at the multiple outcomes it has produced. One important outcome is the interactive fashion in which The Water Table encourages children in sharing, learning and understanding flow behaviour. Furthermore, this project has helped develop engineering and design skills of the undergraduate students involved. The objective of this paper is to describe the learning experience of the undergraduate students who designed, prototyped and built The Water Table exhibit.
Creeper: an algorithm for decoding convolutional codes
Authors: V. Imtawil
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

There are two main strategies for decoding convolutional codes: the well-known Viterbi algorithm and sequential decoding. This paper presents a comparison of Creeper, an algorithm for sequential decoding, and the Viterbi algorithm. Creeper is an algorithm which combines the best properties of both the stack and the Fano algorithms. It requires less memory than the stack algorithm and has no backward moves as in the Fano algorithm. Some results of simulation show that Creeper is an interesting alternative to the Viterbi algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Homomorphism bounds for oriented planar graphs
Authors: T. H. Marshall
Venue: Journal of Graph Theory (2007)

If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a homomorphism bound for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to H. We find some necessary conditions for a graph to be a homomorphism bound for the class of oriented planar graphs and prove that such a graph must have maximum degree at least 16; thus there exists an oriented planar graph with oriented chromatic number at least 17. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 175&ndash;190, 2007
Working Class Hero
Authors: David Alan Grier
Venue: Computer (2007)

Linux and open source software represent a force that long predates the computer era: the notion of contributing to the common good.
Principles of Superdeduction
Authors: Paul Brauner, Clement Houtmann, Claude Kirchner
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in the theory in a uniform way. Introduced ten years ago, Deduction modulo allows us to make use of the computational part of the theory Th for true computations modulo which deductions are performed. Focusing on the sequent calculus, this paper presents and studies the dual concept where the theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. We call such a new deduction system "superdeduction". We introduce a proof-term language and a cut-elimination procedure both based on Christian Urban's work on classical sequent calculus. Strong normalisation is proven under appropriate and natural hypothesis, therefore ensuring the consistency of the embedded theory and of the deduction system. The proofs obtained in such a new system are much closer to the human intuition and practice. We consequently sketch how superdeduction along with deduction modulo can be used to ground the formal foundations of new extendible proof assistants like lemuridæ, our prototypal implementation of superdeduction modulo.
Hand radiograph image segmentation using a coarse-to-fine strategy
Authors: Chin-Chuan Han, Chang-Hsing Lee, Wen-Li Peng
Venue: Pattern Recognition (2007)

Image segmentation techniques have been widely applied in diagnosis systems with medical image support. Information about metaphyseal and epiphyseal regions is crucial in bone age assessment. In this study, hand radiograph images have been segmented using a coarse-to-fine strategy. Watershed transform is first done to get metaphyseal regions at a coarse level. Some image processing algorithms, such as noise removal, labeling, and ellipse region fitting, are performed to find the epiphyseal regions of interest (ROIs). The epiphyseal regions are extracted using an active contour model approach based on GVF (gradient vector flow) at a fine level. Some hand radiograph images are processed to show the validity of the proposed approach.
Distributed Digital Logic Simulation on a Network of Workstations
Authors: S. Sundaram
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

General purpose parallel processing machines are increasingly being used to speedup a variety of VLSI CA D applications. This paper addresses the mapping of logic simulation using the time first algorithm on parallel machines by exploting the concurrency available in the circuit being simulated. The speedup obtained on parallel/distributed simulation, depends on two major factors, the amount of simulation concurrency possible, and the amount of messages that must be passed among processors. Logic simulation using Time. First algorithm has been mapped to a distributed platform using a network of workstations. In this paper we propose a partitioning algorithm, which drastically reduces the interprocessor communication and also gives better simulation time. Reduction of communication data up to 4t0% with eight processors have been obtained for ISCAS benchmark circuits. Reduction of simulation time was also observed.
Toward Models for Forensic Analysis
Authors: Sean Peisert, Matt Bishop, Sidney Karin, Keith Marzullo
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

The existing solutions in the field of computer forensics are largely ad hoc. This paper discusses the need for a rigorous model of forensics and outlines qualities that such a model should possess. It presents an overview of a forensic model and an example of how to apply the model to a real-world, multi-stage attack. We show how using the model can result in forensic analysis requiring a much smaller amount of carefully selected, highly useful data than without the model.
A noniterative maximum likelihood parameter estimator of superimposed chirp signals
Authors: S. Saha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We address the problem of parameter estimation of superimposed chirp signals in noise. The approach used here is a computationally modest implementation of a maximum likelihood (ML) technique. The ML technique for estimating the complex amplitudes, chirping rates and frequencies reduces to a separable optimization problem where the chirping rates and frequencies are determined by maximizing a compressed likelihood function which is a function of only the chirping rates and frequencies. Since the compressed likelihood function is multidimensional, its maximization via grid search is impractical. We propose a non-iterative maximization of the compressed likelihood. function using importance sampling. Simulation results are presented for a scenario involving closely spaced parameters for the individual signals.
Error rate reduction in DNA self-assembly by non-constant monomer concentrations and profiling
Authors: B. Jang, Y-B. Kim, F. Lombardi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper proposes a novel technique based on profiling the monomers for reducing the error rate in DNA self-assembly. This technique utilizes the average concentration of the monomers (tiles) for a specific pattern as found by profiling its growth. The validity of profiling and the large difference in the concentrations of the monomers are shown to be applicable to different tile sets. To evaluate the error rate new Markov based models are proposed to account for the different types of bonding (i.e. single, double and triple) in the monomers as modification to the commonly assumed kinetic trap model. A significant error rates reduction is accomplished compared to a scheme with constant concentration as commonly utilized under the kinetic trap model. Simulation results are provided.
A Distributed Coordination Algorithm for a Heterogeneous Group of Peers
Authors: Ailixier Aikebaier, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In distributed applications like computer supported cooperative work (CSCW), multiple peer processes are required to cooperate to make a global decision, e.g. fix a date for a meeting of multiple persons. We discuss how multiple peer processes make a decision to achieve some objectives in a peer-to-peer (P2P) overlay network. Here, every process is assumed to be peer and autonomous. A domain of a process is a collection of possible values which the process can take. Each process first takes a value v in its domain and notifies the other processes of the value v. A process can change the value to another value on receipt of values from other processes. However, a process may not take every value in the domain and can take only some value depending on the value v. For example, a process may abort after notifying commit but cannot commit after abort in the commitment control. An existentially dominant relation shows what values a process can take after taking a value. In addition, values are also ordered in the preferential relation. Based on the existential and preferential relations, each process takes the most preferable value in the domain, which is dominantly preceded by the value v. In this paper, we discuss how every process makes an agreement on a tuple of values while each process can change the value according to the existential and preferential relations. In this paper, we discuss a coordination protocol in a type of heterogeneous system where every pair of processes have the same domain but may have different existential and preferential relations. Each process learns a part of the relations of another process through exchanging values.
A generic systolic processor for real time grayscale morphology
Authors: O. Deforges
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Mathematical morphology is a powerful and widespread tool for image analysis and coding, but for large analysis neighborhoods, it becomes rapidly time consuming on general purpose machines. Much work has been done to decrease the overall complexity by splitting heavy computation tasks into several more efficient ones. Even if significant speedup factors have been achieved using dedicated architectures, the major drawback is that the number of operations required is still dependent on the considered neighborhood size. This paper introduces a systolic network for real time grey level morphological processing since it is able to perform erosions, dilations, openings, and closings during a unique image pass whatever the neighborhood shape and size. It is based on a new structuring elements recursive decomposition by two pixels dilations and union sets. The resulting architecture is fully regular, built from elementary interconnected stages. By pipelining these stages timing performances are independent of the structuring element complexity. Efficient synthesis has been achieved into a FPGA enabling dual port ram implementation.
Standards alignment for metadata assignment
Authors: Anne R. Diekema, Ozgur Yilmazel, Jennifer Bailey, Sarah C. Harwell, Elizabeth D. Liddy
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The research in this paper describes a Machine Learning technique called hierarchical text categorization which is used to solve the problem of finding equivalents from among different state and national education standards. The approach is based on a set of manually aligned standards and utilizes the hierarchical structure present in the standards to achieve a more accurate result. Details of this approach and its evaluation are presented.
Experience with some principles for building an internet-scale reliable system
Authors: Mike Afergan, Joel Wein, Amy LaMeyer
Venue: Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2 (2005)

We discuss the design methodology used to achieve commercial-quality reliability in the Akamai content delivery network. The network consists of 15,000+ servers in 1,100+ networks and spans 65+ countries. Despite the scale of the Akamai CDN and the unpredictable nature of the underlying Internet, we seek to build a system of extremely high reliability. We present some simple principles we use to assure high reliability, and illustrate their application. As there is some similarity-in-spirit between our implementation and recent trends in the research literature, we hope that sharing our experiences will be of value to a broad community.
devd: a device configuration daemon
Authors: M. Warner Losh
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

Hot-pluggable bus technologies have proliferated, rendering traditional boot time configuration of devices via an /etc/rc script insufficient for many user's needs. Most implementations of hot-plug technologies have provided a means to address these deficiencies, yet their solutions tend to be confined to only that technology. The goal of FreeBSD's devd(8) is to provide a uniform framework by which interesting events relating to hot-plugging can be handled. devd provides a regular framework for these technologies to have user-land configuration commands run in a generic, extensible way. The implementation encountered a number of issues which are instructive to explore. devd only responds to events that the kernel generates and does not participate in interactions with the kernel that would block another thread of execution. At the present time, devd supports executing arbitrary commands when a driver attaches to the tree, when it detaches and when a bus detects an unknown device attached to that bus.
Measuring the Strength of Indirect Coupling
Authors: Hong Yul Yang, Ewan Tempero
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

It is widely accepted that coupling plays an important role in software quality, particularly in the areas of software maintenance, so effort should be made to keep coupling levels to a minimum in order to reduce the complexity of the system. We have previously introduced the concept of "indirect" coupling -- coupling formed by relationships/dependencies that are not directly evident -- with the belief that high levels of indirect coupling will constitute greater costs to maintenance as it is harder to detect. In this paper we extend our previous studies by proposing metrics that will advance our understanding of the exact relationship between indirect coupling and maintainability. In particular, the metrics focus on the reflection of "strength" as it is a fundamental component of coupling. We present our observations on the results of applying the metrics to existing Java applications.
Developing cost-effective model-based techniques for gui testing
Authors: Atif Memon
Venue:  (2006)

Most of today's software users interact with the software through a graphical user interface (GUI), which constitutes as much as 45-60% of the total code. The correctness of the GUI is necessary to ensure the correctness of the overall software. Although GUIs have become ubiquitous, testing GUIs for functional correctness has remained a neglected research area. Existing GUI testing techniques are extremely resource intensive primarily because GUIs have very large input spaces and evolve frequently. This dissertation overcomes the limitations of existing techniques by developing a process with supporting models, techniques, and tools for continuous integration testing of evolving GUI-based applications. The key idea of this process is to create three concentric testing loops, each with specific GUI testing goals, resource usage, and targeted feedback. The innermost fully automatic loop called crash testing operates on each code change of the GUI software. The second semi-automated loop called smoke testing operates on each day's GUI build. The outermost loop called comprehensive GUI testing is executed after a major version of the GUI is available. The primary enablers of this process, also developed in this dissertation, include an abstract model of the GUI and a set of model-based techniques for test-case generation, test oracle creation, and continuous GUI testing. The model and techniques were obtained by studying GUI faults, interactions between GUI events, and why certain event interactions lead to faults. The continuous testing process and associated techniques are shown to be useful, via several large experiments involving millions of test cases, on both in-house and open-source GUI applications.