ppxscal/embedding_network huggingface dataset:
Parallel program performance prediction using deterministic task graph analysis
Authors: Vikram S. Adve, Mary K. Vernon
Venue: ACM Transactions on Computer Systems (TOCS) (2004)

In this article, we consider analytical techniques for predicting detailed performance characteristics of a single shared memory parallel program for a particular input. Analytical models for parallel programs have been successful at providing simple qualitative insights and bounds on program scalability, but have been less successful in practice for providing detailed insights and metrics for program performance (leaving these to measurement or simulation). We develop a conceptually simple modeling technique called deterministic task graph analysis that provides detailed performance prediction for shared-memory programs with arbitrary task graphs, a wide variety of task scheduling policies, and significant communication and resource contention. Unlike many previous models that are stochastic models, our model assumes deterministic task execution times (while retaining the use of stochastic models for communication and resource contention). This assumption is supported by a previous study of the influence of nondeterministic delays in parallel programs.We evaluate our model in three ways. First, an experimental evaluation shows that our analysis technique is accurate and efficient for a variety of shared-memory programs, including programs with large and/or complex task graphs, sophisticated task scheduling, highly nonuniform task times, and significant communication and resource contention. The results also show that the deterministic assumption is crucial to permit accurate and yet efficient analysis of these programs. Second, we use three example programs to illustrate the predictive capabilities of the model. In two cases, broad insights and detailed metrics from the model are used to suggest improvements in load-balancing and the model quickly and accurately predicts the impact of these changes. In the third case, the model provides novel insights into the impact of program design changes that improve communication locality as well as load-balancing, via new (but general-purpose) metrics. Finally, we present results from a comparison of our model and representative stochastic models, and use these to characterize the conditions under which a deterministic model or stochastic models would be appropriate.
Boosting Performance for I/O-Intensive Workload by Preemptive Job Migrations in a Cluster System
Authors: Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Load balancing in a cluster system has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources. However, if a significant portion of applications running in the system is I/O-intensive, traditional load balancing policies that focus on CPU and memory usage may cause the system performance to decrease substantially. To solve this problem, a new I/O-aware load-balancing scheme with preemptive job migration is presented to sustain the high performance of a cluster with a diverse set of workload conditions. The proposed scheme dynamically detects I/O load imbalance on nodes of a cluster, and determines whether to preempt some running jobs on over-loaded nodes and migrate them to other less- or under-loaded nodes. Besides balancing I/O load, the scheme takes into account both CPU and memory load sharing in clusters, thereby maintaining the same level of performance as existing schemes when I/O load is low or well balanced. Results from a trace-driven simulation show that, compared to the existing approaches that only consider I/O with non-preemptive job migrations, the proposed schemes achieve the improvement in mean slowdown by up to a factor of 10.
Organised Sound compact disc
Authors: Anonymous
Venue: Organised Sound (2001)

Complete Listing for Volume 6
Staged notational definitions
Authors: Walid Taha, Patricia Johann
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Recent work proposed defining type-safe macros via interpretation into a multi-stage language. The utility of this approach was illustrated with a language called MacroML, in which all type checking is carried out before macro expansion. Building on this work, the goal of this paper is to develop a macro language that makes it easy for programmers to reason about terms locally. We show that defining the semantics of macros in this manner helps in developing and verifying not only type systems for macro languages but also equational reasoning principles. Because the MacroML calculus is sensetive to renaming of (what appear locally to be) bound variables, we present a calculus of staged notational definitions (SND) that eliminates the renaming problem but retains MacroML's phase distinction. Additionally, SND incorporates the generality of Griffin's account of notational definitions. We exhibit a formal equational theory for SND and prove its soundness.
The Girard--Reynolds isomorphism
Authors: Philip Wadler
Venue: Information and Computation (2003)

