ppxscal/embedding_network huggingface dataset:
Manufacturing Software Components from Object-Oriented Design Models
Authors: Eckhardt Holz, Olaf Kath, Marc Born
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: This paper presents a model-based approach to support the design of component based distributed applications through the provision of a suitable MOF based meta model in combination with a UML profile as supporting notation and code generation rules for CORBA-middleware platforms. The meta-model enables structural definitions of object types whose implementations are contained in components. It supports the specification of their configuration properties as well as of the interaction policies for the communication between these objects. The modeling concepts also allow for the combination of different interaction kinds, which are operational, signal and continuous media interaction.
An Information Statistics Approach to Data Stream and Communication Complexity
Authors: Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present a new method for proving strong lower bounds in communication complexity. This method is based on the notion of the conditional information complexity of a function which is the minimum amount of information about the inputs that has to be revealed by a communication protocol for the function. While conditional information complexity is a lower bound on the communication complexity, we show that it also admits a direct sum theorem. Direct sum decomposition reduces our task to that of proving (conditional) information complexity lower bounds for simple problems (such as the AND of two bits). For the latter, wedevelop novel techniques based on Hellinger distance and its generalizations.Our paradigm leads to two main results:(1) An improved lower bound for the multi-party set-disjointness problem in the general communication complexity model, and a nearly optimal lower bound in the one-way communication model. As a consequence, we show that for any real k > 2, approximating the k-th frequency moment in the data stream model requires \Omega (n^{1 - {2 \mathord{\left/ {\vphantom {2 k}} \right. \kern-\nulldelimiterspace} k}}) space; this resolves a conjecture of Alon, Matias, and Szegedy [3].(2) A lower bound for the Lp approximation problem in the general communication model; this solves an open problem of Saks and Sun [23]. As a consequence, we show that for p >2, approximating the Lp norm to within a factor of n^\varepsilon in the data stream model with constant number of passes requires \Omega (n^{1 - 4\varepsilon- {2 \mathord{\left/ {\vphantom {2 p}} \right. \kern-\nulldelimiterspace} p}}) space.
A Method to Reduce Risks in Building Distributed Enterprise Systems
Authors: Guijun Wang, Georgina Cone
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: A number of risks are associated with building distributed enterprise systems, ranging from functionality to quality attributes. It is critical to identify and reduce these risks early in the development cycle. Current component-based development methods target at improving the precision in the modeling of system functionality based on UML and enhancing reusability through components and frameworks. However, major risks like performance, scalability, and maintainability of distributed systems have not been adequately addressed. In this paper, we propose a method to reduce these risks early in the development cycle. This method consists of three interrelated elements: work model and workload model, architecture-driven component-based development, and architecture analysis and simulation. We demonstrate the effectiveness of this method using the prototype of a factory floor information system.
Towards evolutionary and adaptive workflow systems-infrastructure support based on Higher-Order Object Nets and CORBA
Authors: Ingo Claßen, Herbert Weber, Yanbo Han
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Issues of workflow systems adaptability and evolution capability are discussed from two perspectives, namely design and evolution of workflow systems from a continuous software engineering perspective as well as redesign and runtime on-the-fly modifications of workflow models from an application perspective. Special attention is paid to a suitable infrastructure support for designing more configurable and adaptive workflow systems. A new workflow language, called Higher-Order Object Nets (HOON), is introduced. The intended uses of HOON are, on one side, to directly describe real-world business processes, and on the other side, to serve as a build-time composition model and a run-time overall control skeleton of the underlying software components that support individual business activities. On the basis of HOON and CORBA, a layered, framework-based and generic system architecture is presented.
A Framework for a Cryptographic Protocol Evaluation Workbench
Authors: Alec Yasinsac, William A. Wulf
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Tools to evaluate Cryptographic Protocols (CPs) exploded into the literature after development of BAN Logic [BAN88,BAN90]. Many of these were created to repair weaknesses in BAN Logic. Unfortunately, these tools are all complex and difficult to implement individually, with little or no effort available to implement multiple tools in a workbench environment. We propose a framework that allows a protocol analyst to exercise multiple CP evaluation tools in a single environment. Moreover, this environment exhibits characteristics that will enhance the effectiveness of the CP evaluation methods themselves.
Sequence comparison on a cluster of workstations using the PVM system
Authors: Xiaojun Guan, Richard J. Mural, Edward C. Uberbacher
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Sequence comparison is one of the most important tools in molecular biology research. As the amount of DNA data increases rapidly, efficient sequence comparison algorithms are essential in studying newly discovered sequences. We have implemented a distributed sequence comparison algorithm by T.F. Smith and M. Waterman (1981) on a cluster of workstations using the PVM paradigm. This implementation has achieved similar performance to the Intel iPSC/860 hypercube, a massively parallel computer. The distributed Smith-Waterman algorithm serves as a search tool for two Internet servers GRAIL and GENQUEST. This paper describes the implementation and the performance of the algorithm.
Performance Analysis and Optimization on a Parallel Atmospheric General Circulation Model Code
Authors: John Z. Lou, John D. Farrara
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

