ppxscal/embedding_network huggingface dataset:
Retrieval of software components using a distributed web system
Authors: Anita Behle, Michael Kirchhof, Manfred Nagl, Ralf Welter
Venue: Journal of Network and Computer Applications (2002)

Software reuse is important, especially product reuse. This paper describes a retrieval system for software components, the most popular form of product reuse. The system is distributed and embedded in the web and is based on structured retrieval using a classification schema.After defining the requirements for the system, we first discuss the advanced outside functionalities of the component retrieval system, as its multi-paradigmatic classification approach, the ability to extend/change the schema, the navigational facility through different views, and the system's interface to search engines. Then, the most interesting topics of the system's realization are discussed, as dynamic web page generation and personalization, how the specific environments for different roles are built, how schema modification is handled, and how the system was designed being driven by software for reuse. Some measurements of the system's outside behavior and its convenience for users are given.
Internet information and communication systems for civil engineering: a review
Authors: Z. Turk
Venue: Civil and structural engineering computing: 2001 (2001)

Throughout history, information and communication technologies have been supporting building projects. The paper first introduces the concept of the communication revolutions and analyses how they influenced the construction profession. It then defines the modern understanding of the terms and concepts, proposes a taxonomy of communication types and groups them into four application areas: (1) to deliver information, (2)to enable collaboration and (3) commerce and (4) to provide a platform where the core engineering work gets done. The development along those four areas is analysed by giving brief market watch as well as state of the art overviews. The author concludes, that research issues on implementing the communication technologies include not only the technical but social, legal, economical and educational problems.
On Quasi-Reversibility and Local Balance: An Alternative Derivation of the Product-Form Results
Authors: Xiuli Chao, Masakiyo Miyazawa
Venue: Operations Research (1998)

We are concerned with a queueing network, described by a continuous-time Markov chain, in which each node is quasi-reversible. A new class of local balance equations is derived for the Markov chain with respect to a product-form distribution, which simultaneously provides an alternative and short proof for product form results of queueing networks with customers and signals. Furthermore, if each node is internally balanced, i.e., the total arrival rate equals the total departure rate for each node, the Markov chain is locally balanced in the ordinary sense. Our arguments reveal a close relationship between quasi-reversibility and local balance, and provide further insights into how transition rates are balanced in product form queueing networks.
Towards the automatic optimal mapping of pipeline algorithms
Authors: D. González, F. Almeida, L. Moreno, C. Rodríguez
Venue: Parallel Computing (2003)

The assignment of computations to processors is a crucial factor determining the effectiveness of a parallel algorithm. The portability of parallel programs has involved lot of effort during the last decade. However, the performance of a parallel code suffers, in many cases, from inherent effects of the target architectures. The optimal mapping of a parallel program is strongly dependent on the granularity and network architecture. We focus on the problem of finding the optimal mapping of pipeline algorithms on a ring of processors. We propose an analytical model that allows an easy estimation of the parameters needed to obtain the mapping. The model can be introduced in a suitable tool to automatically produce this mapping. Both the accuracy of the model and the optimal efficiency of the algorithm found are contrasted on pipeline algorithms for the knapsack problem, for the resource allocation problem and for the path planning problem.
Battery-aware power management based on Markovian decision processes
Authors: Peng Rong, Massoud Pedram
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper is concerned with the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a detailed stochastic model of a power-managed, battery-powered electronic system is presented. The model, which is based on the theories of continuous-time Markovian decision processes and stochastic networks, captures two important characteristics of today's rechargeable battery cells, i.e., the current rate-capacity characteristic and the relaxation-induced recovery. Next, the battery-aware dynamic power management problem is formulated as a policy optimization problem and solved exactly by using a linear programming approach. Experimental results show that the proposed method outperforms existing heuristic methods for battery management by as much as 17% in terms of the average energy delivered per unit weight of battery cells.
A recent radical graphical approach to programming
Authors: Alfred L. McKinney
Venue: Journal of Computing Sciences in Colleges (2003)

