ppxscal/embedding_network huggingface dataset:
Gilgamesh: a multithreaded processor-in-memory architecture for petaflops computing
Authors: Thomas L. Sterling, Hans P. Zima
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Processor-in-Memory (PIM) architectures avoid the von Neumann bottleneck in conventional machines by integrating high-density DRAM and CMOS logic on the same chip. Parallel systems based on this new technology are expected to provide higher scalability, adaptability, robustness, fault tolerance and lower power consumption than current MPPs or commodity clusters. In this paper we describe the design of Gilgamesh, a PIM-based massively parallel architecture, and elements of its execution model. Gilgamesh extends existing PIM capabilities by incorporating advanced mechanisms for virtualizing tasks and data and providing adaptive resource management for load balancing and latency tolerance. The Gilgamesh execution model is based on macroservers, a middleware layer which supports object-based runtime management of data and threads allowing explicit and dynamic control of locality and load balancing. The paper concludes with a discussion of related research activities and an outlook to future work.
A Dynamic Model for Requirements Planning with Application to Supply Chain Optimization
Authors: Stephen C. Graves, David B. Kletter, William B. Hetzel
Venue: Operations Research (1998)

This paper develops a new model for studying requirements planning in multistage production-inventory systems. We first characterize how most industrial planning systems work, and we then develop a mathematical model to capture some of the key dynamics in the planning process. Our approach is to use a model for a single production stage as a building block for modeling a network of stages. We show how to analyze the single-stage model to determine the production smoothness and stability for a production stage and the inventory requirements. We also show how to optimize the tradeoff between production capacity and inventory for a single stage. We then can model the multistage supply chain using the single stage as a building block. We illustrate the multistage model with an industrial application, and we conclude with some thoughts on a research agenda.
What Designers of Bus and Network Architectures Should Know about Hypercubes
Authors: Laurence E. LaForge, Kirk F. Korver, M. Sami Fadali
Venue: IEEE Transactions on Computers (2003)

We quantify why, as designers, we should prefer clique-based hypercubes (K-cubes) over traditional hypercubes based on cycles (C-cubes). Reaping fresh analytic results, we find that K-cubes minimize the wirecount and, simultaneously, the latency of hypercube architectures that tolerate failure of any f nodes. Refining the graph model of Hayes (1976), we pose the feasibility of configuration as a problem in multivariate optimization:What (f + 1){\hbox{-}}{\rm connected}n{\hbox{-}}{\rm vertex} graphs with fewest edges \lceil n ( f + 1) / 2\rceil minimize the maximum a) radius or b) diameter of subgraphs (i.e., quorums) induced by deleting up to f vertices? (1)We solve (1) for f that is superlogarithmic but sublinear in n and, in the process, prove: 1) the fault tolerance of K-cubes is proportionally greater than that of C-cubes; 2) quorums formed from K-cubes have a diameter that is asymptotically convergent to the Moore Bound on radius; 3) under any conditions of scaling, by contrast, C-cubes diverge from the Moore Bound. Thus, K-cubes are optimal, while C-cubes are suboptimal. Our exposition furthermore: 4) counterexamples, corrects, and generalizes a mistaken claim by Armstrong and Gray (1981) concerning binary cubes; 5) proves that K-cubes and certain of their quorums are the only graphs which can be labeled such that the edge distance between any two vertices equals the Hamming distance between their labels; and 6) extends our results to K-cube-connected cycles and edges. We illustrate and motivate our work with applications to the synthesis of multicomputer architectures for deep space missions.
Yield Management Impacts on Airline Spill Estimation
Authors: Peter P. Belobaba, Andras Farkas
Venue: Transportation Science (1999)

The correct estimation of spill, or passenger demand turned away, is an integral part of the determination of optimal aircraft capacities in the airline fleet assignment process. While making advances in the solution of the large-scale fleet assignment optimization problem, airlines have continued to use an aggregate approach to spill estimation. This aggregate approach ignores the effects of yield management practices that have been widely implemented by airlines during the past decade. In this paper, we illustrate the importance of incorporating the effects of yield management booking limits into the methodology used to estimate both the number of passengers spilled at a given aircraft capacity and their associated revenue value. We describe an approach to spill estimation that makes use of the detailed demand information provided by yield management systems, and we present recursive algorithms that can be used to obtain more accurate spill estimates in cases when multiple booking classes are used. Numerical examples are presented to illustrate the extent to which the outcomes of the different estimation approaches differ, suggesting that these differences can be large enough to have an impact on optimal fleet assignment.
Implementation and evaluation of a QoS-capable cluster-based IP router
Authors: Prashant Pradhan, Tzi-cker Chiueh
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

