ppxscal/embedding_network huggingface dataset:
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
Authors: Hanif D. Sherali, J. Cole Smith, Youngho Lee
Venue: INFORMS Journal on Computing (2000)

In this paper, we consider a network design problem arising in the context of deploying synchronous optical networks (SONET) using a unidirectional path switched ring architecture, a standard of transmission using optical fiber technology. Given several rings of this type, the problem is to find an assignment of nodes to possibly multiple rings, and to determine what portion of demand traffic between node pairs spanned by each ring should be allocated to that ring. The constraints require that the demand traffic between each node pair should be satisfiable given the ring capacities, and that no more than a specified maximum number of nodes should be assigned to each ring. The objective function is to minimize the total number of node-to-ring assignments, and hence, the capital investment in add-drop multiplexer equipments. We formulate the problem as a mixed-integer programming model, and propose several alternative modeling techniques designed to improve the mathematical representation of this problem. We then develop various classes of valid inequalities for the problem along with suitable separation procedures for tightening the representation of the model, and accordingly, prescribe an algorithmic approach that coordinates tailored routines with a commercial solver (CPLEX). We also propose a heuristic procedure which enhances the solvability of the problem and provides bounds within 5--13% of the optimal solution. Promising computational results are presented that exhibit the viability of the overall approach and that lend insights into various modeling and algorithmic constructs.
High capacity and automatic functional extraction tool for industrial VLSI circuit designs
Authors: Sasha Novakovsky, Shy Shyman, Ziyad Hanna
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV-Extract and is part of a comprehensive Formal Equivalence Verification (FEV) system developed at Intel to verify modern microprocessor designs. FEV-Extract employs a powerful hierarchical analysis procedure, and advanced and generic algorithms for automatic recognition of logical primitives, to cope with variety of circuit design styles and their complexity. Logic equations are then extracted to generate a behavioral RTL model described in industrial standard HDL languages, to be used in the formal equivalence verification, logic simulation, synthesis and testability flows.
Out-of-core sort-first parallel rendering for cluster-based tiled displays
Authors: Wagner T. Corrêa, James T. Klosowski, Cláudio T. Silva
Venue: Parallel Computing (2003)

We present a sort-first parallel system for out-of-core rendering of large models on cluster-based tiled displays. The system renders high-resolution images of large models at interactive frame rates using off-the-shelf PCs with small memory. Given a model, we use an out-of-core preprocessing algorithm to build an on-disk hierarchical representation for the model. At run time, each PC renders the image for a display tile, using an out-of-core rendering approach that employs multiple threads to overlap rendering, visibility computation, and disk operations. The system can operate in approximate mode for real-time rendering, or in conservative mode for rendering with guaranteed accuracy. Running our system in approximate mode on a cluster of 16 PCs each with 512 MB of main memory, we are able to render 12-megapixel images of a 13-million-triangle model with 99.3% of accuracy at 10.8 frames per second. Rendering such a large model at high resolutions and interactive frame rates would typically require expensive high-end graphics hardware. Our results show that a cluster of inexpensive PCs is an attractive alternative to those high-end systems.
Hypothesis finding based on upward refinement of residue hypotheses
Authors: Akihiro Yamamoto
Venue: Theoretical Computer Science (2003)

For given logical formulae B and E such that B n E, hypothesis finding means the generation of a formula H such that B ∧ H ⊧ E. Hypothesis finding constitutes a basic technique for fields of inference, like inductive inference and knowledge discovery. In order to put various hypothesis finding methods proposed previously on one general ground, we use upward refinement and residue hypotheses. We show that their combination is a complete method for solving any hypothesis finding problem in clausal logic. We extend the relative subsumption relation, and show that some hypothesis finding methods previously presented can be regarded as finding hypotheses which subsume examples relative to a given background theory. Noting that the weakening rule may make hypothesis finding difficult to solve, we propose restricting this rule either to the inverse of resolution or to that of subsumption. We also note that this work is related to relevant logic.
A Memory-Based Reasoning Approach for Assessing Software Quality
Authors: Raymond A. Paul, Venkata U. B. Challagulla, Farokh B. Bastani, I-Ling Yen
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Several methods have been explored for assuring the reliability of Mission Critical Systems (MCS), but no single method has proved to be completely effective. This paper presents an approach for quantifying the confidence in the probability that a program is free of specific classes of defects. The method uses memory-based reasoning techniques to admit a variety of data from a variety of projects for the purpose of assessing new systems. Once a sufficient amount of information has been collected, the statistical results can be applied to programs that are not in the analysis set to predict their reliabilities and guide the testing process. The approach is applied to the analysis of Y2K defects based on defect data generated using fault-injection simulation.
On some nonlinear ordinary differential equations with advanced arguments
Authors: Antoni Augustynowicz, Henryk Leszczyński, Wolfgang Walter
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

