ppxscal/embedding_network huggingface dataset:
Regular packings of regular graphs
Authors: A. Gutiérrez, A. S. Lladó
Venue: Discrete Mathematics (2002)

A graph H is G-decomposable if it contains subgraphs G1,...,Gh, h ≥ 2, isomorphic to G whose sets of edges partition E(H). Wilson (Proceedings of the Fifth British Combinatorial Conference, University of Aberdeen, Aberdeen, 1975, pp. 647-659; Congr. Numer. XV, Utilitas, Math., Winnipeg, Manitoba, 1976) proved that, given a nonempty graph G, the complete graph KN is G-decomposable for N large enough, provided some natural divisibility conditions hold. Fink and Ruiz (Czechoslovak Math. J. 36 (111) (1986) 172) proved that a noncomplete G-decomposable graph H exists even within the class of circulant graphs. The order N0(G) of the smallest G-decomposable regular graph is known only for particular classes of graphs or for graphs with small maximum degree. We give some tools to study the problem of determining N0(G) when G is a connected regular graph. These tools are applied to obtain upper and lower bounds of N0(G) for regular graphs of degree r ≥ |V(G)|/2. Families of extremal graphs which attain the bounds are also given.
How to Play M13?
Authors: Sebastian Egner Thomas Beth
Venue: Designs, Codes and Cryptography (1999)

A puzzle called &rsquo;&rsquo;M_{13} &lsquo;&lsquo; J. H. Conway has described recently is explained. We report an implementation of the puzzle in the programming language Java. The program allows the human user to &rsquo;&rsquo;play M_{13}&lsquo;&lsquo; interactively (and to cheat by solving it automatically). The program is an example on how to bring to life a nice piece of discrete mathematics. In this sense it presents not only a didactical way of seeing &rsquo;&rsquo;mathematics at work&lsquo;&lsquo;, but also displays the stabilizer chain method developed by C. Sims to solve group theoretic puzzles, the most famous of which being Rubik&lsquo;s cube.
A Class of Discrete Multiresolution Random Fields and Its Application to Image Segmentation
Authors: Roland Wilson, Chang-Tsun Li
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

In this paper, a class of Random Field model, defined on a multiresolution array is used in the segmentation of gray level and textured images. The novel feature of one form of the model is that it is able to segment images containing unknown numbers of regions, where there may be significant variation of properties within each region. The estimation algorithms used are stochastic, but because of the multiresolution representation, are fast computationally, requiring only a few iterations per pixel to converge to accurate results, with error rates of 1-2 percent across a range of image structures and textures. The addition of a simple boundary process gives accurate results even at low resolutions, and consequently at very low computational cost.
A Stochastic Programming Approach for Range Query Retrieval Problems
Authors: Xian Liu, Wilsun Xu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

One of the important issues in range query (RQ) retrieval problems is to determine the key's resolution for multiattribute records. Conventional models need to be improved because of potential degeneracy, less desired computability, and possible inconsistency with the partial match query (PMQ) models. This paper presents a new RQ model to overcome these drawbacks and introduces a new methodology, stochastic programming (SP), to conduct the optimization process. The model is established by using a monotone increasing function to characterize range sizes. Three SP approaches, wait-and-see(WS), here-and-now (HN), and scenario tracking (ST) methods are integrated into this RQ model. Analytical expressions of the optimal solution are derived. It seems that HN has advantage over WS because the latter usually involves complicated multiple summations or integrals. For the ST method, a nonlinear programming software package is designed. Results of numerical experiments are presented that optimized a 10-dimensional RQ model and tracked a middle size (100) and a large size (1,000) scenarios.
A Neural-Network-Based Approach to Optical Symbol Recognition
Authors: Mu-Chun Su, Hsin-Hua Chen, Wan-Chi Cheng
Venue: Neural Processing Letters (2002)

In this paper we propose a neural-network-based approach to solving optical symbol recognition problems, from node head recognition to handwritten digit recognition. We demonstrated that node heads could be easily recognized by using a set of fuzzy rules extracted from the parameters of trained neural networks. For handwritten digit recognition we demonstrated that only 12 features are sufficient to achieve a high recognition rate. Several databases were tested to demonstrate the effectiveness and efficiency of the proposed recognition method.
Temporally silent stores
Authors: Kevin M. Lepak, Mikko H. Lipasti
Venue: ACM SIGARCH Computer Architecture News (2002)