The second-order polymorphic lambda calculus, F2, was independently discovered by Girard and Reynolds. Girard additionally proved a Representation Theorem: every function on natural numbers that can be proved total in second-order intuitionistic predicate logic, P2, can be represented in F2. Reynolds additionally proved an Abstraction Theorem: for a suitable notion of logical relation, every term in F2 takes related arguments into related results. We observe that the essence of Girard's result is a projection from P2 into F2, and that the essence of Reynolds's result is an embedding of F2 into P2, and that the Reynolds embedding followed by the Girard projection is the identity. The Girard projection discards all first-order quantifiers, so it seems unreasonable to expect that the Girard projection followed by the Reynolds embedding should also be the identity. However, we show that in the presence of Reynolds's parametricity property that this is indeed the case, for propositions corresponding to inductive definitions of naturals or other algebraic types.
Encryption using two-dimensional cellular automata with applications
Authors: Marian Srebrny, Piotr Such
Venue: Artificial intelligence and security in computing systems (2003)

A new symmetric cryptosystem is presented, based on two-dimensional cellular automata. Enciphering uses both left- and right-toggle rules. Enhanced cryptographic power is obtained by designing some simple geometric transformations on squares of bits of information. As an application, a software system "IPI Protect" is presented which integrates with MS Word for protecting the documents against unauthorized modifications while allowing free viewing and printing.
A Delphi Assessment of the Digital Rosetta Stone Model
Authors: Alan R. Heminger, Don M. Kelley
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Information that is stored digitally can only be used if it can be retrieved and interpreted. If themethods to retrieve the bitstream are lost, it may be difficult, if not impossible to re-create them. The knowledge to interpret the bitstream is also at risk. The Digital Rosetta Stone (DRS) Model was developed as a framework for capturing and maintaining the methods necessary to retrieve and display digital information stored on obsolete media or using obsolete software.However, this conceptual model had not yet been assessed by the community of professionals for its practical efficacy. This study used the Delphi Method to explore the DRS with those responsible for maintaining access to digital data. Overall, the Delphi group expressed concerns about the practicality of developing the DRS, but agreed that it is an important concept that should be explored further. If found to be technologically feasible and economically desirable, the DRS could well lead to a long-term solution for recovering information that would otherwise be impossible to recover.
Linkage metrics for process reengineering
Authors: Alan T. Yaung, Tzvi Raz
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Process reengineering has emerged as a key approach to the improvement of productivity and quality in many areas, including software development. In this paper we present a comprehensive set of metrics designed to provide objectivity and rigor to the analysis and design activities that are part of process reengineering. The metrics are based on the linkage among the tasks in the organization, and measure linkage validity, connectivity, and reachability in support of the task analysis phase, and cohesion and coupling in support of the process design phase. We conclude with our experience in the use of these metrics in a software development organization.
Hardcoding finite state automata processing
Authors: E. Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.
Texture segmentation using wavelet transform
Authors: S. Arivazhagan, L. Ganesan
Venue: Pattern Recognition Letters (2003)

Texture analysis such as segmentation and classification plays a vital role in computer vision and pattern recognition and is widely applied to many areas such as industrial automation, bio-medical image processing and remote sensing. This paper describes a novel technique of feature extraction for characterization and segmentation of texture at multiple scales based on block by block comparison of wavelet co-occurrence features. The performance of this segmentation algorithm is superior to traditional single resolution techniques such as texture spectrum, co-occurrences, local linear transforms, etc. The results of the proposed algorithm are found to be satisfactory.
OntoKhoj: a semantic web portal for ontology searching, ranking and classification
Authors: Chintan Patel, Kaustubh Supekar, Yugyung Lee, E. K. Park
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

The goal of the next generation Web is to build virtual communities, wherein software agents and people can work in cooperation by sharing knowledge. To achieve this goal, the emerging Semantic Web community has proposed ontologies to express knowledge in a machine understandable way. The process of building and maintaining ontologies, which is known as Ontology Engineering, presents unique challenges. These challenges are related to lack of trustworthy and authoritative knowledge sources and absence of a centralized repository to locate ontologies to be reused. In this paper, we propose a Semantic Web portal, called OntoKhoj that is designed to simplify the Ontology Engineering process. The methodology in developing OntoKhoj is based on algorithms used for searching, aggregating, ranking and classifying ontologies in Semantic Web. The proposed OntoKhoj would 1) allow agents and ontology engineers to retrieve trustworthy, authoritative knowledge, and 2) expedite the process of ontology engineering through extensive reuse of ontologies. We have implemented the OntoKhoj portal and further validated our system on the real ontological data in the Semantic Web.
Interpolator: a two-dimensional graphical interpolation system for the simultaneous control of digital signal processing parameters
Authors: Martin Spain, Richard Polfreman
Venue: Organised Sound (2001)

