ppxscal/embedding_network huggingface dataset:
Skewed CMOS: noise-tolerant high-performance low-power static circuit family
Authors: Alexandre Solomatnikov, Dinesh Somasekhar, Naran Sirisantana, Kaushik Roy
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

In this paper, we present a noise-tolerant high-performance static circuit family suitable for low-voltage operation called skewed logic. Skewed logic circuits in comparison with Domino logic have better scalability and they are more suitable for low voltage applications because of better noise margins. Skewed logic and its variations have been compared with Domino logic in terms of delay, power, and dynamic noise margin. A design methodology for skewed CMOS pipelined circuits has been developed. To demonstrate applicability of proposed logic style 0.35 µm 5.56 ns CMOS 16 × 16 bit multiplier has been designed using skewed logic circuits and fabricated through MOSIS. Measurement results show that the multiplier only consumed power of 195 mW due to low clock load.
Aggregation based information collection for mobile environments
Authors: Qi Han, Nalini Venkatasubramanian
Venue: Journal of High Speed Networks (2002)

In the future, we are likely to see a tremendous rise in mobile computing and communications as ubiquitous applications incorporate multimedia information. These mobile multimedia applications will have QoS requirements; resource provisioning algorithms utilize current system resource availability information to ensure that these applications meet their QoS requirements. Information collection algorithms collect and maintain current system resource information and are vital in performing efficient resource provisioning. In this paper, we present a novel information collection technique for mobile environments - the ABIC (aggregation-based information collection) algorithm. This algorithm derives aggregate mobility from individual user mobility, then utilizes the aggregation to drive the information collection process and adjust the related parameters in the process. A feedback loop allows the information collection process to utilize feedback from the resource provisioning process in further decision making. We compare the ABIC approach to other proposed information collection algorithms under different workloads and mobility patterns. Our experimental results show that the aggregation based information collection algorithm exhibits superior performance under most mobility criteria and request patterns.
Reflections and Projections on Creativity in Operations Research and Management Science: a Pressing Need for a Shift in Paradigm
Authors: Ajit Kambil, Eric Van Heck, Thomas L. Saaty
Venue: Operations Research (1998)

This paper is an outgrowth of a talk given at a plenary session of the national meeting of ORSA/TIMS (now INFORMS) in May of 1996. Rather than speculate on what might be the possible domain of OR/MS within a systems framework, the paper gives a sketch of what basic ideas there are today that can help us get to a unified mathematical theory of the subject. The concept of influence occurs in all fields of knowledge-from physics, with its gravitational and electromagnetic influences, to sociology with its societal, political, economic, and technological influences. We argue that influence, a sensed, perceived or inferred stimulus, is the single most central concept for analyzing causal relations in OR/MS problems. Problem solving is contextual and focuses on the distribution of influence in allocation, queuing, inventory, and similar problems by manipulating measurable quantities. Because most influences are abstract and intangible, emphasis on creating structures to represent and measure the flow of influence of intangibles and their propagation is critical for the development of a general scientific theory for OR/MS, more critical than in any other field because our problem domain is very general and interdisciplinary. The paper advocates the need for a systemic integration of the diverse approaches used in OR/MS within a single framework for all areas, including dependencies and feedback among influences to maintain the full integrity of the problems we solve. Examples and illustrations are given together with observations about the use of creativity and intelligence to move the process of creating a theory beyond the traditional process of problem solving.
Scaling the unscalable: a case study on the AlphaServer SC
Authors: Patrick H. Worley
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

A case study of the optimization of a climate modeling application on the Compaq AlphaServer SC at the Pittsburgh Supercomputer Center is used to illustrate tools and techniques that are important to achieving good performance scaling.
Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorization
Authors: Heejo Lee, Jong Kim, Sung Je Hong, Sunggu Lee
Venue: Parallel Computing (2003)

Block-oriented sparse Cholesky factorization decomposes a sparse matrix into rectangular subblocks; each block can then be handled as a computational unit in order to increase data reuse in a hierarchical memory system. Also, the factorization method increases the degree of concurrency and reduces the overall communication volume so that it performs more efficiently on a distributed-memory multiprocessor system than the customary column-oriented factorization method. But until now, mapping of blocks to processors has been designed for load balance with restricted communication patterns. In this paper, we represent tasks using a block dependency DAG that represents the execution behavior of block sparse Cholesky factorization in a distributed-memory system. Since the characteristics of tasks for block Cholesky factorization are different from those of the conventional parallel task model, we propose a new task scheduling algorithm using a block dependency DAG. The proposed algorithm consists of two stages: early-start clustering, and affined cluster mapping (ACM). The early-start clustering stage is used to cluster tasks while preserving the earliest start time of a task without limiting parallelism. After task clustering, the ACM stage allocates clusters to processors considering both communication cost and load balance. Experimental results on a Myrinet cluster system show that the proposed task scheduling approach outperforms other processor mapping methods.
The Access-Control Problem on Capacitated FIFO Networks With Unique O-D Paths is Hard
Authors: Alan L. Erera, Carlos F. Daganzo, David J. Lovell
Venue: Operations Research (2002)

