ppxscal/embedding_network huggingface dataset:
Versioning concurrency control for hard real-time systems
Authors: LihChyun Shu, Michal Young
Venue: Journal of Systems and Software (2002)

The problems of hard real-time systems scheduling involve not only guaranteeing schedulability but also ensuring that shared data will not be corrupted. Maintaining shared data consistency has long been studied in database systems. In this paper, we discuss the key differences between database concurrency control and concurrency control for hard real-time systems and describe an approach to adapting advanced concurrency control techniques to systems requiring analytic worst-case latency guarantees. We describe an example concurrency control technique which avoids interference between queries and updaters. The versioning technique can be implemented with simple and predictable low-overhead algorithms and data structures and its application to a task set is driven by the schedulability analysis. Performance evaluation results via case studies and simulation experiments are presented that show that the versioning technique can improve pure locking protocols in a variety of settings. In particular, when tasks are computation-intensive, the improvement made by the versioning technique in reducing worst-case blocking and increasing schedulability is most significant.
Optimizing multiple dimensional queries simultaneously in multidimensional databases
Authors: Weifa Liang, Maria E. Orlowska, Jeffrey X. Yu
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and $ \epsilon $ is a fixed constant with $0<\epsilon \leq 1$. We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one.
Cutting and Reuse: An Application from Automobile Component Manufacturing
Authors: Claudio Arbib, Fabrizio Marinelli, Fabrizio Rossi, Francesco Di Iorio
Venue: Operations Research (2002)

This paper presents a decision support tool for solving a cutting and reuse problem arising in a European plant devoted to the production of gear belts. In this production, rectangular pieces of rubberised nylon are cut using machines employing parallel blades, so as to obtain rectangular components of identical height and (possibly) different width. A component is then used to produce a set of belts with the same girth; but, if necessary, the girth required can also be obtained by sewing together two components. The major objectives of optimisation are: trim loss minimisation, quality control, workload equalisation, setup minimisation. The problem, a particular one-dimensional cutting stock with both cutting and reuse decision variables, has been formulated in terms of integer linear programming and then efficiently solved by applying standard packages within a column generation scheme. A significant improvement of performance has been obtained in terms of both economic savings and product quality. This has convinced the management to implement the model in the plant operation.
Aspects of system description
Authors: Michael Jackson
Venue: Programming methodology (2003)

This paper discusses some aspects of system description that are important for software development. Because software development aims to solve problems in the world, rather than merely in the computer, these aspects include: the distinction between the hardware/software machine and the world in which the problem is located; the relationship between phenomena in the world and formal terms used in descriptions; the idea of a software model of a problem world domain; and an approach to the decomposition of problems and its consequences for the larger structure of software development descriptions.
Use Case Maps for the Capture and Validation of Distributed Systems Requirements
Authors: Daniel Amyot, Luigi Logrippo, Raymond J. A. Buhr, Tom Gray
Venue: Proceedings of the 4th IEEE International Symposium on Requirements Engineering (1999)

Functional scenarios describing system views, uses, or services are a common way of capturing requirements of distributed systems. However, integrating individual scenarios in different ways may result in different kinds of unexpected or undesirable interactions. In this paper, we present an innovative approach based on the combined use of two notations. The first one is a recent visual notation for causal scenarios called Use Case Maps (UCMs), which is used to capture and integrate the requirements. Integrating UCMs together helps avoiding many interactions before any prototype is generated. The second notation is the formal specification language LOTOS. UCM scenarios are translated into high-level LOTOS specifications, which can be used to validate the requirements formally through numerous techniques, including functional testing based on UCMs. LOTOS possesses powerful testing concepts and tools that we use for the detection of remaining undesirable interactions. To illustrate these concepts, we use a simple connection example and results from the capture and the validation of several telephony features from the First Feature Interaction Contest.
Web-centric projects in computer science courses
Authors: Kwok-Bun Yue
Venue: Journal of Computing Sciences in Colleges (2002)