The paper deals with ODEs with an advanced argument, in particular, with such equations as y'(t) = (y(βt))1/β, the simplest example is y'(t) = √y(2t). The corresponding initial-value problem with y(0) = y0 > 0 has three types of solutions: (a) a unique analytic solution, (b) solutions of subexponential growth, and (c) for every λ > 0 a solution that behaves like eλt as t → ∞. In the case y0 = 0 there is (besides y ≡ 0) a positive solution, for some β > 1 it can be analytic, but the above example β = 2 admits infinitely many analytic solutions.
Responsibility Tokens in Supply Chain Management
Authors: Evan L. Porteus
Venue: Manufacturing Service Operations Management (2000)

The decentralized supply chain management scheme of Lee and Whang (1999) can be viewed as operationalizing the decentralized management scheme implicit in Clark and Scarf (1960). This paper proposes the use of what are called responsibility tokens (RTs) to further facilitate that operationalization. The proposal assumes that a management information system, presumably electronic, is established to monitor inventories and shipment quantities, and to carry out transfer payments between players. As in Lee and Whang(1999), the incentives of the system are aligned, so if each player is brilliantly self-serving, the system optimal solution will result. While the system administrator need not know how the system should be managed, the most upstream player must know how to manage the system optimally for the system optimal solution to be achieved. RTs endow the system with an attractive self-correcting property: An example illustrates that upstream players are given a mechanism and the incentive to correct for downstream overordering. The downstream players who over-order are penalized, but system performance is not degraded much. Extensions and further research are also discussed.
Odor-based navigational strategies for mobile agents
Authors: Christodoulos Lytridis, Gurvinder S. Virk, Yann Rebour, Endre E. Kadar
Venue: Adaptive Behavior (2001)

Although most species are sensitive to various chemicals, and olfactory skills such as search strategies for finding nutritious substance are seemingly simple, these basic skills are still not fully understood. Traditionally, chemotaxis has been considered as the fundamental chemosensory navigational mechanism for most species. Previous studies have demonstrated, however, that biased random walk is the more fundamental navigational strategy in various types of diffusion fields. Biased random walk is a robust and slow search process, but it has been shown that its efficiency can be enhanced if it is combined with chemotaxis. The present article summarizes previous findings of the authors in olfactory navigation and extends the work to searching in dynamic flow fields, including turbulence. In addition, a cooperative, multi-agent search method has been investigated and shown to be successful in enhancing search efficiency. The significance of these findings is discussed in the context of future plans to implement these strategies in experimental mobile robots.
Arithmetic on superelliptic curves
Authors: S. D. Galbraith, S. M. Paulus, N. P. Smart
Venue: Mathematics of Computation (2002)

This paper is concerned with algorithms for computing in the divisor class group of a nonsingular plane curve of the form yn = c(x) which has only one point at infinity. Divisors are represented as ideals, and an ideal reduction algorithm based on lattice reduction is given. We obtain a unique representative for each divisor class and the algorithms for addition and reduction of divisors run in polynomial time. An algorithm is also given for solving the discrete logarithm problem when the curve is defined over a finite field.
Overlap matching
Authors: Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
Venue: Information and Computation (2003)

We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are singled out. A "match" is a text location where a specified relation between the text and pattern areas is satisfied. In particular we define the structural matching problem of overlap (parity) matching. We seek the text locations where all overlaps of the given pattern and text intervals have even length. We show that this problem can be solved in time O(n log m), where the text length is n and the pattern length is m. As an application of overlap matching, we show how to reduce the string matching with swaps problem to the overlap matching problem. The string matching with swaps problem is the problem of string matching in the presence of local swaps. The best deterministic upper bound known for this problem was O(nm1/3 log m log σ) for a general alphabet Σ, where σ = min(m, |Σ|). Our reduction provides a solution to the pattern matching with swaps problem in time O(n log m log σ).
There are infinitely many Smarandache derivations, integrations and lucky numbers
Authors: Pantelimon Stănică, Gabriela Stănică
Venue: Smarandache notions (2002)

