ppxscal/embedding_network huggingface dataset:
The algebra of metric betweenness I: Subdirect representation and retraction
Authors: Hans-Jürgen Bandelt, Victor Chepoi
Venue: European Journal of Combinatorics (2007)

We bring together algebraic concepts such as equational class and various concepts from graph theory for developing a structure theory for graphs that promotes a deeper analysis of their metric properties. The basic operators are Cartesian multiplication and gated amalgamation or, alternatively, retraction. Specifically, finite weakly median graphs are known to be decomposable (relative to these operators) into smaller pieces that in turn are parts of hyperoctahedra, the pentagonal pyramid, or of certain triangulations of the plane. This decomposition scheme can be interpreted as Birkhoff's subdirect representation in purely algebraic terms.
Python in Nanophotonics Research
Authors: Peter Bienstman, Lieven Vanholme, Wim Bogaerts, Pieter Dumon, Peter Vandersteegen
Venue: Computing in Science and Engineering (2007)

The authors describe how they use Python for nanophotonics research specifically, they describe using it for electromagnetic modeling, mask design, and process simulation.
Cognitive Issues in Information Visualisation Design for Interaction for the Visually Impaired
Authors: D. Graham, Benest,  P. Nicholl
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper reports on the findings of a study on improving interaction design for visually impaired students, focusing upon the cognitive criteria for information visualisation.
How GPUs Work
Authors: David Luebke, Greg Humphreys
Venue: Computer (2007)

GPUs have moved away from the traditional fixed-function 3D graphics pipeline toward aflexible general-purpose computational engine.
Diverse cell interaction in dynamic cell sizing and VC-PGA cell priority selection method
Authors: A. Amphawan, E. M. A. G
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Dynamic cell sizing is a flexible load-balancing scheme which allows potential capacity gains by modifying its coverage area at any given time for optimum performance. In this paper, the diverse interaction among cells is discussed. The preliminary description of forward link capacity gain on a single cell serves as groundwork for discussions on bi-directional impact of cell-pairs and the multifarious interactions of cells in a CDMA network. The diverse interaction of cells is then made analogous to that of community members in a virtual community in a genetic algorithm. The cell to be given highest priority cell over shrinking in the virtual community is selected by the virtual community parallel genetic algorithm (VC-PGA). By this method, the number of cell attenuations may be controlled, the emergence of coverage holes reduced and thus, the quality of service increased.
Influence of codified knowledge on software design task performance: a comparison of pairs with individuals
Authors: Radha Mahapatra
Venue:  (2006)

The need to improve the success rates of software development projects has prompted the software engineering community to come-up with various initiatives. These initiatives include: new software development processes such as Extreme Programming (XP), leveraging the development process by reusing existing knowledge of software artifacts. XP utilizes pairs in the performance of various software development tasks. Moreover, development of software applications is a knowledge intensive process that utilizes both tacit and explicit knowledge. This experimental study utilized software development professionals as subjects and manipulated the iv mode of participation (individual or pairs) and availability of codified knowledge (design patterns). Results of the study indicate that the performance of collaborating pairs were better than the 2nd best individual in nominal pairs. Collaborating pairs also took more time than the average time taken by nominal pairs to complete the task and they were more satisfied than the individuals. This study also found that the codified knowledge in the form of design patterns helped in arriving at a better solution. One interesting finding of this study is the effect of design self-efficacy/collective-efficacy on task performance.
Designing Audio Visual Software for Digital Interactive Art
Authors: Sung-dae Hong, Jin-wan Park, Won-Hyung Lee
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper, in the development of interactive media art contents, represents a study of the software design which controls movement with sampled sound data. Sound processing samples numerical data from real sound, this is applied to graphic digital media software. The result from this percussion performance contents development is a moving image synchronized with sound.
The repeated nondestructive march tests with variable address sequences
Authors: V. N. Yarmolik, S. V. Yarmolik
Venue: Automation and Remote Control (2007)

Random access memory testing by repeated application of march tests was examined. The sequence of addresses formed in each test phase with the constant test structure was used as a variable parameter. The method of the modified address sequences formation is proposed. As a difference measure of the modified address sequences arithmetic distance is used. The efficiency of detection of pattern sensitive faults is estimated depending on modification of the address sequences and their arithmetic distances.
Adaptive page replacement to protect thrashing in Linux
Authors: Song Jiang, Xiaodong Zhang
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

