ppxscal/embedding_network huggingface dataset:
Railroad Blocking: A Network Design Application
Authors: Cynthia Barnhart, Hong Jin, Pamela H. Vance
Venue: Operations Research (2000)

In this study, we formulate the railroad blocking problems as a network design problem with maximum degree and flow constraints on the nodes and propose a heuristic Lagrangian relaxation approach to solve the problem. The newapproach decomposes the complicated mixed integer programming problem into two simple subproblems so that the storage requirement and computational effort are greatly reduced. A set of inequalities are added to one subproblem to tighten the lower bounds and facilitate generating feasible solutions. Subgradient optimization is used to solve the Lagrangian dual. An advanced dual feasible solution is generated to speed up the convergence of the subgradient method. The model is tested on blocking problems from a major railroad, and the results show that the blocking plans generated have the potential to reduce the railroad's operating costs by millions of dollars annually.
Topological interpretation of fuzzy sets and intervals
Authors: Rudolf F. Albrecht
Venue: Fuzzy Sets and Systems (2003)

Fuzzy set theory and interval mathematics were independently invented and developed in the mid 1960s as tools for a quantitative analysis of approximations to mathematically exact values, which may not be observable, representable or computable. We show that both approaches are covered by a general topological theory developed almost two decades earlier. We start with the concepts of naive fuzzy set and interval theory and discuss the underlying common features. Then we represent the theory of topological filter bases, their homomorphisms and the rounding of filter bases. Fuzzy set theory and interval mathematics can be described in terms of this theory. In addition, some of the concepts of classical fuzzy and interval theory are extended.
Proceedings of the 2002 workshop on Memory system performance
Venue: Memory System Performance (2002)

