ppxscal/embedding_network huggingface dataset:
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square
Authors: A. Khalfalah, S. Lodha, E. Szemerédi
Venue: Discrete Mathematics (2002)

Erdös and Sárközy proposed the problem of determining the maximal density attainable by a set S of positive integers having the property that no two distinct elements of S sum up to a perfect square. Massias [(Sur les suites dont les sommes des terms 2 á 2 ne sont par des carr)] exhibited such a set consisting of all x ≡ 1 (mod 4) with x ≡ 14, 26, 30 (mod 32). Lagarias et al. [(J. Combin. Theory Ser. A 33 (1982) 167)] showed that for any positive integer n, one cannot find more than 11/32n residue classes (modn) such that the sum of any two is never congruent to a square (modn), thus essentially proving that the Massias' set has the best possible density. They [(J. Combin. Theory Sen A 34 (1983) 123)] also proved that the density of such a set S is never > 0.475 when we allow general sequences. We improve on the lower bound for general sequences, essentially proving that it is not 0.475, but arbitrarily close to 11/32, the same as that for sequences made up of only arithmetic progressions.
High-Order Pattern Discovery from Discrete-Valued Data
Authors: Andrew K. C. Wong, Yang Wang
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

To uncover qualitative and quantitative patterns in a data set is a challenging task for research in the area of machine learning and data analysis. Due to the complexity of real-world data, high-order (polythetic) patterns or event associations, in addition to first-order class-dependent relationships, have to be acquired. Once the patterns of different orders are found, they should be represented in a form appropriate for further analysis and interpretation. In this paper, we propose a novel method to discover qualitative and quantitative patterns (or event associations) inherent in a data set. It uses the adjusted residual analysis in statistics to test the significance of the occurrence of a pattern candidate against its expectation. To avoid exhaustive search of all possible combinations of primary events, techniques of eliminating the impossible pattern candidates are developed. The detected patterns of different orders are then represented in an attributed hypergraph which is lucid for pattern interpretation and analysis. Test results on artificial and real-world data are discussed toward the end of the paper.
A Scalable and Reliable Paradigm for Media on Demand
Authors: Gavin B. Horn, Per Knudsgaard, Soren B. Lassen, Michael Luby, Jens Eilstrup Rasmussen
Venue: Computer (2001)

The challenges for streaming media today include the high data rates and significant bandwidth required for the uninterrupted delivery of high-quality music and video. Building a scalable and reliable system for on-demand and live streaming in this environment has proven difficult.By definition, a media-on-demand system lets clients freely access and play back media without interruption after a given start-up latency. The authors' system keeps the server's outgoing bandwidth independent of the number of clients, and each client behaves independently of other clients.Although most codecs tolerate a certain amount of data loss, a high loss rate can significantly affect playback quality. Even with router assistance to aggregate acknowledgments, for a sufficiently heterogeneous network and a large enough audience, at least one client will lose almost every packet. This requires retransmission, which causes delays and results in massive reception of duplicate packets.The authors' MoD system uses forward error correction codes to recover lost data. FEC uses the same redundant data to allow multiple clients to recover from different packet losses.
3-D Human Modeling and Animation, 2nd edition
Authors: Peter Ratner
Venue:  (2003)

:Ideal for graphic designers, artists, and others, 3-D Human Modeling and Animation builds a bridge from traditional figure drawing, painting, and sculpture to the creation and animation of figures using computer technology. With a step-by-step approach, the book leads readers through the process of modeling human figures, with specific yet flexible techniques that can be applied to many different hardware/software setups. Separate chapters cover different areas of the body, and contain everything readers need to know about proportion, basic design strategies, 3-D construction methods, and other essential information. The final chapters show how to prepare figures for animation and get them up and runningand jumping, walking, turning, and twisting! Complete with illustrations, helpful exercises, and more, 3-D Human Modeling and Animation opens up a whole new world of creative possibilities to explore.
A Generalized Technique for Simulating Software Reliability
Authors: Robert C. Tausworthe, Michael R. Lyu
Venue: IEEE Software (1996)

Although several models have been proposed for assessing software reliability, none has emerged as the most effective predictor. The authors offer a general simulation technique that relaxes or removes many of the usual reliability-modeling assumptions and expands the reliability process to encompass the entire software life cycle.
A Combinatorial Analysis of Subcube Reliability in Hypercubes
Authors: Laxmi N. Bhuyan, Yeimkuan Chang
Venue: IEEE Transactions on Computers (1995)