Recent work has shown that silent stores--stores which write a value matching the one already stored at the memory location--occur quite frequently and can be exploited to reduce memory traffic and improve performance. This paper extends the definition of silent stores to encompass sets of stores that change the value stored at a memory location, but only temporarily, and subsequently return a previous value of interest to the memory location. The stores that cause the value to revert are called temporally silent stores. We redefine multiprocessor sharing to account for temporal silence and show that in the limit, up to 45% of communication misses in scientific and commercial applications can be eliminated by exploiting values that change only temporarily. We describe a practical mechanism that detects temporally silent stores and removes the coherence traffic they cause in conventional multiprocessors. We find that up to 42% of communication misses can be eliminated with a simple extension to the MESI protocol. Further, we examine application and operating system code to provide insight into the temporal silence phenomenon and characterize temporal silence by examining value frequencies and dynamic instruction distances between temporally silent pairs. These studies indicate that the operating system is involved heavily in temporal silence, in both commercial and scientific workloads, and that while detectable synchronization primitives provide substantial contributions, significant opportunity exists outside these references.
Agent-Based Simulation in the Study of Social Dilemmas
Authors: N. M. Gotts, J. G. Polhill, A. N. R. Law
Venue: Artificial Intelligence Review (2003)

This review discusses agent-based social simulation (ABSS) in relation to the study of social dilemmas such as the Prisoner's Dilemma and Tragedy of the Commons. Its aims are to explore the place of ABSS in relation to other research methods such as mathematical analysis, to familiarise artificial intelligence researchers (particularly those working on multi-agent systems) with a body of relevant multidisciplinary work, and to suggest directions for future ABSS research on social dilemmas.ABSS research can contribute greatly to the understanding of social phenomena, but needs to be based on a clear appreciation of the current `state of play' in the areas where it is used. With regard to `thin' (simple, general) simulation models, this primarily means attending to what has been or could be discovered by mathematical analysis, to work using other forms of simulation, and to the relevant theoretical disputes; with regard to `thick' (specific, detailed) models (about which the paper has less to say), linking to the relevant `thin' models and to the empirical evidence. The bulk of ABSS work on social dilemmas has been concentrated in quite a narrow &ndash; though certainly significant &ndash; area (reciprocal altruism in the Prisoner's Dilemma), and has sometimes been seriously flawed by over-ambitious claims, and insufficient attention to analytical approaches &ndash; although this same work has been very fertile in terms of inspiring further work, both analytical and simulation-based.
The Emerging STEP Standard for Product-Model Data Exchange
Venue: Computer (1993)

The International Organization for Standardization's (ISO's) standard for the exchange of product-model data (STEP) is discussed. The goal of this standard, officially named ISO 10303, is to facilitate the computer-readable exchange of the total information used to define an industrial product. As a standard method for digital product definition. STEP will support communications among heterogeneous computer environments. The standard will make it easier to integrate systems that perform various product life-cycle functions, such as design, manufacturing, and logistics support, and will help facilitate concurrent engineering. The current electronic domain standards are reviewed. The ways in which STEP differs from them are outlined.
Flexible Control for Robot Manipulators
Authors: Angel L. Enriquez, Adel H. Eltimsahy, Mohsin M. Jamali
Venue: IEEE Micro (1995)

This article deals with the design and implementation of a flexible controller that is suitable for different types of robots and control algorithms. The flexible controller allows use of different control modes at the various joints of the robot and uses a multiprocessor architecture for the individual control of each joint. The DSP56001 digital signal processor serves as the master controller, executes control algorithms, and gives trajectory orders to each joint. The HCTL-1100 acts as the joint processor and is capable of operating in different modes, can be connected directly to an incremental optical encoder, provides the user with options to accommodate different specialized applications, and eliminates extra hardware.
A Framework for Product Data
Authors: Alison McKay, M. Susan Bloor, Alan de Pennington
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Improved support for engineering using information technology involves the integration of existing, evolving and future product data, and software that processes that data. For this reason, there is increasing interest in the representation of product data in the computer to support computer-aided engineering applications. To avoid duplication and inconsistency, and to support the use of new implementation technology as it emerges, conceptual models of product data are required. Such models are independent of the software and hardware environments in which they are implemented. System architectures to support the integration of applications at implementation time are becoming an accepted part of engineering information systems. We contend that, to use these software support environments effectively, integrated product data is required. Further, it must be possible to extend the integrated product data in a controlled fashion if it is to evolve to support future engineering applications effectively. A framework that is a part of the product data, at the conceptual modeling (rather than the implementation) stage, is shown to help to satisfy these requirements. The framework presented here is a structure for the information content of product data rather than for the implementation of such data. Our research has shown that product data based on the framework can be successfully implemented in a number of different forms; for example, network, relational, and object-oriented databases. This paper describes a framework for electromechanical product data that has been implemented in a structure editor and is currently being used to support a range of engineering applications. We show that the process of product data integration can be improved by using existing integration strategies in conjunction with a framework that provides an overall organization for the data.
Leveraging Distributed Software Development
Authors: Junichi Suzuki, Yoshikazu Yamamoto
Venue: Computer (1999)