An analysis is presented of the primary factors influencing the performance of a parallel implementation of the UCLA atmospheric general circulation model (AGCM) on distributed memory, massively parallel computer systems. Several modifications to the original parallel AGCM code aimed at improving its numerical efficiency, load balance and single node code performance are discussed. The impact of these optimization strategies on the performance on two of the state of the art parallel computers, the Intel Paragon and Cray T3D, is presented and analyzed. It is found that implementation of a load balanced FFT algorithm results in a reduction in overall execution time of approximately 45% compared to the original convolution based algorithm. Preliminary results of the application of a load balancing scheme for the physics part of the AGCM code suggest additional reductions in execution time of 15-20% can be achieved. Finally, several strategies for improving the single node performance of the code are presented, and the results obtained thus far suggest reductions in execution time in the range of 30-40% are possible.
On Efficient On-Line Grouping of Flows with Shared Bottlenecks at Loaded Servers
Authors: Ossama Younis, Sonia Fahmy
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

We design an efficient on-line approach, FlowMate, for partitioning flows at a busy server into flow groups that share bottlenecks. These groups are periodically input to congestion coordination, aggregation, load balancing, admission control, or pricing modules. FlowMate uses in-band packet delay measurements to the receivers to determine shared bottlenecks among flows. Packet delay information is piggybacked on returning feedback, or, if impossible,flow (e.g., TCP) round trip time estimates are used. We simulate FlowMate to examine the effect of network load, traffic burstiness, network buffer sizes, and packet drop policies on partitioning correctness. Our results demonstrate accurate partitioning of medium to long-lived flows even under heavy load and self-similar background traffic. Experiments with HTTP/1.1 flows demonstrate difficulties in partitioning bursty foreground traffic. We also study fairness of coordinated congestion management when integrated with FlowMate.
Issues in Modeling for Data Mining
Authors: Tsau Young Lin
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Modeling in data mining has not been fully explored; so data mining is often regarded as a set of added operations in database systems. The consequence many notions are overloaded. Some terms often have different semantics. This paper continues previous effort to explore and reiterate some fundamental issues in data mining.
Performance assessment of embedded Hw/Sw systems
Authors: J. P. Calvez, O. Pasquier
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Performance assessment of embedded Hw/Sw systems built with various types of VLSI components, i.e. heterogeneous multi-processor architectures, is important to help the development of complex real-time applications. To design such a tool, two issues are to be solved, relevant information gathered simultaneously on several components without disturbing the application behavior, and the display of the performance results in a way which is easily interpreted by designers. This paper presents an interesting solution for the two above issues. We first describe what the goal for designers is and what kind of applications are concerned. Then we describe the principle of collecting an event trace and the technique to evaluate the selected performance indexes. The monitoring technique, based on a specific ASIC, is nonintrusive and allows to capture real-time event occurrences from software tasks and even from hardware functions implemented in ASICs. Each event is automatically time-stamped, collected and processed in real-time to evaluate the performance indexes selected by the designer. We also describe the display tool which clearly shows to the designer the results according to different representations. This technique and the associated real-time performance analyzer are integrated in a whole development process based on the MCSE methodology.
Predicting Conditional Branches With Fusion-Based Hybrid Predictors
Authors: Gabriel H. Loh, Dana S. Henry
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Researchers have studied hybrid branch predictors that leverage the strengths of multiple stand-alone predictors. The common theme among the proposed techniques is a selection mechanism that chooses a prediction from among several component predictors. We make the observation that singling out one particular component predictor ignores the information of the non-selected components. We propose Branch Prediction Fusion, originally inspired bywork in the machine learning field, which combines or fuses the information from all of the components to arrive at a final prediction. Our 32KB predictor achieves the same over-allprediction accuracy as the 188KB versions of the previous best performing predictors (the Multi-Hybrid and the global-local perceptron).
Image Processing and Analysis to Diagnose Ocular Refraction Errors
Authors: Antonio Valerio Netto, Maria Cristina F. de Oliveira
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We describe ongoing research on the development of a functional system for diagnosing andmeasuring ocular refractive errors in the human eye (astigmatism, hypermetropia and myopia) by automatically analyzing images of the human ocular globe acquired with the Hartmann-Shack (H-S) technique. H-S images are to be input into a system capable of recognizing the presence of a refractive error and outputting a measurement of such an error. Because the H-S technique provides images rich with information on the human eye, we believe this system may provide a framework that can be extended to get additional information on the health of imaged ocular globes.
CoCheck: Checkpointing and Process Migration for MPI
Authors: Georg Stellner
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Checkpointing of parallel applications can be used as the core technology to provide process migration. Both, checkpointing and migration, are an important issue for parallel applications on networks of workstations. The CoCheck environment which we present in this paper introduces a new approach to provide checkpointing and migration for parallel applications. In difference to existing systems CoCheck rather sits on top of the message passing library than inside and achieves consistency at a level above the message passing system. It uses an existing single process checkpointer which is available for a wide range of systems. Hence, CoCheck can be easily adapted to both, different message passing systems and new machines.
Real-Time Parallel MPEG-2 Decoding in Software
Authors: Angelos Bilas, Jason Fritts, Jaswinder Pal Singh
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The growing demand for high quality compressed video has led to an increasing need for real-time MPEG decoding at greater resolutions and picture sizes. With the widespread availability of small-scale multiprocessors, a parallel software implementation may provide an effective solution to the decoding problem.We present a parallel decoder for the MPEG standard, implemented on a shared memory multiprocessor. Goal of this work is to provide an all-software solution for real-time, high-quality video decoding and to investigate the important properties of this application as they pertain to multiprocessor systems.Both coarse and fine grained implementations are considered for parallelizing the decoder. The coarse-grained approach exploits parallelism at the group of pictures level, while the fine-grained approach parallelizes within pictures, at the slice level. A comparative evaluation of these methods is made, with results presented in terms of speedup, memory requirements, load balance, synchronization time, and temporal and spatial locality. Both methods demonstrate very good speedups and locality properties.
Supporting Learning in Context: Extending Learner-Centered Design to the Development of Handheld Educational Software
Authors: Kathleen Luchini, William Bobrowsky, Michael Curtis, Chris Quintana, Elliot Soloway
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