As the computing world becomes increasingly Web-centric, software systems will obtain more contents and services from outside the organizations. As a result, more university computer science courses will add Web server-side project assignments that use not only local resources within the university, but also external resources throughout the Web. This creates new problems in logistic as the university has no control of the external Web sites. This paper discusses our experience on Web-centric projects, their unique challenges and our recommendations.
Computational and data Grids in large-scale science and engineering
Authors: William E. Johnston
Venue: Future Generation Computer Systems (2002)

As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams are needed to address these problems. In order to support this shift in science, the computing and data-handling infrastructure that is essential to most of modern science must also change in order to support this increased complexity. This is the goal of computing and data Grids: software infrastructure that facilitates solving large-scale problems by providing the mechanisms to access, aggregate, and manage the computer network-based infrastructure of science. This infrastructure includes computing systems, data archive systems, scientific instruments, and computer-mediated human collaborations. This paper examines several large-scale science problems, their requirements for computing and data Grid infrastructure, and the current approaches to providing the necessary functionality.
A "Parallel Approach" Path to Estimating Collision Risk During Simultaneous Landings
Authors: M. Yu. Kitaev, Richard F. Serfozo, Arnold Barnett
Venue: Management Science (1999)

Airport capacity could increase if, even during inclement weather, independent landings could occur on parallel runways only about half a mile apart. A key question about such operations is whether the collision risk they entail is acceptably low. Pursuing that issue, we explore a method for estimating the chance that a plane on final approach during instrument flight conditions will "blunder" in a way that could imperil nearby aircraft. We argue that the method could yield an attractive combination of high estimation accuracy and relatively low cost.
Prophesy: an infrastructure for performance analysis and modeling of parallel and grid applications
Authors: Valerie Taylor, Xingfu Wu, Rick Stevens
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

Performance is an important issue with any application, especially grid applications. Efficient execution of applications requires insight into how the system features impact the performance of the applications. This insight generally results from significant experimental analysis and possibly the development of performance models. This paper present the Prophesy system, for which the novel component is the model development. In particular, this paper discusses the use of our coupling parameter (i.e., a metric that attempts to quantify the interaction between kernels that compose an application) to develop application models. We discuss how this modeling technique can be used in the analysis of grid applications.
Looks good to me
Authors: Linda Roberts, Leigh Rankin, Edward Silver, Darryl Moore, Stephanie Plunkett, David Washburn, Brenda Wilch-Ringen
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Our primary goal was to assess users' reactions to web sites and to better understand why they respond more favorably to some web sites than to others. In the present study, we replicated earlier research1 in which participants performed tasks on 12 different web sites and subsequently rated each of the sites along 14 dimensions. As occurred in the earlier research, reliable differences were observed in the ratings of the web sites. However, in contrast to the earlier study where organization was the primary predictor of overall ratings, attractiveness was the strongest predictor of their overall impression of the sites. It may be that the differing results were due either to different stimulus sets or to different subject populations.
Termination of well-typed logic programs
Authors: Annalisa Bossi, Nicoletta Cocco, Sabina Rossi
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

We consider an extended definition of well-typed programs to general logic programs, i.e. logic programs with negated literals in the body of the clauses. This is a quite large class of programs which properly includes all the well-moded ones. We study termination properties of well-typed general programs while employing the Prolog's left-to-right selection rule. We introduce the notion of typed acceptable program and provide an algebraic characterization for the class of well-typed programs whic hterminate on all well-typed queries.
Monitoring data archives for grid environments
Authors: Jason Lee, Dan Gunter, Martin Stoufer, Brian Tierney
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Developers and users of high-performance distributed systems often observe performance problems such as unexpectedly low throughput or high latency. To determine the source of these performance problems, detailed end-to-end monitoring data from applications, networks, operating systems, and hardware must be correlated across time and space. Researchers need to be able to view and compare this very detailed monitoring data from a variety of angles. To address this problem, we propose a relational monitoring data archive that is designed to efficiently handle high-volume streams of monitoring data. In this paper we present an instrumentation and monitoring event archive service that can be used to collect and aggregate detailed end-to-end monitoring information from distributed applications. This archive service is designed to be scalable and fault tolerant. We also show how the archive is based on the "Grid Monitoring Architecture" defined by the Global Grid Forum.
A Heuristic Scheduling System for Ceramic Industrial Coatings
Authors: John R. Olson, Marc J. Schniederjans
Venue: Interfaces (2000)