The Internet has been changing the way people collaborate on software development, offering certain advantages but also creating new requirements. Internet-based collaboration does make a wider base of talent available, but the development cycles running at Internet speeds require maintaining higher levels of precision. From a project-management perspective, communication is a key factor in Internet-based development. Internet-based collaboration requires effective team communication. The authors point out that when a development team isn't communicating well, it is nearly impossible to create and validate design solutions and manage the team's deliverables. So while Internet collaboration offers a number of advantages, the friction created by distributed-therefore delayed-communication typically increases the over-head associated with sharing project information. And the technology itself- including system interoperability and the synchronous or asynchronous collaboration tools-can create problems in a distributed development environment. As the complexities of distributed collaborative- development environments increase, frameworks designed for such environments will become essential. The authors describe one such framework- called SoftDock-and the new technologies it exploits. It lets developers analyze, design, and develop software from component models.
Maintenance Tools
Authors: Paul Oman
Venue: IEEE Software (1990)

After a brief overview, eight tools to help the maintenance programmer analyze and understand code are described in separate presentations. All of them are code-visualization tools. However, while all these tools show how a program is structured, they use different means to achieve different ends. The tools covered are: Objective-C Browser; Vifor; Seela; Battle Map; Act; Grasp/Ada; Expert Dataflow and Static Analysis; Surgeon's Assistant; and Dependency Analysis Tool Set.
Reducing the Storage Requirements of a Perfect Hash Function
Authors: Paolino Di Felice, Ugo Madama
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

The amount of memory required by perfect hash functions at retrieval time is one of the primary issues to be taken into account when looking for such functions. This correspondence gives empirical evidence about the effectiveness of a strategy suitable to significantly reduce the memory requirements of the order preserving minimal perfect hash function proposed by Czech et al. [3].
Triads, Flocks of Conics and Q ^-(5,q)
Authors: Matthew R. Brown, Christine M. O‘keefe, Tim Penttila
Venue: Designs, Codes and Cryptography (1999)

We show that if an ovoid of Q (4,q),q even, admits a flock of conics then that flock must be linear. It follows that an ovoid of PG (3,q),q even, which admits a flock of conics must be an elliptic quadric. This latter result is used to give a characterisation of the classical example Q ^-(5,q) among the generalized quadrangles T _3(\O), where \O is an ovoid of PG (3,q) and q is even, in terms of the geometric configuration of the centres of certain triads.
Speeding Up External Mergesort
Authors: LuoQuan Zheng, Per-Åke Larson
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

External mergesort is normally implemented so that each run is stored contiguously on disk and blocks of data are read exactly in the order they are needed during merging. We investigate two ideas for improving the performance of external mergesort: interleaved layout and a new reading strategy. Interleaved layout places blocks from different runs in consecutive disk addresses. This is done in the hope that interleaving will reduce seek overhead during merging. The new reading strategy precomputes the order in which data blocks are to be read according to where they are located on disk and when they are needed for merging. Extra buffer space makes it possible to read blocks in an order that reduces seek overhead, instead of reading them exactly in the order they are needed for merging. A detailed simulation model was used to compare the two layout strategies and three reading strategies. The effects of using multiple work disks were also investigated. We found that, in most cases, interleaved layout does not improve performance, but that the new reading strategy consistently performs better than double buffering and forecasting.
Interactive and symbolic data dependence analysis based on ranges of expressions
Authors: Yang Bo, Zheng Fengzhou, Wang Dingxing, Zheng Weimin
Venue: Journal of Computer Science and Technology (2002)

Traditional data dependence testing algorithms have become very accurate and efficient for simple subscript expressions, but they cannot handle symbolic expressions because of the complexity of data-flow and lack of the semantic information of variables in programs. In this paper, a range-based testing and query approach, called DDTQ, is proposed to eliminate data dependence between array references with symbolic subscripts. DDTQ firstly extracts data dependence information from the symbolic subscripts, a testing algorithm is then used to disprove the dependence based on the ranges of expressions. The assumed dependence that cannot be handled by the disprover will be converted into simple questions by a question engine so that the compiler can solve them by user interaction in a friendly way. The experiment on perfect benchmarks indicates that DDTQ is effective in improving the parallelizing capability of the compiler.
Fibered geometries
Authors: Leen Kuijken, Hendrik Van Maldeghem
Venue: Discrete Mathematics (2002)