A number is said to be a Smarandache Lucky Number (see [3, 1, 2]) if an incorrect calculation leads to a correct result. In general, a Smarandache Lucky Method or Algorithm is said to be any incorrect method or algorithm, which leads to a correct result. In this note we find an infinite sequence of distinct lucky fractions. We also define a lucky product differentiation and a lucky product integration. For a given function f, we find all other functions g, which renders the product lucky for differentiation/integration.
The effects of menu design on information-seeking performance and user's attitude on the world wide web
Authors: Byeong-Min Yu, Seak-Zoon Roh
Venue: Journal of the American Society for Information Science and Technology (2002)

As the Web becomes more popular, the interest in effective navigation is increasing. Menu design is becoming a central issue of human computer interface design as the focus of computer applications moves from the computer as a machine to the human as a user. The purpose of this study was to investigate the effect of three different Web menu designs (a simple selection menu, a global and local navigation menu, and a pull-down menu) on users' information-seeking performance and attitudes. Three Cyber-shopping mall Web sites were developed for the experiment. These Web sites had the same content and a constant information structure, but each had a different menu design. The results showed different effect of menu design on both searching performance and browsing performance. More specifically, participants' searching performance was superior in the pull-down menu condition compared to the global and local navigation menu and the simple selection menu conditions. Browsing task performance was the fastest with the global and local navigation menu. However, there were no significant differences among three menu designs in terms of users' perception on appeal of the Web site and disorientation.
A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data
Authors: Qunfeng Dong, Zhijun Wu
Venue: Journal of Global Optimization (2003)

Nuclear magnetic resonance (NMR) structure modeling usually produces a sparse set of inter-atomic distances in protein. In order to calculate the three-dimensional structure of protein, current approaches need to estimate all other ``missing'' distances to build a full set of distances. However, the estimation step is costly and prone to introducing errors. In this report, we describe a geometric build-up algorithm for solving protein structure by using only a sparse set of inter-atomic distances. Such a sparse set of distances can be obtained by combining NMR data with our knowledge on certain bond lengths and bond angles. It can also include confident estimations on some ``missing'' distances. Our algorithm utilizes a simple geometric relationship between coordinates and distances. The coordinates for each atom are calculated by using the coordinates of previously determined atoms and their distances. We have implemented the algorithm and tested it on several proteins. Our results showed that our algorithm successfully determined the protein structures with sparse sets of distances. Therefore, our algorithm reduces the need of estimating the ``missing'' distances and promises a more efficient approach to NMR structure modeling.
Exercises in coalgebraic specification
Authors: Bart Jacobs
Venue: Algebraic and coalgebraic methods in the mathematics of program construction (2002)

An introduction to coalgebraic specification is presented via examples. A coalgebralc specification describes a collection of coalgebras satisfying certain assertions. It is thus an axiomatic description of a particular class of mathematical structures. Such specifications are especially suitable for state-based dynamical systems in general, and for classes in object-oriented programming languages in particular. This chapter will gradually introduce the notions of bisimilarity, invariance, component classes, temporal logic and refinement in a coalgebraic setting. Besides the running example of the coalgebraic specification of (possibly infinite) binary trees, a specification of Peterson's mutual exclusion algorithm is elaborated in detail.
The diffusion of anticipatory standards with particular reference to the ISO/IEC information resource dictionary system framework standard
Authors: Bernadette M. Byrne, Paul A. Golder
Venue: Computer Standards Interfaces (2002)

In the late 1980s, traditional standards development organisations (SDOs) were moving toward creating anticipatory standards as a way of coping with the fast growth in new technology in the computing industry. The development of anticipatory standards (standards developed ahead of the technology) was seen as a possible way for the formal standards bodies to keep abreast of these rapid changes. By creating standards ahead of the technology, the standards would act as "change agents" and guide the market. Anticipatory standards were seen as one way of addressing the problem of arriving at suboptimal de facto standards. If the industry can be guided before the technology develops, this will encourage the use of optimal products. This paper considers the diffusion pattern of the ISO/IEC Information Resource Dictionary System (IRDS) Framework standard that fits into the category of an anticipatory standard. Comparisons are made between the diffusion patterns of the ISO/IEC IRDS standard and the ISO/IEC Open Standards Interconnection (OSI) Reference Model as they were both anticipatory in nature, both framework/reference standards, both originated at approximately the same time and were both developed in traditional standards development organisations.
Embedded Organizational Events: the Units Ofprocess in Organization Science
Authors: Marjorie Sarbaugh-Thompson, Martha Feldman, Mark F. Peterson
Venue: Organization Science (1998)