This paper provides a very brief overview of the history of graphical approaches to programming. A more detailed description is given of SoftWIRE, a recent radical graphical approach to programming, which has much potential. SoftWIRE utilizes Visual Basic (VB) in the Integrated Development Environment (IDE) Microsoft Visual Studio. NET. The description of SoftWIRE provides details, advantages, and program examples. Predictions are made on the development and the future of graphical programming and also on a possible shift to using a graphical-oriented paradigm to teach programming. A sample course description and outline using SoftWIRE and a graphical approach for Computer Science I (Introduction to Problem Solving and Programming) is given in the Appendix.
De Bruijn's syntax and reductional equivalence of &lambda;-terms
Authors: Fairouz Kamareddine, Roel Bloo, Rob Nederpelt
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

In this paper, a notation influenced by de Bruijn's syntax of the &lambda;-calculus is used to describe canonical forms of terms and an equivalence relation which divides terms into classes according to their reductional behaviour. We show that this notation helps describe canonical forms more elegantly than the classical notation and we establish the desirable properties of our reduction modulo equivalence classes rather than single terms. Finally, we extend the cube consisting of eight type systems with class reduction and show that this extension satisfies all the desirable properties of type systems.
About Our Authors
Authors: Hiroshige Dan, Nobuo Yamashita, Masao Fukushima
Venue: Information Systems Research (2002)

About Our Authors
Real-Time Optimization of Containers and Flatcars for Intermodal Operations
Authors: Warren B. Powell, Tassio A. Carvalho
Venue: Transportation Science (1998)

We propose a dynamic model for optimizing the flows of flatcars that considers explicitly the broad range of complex constraints that govern the assignment of trailers and containers to a flatcar. The problem is formulated as a logistics queueing network which can handle a wide range of equipment types and complex operating rules. The complexity of the problem prevents a practical implementation of a global network optimization model. Instead, we formulate a global model with the specific goal of providing network information to local decision makers, regardless of whether they are using optimization models at the yard level. Thus, our approach should be relatively easy to implement given current rail operations. Initial experiments suggest that a flatcar fleet that is managed locally, without the benefit of our network information, can achieve the same demand coverage as a fleet that is 10 percent smaller, but is managed locally with our network information.
Improving Quality Via Matching: a Case Study Integrating Supplier and Manufacturer Quality Performance
Authors: Robert Plante, Herbert Moskowitz, Jen Tang, Jeff Duffy
Venue: Manufacturing Service Operations Management (1999)

The relentless pursuit of increased product quality via continuous improvement is an important long-term strategy for achieving competitive advantage. However, manufacturers must still achieve high product quality in the short run. Hence, short-run quality improvement strategies are necessary, and, if possible, should complement (rather than substitute for) a longer run continuous improvement strategy with suppliers. We propose a novel short-run quality improvement strategy with suppliers which is based on a combinatorial optimization model for determining the optimal matching of raw material batches (from suppliers) with process variable parameters (of the manufacturer) by exploiting their interaction effects. Although the model can be difficult to solve, we develop sufficient conditions for a special case where the attainment of an optimal solution is straightforward. We demonstrate the use of the proposed approach in an actual pharmaceutical process. Using data from the pharmaceutical case, we develop several simulation scenarios where matching is shown (predicted) to greatly improve process yield. We also discuss the use of matching to illuminate various strategies for long-term continuous improvement of supplier and manufacturer processes in general.
Arrival first queueing networks with applications in kanban production systems
Authors: Richard J. Boucherie, Xiuli Chao, Masakiyo Miyazawa
Venue: Performance Evaluation (2003)

In this paper, we introduce a new class of queueing networks called arrival first networks. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production systems operating under a kanban protocol. In contrast with the conventional departure first networks, where a transition is initiated by service completion of items at the originating nodes that are subsequently routed to the destination nodes (push system), in an arrival first network a transition is initiated by the destination nodes of the items and subsequently those items are processed at and removed from the originating nodes (pull system). These are similar to the push and pull systems in manufacturing systems.Our characterisation provides necessary and sufficient conditions for the network to possess linear traffic equations, and sufficient conditions for the network to have a product form stationary distribution. We apply our results to networks operating under a kanban mechanism and characterise the rate at which items are pulled as well as the routing and blocking protocols that give rise to a product form stationary distribution.
A New Approach to Performance Measurement and Goal Setting
Authors: Bruce H. Andrews, John J. Carpentier, Tracy L. Gowen
Venue: Interfaces (2001)