This paper is concerned with the performance of multicommodity capacitated networks in a deterministic but time-dependent environment. For a given time-dependent origin-destination table, this paper asks if it is easy to find a way of regulating the input flows into the network to avoid queues from growing internally, i.e., to avoid capacity violations. Problems of this type are conventionally approached in the traffic/transportation field with variational methods such as control theory (if time is continuous) and with mathematical programming (if time is discrete). However, these approaches can only be expected to work well ifthe set off easible solutions is convex.Unfortunately, it is found in this paper that this is not the case. It is shown that continuous-time versions of the problem satisfying the smoothness conditions of control theory can have a finite but very large number off easible solutions. The same happens for the discrete time case. These difficulties arise even with the simplest versions of the problem (with unique origin-destination paths, perfect information, and deterministic travel times).The paper also shows that the continuous-time feasibility problem is NP-hard, and that if we restrict our attention to (practical) problems whose data can be described with a finite number ofbits (e.g., in discrete time), then the problem is NP-complete. These results are established by showing that the problem instances of interest can be related to the Directed Hamiltonian Path problem by a polynomial transformation.
Building web applications with Servlets and Javaserver pages
Authors: David Janzen
Venue: Journal of Computing Sciences in Colleges (2002)

Servlets and JavaServer Pages provide the ability to dynamically generate web pages using the Java programming language. Among other benefits, the use of Java on the server-side allows the web developer to directly implement object-oriented designs, utilize multiple threads of execution, and employ JDBC to communicate with a database. This tutorial will introduce Servlets and JavaServer Pages through UML diagrams, code samples, and an example web application.
Boundary vertices in graphs
Authors: Gary Chartrand, David Erwin, Garry L. Johns, Ping Zhang
Venue: Discrete Mathematics (2003)

The distance d(u, v) between two vertices u and v in a nontrivial connected graph G is the length of a shortest u-v path in G. For a vertex v of G, the eccentricity e(v) is the distance between v and a vertex farthest from v. A vertex v of G is a peripheral vertex if e(v) is the diameter of G. The subgraph of G induced by its peripheral vertices is the periphery Per(G) of G. A vertex u of G is an eccentric vertex of a vertex v if d(u, v)= e(v). A vertex x is an eccentric vertex of G if x is an eccentric vertex of some vertex of G. The subgraph of G induced by its eccentric vertices is the eccentric subgraph Ecc(G) of G. A vertex u of G is a boundary vertex of a vertex v if d(w,v) ≤ d(u,v) for all w ∈ N(u). A vertex u is a boundary vertex of G if u is a boundary vertex of some vertex of G. The subgraph of G induced by its boundary vertices is the boundary ∂(G) of G. A graph H is a boundary graph if H = ∂(G) for some graph G. We study the relationship among the periphery, eccentric subgraph, and boundary of a connected graph and establish a characterization of all boundary graphs. It is shown that per each triple a, b, c of integers with 2 ≤ a ≤ b ≤ c, there is a connected graph G such that Per(G) has order a, Ecc(G) has order b, and ∂(G) has order c. Moreover, for each triple r,s,t of rational numbers with 0 < r ≤ s ≤ t ≤ 1, there is a connected graph G of order n such that |V(Per(G))|/n=r, |V(Ecc(G))|/n = s, and |V(∂(G))| n=t.
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems
Authors: David Gamarnik
Venue: Mathematics of Operations Research (2002)

We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certaingeneralized priority policy and prove that the stability of this policy is algorithmically undecidable. We also prove that stability of a homogeneous random walk in d + is undecidable. Finally, we show that the problem of computing a fluid limit of a queueing system or of a constrained homogeneous random walk is undecidable. To the best of our knowledge these are the first undecidability results in the area of stability of queueing systems and random walks in d +. We conjecture that stability of common policies like First-In-First-Out and priority policy is also an undecidable problem.
Optimized power-delay curve generation for standard cell ICs
Authors: Miodrag Vujkovic, Carl Sechen
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