In this brief contribution, we derive an exact expression for $(n - 1)$-cube reliability in an $n$-cube using a new probability fault model and an existing random fault model. Approximate results are also obtained for $m$-cube reliability for values of $m$ smaller than $n - 1.$ We show that the proposed probability model for computing subcube reliability is equally accurate, but computationally more efficient than the existing random fault model.
MySpiders: Evolve Your Own Intelligent Web Crawlers
Authors: Gautam Pant, Filippo Menczer
Venue: Autonomous Agents and Multi-Agent Systems (2002)

The dynamic nature of the World Wide Web makes it a challenge to find information that is both relevant and recent. Intelligent agents can complement the power of search engines to meet this challenge. We present a Web tool called MySpiders, which implements an evolutionary algorithm managing a population of adaptive crawlers who browse the Web autonomously. Each agent acts as an intelligent client on behalf of the user, driven by a user query and by textual and linkage clues in the crawled pages. Agents autonomously decide which links to follow, which clues to internalize, when to spawn offspring to focus the search near a relevant source, and when to starve. The tool is available to the public as a threaded Java applet. We discuss the development and deployment of such a system.
Authorization and Revocation in Object-Oriented Databases
Authors: Ivo Majetic, Ernst L. Leiss
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Few studies of object-oriented databases deal with their security, a fundamental aspect of systems with complex data structures. Most authorization systems give users who own resources only some basic control over them; here, we provide users with more direct control over their resources by associating with each grant propagation numbers. Propagation numbers govern the grantability and exercisability of the privileges. Of particular interest in our study of authorization in an o-o environment is the combination of inheritance and granting of privileges. Diverse policies are discussed and implemented in a test-bed system.
An Exploration of Instruction Fetch Requirement in Out-of-Order Superscalar Processors
Authors: Pierre Michaud, André Seznec, Stéphan Jourdan
Venue: International Journal of Parallel Programming (2001)

The performance of superscalar processors depends on many parameters with correlated effects. This paper explores the relations between some of these parameters, and more particularly, the requirement in instruction fetch bandwidth. We introduce new enhancements to increase the bandwidth of conventional instruction fetch engines. However, experiments show that the performance does not increase proportionally to the fetch. Once the measured IPC is half the instruction fetch bandwidth, increasing the fetch bandwidth brings very little improvement. In order to better understand this behavior, we develop a model from the empirical observation that the available instruction parallelism grows as the square root of the instruction window size. From the model, we derive that the fetch bandwidth requirement grows as the square root of the distance between mispredicted branches. We also verify experimentally that, to double the IPC, one should both double the fetch bandwidth and decrease the number of mispredicted branches fourfold.
Dynamic-mesh finite element method for Lagrangian computational fluid dynamics
Authors: Ivan Malcevic, Omar Ghattas
Venue: Finite Elements in Analysis and Design (2002)

We present a novel method for simulation of flows with dynamic interfaces based on a Lagrangian flow formulation and dynamic finite element meshes. Dynamic interfaces are naturally resolved through the material flow description, which eliminates the need for complex dynamic structures to track the moving boundaries. However, the resulting dynamic meshes propagate with the flow and quickly become distorted. We resolve the mesh distortions by regenerating the mesh at each time step. The components include a Lagrangian nodal movement, local refinement/coarsening and triangulation. We have created a highly efficient parallel implementation, and successfully applied it to large-scale simulations of flows with numerous cellular bodies. The method easily handles interface-dominated flows and promises highly successful applications to complex flows including the target problem of microstructural blood flow simulation.
Prism: a knowledge based system for semantic integrity specification and enforcement in database systems
Authors: Allan Shepherd, Larry Kerschberg
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

This paper presents a knowledge-based approach to the specification, design, implementation, and evolution of database applications The knowledge base consists of 1) facts regarding database objects that are organized into a hierarchy of models, and 2) rules that specify the behavior of objects within a model and among modelsThe model hierarchy consists of database application data, database schemas, data model definitions, and system-related objects that control the user's interaction with the system The rules governing the behavior of objects are specified as explicit constraints on those objects User goals are transformed into conjectures that the inference engine must prove are satisfiable by interpreting all applicable constraintsThe semantic architecture of the PRISM system is described, together with the syntax and semantics of the constraint language PRISM is implemented in the C programming language and runs under the UNIX ** operating system
Empirically Guided Software Effort Guesstimation
Authors: Philip M. Johnson, Carleton A. Moore, Joseph A. Dane, Robert S. Brewer
Venue: IEEE Software (2000)

Project LEAP at the University of Hawaii is investigating tools and methods to support low-cost, empirically based software developer improvement. A recent case study provides evidence that guesstimates, when informed by low-cost analytical methods, might be the most accurate method.
Interlock Collapsing ALU's
Authors: S. Vassiliadis, J. Phillips, B. Blaner
Venue: IEEE Transactions on Computers (1993)