Analyzing the variations of page replacement implementations in recent Linux kernel versions of 2.0, 2.2, and 2.4, we compare their abilities to deal with system thrashing. We show that although the page implementation in Kernel 2.2 is relatively effective to protect thrashing among the three versions, none of them have adaptive ability, and thus the protection is limited. By running several groups of memory-intensive application programs on Kernel 2.2, we observe serious thrashing when memory shortage attains a certain level. We propose and implement a thrashing protection patch in Linux kernels, which makes replacement policy responsively resolve excessive memory paging by temporarily helping one of the active processes quickly build up its working set. Consequently, thrashing could be eliminated at the level of page replacement, so that load controls at a higher level, such as process suspensions/swapping can be avoided or delayed until it is truly necessary. Our experiments show that our patch can significantly reduce page faults and the execution time of each individual thrashing process for several groups of interacting programs. We also show that our method introduces little additional overhead to program executions, and its implementation in Linux (or Unix) system is straightforward.
Spam Filter Based Approach for Finding Fault-Prone Software Modules
Authors: Osamu Mizuno, Shiro Ikami, Shuya Nakaichi, Tohru Kikuno
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Because of the increase of needs for spam e-mail detection, the spam filtering technique has been improved as a convenient and effective technique for text mining. We propose a novel approach to detect fault-prone modules in a way that the source code modules are considered as text files and are applied to the spam filter directly. In order to show the applicability of our approach, we conducted experimental applications using source code repositories of Java based open source developments. The result of experiments shows that our approach can classify more than 75% of software modules correctly.
Estimation of Trustworthiness for P2P System in Collusive Attack
Authors: Fumiaki Sato
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In the community of P2P, it is paid attention to try to control illegal behavior of the peer by managing the reputation of the peer. However, the implementation over-head was large, and the semantics of the trust model was indefinite in many of proposed methods. On the other hand, the trustworthiness estimation method by a simple, probabilistic technique, that is, by the maximum likelihood estimation is proposed. If this method is used, the problem concerning the semantics of the reliability model and the problem of the implementation overhead can be improved. However, the defense to a collusive attack is not proposed in this method. In this paper, it proposes the trust estima-tion method of the peer to give the defense to a collusive attack to the maximum likelihood estimation method. Moreover, peer's trustworthiness is correctly estimated though there is a collusive attack in this proposal method from the simulation result.
Polarimetric IR automatic target detection and recognition
Authors: F. Sadjadi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Automatic detection and recognition of targets by means of passive IR sensors suffer from limitations due to lack of sufficient contrast between the targets and their background, and among the facets of a target. The results of a suite of polarization-sensitive automatic target detection and recognition algorithms on sets of simulated and real polarimetric IR imagery are presented. A custom designed polarimetric IR (PIR) imaging sensor is used for collecting real polarimetric target data under a variety of conditions. Then a set of novel algorithms are designed and tested that uses the target and background Stokes parameters for detection, segmentation and classification of targets. The empirical performance results in terms of the probabilities of detection, false alarm rate, segmentation accuracy, and recognition probabilities as functions of the number of pixels on target, aspect and depression angles and several background conditions (clutter densities) of applying this ATR algorithms on the polarimetric data and its comparison with a typical IR only ATR are demonstrated, showing that a noticeable improvement can be achieved. 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
Efficient simulation of large-scale p2p networks: packet-level vs. flow-level simulations
Authors: Kolja Eger, Tobias Hoßfeld, Andreas Binzenhöfer, Gerald Kunzmann
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

Peer-to-peer (P2P) networks can reduce the distribution cost of large media files for the original provider of the data significantly. Thereby, the BitTorrent protocol is widely used in the Internet today. Most research work studies the protocol analytically, by simulations at the flow-level or real world experiments. Thereby, for flow-level simulations the influence of neglecting packet-level characteristics is not yet quantified. Therefore, this paper compares packet-level simulation results with flow-level values and analytically derived bounds. Our findings show that BitTorrent is near to optimal at flow-level for different scenarios. Naturally, packet-level results deviate more from the optimal values but differences are at most around 30% in our simulations. Furthermore, we show that the propagation delay can significantly influence the download performance of BitTorrent.
A system for structured high-performance multithreaded programming in Windows NT
Authors: John Thornley, K. Mani Chandy, Hiroshi Ishii
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