We developed and implemented a heuristic-based scheduling system for Ceramic Industrial Coatings (CIC), a large producer of paint and wood coatings in the Midwest. We experienced implementation issues and problems in the process of developing the heuristic system. The paint coating industry has unique scheduling problems. Results included a 39-percent reduction in manufacturing processing time, a 23-percent reduction in late batches, a 49-percent reduction in scrapped batches, and a 72-percent reduction in scrap cost.
More legacy system patterns
Authors: Anthony Lauder, Stuart Kent
Venue: Systems engineering for business process change: new directions (2002)

In an earlier volume we began documenting patterns underpinning legacy systems. The catalogued patterns were uncovered during an intensive 18- month immersion in both the technology and the development culture surrounding the evolution of numerous commercial legacy systems. After a further year's involvement with our commercial partner, we are now in a position to add additional legacy system patterns to our catalog, and we do so here.
Real-Time and Performance Evaluation Extensions of Specification Language LOTOS
Authors: Zbigniew Huzar, Jan Magott
Venue: Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (1995)

The paper contains extensions of specification language LOTOS in three directions: actions with durations, real-time and performance evaluation constructions. We have introduced a time-out as a specific action. An expressive power of this action has been discussed. We have defined such a performance evaluation extension of LOTOS that can be used as a modelling language for performance evaluation of distributed systems. A true concurrency semantics (in the sense that it refers to the fact that actions with durations may overlap in time) for these extensions is defined.
On the aggregation of some classes of fuzzy relations
Authors: Ana Pradera, Enric Trillas, Elena Castiñeira
Venue: Technologies for constructing intelligent systems: tools (2002)

This paper deals with the aggregation of fuzzy relations under a closure constraint, that is, it studies how to combine a collection of fuzzy relations that present some common Properties in order to obtain a single one with the same properties. This aggregation problem is addressed for two important classes of closely related fuzzy relations: generalized distances and indistinguishability operators.
Introduction to Object-Oriented Systems Engineering, Part 1
Authors: Haig F. Krikorian
Venue: IT Professional (2003)

Emerging OOSE methods provide a context and guide for the overall systems development process.
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Authors: Jie Sun, Kim-Chuan Toh, Gongyun Zhao
Venue: Mathematics of Operations Research (2002)

Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex body G in the cone of symmetric positive semidefinite matrices. Assume that G is defined by an oracle, which for any givenm xm symmetric positive semidefinite matrix Y either confirms that Y e G or returns a cut, i.e., a symmetric matrixA such that G is in the half-space { Y :A Â·Y = A Â· Y}. We study an analytic center cutting plane algorithm for this problem. At each iteration, the algorithm computes an approximate analytic center of a working set defined by the cutting plane system generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise the new cutting plane returned by the oracle is added into the system. As the number of iterations increases, the working set shrinks and the algorithm eventually finds a solution to the problem. All iterates generated by the algorithm are positive definite matrices. The algorithm has a worst-case complexity of O *( m3 /e 2 )on the total number of cuts to be used, where e is the maximum radius of a ball contained by G.
Two-dimensional packing algorithms for layout of disconnected graphs
Authors: Ugur Dogrusoz
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they perform well are analyzed.
Experiences with the SEMPA resource manager for real world scientific computing in networks of workstations
Authors: Ursula Maier, Peter Luksch, Arndt Bode
Venue: Cluster Computing (2001)