The emerging family of mobile devices presents new opportunities to design handheld tools that can support students within the context of their learning activities. In this paper we discuss the challenges of building handheld educational software and describe the design of Pocket PiCoMap, a learner-centered tool that supports concept mapping activities on handheld computers. By combining available research on the design of small interfaces with existing guidelines for developing learner-centered desktop software, we describe some of the design considerations and trade-offs of developing learner-centered handheld software. We present initial design guidelines for balancing these constraints, describe their application to the development of Pocket PiCoMap, and discuss ongoing classroom tests of this software.
Reusing (Shrink Wrap) Schemas by Modifying Concept Schemas
Authors: Lois M. L. Delcambre, Jimmy Langston
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

A shrink wrap schema is a well-crafted, complete, global schema that represents an application. A concept schema is a subset of the shrink wrap schema that addresses one particular point of view in an application. We define schema modification operations to customize each concept schema, to match the designer's perception of the application. We maintain the integrated, customized user schema. We enforce consistency checks to provide feedback to the designer about interactions among the concept schemas. We embody these mechanisms in an interactive system that aids in shrink wrap schema-based design. The shrink wrap schema approach promotes reuse of past design efforts; prior approaches to schema reuse do not attempt to reuse an entire schema nor do they focus on local customization. The focus of this paper is on the definition of concept schemas and their corresponding modification operations.
Optimizing Software Data Prefetches with Rotating Registers
Authors: Gautam Doshi, Rakesh Krishnaiyer, Kalyan Muthukumar
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: Software data prefetching is a well-known technique to improve the performance of programs that suffer many cache misses at several levels of memory hierarchy. However, it has significant overhead in terms of increased code size, additional instructions, and possibly increased memory bus traffic due to redundant prefetches. This paper presents two novel methods to reduce the overhead of software data prefetching and improve the program performance by optimized prefetch scheduling. These methods exploit the availability of rotating registers and predication in architectures such as the ItaniumTM architecture. The methods (1) minimize redundant prefetches, (2) reduce the number of issue slots needed for prefetch instructions, and (3) avoid branch mispredict penalties - all with minimal code size increase. Compared to traditional data prefetching techniques, these methods (i) do not require loop unrolling, (ii) do not require predicate computations and (iii) require fewer machine resources. One of these methods has been implemented in the Intel Production Compiler for the Itanium TM processor. This technique is compared with traditional approaches for software prefetching and experimental results are presented based on the floating-point benchmark suite of CPU2000.
Global Predicate-Based Locks in Long-Running Transactions
Authors: Richard Hull
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