An effective way to compare logic techniques, logic families, or cell libraries is by means of power (or area) versus delay plots, since the efficiency of achieving a particular delay is of crucial significance. In this paper we describe a method of producing an optimized power versus delay curve for a combinational circuit. We then describe a method for comparing the relative merits of a set of power versus delay curves for a circuit, each generated with a different cell library. Our results indicate that very few combinational functions need to be in a cell library, at most 11. The power-delay points achieved by Design Compiler from Synopsys using the state-of-the-art Artisan Sage-X library compare unfavorably to our approach. In terms of minimum energy-delay product, our approach is superior by 79% on average. Our approach yields the same delay points with a 107% savings in power consumption, on average. We also show that the specified VDD for a process technology should only be used for the absolute fastest implementations of a circuit.
Simulation modeling and analysis issues for high-speed combined continuous and discrete food industry manufacturing processes
Authors: Abu M. Huda, Christopher A. Chung
Venue: Computers and Industrial Engineering (2002)

Many high-speed, minute component, flow oriented manufacturing processes are found in the food industry. These types of operations typically involve the transformation of a product from a fluid state into distinct packages. This transformation requires that these systems be modeled both continuously and discretely with respect to time in order to develop valid models. The complexity associated with these types of combined continuous and discrete simulation models, limits the availability of food processing industry related literature. This paper examines those issues in the context of a typical high-speed food processing facility.
Solving Inverse Spanning Tree Problems Through Network Flow Techniques
Authors: P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
Venue: Operations Research (1999)

Given a solution x* and an a priori estimated cost vector c, the inverse optimization problem is to identify another cost vector d so that x* is optimal with respect to the cost vector d and its deviation from c is minimum. In this paper, we consider the inverse spanning tree problem on an undirected graph G = (N, A) with n nodes and m arcs, and where the deviation between c and d is defined by the rectilinear distance between the two vectors, that is, L1 norm. We show that the inverse spanning tree problem can be formulated as the dual of an assignment problem on a bipartite network G0 = (N0, A0) with [math not displayed] and [math not displayed]. The bipartite ne twork satisfies the property that |N1| = (n - 1), |N2| = (m - n + 1), and |A0| = O(nm). In general, |N1| N2|. Using this special structure of the assignment problem, we develop a specific implementation of the successive shortest path algorithm that runs in O(n3) time. We also consider the weighted version of the inverse spanning tree problem in which the objective function is to minimize the sum of the weighted deviations of arcs. The weighted inverse spanning tree can be formulated as the dual of the transportation problem. Using a cost scaling algorithm, this transportation problem can be solved in O(n2m log(nC)) time, where C denotes the largest arc cost in the data. Finally, we consider a minimax version of the inverse spanning tree problem and show that it can be solved in O(n2) time.
Refinement of Hölder inequality and application to Ostrowski inequality
Authors: Xiaojing Yang
Venue: Applied Mathematics and Computation (2003)

In this paper, refinement of Hölder integral inequality is established and a necessary and sufficient condition for equality is obtained. As an application, we get an improved Ostrowski integral inequality.
A Comparison of Formulations for the Single-Airport Ground-Holding Problem with Banking Constraints
Authors: Robert Hoffman, Michael O. Ball
Venue: Operations Research (2000)

Both the single-airport ground-holding problem (GH) and the multi-airport ground-holding problem can be extended by the addition of banking constraints to accommodate the hubbing operations of major airlines. These constraints enforce the desire of airlines to land certain groups of flights, called banks, within fixed time windows, thus preventing the propagation of delays throughout their entire operation. GH can be formulated as a transportation problem and readily solved. But in the presence of banking constraints, GH becomes a difficult integer programming problem. In this paper, we construct five different models of the single-airport ground-holding problem with banking constraints (GHB). The models are evaluated both computationally and analytically. For two of the models, we show that the banking constraints induce facets of the convex hull of the set of integer solutions. In addition, we explore a linear transformation of variables and a branching technique.
Empirical evaluation of a fuzzy logic-based software quality prediction model
Authors: Sun Sup So, Sung Deok Cha, Yong Rae Kwon
Venue: Fuzzy Sets and Systems (2002)

Software inspection, due to its repeated success on industrial applications, has now become an industry standard practice. Recently, researchers began analyzing inspection data to obtain insights on how software processes can be improved. For example, project managers need to identify potentially error-prone software components so that limited project resource may be optimally allocated. This paper proposes an automated and fuzzy logic-based approach to satisfy such a need. Fuzzy logic offers significant advantages over other approaches due to its ability to naturally represent qualitative aspect of inspection data and apply flexible inference rules. In order to empirically evaluate the effectiveness of our approach, we have analyzed published inspection data and the ones collected from two separate inspection experiments which we had conducted. χ2 analysis is applied to statistically demonstrate validity of the proposed quality prediction model.
The Air Traffic Flow Management Problem with Enroute Capacities
Authors: Dimitris Bertsimas, Sarah Stock Patterson
Venue: Operations Research (1998)