The Sempa Resource Manager is a resource management system for parallel applications in a network of workstations that enables the utilization of idle resources for parallel computing and shortens the execution time of parallel applications by dynamic load balancing at runtime. The network of workstations runs in a non-dedicated mode, where the Sempa Resource Manager assigns hosts that are not required by interactive users to its batch jobs. The flexible structure of the Sempa Resource Manager guarantees scalability and results in functions for transparent process migration and dynamic reconfiguration of the parallel execution environment. We present performance measurements with an industrial computational fluid dynamics program proving the efficiency of the Sempa Resource Manager.
The gateway: a navigation technique for migrating to small screens
Authors: Bonnie MacKay
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Displaying and navigating information on a large screen can be a challenge and has resulted in a variety of techniques such as text summarization and fisheye. An additional challenge is how to organize information on small screens in a format that can be understood in its context and facilitates navigation within the inherent constraints of these devices. We introduce a navigation model, the Gateway, to decrease transitional volatility introduced by migration of web pages to the smaller screen.
Theory of Single Spin Detection with STM
Authors: A. V. Balatsky, I. Martin
Venue: Quantum Information Processing (2002)

We propose a mechanism for detection of a single spin center on a non-magnetic substrate. In the detection scheme, the STM tunnel current is correlated with the spin orientation. In the presence of magnetic field, the spin precesses and the tunnel current is modulated at the Larmor frequency. The mechanism relies on the effective spin-orbit interaction between the injected unpolarized STM current and the local spin center, which leads to the nodal structure of the spatial signal profile. Based on the proposed mechanism, the strongest spin-related signal can be expected for the systems with large spin-orbit coupling and low carrier concentration.PACS: 74.40.Gk; 72.70.+m; 73.63.Kv; 85.65.+h
System-level exploration for Pareto-optimal configurations in parameterized system-on-a-chip (December 2002)
Authors: Tony Givargis, Frank Vahid, Jörg Henkel
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

In this work, we provide a technique for efficiently exploring the power/performance design space of a parameterized system-on-chip (SOC) architecture to find all Pareto-optimal configurations. These Pareto-optimal configurations will represent the range of power and performance tradeoffs that are obtainable by adjusting parameter values for a fixed application that is mapped on the SOC architecture. Our approach extensively prunes the potentially large configuration space by taking advantage of parameter dependencies. We have successfully applied our technique to explore Pareto-optimal configurations of our SOC architecture for a number of applications.
Development of a communication environment between IPv6 and IPv4
Authors: Gábor Fóris, László Sógor, Péter Hendlein, Krisztián Notaisz, Márta Fidrich
Venue: Acta Cybernetica (2002)

The aim of this paper is to present the design, specification, implementation and testing of a demonstration environment for examining a genuinely new communication technique. This technique ensures that 3G mobile networks can communicate with legacy Internet phones. More than one levels of the TCP/IP protocol family are necessary for the communication, so we had to develop device drivers and user level applications too. The different levels require various development techniques and tools, whose efficiently combined usage is emphasized.
A Ring Architecture Strategy for BIST Test Pattern Generation
Authors: C. Fagot, O. Gascuel, P. Girard, C. Landrault
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper presents a new effective Built-In Self Test (BIST) scheme that achieves 100% fault coverage with low area overhead, and without any modification of the circuit under test (CUT), i.e., no test point insertion. The set of patterns generated by a pseudo-random pattern generator, e.g. a Linear Feedback Shift Register (LFSR), is transformed into a new set of patterns that provides the desired fault coverage. To transform these patterns, a ring architecture composed by a set of masks is used. During on-chip test pattern generation, each mask is successively selected to map the original pattern sequence into a new test sequence. We describe an efficient algorithm that constructs a ring of masks from the test cubes provided by an automatic test pattern generator (ATPG) tool. Moreover, we show that rings of masks are implemented very easily at low silicon area cost, without requiring any logic synthesis tool; a combinational mapping logic corresponding to the masks is placed between the LFSR and the CUT, together with a looped shift register that acts as a mask selecting circuit. Experimental results are given at the end of the paper, demonstrating the effectiveness of the proposed approach in terms of area overhead, fault coverage and test sequence length. Note that this paper is an extended version of [1].