A device capable of executing interlocked fixed point arithmetic logic unit (ALU) instructions in parallel with other instructions causing the execution interlock is presented. The device incorporates the design of a 3-1 ALU and can execute two's complement, unsigned binary, and binary logical operations. It is shown that status for ALU operations using a 3-1 ALU can be determined in a parallel fashion, resulting in the compliance of the proposed device with predetermined architectural behavior of single instruction execution. The device requires no more logic stages than does a 3-1 binary adder using a carry-save adder (CSA) followed by a carry-lookahead adder (CLA) design. Design considerations using a commonly available CMOS technology are also reported, indicating that the device will not increase the machine cycle of an implementation. It is suggested that the device can maintain full architectural compatibility.
Row and column generation technique for a multistage cutting stock problem
Authors: Eugene J. Zak
Venue: Computers and Operations Research (2002)

The multistage cutting stock problem (CSP) generalizes the one-dimensional CSP when a lengthwise cutting process is distributed over two or more successive stages. At every stage of the cutting process incoming rolls are slit into smaller rolls by width. The problem is to minimize total trim loss occurring at all stages of technological process meeting customer demands for finished rolls. We propose a row and column generation technique for solving the multistage one-dimensional CSP. The technique is a generalization of the column generation method suggested by Gilmore and Gomory for solving a classic CSP. The procedure generates only those intermediate rolls (rows) and cutting patterns (columns) that are needed. An auxiliary problem embedded into the frame of the revised simplex algorithm is a non-linear knapsack problem that can be solved efficiently. Computational results prove the overall method is a valuable addition to the tool set for modeling and solving the multistage CSP.
A Theory of Coteries: Mutual Exclusion in Distributed Systems
Authors: T. Ibaraki, T. Kameda
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A coterie under a ground set U consists of subsets (called quorums) of U such that anypair of quorums intersect with each other. Nondominated (ND) coteries are of particularinterest, since they are optimal in some sense. By assigning a Boolean variable to eachelement in U, a family of subsets of U is represented by a Boolean function of thesevariables. The authors characterize the ND coteries as exactly those families which canbe represented by positive, self-dual functions. In this Boolean framework, it is provedthat any function representing an ND coterie can be decomposed into copies of thethree-majority function, and this decomposition is representable as a binary tree. It isalso shown that the class of ND coteries proposed by D. Agrawal and A. El Abbadi (1989) is related to a special case of the above binary decomposition, and that the composition proposed by M.L. Neilsen and M. Mizuno (1992) is closely related to the classical Ashenhurst decomposition of Boolean functions. A number of other results are also obtained. The compactness of the proofs of most of these results indicates the suitability of Boolean algebra for the analysis of coteries.
Overlarge sets of 2-(11, 5, 2) designs and related configurations
Authors: Rudolf Mathon, Anne Penfold Street
Venue: Discrete Mathematics (2002)

We consider the construction of several configurations, including: • overlarge sets of 2-(11, 5,2) designs, that is, partitions of the set of all 5-subsets of a 12-set into 72 2-(11, 5, 2) designs; • an indecomposable doubly overlarge set of 2-(11,5,2) designs, that is, a partition of two copies of the set of all 5-subsets of a 12-set into 144 2-(11,5,2) designs, such that the 144 designs can be arranged into a 12 × 12 square with interesting row and column properties; • a partition of the Steiner system S(5,6,12) into 12 disjoint 2-(11,6,3) designs arising from the diagonal of the square; • bidistant permutation arrays and generalized Room squares arising from the doubly overlarge set, and their relation to some new strongly regular graphs.
Mongrel: hybrid techniques for standard cell placement
Authors: Sung Woo Hur, John Lillis
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We give an overview of a standard-cell placer Mongrel. The prototype tool adopts a middle-down methodology in which a grid is imposed over the layout area and cells are assigned to bins forming a global placement. The optimization technique applied in this phase is based on the Relaxation-Based Local Search (RBLS) framework in which a combinatorial search mechanism is driven by an analytical engine. This enables a more global view of the problem and results in complex modifications of the placement in a single search "move". Details of this approach including a novel placement legalization procedure are presented. When a global placement has converged, a detailed placement is formed and further optimized by the proposed optimal interleaving technique. Experimental results are presented and are quite promising, demonstrating that there is significant room for improvement in state of the art placement.
Image Segmentation by Unifying Region and Boundary Information
Authors: J. F. Haddon, J. F. Boyce
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A two-stage method of image segmentation based on gray level cooccurrence matrices is described. An analysis of the distributions within a cooccurrence matrix defines an initial pixel classification into both region and interior or boundary designations. Local consistency of pixel classification is then implemented by minimizing the entropy of local information, where region information is expressed via conditional probabilities estimated from the cooccurrence matrices, and boundary information via conditional probabilities which are determined a priori. The method robustly segments an image into homogeneous areas and generates an edge map. The technique extends easily to general edge operators. An example is given for the Canny operator. Applications to synthetic and forward-looking infrared (FLIR) images are given.
Openings Can Introduce Zero Crossings in Boundary Curvature
Authors: P. F. M. Nacken
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Chen and Yan (1989) presented a result on zero crossings of boundary curvature under morphological openings. In this correspondence, it is shown, by means of a counter example, that this result is not correct. An analysis of the counter example shows where Chen and Yan go wrong and determines a class of images for which their theorem holds.
Novel highly symmetrical trivalent graphs which lead to negative curvature carbon and boron nitride chemical structures
Authors: R. B. King
Venue: Discrete Mathematics (2002)