The musical use of realtime digital audio tools implies the need for simultaneous control of a large number of parameters to achieve the desired sonic results. Often it is also necessary to be able to navigate between certain parameter configurations in an easy and intuitive way, rather than to precisely define the evolution of the values for each parameter. Graphical interpolation systems (GIS) provide this level of control by allocating objects within a visual control space to sets of parameters that are to be controlled, and using a moving cursor to change the parameter values according to its current position within the control space. This paper describes Interpolator, a two-dimensional interpolation system for controlling digital signal processing (DSP) parameters in real time.
Linearized oscillation theory for a nonlinear delay impulsive equation
Authors: Leonid Berezansky, Elena Braverman
Venue: Journal of Computational and Applied Mathematics (2003)

For a scalar nonlinear impulsive delay differential equation {y}(t) + Σk=1m rk(t)fk[y(hk(t))] = 0, t ≠ τj, y(τj) = Ij(y(τj-)) with rk(t) ≥ 0, hk(t) ≤ t, limj→∞ τj = ∞, such an auxiliary linear impulsive delay differential equation {x}(t) + Σk=1m rk(t)ak(t)x(hk(t))=0, x(τj) = bjx(τj-) is constructed that oscillation (nonoscillation) of the nonlinear equation can be deduced from the corresponding properties of the linear equation. Coefficients rk(t) and delays are not assumed to be continuous. Explicit oscillation and nonoscillation conditions are established for some nonlinear impulsive models of population dynamics, such as the impulsive logistic equation and the impulsive generalized Lasota-Wazewska equation which describes the survival of red blood cells. It is noted that unlike nonimpulsive delay logistic equations a solution of a delay impulsive logistic equation may become negative.
Public-key support for group collaboration
Authors: Carl Ellison, Steve Dohrmann
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