Analyses of the events that occur in the context of organization process are rapidly advancing. Scholars holding otherwise disparate views share the sense that social actors, including organizations, attend to, interpret, and act upon events. Analyses of events are converging from two theoretical and methodological starting points. Analyses that emphasize human subjectivity and contextual specificity are seeking increased cross-situational learning. Nomothetic analyses are building on their strength in cross-situational learning by striving to represent the way subjects themselves construct events in relation to context. Rather than continuing to analyze classic organizational and environmental dimensions like formalization, general uncertainty, munificence, and stability, scholars are increasingly analyzing the qualities of events and the meanings they are given. They are treating events as elements that social actors abstract from social processes, and social actors as parties who interact to give events meaning. The present paper defines event analyzes its origins and current uses, and indicates how using and going beyond lessons from physics can promote organization studies. These lessons come from the analysis of physical events as particles in relation to waves, fields, and perspectives. The uniquely social element of potential takes us beyond the experience of physical science.
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0 LCPs
Authors: Yun-Bin Zhao, Duan Li
Venue: SIAM Journal on Optimization (2002)

Based on the concept of the regularized central path, a new non--interior-point path-following algorithm is proposed for solving the P0 linear complementarity problem (P0 LCP). The condition ensuring the global convergence of the algorithm for P0 LCPs is weaker than most conditions previously used in the literature. This condition can be satisfied even when the strict feasibility condition, which has often been assumed in most existing non--interior-point algorithms, fails to hold. When the algorithm is applied to P* and monotone LCPs, the global convergence of this method requires no assumption other than the solvability of the problem. The local superlinear convergence of the algorithm can be achieved under a nondegeneracy assumption. The effectiveness of the algorithm is demonstrated by our numerical experiments.
Operations Research Trajectories: The Anglo-American Experience from the 1940s to the 1990s
Authors: Maurice W. Kirby
Venue: Operations Research (2000)

This paper is derived from the author's sponsored history of Operations Research in Britain from its formal inception in the later 1930s. It is inspired by the knowledge that any history of OR in Britain that ignores the interrelationship with OR in the United States would be grossly incomplete. This relates not only to the period of military collaboration in World War II but also to the profound influence on British operations researchers of American-derived techniques and methods. The Anglo-American perspective serves also to highlight major contrasts, as well as striking similarities in the development of OR in both countries. The paper advocates the need for ongoing research into the history of OR as an essential complement to the advancing frontier of knowledge, both in theory and in practice. Virtually all disciplines worthy of university-level study have their chroniclers, and this should apply with no less force to OR in the light of its impressive trajectory of development and early acknowledgment of its utilitarian value in a wide variety of settings in the public and private sectors.
Active control of earthquake excited structures using fuzzy supervisory technique
Authors: Kwan-Soon Park, Hyun-Moo Koh, Seung-Yong Ok
Venue: Advances in Engineering Software (2002)

A fuzzy supervisory technique for the active control of earthquake-excited building structures is studied in this paper. The method has a hierarchical structure, which consists of a supervisor at the higher level and several sub-controllers at the lower level. Each sub-controller is designed to reduce the story-drift of each floor by using an optimal control theory and a fuzzy logic is adopted to obtain a desirable supervisor. A fuzzy supervisor appropriately tunes the predesigned control gains at every moment by estimating the state of a structure through the fuzzy inference mechanism. The improved seismic control performance can be achieved by converting a simply designed static gain into a real-time variable dynamic gain through a fuzzy tuning process. Example designs and numerical simulations of an earthquake-excited three-story building are performed to prove the validity of the proposed control strategy.
Combining multi-visual features for efficient indexing in a large image database
Authors: Anne H. H. Ngu, Quan Z. Sheng, Du Q. Huynh, Ron Lei
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2001)

The optimized distance-based access methods currently available for multidimensional indexing in multimedia databases have been developed based on two major assumptions: a suitable distance function is known a priori and the dimensionality of the image features is low. It is not trivial to define a distance function that best mimics human visual perception regarding image similarity measurements. Reducing high-dimensional features in images using the popular principle component analysis (PCA) might not always be possible due to the non-linear correlations that may be present in the feature vectors. We propose in this paper a fast and robust hybrid method for non-linear dimensions reduction of composite image features for indexing in large image database. This method incorporates both the PCA and non-linear neural network techniques to reduce the dimensions of feature vectors so that an optimized access method can be applied. To incorporate human visual perception into our system, we also conducted experiments that involved a number of subjects classifying images into different classes for neural network training. We demonstrate that not only can our neural network system reduce the dimensions of the feature vectors, but that the reduced dimensional feature vectors can also be mapped to an optimized access method for fast and accurate indexing.