A major challenge in Internet edge router design is to support both high packet forwarding performance and versatile and efficient packet processing capabilities. The thesis of this research project is that a cluster of PCs connected by a high speed system area network provides an effective hardware platform for building routers to be used at the edges of the Internet. This paper describes a scalable and extensible edge router architecture called Panama, which supports a novel aggregate route caching scheme, a real-time link scheduling algorithm whose performance overhead is independent of the number of real-time flows, a highly efficient kernel extension mechanism to safely load networking software extensions dynamically, and an integrated resource scheduler which ensures that real-time flows with additional packet processing requirements still meet their end-to-end performance requirements. This paper describes the implementation and evaluation of the first Panama prototype based on a cluster of PCs and Myrinet.
Deliberate Learning and the Evolution of Dynamic Capabilities
Authors: Maurizio Zollo, Sidney G. Winter
Venue: Organization Science (2002)

This paper investigates the mechanisms through which organizations develop dynamic capabilities, defined as routinized activities directed to the development and adaptation of operating routines. It addresses the role of (1) experience accumulation, (2) knowledge articulation, and (3) knowledge codifi- cation processes in the evolution of dynamic, as well as operational, routines. The argument is made that dynamic capabilities are shaped by the coevolution of these learning mechanisms. At any point in time, firms adopt a mix of learning behaviors constituted by a semiautomatic accumulation of experience and by deliberate investments in knowledge articulation and codification activities. The relative effectiveness of these capability-building mechanisms is analyzed here as contingent upon selected features of the task to be learned, such as its frequency, homogeneity, and degree of causal ambiguity. Testable hypotheses about these effects are derived. Somewhat counterintuitive implications of the analysis include the relatively superior effectiveness of highly deliberate learning processes such as knowledge codification at lower levels of frequency and homogeneity of the organizational task, in contrast with common managerial practice.
Static Analysis of Binary Code to Isolate Malicious Behaviors
Authors: J. Bergeron, Mourad Debbabi, M. M. Erhioui, Béchir Ktari
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

In this paper, we address the problem of static slicing on binary executables for the purposes of the malicious code detection in COTS components. By operating directly on binary code without any assumption on the availability of source code, our approach is realistic and appropriate for the analysis of COTS software products. To be able to reason on such low-level code, we need a suite of program transformations that aim to get a high level imperative representation of the code. The intention is to significantly improve the analyzability while preserving the original semantics. Next, we apply slicing techniques to extract those code fragments that are critical from the security standpoint. Finally, these fragments are subjected to verification against behavioral specifications to statically decide whether they exhibit malicious behaviors or not.
An Evaluation of Self-Organizing Map Networks as a Robust Alternative to Factor Analysis in Data Mining Applications
Authors: Melody Y. Kiang, Ajith Kumar
Venue: Information Systems Research (2001)

Kohonen's self-organizing map (SOM) network is one of the most important network architectures developed during the 1980s. The main function of SOM networks is to map the input data from ann-dimensional space to a lower dimensional (usually one- or two-dimensional) plot while maintaining the original topological relations. Therefore, it can be viewed as an analog of factor analysis. In this research, we evaluate the feasibility of using SOM networks as a robust alternative to factor analysis and clustering for data mining applications. Specifically, we compare SOM network solutions to factor analytic and K-Means clustering solutions on simulated data sets with known underlying factor and cluster structures.The comparisons indicate that the SOM networks provide solutions superior to unrotated factor solutions in general and provide more accurate recovery of underlying cluster structures when the input data are skewed. Our findings suggest that SOM networks can provide robust alternatives to traditional factor analysis and clustering techniques in data mining applications.
Career fields
Authors: Antonio M. Lopez,  Jr.
Venue: Journal of Computing Sciences in Colleges (2003)

This paper defines the concept of career fields and recommends it as a means of motivating undergraduates, who are majoring in computer science, computer engineering, or computer information systems, to persist in the attainment of a bachelor's degree. The paper illustrates the importance of career fields with scenarios where undergraduates might apply their computing knowledge in the context of a particular career field. Finally, it suggests how faculty might nurture the concept in students throughout the student's entire course of academic studies.
Implementing the MPI process topology mechanism
Authors: Jesper Larsson Träff
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