This paper characterizes the security of group collaboration as being a product not merely of cryptographic algorithms and coding practices, but also of the man-machine process of group creation. We show that traditional security mechanisms do not properly address the needs of a secured collaboration and present a research prototype, called NGC (next generation collaboration), that was designed to meet those needs. NGC distinguishes itself in the care with which the man-machine process was analyzed and shaped to improve the security of the whole process. We include a detailed analysis of the problem of binding a name to a key, traditionally thought to be the province of PKI, but we show that the SDSI local name concept produces a result with superior security to that produced by standard PKI.
Efficient Modular Testing of SOCs Using Dual-Speed TAM Architectures
Authors: Anuja Sehgal, Krishnendu Chakrabarty
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The increasing complexity of system-on-chip (SOC) integrated circuits has spurred the development of versatile automatic test equipment (ATE) that can simultaneously drive different channels at different data rates. Examples of such ATEs include the Agilent 93000 series tester based on port scalability and the test processor-per-pin architecture, and the Tiger system from Teradyne. The number of tester channels with high data rates may be constrained in practice however due to ATE resource limitations, the power rating of the SOC, and scan frequency limits for the embedded cores. Therefore, we formulate the following optimization problem: given two available data rates for the tester channels, an SOC-level test access mechanism (TAM) width W, V (V
Assessing Trust Among IS Personnel: A View of General Trust, Trust of Management and Inter-Organizational Trust
Authors: Tom L. Roberts, Paul D. Sweeney, Dean McFarlin, Paul H. Cheney
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Trust is a central component in most relationships and a vital component in business transactions. This study evaluates several trust levels for IS personnel. The general trust of people, trust of management and supervisors, and inter-organizational trust are evaluated. The study surveyed 168 information systems workers. The results indicate a low level of trust by information systems personnel in all aspects of trust. These results should be of notice for management in IS organizations because they must understand the perceptions of their employees as they conduct business both internally in their organization and in dealing with potential customers or clients.
Design to test migration: a tester and a simulator
Authors: Gordon F. Taylor
Venue: Proceedings of the conference on European design automation (1990)

The advantages of a good migration route from design data to test data are well known and understood. A good route can be established by embedding a design simulator into a test-preparation system, but development of the test-preparation software involves significant engineering work including a close examination of the simulator's interfaces. The test-preparation simulator can then be made available to designers so that their data can flow smoothly into the test environment.
Generated designs: Structure and composition
Authors: C. F. Earl
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Generated designs are formed through rules that change, and structures that interpret, descriptions. The structure of design descriptions is examined with particular reference to generative shape descriptions acting as the infrastructure for attributes. Structure is represented by relations among the parts of descriptions. In particular, a closure structure allows relations to be described by the parts themselves. Design processes use descriptions in combination. It is shown how to combine separate descriptions in parallel and sequentially. Rules change descriptions. It is shown how to aggregate local changes consistently across a design and to use rules with structure on their component shapes to highlight selected emergent features. Further, multiple attribute descriptions, including shape and associated properties, are constructed. Their structures are represented algebraically.
Multimodal processing by finding common cause
Authors: Harriet J. Nock, Giridharan Iyengar, Chalapathy Neti
Venue: Communications of the ACM (2004)

Commonalities help answer many context-aware questions that arise in human-computer interaction.
Hybrid (OpenMP and MPI) parallelization of MFIX: a multiphase CFD code for modeling fluidized beds
Authors: Sreekanth Pannala, Ed D'Azevedo, Madhava Syamlal
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We describe the effort and experience in generating a hybrid parallel version of MFIX (Multiphase Flow with Interphase eXchanges), a code for modeling reactive multiphase flow in fluidized beds. The code uses portable OpenMP and MPI in a unified source code. The resulting parallel code has been ported to Beowulf Linux clusters, SGI shared memory multiprocessors, Compaq SC clusters, and an IBM SP. We present hybrid parallel performance results specifically on the 32-way node of IBM SP. This experience is relevant, as most modern high-performance computing (HPC) systems are clusters of SMP nodes.
Scheduling problems on two sets of identical machines
Authors: Csanád Imreh
Venue: Computing (2003)

In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.
Data-Flow-Based Unit Testing of Aspect-Oriented Programs
Authors: Jianjun Zhao
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

The current research so far in aspect-oriented softwaredevelopment is focused on problem analysis, software design,and implementation techniques. Even though the importanceof software testing is known, it has received littleattention in the aspect-oriented paradigm. In this paper, wepropose a data-flow-based unit testing approach for aspect-orientedprograms. Our approach tests two types of unitsfor an aspect-oriented program, i.e., aspects that are modularunits of crosscutting implementation of the program,and those classes whose behavior may be affected by oneor more aspects. For each aspect or class, our approachperforms three levels of testing, i.e., intra-module, inter-module,and intra-aspect or intra-class testing. For an individualmodule such as a piece of advice, a piece of introduction,and a method, we perform intra-module testing.For a public module along with other modules it calls inan aspect or class, we perform inter-module testing. Formodules that can be accessed outside the aspect or classand can be invoked in any order by users of the aspect orclass, we perform intra-aspect or intra-class testing. Ourapproach can handle unit testing problems that are uniqueto aspect-oriented programs. We use control flow graphs tocompute def-use pairs of an aspect or class being tested anduse such information to guide the selection of tests for theaspect or class.
Agent-Based Modeling of Knowledge Flows: Illustration from the Domain of Information Systems Design
Authors: Mark E. Nissen, Raymond E. Levitt
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Knowledge management (KM) represents a topic of considerable current interest. However, the majority of extant KM research treats knowledge as a static object that can be acquired, stored and retrieved through information technology. Two fundamental problems emerge from this current majority view: (1) many scholars view knowledge as distinct from information, and (2) very little attention is paid to the dynamics of knowledge -- a phenomenon which many scholars term "knowledge flows." In this article we build upon a steady stream of research in computational organization theory to develop agent-based models of knowledge flows. Such models draw from emerging theory for multidimensional representation of the knowledge flow phenomenon, and they enable the dynamics of enterprise knowledge flows to be formalized and simulated through computational models. We illustrate this research approach and modeling environment through formal representation and simulation of knowledge flows from the domain of information systems design.