Massachusetts Institute of Technology, Cambridge, Massachusetts (Received August 1994; revision received October 1995; accepted May 1996) Throughout the United States and Europe, demand for airport use has been increasing rapidly, while airport capacity has been stagnating. Over the last ten years the number of passengers has increased by more than 50 percent and is expected to continue increasing at this rate. Acute congestion in many major airports has been the unfortunate result. For U.S. airlines, the expected yearly cost of the resulting delays is currently estimated at $3 billion. In order to put this number in perspective, the total reported losses of all U.S. airlines amounted to approximately $2 billion in 1991 and $2.5 billion in 1990. Furthermore, every day 700 to 1100 flights are delayed by 15 minutes or more. European airlines are in a similar plight. Optimally controlling the flow of aircraft either by adjusting their release times into the network (ground-holding) or their speed once they are airborne is a cost effective method to reduce the impact of congestion on the air traffic system. This paper makes the following contributions: (a) we build a model that takes into account the capacities of the National Airspace System (NAS) as well as the capacities at the airports, and we show that the resulting formulation is rather strong as some of the proposed inequalities are facet defining for the convex hull of solutions; (b) we address the complexity of the problem; (c) we extend that model to account for several variations of the basic problem, most notably, how to reroute flights and how to handle banks in the hub and spoke system; (d) we show that by relaxing some of our constraints we obtain a previously addressed problem and that the LP relaxation bound of our formulation is at least as strong when compared to all others proposed in the literature for this problem; and (e) we solve large scale, realistic size problems with several thousand flights.
A survey and performance analysis of software platforms for interactive cluster-based multi-screen rendering
Authors: Oliver G. Staadt, Justin Walker, Christof Nuber, Bernd Hamann
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

We present a survey of different software architectures designed to render on a tiled display. We provide an in-depth analysis of three selected systems, including their implementation of data distribution, sort-first rendering, and overall usability. We use various test cases to analyze the performance of these three systems.
A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems
Authors: Eugene Khmelnitsky
Venue: Mathematics of Operations Research (2002)

The paper addresses a class of continuous-time, optimal control problems whose solutions are typically characterized by both bang-bang and "singular" control regimes. Analytical study and numerical computation of such solutions are very difficult and far from complete when only techniques from control theory are used. This paper solves optimal control problems by reducing them to the combinatorial search for the shortest path in a specially constructed graph. Since the nodes of the graph are weighted in a sequence-dependent manner, we extend the classical, shortest-path algorithm to our case. The proposed solution method is currently limited to single-state problems with multiple control functions. A production planning problem and a train operation problem are optimally solved to illustrate the method.
Accelerated force computation for physics-based information visualization
Authors: Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus Gross
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

Visualization of similarity is an emerging technique for analyzing relation-based data sets. A common way of computing the respective layouts in an information space is to employ a physics-based mass-spring system. Force computation, however, is costly and of order N2. In this paper, we propose a new acceleration method to adopt a well-known optimized force-computation algorithm which drastically reduces the computation time to the order of N log N. The basic idea is to derive a two-pass, "prediction and correction" procedure including a customized potential function. We have applied this method to two different applications: web access and sales analysis. Both demonstrate the efficiency and versatility of the presented method.
Drowsy instruction caches: leakage power reduction using dynamic voltage scaling and cache sub-bank prediction
Authors: Nam Sung Kim, Krisztián Flautner, David Blaauw, Trevor Mudge
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

On-chip caches represent a sizeable fraction of the total power consumption of microprocessors. Although large caches can significantly improve performance, they have the potential to increase power consumption. As feature sizes shrink, the dominant component of this power loss will be leakage. In our previous work we have shown how the drowsy circuit---a simple, state-preserving, low-leakage circuit that relies on voltage scaling for leakage reduction---can be used to reduce the total energy consumption of data caches by more than 50%. In this paper, we extend the architectural control mechanism of-the drowsy cache to reduce leakage power consumption of instruction caches without significant impact on execution time. Our results show that data and instruction caches require different control strategies for efficient execution. To enable drowsy instruction caches, we propose a technique called cache subbank prediction which is used to selectively wake up only the necessary parts of the instruction cache, while allowing most of the cache to stay in a low leakage drowsy mode. This prediction technique reduces the negative performance impact by 76% compared to the no-prediction policy. Our technique works well even with small predictor sizes and enables an 86% reduction of leakage energy in a 64K byte instruction cache.