With the advent of inexpensive multiprocessor PCs, multithreading is poised to play an important role in computationally intensive business and personal computing applications, as well as in science and engineering. However, the difficulty of multithreaded programming remains a major obstacle. Windows NT support for threads is well suited to systems programming, but is too unstructured when multithreading is used for the purpose of speeding up program execution. In this paper, we describe a system for structured multithreaded programming. Thread creation operations are multithreaded variants of blocks and loops, and synchronization objects are based on Boolean flags and integer counters. With this system, most multithreaded program development can be performed using traditional sequential methods and tools. The system is integrated with Windows NT and Microsoft Developer Studio Visual C++. We are developing a variety of applications in collaboration with other researchers, to demonstrate the power of structured multithreaded programming on commodity multiprocessors running Windows NT. In one benchmark application (aircraft route optimization), we achieved better performance on a quad-processor Pentium Pro system than the best results reported on expensive supercomputers.
Experience implementing an IP address closure
Authors: Ning Wu, Alva Couch
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Most autonomic systems require large amounts of human labor and configuration before they become autonomous. We study the management problem for autonomic systems, and consider the actions needed before a system becomes self-managing, as well as the tasks a system administrator must still perform to keep so-called "self-managing systems" operating properly. To understand the problem, we implemented a prototype self-managing "IP address closure" that implements integrated DNS and DHCP. We conclude that the system administrator is far from obsolete, but that the administrator of the future will have a different skill set than those of the present, focused around effective interaction with closures rather than management of individual machines.
Canonical correlations and canonical time series
Authors: J. K. Thomas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper, we revisit the problem of interrelations between large correlated data sets by considering cross correlations between a few linear combinations of the elements of each. This problem was studied by Hotelling (see Biometrika, vol.28, p.321-77) and Anderson (1958). We generalize the problem by studying linear transformations of the data sets, and applying our results to the case where one of the transformed data sets is noise corrupted. We derive best reduced-rank linear transformations and present asymptotic results. We conclude the paper by studying a causal filtering version of this problem and connecting it with the asymptotic case.
Towards Supporting Interactions between Self-Managed Cells
Authors: Alberto Schaeffer-Filho, Emil Lupu, Naranker Dulay, Sye Loong Keoh, Kevin Twidle, Morris Sloman, Steven Heeps, Stephen Strowes, Joe Sventek
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Management in pervasive systems cannot rely on human intervention or centralised decision-making functions. It must be devolved, based on local decision-making and feedback control-loops embedded in autonomous components. We have previously proposed the self-managed cell (SMC) as an architectural pattern for building ubiquitous applications, where a SMC consists of hardware and software components that form an autonomous administrative domain. SMCs may be realised at different scales, from body-area networks for health monitoring, to an entire room or larger distributed settings. However, to scale to larger systems, SMCs must collaborate with each other, and federate or compose in larger SMC structures. This paper discusses requirements for interactions between SMCs and proposes key abstractions and protocols for realising peer-to-peer and composition interactions. These enable SMCs to exchange data, react to external events and exchange policies that govern their collaboration. Dynamically customisable interfaces are used for encapsulation and interaction mediation. Although the examples used here are based on healthcare scenarios, the principles and abstractions described in the paper are more generally applicable.
Improving the Results and Performance of Clustering Bit-encoded XML Documents
Authors: Michal Kozielski
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Clustering XML documents according to their structure is one of the techniques that may improve the effectiveness of XML documents storage and retrieval. One of existing approaches to this problem is to encode XML document structure as a string of bits and cluster such feature vectors. High dimensionality and sparseness of the feature vectors are the weaknesses of this method. The paper presents four methods reducing the dimensionality of the bit feature vectors. Two of these methods are novel. They are dedicated to XML documents and should be applied during the encoding process. The results showed good efficiency of these inner-encoding methods and their ability of improving clustering results in some cases. The methods presented in the paper are tested on two datasets of XML documents having different characteristics.
Fast structure from motion recovery applied to 3D image stabilization
Authors: S. Srinivasan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In this paper, we address 3D image stabilization using a framework for the estimation of scene structure from a monocular motion field. We show that our algorithm rapidly and accurately determines the focus of expansion (FOE) in an optical flow field. This involves computing the least squares error of a large system of equations without actually solving the equations, to generate an error surface that describes the goodness of fit as a function of the hypothesized FOE. Consequently, we recover the rotational motion which we use to perform 3D image stabilization.
Topological Correction of Hypertextured Implicit Surfaces for Ray Casting
Authors: Manuel N. Gamito
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