Our aim is to initiate the study of fibered geometries, in particular fibered projective planes and fibered generalized polygons. In fact, we apply the theory of fuzzy sets in a particular way on incidence geometry. Combinatorial and geometric questions arise. But also classical objects are recognized by this alternative view: for instance apartments arise naturally in the theory of "contagious values".
Economic Online Self-Test in the Time-Triggered Architecture
Authors: Andreas Steininger, Christopher Temple
Venue: IEEE Design Test (1999)

Fault-tolerant, distributed, real-time architectures are often based on a restrictive fault model and special assumptions of the node behavior in the event of faults. The Time-Triggered Architecture (TTA) typifies such an architecture. Using the TTA, this article analyzes the implications of the single-fault assumption and the fail-silence assumption on error detection and testing. Preventing fault accumulation within the communication controllers is of utmost importance in guaranteeing system fault tolerance. The methods for on-line self-testing traditionally applied to attain this goal compromise the responsiveness of the system or result in costly solutions. The strategy presented in this article is cost-efficient, since it fully utilizes the properties offered by the TTA for testing.
Mobile computing
Authors: M. Satyanarayanan
Venue: Computer (1993)

The problems, limitations, and potential advantages of mobile computing systems are discussed. It is suggested that the constraints violate many of the assumptions upon which today's distributed systems are based. A key requirement of mobile computing systems will be the ability to access critical data regardless of location, which implies interdependence between the elements of a mobile computing system. The Coda file system, which is an effort to provide transparency of environment to mobile computing systems, is reviewed.
Adaptive Scale Filtering: A General Method for Obtaining Shape From Texture
Authors: J. v. Stone, S. d. Isard
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We introduce adaptive scale filtering, a general method for deriving shape from texture under perspective projection without recourse to prior segmentation of the image into geometric texture elements (texels), and without thresholding of filtered images.If texels on a given surface can be identified in an image then the orientation of that surface can be obtained [11]. However, there is no general characterization of texels for arbitrary textures. Furthermore, even if the size and shape of texels on the surface is invariant with regard to position, perspective projection ensures that the size and shape of the corresponding image texels vary by orders of magnitude.Commencing with an initial set F0 of identical image filters, adaptive scale filtering iteratively derives a set FN which contains a unique filter for each image position. Each element of FN is tuned to the three-dimensional structure of the surface; that is, all image filters in FN back-project to an identical shape and size on the surface. Thus image texels of various sizes, but associated with a single spatial scale on the surface, can be identified in different parts of the image. When combined with conventional shape from texture methods, edges derived using FN provide accurate estimates of surface orientation. Results for planar surfaces are presented.
Information Proficiency: Your Key to the Information Age, 1st edition
Authors: Thomas J. Buckholtz
Venue:  (1997)

:The Information Age has generated an explosion of information and technology. Currently, executives and empowered employees create a wealth of good ideas. But, how can you sharpen your focus and seize the best opportunities? In Information Proficiency: Your Key to the Information Age, author Thomas Buckholtz shows you how to thrive in these challenging times and put your good ideas to work using information proficiency: the effective use of information to define and achieve goals. Dubbed "the information wizard" by InfoWorld, Tom Buckholtz has led the deployment of information resources and systems for the world's biggest buyer of information technology, the U.S. Government. In this engaging book, he shares the groundbreaking concepts and techniques he developed while serving as the Commissioner of the Information Resources Management Service, U.S. General Services Administration, where he directed the implementation of computing, telecommunications, and records management throughout the Executive Branch. Buckholtz shows you how to avoid the common trap of focusing too much on technology. Instead, he concentrates on the crucial products of all organizations - decisions and the implementation of those decisions. "Information proficiency provides the power to accomplish your objectives. The components of this power are quality decision making and incisive implementation." The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Additive utilities on densely ordered sets
Authors: Yutaka Nakamura
Venue: Journal of Mathematical Psychology (2002)

This paper shows sufficient conditions for the existence of additive utilities without a restricted solvability axiom. Our conditions require that each essential component of the underlying Cartesian product be densely ordered.
A Class of Perfect Ternary Constant-Weight Codes
Authors: Mattias Svanström
Venue: Designs, Codes and Cryptography (1999)

We construct a class of perfect ternary constant-weight codes of length 2^r, weight 2^r-1 and minimum distance 3. The codes have 2^{2^r-1} codewords. The construction is based on combining cosets of binary Hamming codes. As a special case, for r=2 the construction gives the subcode of the tetracode consisting of its nonzero codewords. By shortening the perfect codes, we get further optimal codes.