To support their continuous improvement programs, we developed and implemented a performance-measurement and goal-setting system for the six regional water utility operating companies that are all managed by one holding company. The performance-measurement and goal-setting stages both have two sample-based methodological components: (1) estimation of past and future cumulative distribution functions (c.d.f.s) of the key performance metric for a population of operating companies in the industry, and (2) regression analysis of the same metric for comparing period-to-period changes (both past and projected) in the performance of individual operating companies. This system has allowed the holding company to better evaluate and plan for its own performance in relation to that of its peers and to establish credible, individualized goals for its six regional companies based on estimates of their inherent capability.
On-chip interconnect modeling by wire duplication
Authors: Guoan Zhong, Cheng-Kok Koh, Kaushik Roy
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper, we present a novel wire duplication-based interconnect modeling technique. The proposed modeling technique exploits the sparsity of the L&minus;1 matrix, where L is the inductance matrix, and constructs a sparse and stable equivalent RLC circuit by windowing the original inductance matrix. The model avoids matrix inversions. Most important, it is more accurate and more efficient than many existing techniques.
Air pollution model quality assurance: a review
Authors: E. Canepa
Venue: Development and application of computer techniques to environmental studies (2002)

Quality assurance means all those planned and systematic actions necessary to provide adequate confidence that a product or service will satisfy given requirements for quality. Information is given about new developments concerning model quality assurance of atmospheric dispersion models, in particular about model evaluation, the overall system of procedures designed to measure the model performance, and model validation, the analysis of model performance based on the comparison of model outputs with experimental data. Some quality indicators currently used in model validation exercises are described. Problems related to uncertainty analysis are highlighted.
HIRISC - a RISC architecture and machine simulator
Authors: Timothy S. Margush
Venue: Journal of Computing Sciences in Colleges (2001)

The HiRISC Computer System is a hypothetical computer modeled after a generic RISC architecture. The simulator for the system was developed to support a Systems Programming course, providing a bare bones machine for experimentation with loaders, linkers, and assemblers. The HiRISC Simulator is a Windows-based program that includes independent windows providing visual displays of all internal registers, memory, and IO devices. A simple control panel displays control unit information and allows the operator to start, stop, or single-step the processor. Memory contents may be edited within the simulation environment, but the simulator also includes a built in object file loader and a machine language debugger with breakpoints and single step capability. Logging capabilities facilitate the development of student reports. A cross-assembler is available to produce object files in an acceptable format.
On the Tail of the Waiting Time in a Markov-Modulated M/G/1 Queue
Authors: Søren Asmussen, Colm O'cinneide
Venue: Operations Research (2002)

We show that the "exponential decay parameter" of the waiting time in a Markov-modulatedM/G/1 queue is no larger than that of the correspondingM/G/1 queue with "averaged" parameters, and we give a necessary and sufficient condition for equality. We also explore the effect of speeding up the modulation process. A key tool is a Markov-modulated fluid model.
Pseudo-boolean optimization
Authors: Endre Boros, Peter L. Hammer
Venue: Discrete Applied Mathematics (2002)

This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms.
Improving Repetitive Manufacturing Systems: Model and Insights
Authors: Scott Webster, Z. Kevin Weng
Venue: Operations Research (2001)

We consider a manufacturing system that is controlled by a fixed-cycle smoothed production policy. This policy, which is becoming increasingly common in repetitive manufacturing environments, is characterized by a production rate that is updated on a periodic basis. We model the system as a stochastic process that includes parameters for vendor responsiveness, plant responsiveness, randomness in production yield rates, nonstationarity and randomness in market demand, demand forecast error, operating cost rates, and safety stock. Properties of the model expose structural relationships between expected system performance and system parameters.
A Method for the Improvement of the Behavior of Bidirectional Associative Memories as Pattern Classifiers
Authors: Francisco J. López-Aligué, Ignacio Alvarez-Troncoso, M. Isabel Acevedo-Sotoca, Carlos J. García-Orellana, Miguel Macías-Macías
Venue: Neural Processing Letters (2003)