Hypertextures are a useful modelling tool in that they can add three-dimensional detail to the surface of otherwise smooth objects. Hypertextures can be rendered as implicit surfaces, resulting in objects with a complex but well defined boundary. However, representing a hypertexture as an implicit surface often results in many small parts being detached from the main surface, turning an object into a disconnected set. Depending on the context, this can detract from the realism in a scene where one usually does not expect a solid object to have clouds of smaller objects floating around it. We present a topology correction technique, integrated in a ray casting algorithm for hypertextured implicit surfaces, that detects and removes all the surface components that have become disconnected from the main surface. Our method works with implicit surfaces that are C2 continuous and uses Morse theory to find the critical points of the surface. The method follows the separatrix lines joining the critical points to isolate disconnected components.
Highly structured scientific publications
Authors: Robert B. Allen
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Science is a complex, but highly structured, activity. We propose that reports about science would benefit by reflecting that structure. We provide an example based on the research paradigm and we explore more complex examples in which workflow models describe the conceptual model, the research procedure, the data analysis, and the conclusions.
A pipelined architecture for distributed text query evaluation
Authors: Alistair Moffat, William Webber, Justin Zobel, Ricardo Baeza-Yates
Venue: Information Retrieval (2007)

Two principal query-evaluation methodologies have been described for cluster-based implementation of distributed information retrieval systems: document partitioning and term partitioning. In a document-partitioned system, each of the processors hosts a subset of the documents in the collection, and executes every query against its local sub-collection. In a term-partitioned system, each of the processors hosts a subset of the inverted lists that make up the index of the collection, and serves them to a central machine as they are required for query evaluation.In this paper we introduce a pipelined query-evaluation methodology, based on a term-partitioned index, in which partially evaluated queries are passed amongst the set of processors that host the query terms. This arrangement retains the disk read benefits of term partitioning, but more effectively shares the computational load. We compare the three methodologies experimentally, and show that term distribution is inefficient and scales poorly. The new pipelined approach offers efficient memory utilization and efficient use of disk accesses, but suffers from problems with load balancing between nodes. Until these problems are resolved, document partitioning remains the preferred method.
A uniform name service for spring's UNIX environment
Authors: Michael N. Nelson, Sanjay R. Radia
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

The Spring operating system provides a uniform name service that can be used to associate any name with any object independent of the type of object, and allows arbitrary name spaces to be created and used as first-class objects. We have used this name service to unify the many UNIX® name spaces. Objects that on UNIX systems are typically stored in separate name spaces are all accessible via a single uniform name service in Spring. In addition, it is easy to add new Spring objects that are not currently available in UNIX systems without modifying the underlying name service.
On the Performance of a Hybrid Wireless Network for Emergency Communications in Disaster Areas
Authors: Hoang Nam Nguyen, Koichi Gyoda, Kazunori Okada, Osamu Takizawa
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Fast deployment of an emergency wireless communication system is essential to provide communication services to survivors and rescue teams in the event of a disaster because the telecommunication infrastructure might be damaged. We present and discuss a hybrid system model of wireless data networks for emergency communications in disaster areas. Because wireless resources are limited, efficient resource management mechanisms are needed to enhance system performance and provide users with QoS. We created a novel resource management scheme for hybrid wireless networks that provides not only high quantity simultaneous connections but also the minimum required throughput. This scheme enables selected powerful end users to operate as temporary relay hosts (TRHs), enabling system resources to be utilized efficiently. The scheme combines network-controlled handover, resource allocation, and admission control and takes advantage of adaptive transmission rates and a multi-hop/relay communication mode. The results obtained by a computer simulation show that using our resource management scheme can reduce the connection blocking probability, i.e., increase the number of simultaneous connections.