A graph described by Klein in the 19th century consisting of 24 heptagons can be used to generate possible but not yet experimentally realized carbon structures through such a leapfrog transformation. The automorphism group of the Klein graph is the simple PSL(2,7) group of order 168, which can be generated from 2 × 2 matrices in a seven-element finite field F7 analogous to the generation of the icosahedral group of order 60 by a similar procedure using F5. Similarly, a graph described by Walther Dyck, also in the 19th century, consisting of 12 octagons on a genus 3 surface, can generate possible carbon or boron nitride structures consisting of hexagons and octagons through a leapfrog transformation. The automorphism group of the Dyck graph is a solvable group of order 96 but does not contain the octahedral group as a normal subgroup and is not a normal subgroup of the automorphism group of the four-dimensional analogue of the octahedron.
Logic Modeling in WAVES
Authors: Alfred S. Gilman
Venue: IEEE Design Test (1990)

WAVES, which stands for waveform and vector exchange specification, is a way to represent in text the histories of logic signals and the requirements placed on them. It is intended to serve as a way of exchanging information between simulator and tester environments. A description is given of the WAVES event-value concept, which captures both the logic value sets used in simulation and the pin codes used in contemporary test-vector languages. The encoding waveforms and frames are discussed.
On the Simulation of Unsteady Flow of an Oldroyd-B Fluid by Spectral Methods
Authors: Alexei Lozinski, Robert G. Owens, Alfio Quarteroni
Venue: Journal of Scientific Computing (2002)

We report numerical results on the simulation of unsteady flow of an Oldroyd-B fluid by spectral element methods. Several techniques to cure the instabilities are considered.
Where and Why Local Shading Analysis Works
Authors: F. P. Ferrie, M. D. Levine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An apparent contradiction in the shape-from-shading literature is examined. Although practical experience suggests that shape can be inferred from the local analysis of shading, mathematical analyses support the opposite. A criterion for exact surface recovery is derived, and it is shown that, as a result of surface geometry, elliptic, hyperbolic, and doubly curved surfaces could be recovered to reasonable accuracy provided that surface curvature and/or foreshortening were limited. In other words, by relaxing the requirement that surfaces be recovered exactly, it is found that local analysis of shading can provide useful descriptions of shape as evidenced by the results presented.
The PSTR/SNS Scheme for Real-Time Fault Tolerance via Active Object Replication and Network Surveillance
Authors: K. H. (Kane) Kim, Chittur Subbaraman
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The time-triggered message-triggered object (TMO) scheme was formulated a few years ago as a major extension of the conventional object structuring schemes with the idealistic goal of facilitating general-form design and timeliness-guaranteed design of complex real-time application systems. Recently, as a new scheme for realizing TMO-structured distributed and parallel computer systems capable of both hardware and software fault tolerance, we have formulated and demonstrated the primary-shadow TMO replication (PSTR) scheme. An important new extension of the PSTR scheme discussed in this paper is an integration of the PSTR scheme and a network surveillance (NS) scheme. This extension results in a significant improvement in the fault coverage and recovery time bound achieved. The NS scheme adopted is a recently developed scheme effective in a wide range of point-to-point networks and it is called the supervisor-based NS (SNS) scheme. The integration of the PSTR scheme and the SNS scheme is called the PSTR/SNS scheme. The recovery time bound of the PSTR/SNS scheme is analyzed on the basis of an implementation model that can be easily adapted to various commercial operating system kernels.
Linear Continuation-Passing
Authors: Josh Berdine, Peter O'hearn, Uday Reddy, Hayo Thielecke
Venue: Higher-Order and Symbolic Computation (2002)

Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (\tt goto statements), process switching (coroutines), and backtracking. However, continuations are often manipulated in a highly stylised way, and we show that all of these, bar backtracking, in fact use their continuations linearly&semi; this is formalised by taking a target language for CPS transforms that has both intuitionistic and linear function types.