We present a form of attaining success levels of up to 100% in character classification by the appropriate use of thresholds in the activity functions of the neurons making up the two-layer network with which bidirectional associative memories are implemented, together with a systematic method for generating the weight matrix. The system that is constructed includes a geometrical pre-processing stage that eliminates distortions, thereby improving the results. As a final characteristic, the functioning of the system presents a high level of immunity to noise or deformations. The system was evaluated using the two popular databases NIST&num;19 and UCI. There was found to be no misclassification in any case, whether under conditions of heavy contamination from noise or distortion of the image to be classified.
A front tracking approach to a model of continuous sedimentation in ideal clarifier-thickener units
Authors: R. Bürger, K. H. Karlsen, C. Klingenberg, N. H. Risebro
Venue: Nonlinear Analysis: Real World Applications (2003)

We study a model of continuous sedimentation. Under idealizing assumptions, the settling of the solid particles under the influence of gravity can be described by the initial value problem for a one-dimensional scalar conservation law with a flux function that depends discontinuously on the spatial position. We construct a weak solution to the sedimentation model by proving the convergence of a front tracking method. The basic building block in this method is the solution of the Riemann problem, which is complicated by the fact that the flux function is discontinuous. A feature of the convergence analysis is the difficulty of bounding the total variation of the conserved variable. To overcome this obstacle, we rely on a certain non-linear Temple functional under which the total variation can be bounded. The total variation bound on the transformed variable also implies that the front tracking construction is well defined. Finally, via some numerical examples, we demonstrate that the front tracking method can be used as a highly efficient and accurate simulation tool for continuous sedimentation.
Algorithm for recognizing Cartesian graph bundles
Authors: Blaz˘ Zmazek, Janez Z˘erovnik
Venue: Discrete Applied Mathematics (2002)

Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is defined and it is shown that any equivalence relation possessing the unique square property determines the fundamental factorization of a graph as a nontrivial Cartesian graph bundle over arbitrary base graph. In this paper we define a relation Δ having a unique square property on Cartesian graph bundles over K_4\e-free simple base. We also give a polynomial algorithm for recognizing Cartesian graph bundles over K_4\e-free simple base.
A highly flexible, distributed multiprocessor architecture for network processing
Authors: Muthu Venkatachalam, Prashant Chandra, Raj Yavatkar
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Network processors (NPs) are an emerging field of programmable processors that are optimized to implement data plane packet processing networking functions. Unlike the general-purpose CPUs that rely heavily on caching for improving performance, the lack of locality in packet processing and need for high-performance I/O have forced designers to come up with innovative architectures that can hide memory latency while still processing packets at high data rates. Most of these NPs use some type of multiprocessing in combination with a hierarchy of memory types to achieve high performance. In addition, to keep up with packets arriving at high data rates over multiple incoming media interfaces, an NP must perform fast I/O and memory operations such as packet storage, table lookup, and extraction of fields in packet headers. We describe an architecture that uses a combination of distributed memory architecture and one or more multithreaded processors to achieve the necessary performance. We describe the challenges in programming such a processor including the issues related to consistency and maintaining packet ordering. We also present a programming model for generic network applications that uses software pipelines. We then demonstrate the use of the programming model in implementing two applications, namely, mapping traffic management algorithms onto a multithreaded architecture and an implementation of a media gateway based on voice-over-AAL2.
Guided synthesis of control programs using UPPAAL
Authors: Thomas Hune, Kim G. Larsen, Paul Pettersson
Venue: Nordic Journal of Computing (2001)

In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We use a timed automata model of the batch plant and the verification tool UPPAAL to solve the scheduling problem.In modeling the plant, we aim at a level of abstraction which is sufficiently accurate in order that synthesis of control programs from generated timed traces is possible. Consequently, the models quickly become too detailed and complicated for immediate automatic synthesis. In fact, only models of plants producing two batches can be analyzed directly! To overcome this problem, we present a general method allowing the user to guide the model-checker according to heuristically chosen strategies. The guidance is specified by augmenting the model with additional guidance variables and by decorating transitions with extra guards on these. Applying this method have made synthesis of control programs feasible for a plant producing as many as 60 batches.The synthesized control programs have been executed in a physical plant. Besides proving useful in validating the plant model and in finding some modeling errors, we view this final step as the ultimate litmus test of our methodology's ability to generate executable (and executing) code from basic plant models.
An experiment in feature engineering
Authors: Pamela Zave
Venue: Programming methodology (2003)

Feature-oriented specifications must be constructed, validated, and verified differently from other specifications. This paper presents a feature-oriented specification technique and a formal method applicable to some of its specifications. The method is applied to an example specification, and the results are evaluated.