The topology functionality of the Message Passing Interface (MPI) provides a portable, architecture-independent means for adapting application programs to the communication architecture of the target hardware. However, current MPI implementations rarely go beyond the most trivial implementation, and simply performs no process remapping.We discuss the potential of the topology mechanism for systems with a hierarchical communication architecture like clusters of SMP nodes. The MPI topology functionality is a weak mechanism, and we argue about some of its shortcomings. We formulate the topology optimization problem as a graph embedding problem, and show that for hierarchical systems it can be solved by graph partitioning. We state the properties of a new heuristic for solving both the embedding problem and the "easier" graph partitioning problem.The graph partitioning based framework has been fully implemented in MPI/SX for the NEC SX-series of parallel vector computers. MPI/SX is thus one of very few MPI implementations with a non-trivial topology functionality. On a 4 node NEC SX-6 significant communication performance improvements are achieved with synthetic MPI benchmarks.
Gales suffice for constructive dimension
Authors: John M. Hitchcock
Venue: Information Processing Letters (2003)

Supergales, generalizations of supermartingales, have been used by Lutz (2002) to define the constructive dimensions of individual binary sequences. Here it is shown that gales, the corresponding generalizations of martingales, can be equivalently used to define constructive dimension.
Codesign-extended applications
Authors: Brian Grattan, Greg Stitt, Frank Vahid
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

We challenge the widespread assumption that an embedded system's functionality can be captured in a single specification and then partitioned among software and custom hardware processors. The specification of some functions in software is very different from the specification of the same function in hardware - too different to conceive of automatically deriving one from the other. We illustrate this concept using a digital camera example. We introduce the idea of codesign-extended applications to deal with the situation, wherein critical functions are written in multiple versions, and integrated such that simple compiler/synthesis flags instantiate a particular version along with the necessary control and communication behavior. By capturing a specification as a codesign-extended application, a designer enables smooth migration among platforms with increasing amounts of on-chip configurable logic.
Computing the face lattice of a polytope from its vertex-facet incidences
Authors: Volker Kaibel, Marc E. Pfetsch
Venue: Computational Geometry: Theory and Applications (2002)

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n, m}.α.φ), where n is the number of vertices, m is the number of facets,α is the number of vertex-facet incidences, and φ is the total number of faces of P. This improves results of Fukuda and Rosta [Computational Geometry 4 (4) (1994) 191-198], who described an algorithm for enumerating all faces of a d-polytope in O(min{n, m} . d. φ2) steps. For simple or simplicial d-polytopes our algorithm can be specialized to run in time O(d. α. φ). Furthermore, applications of the algorithm to other atomic lattices are discussed, e.g., to face lattices of oriented matroids.
Flexible linear programs with a restricted overall flexibility level
Authors: Robert Fullér, Margit Kovács, György Schuster
Venue: Fuzzy Sets and Systems (2002)

It is usually supposed that tolerance levels are determined by the decision maker a priori in flexible linear programming (FLP) problems. In this paper, we shall suppose that the decision maker does not care about the particular values of tolerance levels, but he wishes to keep their sum below a predetermined level which we call his overall flexibility level. We also suppose that his overall flexibility level is soft, i.e. it is admissible to exceed it (to a certain extent). This is a new statement of FLP problems, because here the tolerance levels are also treated as variables, and the only restriction on them is that their sum should not exceed very much a given level. In this setup, we shall prove that the consistency level of FLP problems depends continuously on the decision maker's overall flexibility level.
The impact of the constant complement approach towards view updating
Authors: Jens Lechtenbörger
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Views play an important role as a means to structure information with respect to specific users' needs. While read access through views is easy to handle, update requests through views are dificult in the sense that they have to be translated into appropriate updates on database relations. In this paper the "constant complement translator" approach towards view updating proposed by Bancilhon and Spyratos is revisited within the realm of SQL databases, and a novel characterization is established showing that constant complement translators exist precisely if users have a chance to undo all effects of their view updates using further view updates. Based on this characterization view updates with and without constant complement translators are presented. As it turns out that users cannot fully understand updates on views violating the constant complement principle, the application of this principle in the context of external schema design is discussed.
The penalty boundary method
Authors: B. W. Clark, D. C. Anderson
Venue: Finite Elements in Analysis and Design (2003)