On the 16th of June the ACM SIGPLAN Workshop on Memory System Performance (MSP'02) was held in Berlin, Germany. MSP'02 is a new workshop that focuses on software techniques to address the memory wall.Given current technology trends that forecast a rapidly growing processor-memory speed imbalance, optimizing a program's memory system performance has become increasingly important. Much research has focused on improving the cache performance of scientific programs that use arrays as their primary data structure. Unfortunately, these techniques are not a complete solution for general purpose programs, which manipulate more complex and dynamic data structures. While recent research has begun to address this problem, much work remains to be done.The focus of this workshop is on all aspects of improving the memory system performance of general-purpose programs. This includes novel techniques for profiling memory system behavior, new analyses (both static and dynamic) for identifying and understanding memory-related performance problems, and finally optimizations for improving memory system performance. Software, hardware as well as hybrid approaches are encouraged. In addition, studies of application that describe problems and experience with memory performance related issues in specific application domains are of interest. The objective of the workshop is to bring together programming language researchers in the areas of program analysis and compiler optimization, computer architects, operating system researchers, and application programmers. We hope that this will be the first in a series of workshops that will encourage collaboration across these fields while at the same time expand program optimization research towards an area of great practical importance.MSP'02 features an invited talk and presentations of ten refereed papers. The papers were selected out of fifteen submissions. Fifteen PC members and additional external reviewers prepared multiple written reviews for each submission. The recommendations of the referees determined an initial set of papers selected for acceptance. The members of the program committee were then given the option to resolve differences in opinion for the papers they refereed based on the written reviews during the program committee tele-conferenee meeting. After the resolution process, the 10 papers included in the workshop proceedings were selected for presentation and publication.
Schematic-based lumped parameterized behavioral modeling for suspended MEMS
Authors: Qi Jing, Tamal Mukherjee, Gary K. Fedder
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Schematic-based lumped parameterized behavioral modeling and simulation methodologies have become available since the emergence of analog HDLs. They greatly ease iterative hierarchical multi-domain simulation, which is critical to the design of MEMS. NODAS is one of such tools, with models written in VerilogA and simulation performed within the Cadence framework.This paper focuses on several key modeling issues in NODAS, including schematic representation, element communication, linear, nonlinear and multi-domain modeling, and extensibility to new physical effects, processes and physical domains. A nonlinear beam model and an electrostatic gap model are discussed as examples. Simulation comparison to finite element analyses and experimental data verifies the accuracy of the models and validates the simulation methodology.
Convergence analysis for quadrilateral rotated Q1 elements
Authors: Pingbing Ming, Zhong-Ci Shi
Venue: Scientific computing and applications (2001)

It is proved that the rotated Q1 nonconforming element is convergent on arbitrary quadrilateral meshes for general second order elliptic problems, provided a condition on the mesh subdivision is fulfilled. The necessity of the condition is also discussed.
Interoperable Web services for computational portals
Authors: Marlon Pierce, Geoffrey Fox, Choonhan Youn, Steve Mock, Kurt Mueller, Ozgur Balsoy
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Computational web portals are designed to simplify access to diverse sets of high performance computing resources, typically through an interface to computational Grid tools. An important shortcoming of these portals is their lack of interoperable and reusable services. This paper presents an overview of research efforts undertaken by our group to build interoperating portal services around a Web Services model. We present a comprehensive view of an interoperable portal architecture, beginning with core portal services that can be used to build Application Web Services, which in turn may be aggregated and managed through portlet containers.
Index nesting &ndash; an efficient approach to indexing in object-oriented databases
Authors: Beng Chin Ooi, Jiawei Han, Hongjun Lu, Kian Lee Tan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

In object-oriented database systems where the concept of the superclass-subclass is supported, an instance of a subclass is also an instance of its superclass. Consequently, the access scope of a query against a class in general includes the access scope of all its subclasses, unless specified otherwise. An index to support superclass-subclass relationship efficiently must provide efficient associative retrievals of objects from a single class or from several classes in a class hierarchy. This paper presents an efficient index called the hierarchical tree (the H-tree). For each class, an H-tree is maintained, allowing efficient search on a single class. These H-trees are appropriately linked to capture the superclass-subclass relationships, thus allowing efficient retrievals of instances from a class hierarchy. Both experimental and analytical results indicate that the H-tree is an efficient indexing structure.
Some subsets of the Hermitian curve
Authors: Giorgio Donati, Nicola Durante
Venue: European Journal of Combinatorics (2003)

Three types of subsets of PG(2, q2) of type (0, 1, 2, q + 1) are defined, namely CF-sets, K-sets and H-sets. These subsets may also be obtained as the intersection of the Hermitian curve H with Baer subpencils of lines with vertex not on H. It is shown that under the Bruck-Bose representation these subsets correspond to three-dimensional elliptic quadrics, quadratic cones and hyperbolic quadrics, respectively contained in suitable hyperplanes of PG(4, q).
HCCM: a novel cache consistence mechanism
Authors: Luo Guangchun, Zhang Jun, Lu Xianliang, Lu Jun
Venue: ACM SIGOPS Operating Systems Review (2003)

This paper presents a novel Hierarchical Cache Consistence Mechanism -- HCMM. HCMM is specially designed for the large scale distributed file system in WAN and can well adapt to work in WAN. HCMM uses hierarchical method to manage the consistence of caches, and can minimize the overhead of network communication and cache management. This paper also sets up a theory model to analyze the performance of HCMM. The results of theoretical analysis prove that the performance of HCMM is better than conventional cache consistence mechanism.
Technology a bridge to experimentation with open problems
Authors: Patrick S. Mitchell
Venue: Journal of Computing Sciences in Colleges (2002)

There are two current trends on-going in the teaching of mathematics, incorporating technology and involving undergraduates in research. In this paper we will combine the two trends. Most of the examples given will be from the field of number theory, however the methods described could easily be adapted to other branches of mathematics.
Implementing Industrial Ecology: The AT&T Matrix System
Authors: Braden R. Allenby
Venue: Interfaces (2000)

Industrial ecology, the multidisciplinary study of coupled economic and environmental systems, provides the intellectual basis for understanding and implementing the vision of sustainable development in the firm. Using this approach, AT&amp;T developed a matrix system which, when applied to the firm's products and operations, laid the groundwork for systemic improvements in the firm's environmental performance.
Speech Coding Algorithms: Foundation and Evolution of Standardized Coders, 1 edition
Authors: Wai C. Chu
Venue:  (2003)

:* Speech coding is a highly mature branch of signal processing deployed in products such as cellular phones, communication devices, and more recently, voice over internet protocol * This book collects many of the techniques used in speech coding and presents them in an accessible fashion * Emphasizes the foundation and evolution of standardized speech coders, covering standards from 1984 to the present * The theory behind the applications is thoroughly analyzed and proved
Some new results concerning the Smarandache Ceil function
Authors: Sabin Tabirca, Tatiana Tabirca
Venue: Smarandache notions (2002)

In this article we present two new results concerning the Smarandache Ceil function. The first result proposes an equation for the number of fixed-point number of the Smarandache ceil function. Based on this result we prove that the average of the Smarandache ceil function is Θ(n).
Growing squares: animated visualization of causal relations
Authors: Niklas Elmqvist, Philippas Tsigas
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

We present a novel information visualization technique for the graphical representation of causal relations, that is based on the metaphor of color pools spreading over time on a piece of paper. Messages between processes in the system affect the colors of their respective pool, making it possible to quickly see the influences each process has received. This technique, called Growing Squares, has been evaluated in a comparative user study and shown to be significantly faster and more efficient for sparse data sets than the traditional Hasse diagram visualization. Growing Squares were also more efficient for large data sets, but not significantly so. Test subjects clearly favored Growing Squares over old methods, naming the new technique easier, more efficient, and much more enjoyable to use.
Existence and comparison of maximal and minimal solutions for pseudomonotone elliptic problems in L1
Authors: Juan Casado-Díaz, Alessio Porretta
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

We consider the nonhomogeneous Dirichlet problem {-div(a(x,u, ∇u)) = f in Ω, u = w on δΩ, where -div(a(x, u, ∇u)) is a pseudomonotone operator of Leray-Lions type defined in W1,p0(Ω), w ∈ W1,p(Ω) and f is in L1(Ω). Under suitable assumptions of locally Lipschitz, or locally Hölder, continuity of a(x,s, ξ) with respect to s, we prove the existence of maximal and minimal renormalized solutions and comparison results with respect to data f and w. The results include examples of nonmonotone operators of p-laplace type (for any p > 1), for which it is known that uniqueness of solutions does not hold.
Using decision support systems to help policy makers cope with urban transport problems
Authors: Francesco Mazzeo Rinaldi, Donald Bain
Venue: Decision making support systems: achievements, trends and challenges for (2002)

More than 70% of Europe's population lives in urban areas. Transport pollution contributes significantly to severe health problems in many European cities. The impacts of air pollutants are particularly severe in busy city centres, where congestion creates long queues of stationary traffic pumping fumes onto streets crowded with pedestrians. Although improvements in vehicle technologies have led to steady reductions in pollutant emissions, the decrease has been slower than expected due to the ever-increasing transport demand.Getting urban transport "right" is a challenging task for decision-makers given the number of policy areas affected, the large range of stakeholders and the high political sensitivity of almost any option adopted (including "do nothing"). Ultimately any decision must rest with the skills and informed judgement of the decision-maker or decision college. It remains difficult.The work presented shows the development of a DSS called Navigate Utopia. It is a web-style tool based on Multicriteria Analysis which has been developed to allow policy-makers to explore and evaluate the numerous new transport technology options already available or on the point of entering the market.Navigate Utopia draws on practical experience derived from previous case studies in Europe, giving guidance on how these can best be applied to specific urban situations and providing tools to understand what the effects might be. It considers also the wide range of new and improved propulsion systems currently coming on stream and draws together findings from a wide range of disciplines to address the complex issue of how to ensure successful market entry of new transport technologies.
A banked-promotion translation lookaside buffer system
Authors: Jung-Hoon Lee, Seh-Woong Jeong, Shin-Dug Kim, Charles Weems
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2002)

We present a simple but high performance translation lookaside buffer (TLB) system with low power consumption for use in embedded systems. Our TLB structure supports two page sizes dynamically and selectively to achieve high performance with low hardware cost. To minimize power consumption, a banked-TLB is constructed by dividing one fully associative (FA) TLB space into two separate FA TLBs. These two structures are integrated to form a banked-promotion (BP) TLB. Promotion overcomes the unbalanced utilization of a banked-TLB by moving adjacent entries out of the primary banks into a separate super-page TLB. Simulation results show that the Energy* Delay product can be reduced by about 99.8%, 19.2%, 24.2%, and 24.4% compared with a FA TLB, a micro-TLB, a banked-TLB, and a victim-TLB respectively. Therefore, the BP TLB offers high performance with low power consumption and low hardware cost.
Energy efficient address assignment through minimized memory row switching
Authors: Sambuddhi Hettiaratchi, Peter Y. K. Cheung, Thomas J. W. Clarke
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Data transfer intensive applications consume a significant amount of energy in memory access. The selection of a memory location from a memory array involves driving row and column select lines. A signal transition on a row select line often consumes significantly more energy than a transition on a column select line. In order to exploit this difference in energy consumption of row and column select lines, we propose a novel address assignment methodology that aims to minimize high energy row transitions by assigning spatially and temporally local data items to the same row. The problem of energy efficient address assignment has been formulated as a multi-way graph partitioning problem and solved with a heuristic. Our experiments demonstrate that our methodology achieves row transition counts very close to the optimum and that the methodology can, for some examples, reduce row transition count by 40--70% over row major mapping. Moreover, we also demonstrate that our methodology is capable of handling access sequences with over 15 million accesses in moderate time.
Information Privacy: Corporate Management and National Regulation
Authors: Sandra J. Milberg, H. Jeff Smith, Sandra J. Burke
Venue: Organization Science (2000)

The 1990s have seen a resurgence of interest in information privacy. Public opinion surveys show that many citizens are becoming greatly concerned about threats to their information privacy, with levels of such concern reaching all-time highs. Perhaps as a response to the growing concerns of citizens, the media are devoting more attention to privacy issues, and governmental regulation of the corporate privacy environment is increasing in many countries. Almost all developed countries have grappled with the trade-offs between open access to information--which enables economic efficiency--and an individual's right to privacy. Consistent with these trade-offs, many recent incidents suggest that regulatory approaches to information privacy, corporate management of personal data, and consumer reactions are becoming tightly interwoven around the world. To provide some insights into these relationships, we develop a conceptual model and test it with a cross-cultural sample from 19 different countries.In general, we find that a country's regulatory approach to the corporate management of information privacy is affected by its cultural values and by individuals' information privacy concerns. In addition, as governments become more involved in the corporate management of information privacy, internal management of such issues seems to tighten. This result supports previous observations that most firms take a primarily reactive approach to managing privacy by waiting for an external threat before crafting cohesive policies that confront their information practices. Moreover, when corporations are not perceived to adequately manage information privacy issues, and/or when privacy concerns rise, individuals are more inclined to prefer government intervention and be distrustful of firm self-regulation. As such, citizens may look to lawmakers to enact stricter regulation to reduce their privacy concerns. These findings and several international trends suggest that the self-regulatory model of privacy governance may not be sustainable over the long term.Findings from this research constitute an important contribution to the emerging theoretical base of information privacy research and should be particularly enlightening to those managing information privacy issues. Several directions for future research are also discussed.
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
Authors: James A. Sethian, Alexander Vladimirsky
Venue: SIAM Journal on Numerical Analysis (2003)

We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton--Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as "Ordered Upwind Methods" (OUMs), use partial information about the characteristic directions to decouple these nonlinear systems, greatly reducing the computational labor. Our techniques are considered in the context of control-theoretic and front-propagation problems.We begin by discussing existing OUMs, focusing on those designed for isotropic problems. We then introduce a new class of OUMs which decouple systems for general (anisotropic) problems. We prove convergence of one such scheme to the viscosity solution of the corresponding Hamilton--Jacobi PDE. Next, we introduce a set of finite-differences methods based on an analysis of the role played by anisotropy in the context of front propagation and optimal trajectory problems.The performance of the methods is analyzed, and computational experiments are performed using test problems from computational geometry and seismology.
Magnetic resonance spectrometer controller and data postprocessing software
Authors: R. Pérez De Alejo, E. Álvarez, I. Rodríguez, E. M. Rodríguez, P. Villa, D. Piña, R. Shelton, J. Ruiz-Cabello, M. Cortijo
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

Freeware called MRS_Controller and written for Windows is described. It may be used to control magnetic resonance spectrometers or postprocess data, and is composed of four modules that may carry out field stabilization, graphical pulse sequence edition, experiment planning, and spectral data postprocessing. The control of a commercial Tesla BS587A spectrometer was performed with this software through an independent dynamic link library. It may easily be rewritten to allow the control of other types of spectrometers. This software can also be used for spectral data postprocessing and for planning or preparing experiments offline because hardware access is disabled when an instrument is not detected at startup.
A utility-based power-control scheme in wireless cellular systems
Authors: Mingbo Xiao, Ness B. Shroff, Edwin K. P. Chong
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Distributed power-control algorithms for systems with hard signal-to-interference ratio (SIR) constraints may diverge when infeasibility arises. In this paper, we present a power-control framework called utility-based power control (UBPC) by reformulating the problem using a softened SIR requirement (utility) and adding a penalty on power consumption (cost). Under this framework, the goal is to maximize the net utility, defined as utility minus cost. Although UBPC is still noncooperative and distributed in nature, some degree of cooperation emerges: a user will automatically decrease its target SIR (and may even turn off transmission) when it senses that traffic congestion is building up. This framework enables us to improve system convergence and to satisfy heterogeneous service requirements (such as delay and bit error rate) for integrated networks with both voice users and data users. Fairness, adaptiveness, and a high degree of flexibility can be achieved by properly tuning parameters in UBPC.