Previous work on long-running transactions for multidatabase environments relaxes the isolation requirement of conventional ACID transactions. However, most of that work does not provide mechanisms to explicitly enforce isolation. This paper proposes a framework in which long-running transactions can specify global predicate-based locks to enforce limited forms of isolation between selected transactions. The framework appears to be especially useful in contexts where there is a class of transactions with stringent deadlines, and another class of transactions making multidatabase updates that do not have stringent deadlines.This report motivates and presents the framework, and illustrates its use in connection with maintaining interdatabase constraints. 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
Complete Problems for Dynamic Complexity Classes
Authors: William Hesse, Neil Immerman
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC0, the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a single-step version of the circuit value problem (SSCV).Of independent interest, our construction also produces a first-order formula, ¿, that is in a sense universal for all first-order formulas. Since first-order formulas are stratified by quantifier depth, the first-order formula ¿ emulates formulas of greater depth by iterated application. As a corollary we obtain a fixed quantifier block, QBC, that is complete for all first-order quantifier blocks.
On the Requirements of High-Integrity Code Generation
Authors: Michael W. Whalen, Mats Per Erik Heimdahl
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Although formal requirements specifications can provide a complete and consistent description of a safety-critical software system, designing and developing production quality code from high-level specifications can be a time-consuming and error-prone process. Automated translation, or code generation, of the specification to production code can alleviate many of the problems associated with design and implementation. However, current approaches have been unsuitable for safety-critical environments because they employ complex and/or ad-hoc methods for translation.In this paper, we discuss the issues involved in automatic code generation for high-assurance systems and define a set of requirements that code generators for this domain must satisfy. These requirements cover the formality of the translation, the quality of the code generator, and the properties of the generated code.
Discovering Relationships between Topics of Conferences by Filtering, Extracting and Clustering
Authors: Tsunenori Mine, Shimiao Lu, Makoto Amamiya
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

This paper presents a text mining system that obtains the relationships between the topics of international conferences. The system at first gathers Web pages related to the query "call for paper" with a search engine and filters out pages irrelevant to the query with SVMs. Next it extracts the topics of conferences and clusters them. Each cluster embodies the relationships between topics and conferences. The clustered topics are shown through an Explorer-like graphical user interface. The preliminary experimental results promise that the method works not only for obtaining the relationship between topics of conferences, but also for discovering the relationship between any information entities users are interested in.