Traditional methods for applying boundary conditions in finite element analysis require the mesh to conform to the geometry boundaries. This in turn requires complex meshing algorithms for automated mesh generation from CAD geometry, particularly when using quadrilateral and hexahedral elements. The penalty boundary method (PBM) is introduced as a method that significantly reduces the time required for generating finite element models because the mesh is not required to conform to the CAD geometry. The PBM also eliminates discretization error as boundary conditions are applied using CAD geometry directly rather than an approximation of the geometry, The PBM employs penalty methods to apply boundary conditions on a simple, regular mesh.
On the semiconvergence of extrapolated iterative methods for singular linear systems
Authors: Yongzhong Song, Li Wang
Venue: Applied Numerical Mathematics (2003)

In this paper, we discuss semiconvergence of the extrapolated iterative methods for solving singular linear systems. The sufficient and necessary conditions for semiconvergence of the extrapolated iterative methods are presented. The results are applied to the (generalized, block) JOR and AOR methods.
Applying the multi-agent paradigm to reconfigurable hardware: a sensor fusion example
Authors: Hamid Reza Naji, John Weir, B. Earl Wells
Venue: Second international workshop on Intelligent systems design and application (2002)

In this paper, we illustrate how the multi-agent paradigm that is so prevalent in today's distributed artificial intelligence software systems can be extended to the design of digital hardware. Partitioning the hardware design space into entities called agents, which are autonomous units of execution that have the capability of interacting with the environment and each other has been made much more attractive by the recent advances in the capabilities of reconfigurable hardware. In a reconfigurable embedded processing environment one possible benefit of the multi-agent approach is the use of a common design methodology for both the hardware and software components of the system. It is also believed that the multi-agent approach can greatly facilitate the flexibility, efficiency, fault tolerance, scalability, and maintainability of the overall system. In this paper we will explore the arguments for applying multi-agent techniques to digital hardware, highlighting how such techniques can be applied using current-generation hardware description languages such as VHDL. Then we examine how hardware multi-agent technology can be applied to an example distributed real-time sensor fusion application.
City lights: contextual views in minimal space
Authors: Polle T. Zellweger, Jock D. Mackinlay, Lance Good, Mark Stefik, Patrick Baudisch
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

City Lights are space-efficient fisheye techniques that provide contextual views along the borders of windows and subwindows that describe unseen objects in all directions. We present a family of techniques that use a range of graphical dimensions to depict varied information about unseen objects. City Lights can be used alone or in conjunction with scrollbars, 2D overview+detail, and interaction techniques such as zoomable user interfaces.
Accelerating Cyclic Update Algorithms for Parameter Estimation by Pattern Searches
Authors: Antti Honkela, Harri Valpola, Juha Karhunen
Venue: Neural Processing Letters (2003)

A popular strategy for dealing with large parameter estimation problems is to split the problem into manageable subproblems and solve them cyclically one by one until convergence. A well-known drawback of this strategy is slow convergence in low noise conditions. We propose using so-called pattern searches which consist of an exploratory phase followed by a line search. During the exploratory phase, a search direction is determined by combining the individual updates of all subproblems. The approach can be used to speed up several well-known learning methods such as variational Bayesian learning (ensemble learning) and expectation-maximization algorithm with modest algorithmic modifications. Experimental results show that the proposed method is able to reduce the required convergence time by 60&ndash;85% in realistic variational Bayesian learning problems.
Modeling lateral transshipments in multiechelon repairable-item inventory systems with finite repair channels
Authors: Bong-Ryong Jung, Byung-Geun Sun, Jong-Soo Kim, Sun-Eung Ahn
Venue: Computers and Operations Research (2003)

This article concerns the problem of determining the optimal spare inventory level for a multiechelon repairable-item inventory system, which has several bases and a central depot. When an item fails, the failed item is replaced immediately if a spare is available at the base. If there is no spare item available at the base, it is requested as a lateral transshipment to another base that has a spare in stock. If an item is not available from any of the bases, the item is backordered until a spare becomes available. We propose a model to describe the behavior of the system and develop an algorithm to find the spare inventory level at each base, which minimizes the total expected cost of the system. The algorithm is illustrated using examples of various sizes.
Approximation of Time-Dependent Viscoelastic Fluid Flow: SUPG Approximation
Authors: Vincent J. Ervin, William W. Miles
Venue: SIAM Journal on Numerical Analysis (2003)

In this article we consider the numerical approximation to the time-dependent viscoelasticity equations with an Oldroyd B constitutive equation. The approximation is stabilized by using a streamline upwind Petrov--Galerkin (SUPG) approximation for the constitutive equation. We analyze both the semidiscrete and fully discrete numerical approximations. For both discretizations we prove the existence of, and derive a priori error estimates for, the numerical approximations.