ppxscal/embedding_network huggingface dataset:
Small-scale peer-to-peer overlays
Authors: Minor Gordon
Venue: ACM SIGOPS Operating Systems Review (2006)

Scalability and efficient global search in large-scale peer-to-peer overlays often come at the expense of small-scale, local interactions between peers. For many users, local operations such as browsing, messaging, and direct content exchange between nodes may be more useful than access to the network as a whole. In this note we sketch the design of a small-scale overlay for applications such as ticketing systems, editorial coordination, and ad hoc workflows that currently rely on more general and less efficient mediums such as e-mail. Peers in the overlay form local economies and attempt to maximize user-directed utility functions.
Size Contrast and Assimilation Explained by the Statistics of Natural Scene Geometry
Authors: Catherine Q. Howe, Dale Purves
Venue: Journal of Cognitive Neuroscience (2004)

The term "size contrast and assimilation" refers to a large class of geometrical illusions in which the apparent sizes of identical visual targets in various contexts are different. Here we have examined whether these intriguing discrepancies between physical and perceived size can be explained by a visual process in which percepts are determined by the probability distribution of the possible real-world sources of retinal stimuli. To test this idea, we acquired a range image database of natural scenes that specified the location of every image point in 3-D space. By sampling the possible physical sources of various size contrast or assimilation stimuli in the database, we determined the probability distributions of the size of the target in the images generated by these sources. For each of the various stimuli tested, these probability distributions of target size in different contexts accurately predicted the perceptual effects reported in psychophysical studies. We conclude that size contrast and assimilation effects are a further manifestation of a fundamentally probabilistic process of visual perception.
Body Localization in Still Images Using Hierarchical Models and Hybrid Search
Authors: Jiayong Zhang, Yanxi Liu, Jiebo Luo, Robert Collins
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a 3-level hierarchical model for localizing human bodies in still images from arbitrary viewpoints. We first fit a simple tree-structured model defined on a small landmark set along the body contours by Dynamic Programming (DP). The output is a series of proposal maps that encode the probabilities of partial body configurations. Next, we fit a mixture of view-dependent models by Sequential Monte Carlo (SMC), which handles self-occlusion, anthropometric constraints, and large viewpoint changes. DP and SMC are designed to search in opposite directions such that the DP proposals are utilized effectively to initialize and guide the SMC inference. This hybrid strategy of combining deterministic and stochastic search ensures both the robustness and efficiency of DP, and the accuracy of SMC. Finally, we fit an expanded mixture model with increased landmark density through local optimization. The model hierarchy is trained on a large number of gait images. Extensive tests on cluttered images with varying poses including walking, dancing and various types of sports activities demonstrate the feasibility of the proposed approach.
Design of RBF Neural Synchronous Controller with PID Compensation for a Class of Unknown Chaotic System
Authors: Xinyu Wang, Junwei Lei, Yigao Deng
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Adaptive neural robust controller was designed by using adaptive backstepping method for a class of unknown chaotic system which could be turned to "standard block control type". It was proved by constructing Lyapunov function step by step that all signals of the system are bounded and exponentially converge to the neighborhood of the origin globally. Finally, simulation study is given to demonstrate that the proposed method is effective and the known information of system was made use of as maximally as possible by introducing the PID control.
Mean value analysis for polling systems
Authors: E. M. Winands, I. J. Adan, G. J. Van Houtum
Venue: Queueing Systems: Theory and Applications (2006)

The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.
Individualization and Flexibility through Computer Algebra Systems in Virtual Laboratories
Authors: Sabina Jeschke, Thomas Richter
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Virtual labs enable field specific experiments and open them for collaborative and distributed usage. In order to realize comprehensive laboratory set-ups providing a scientific broadness and user adaptivity, several challenges regarding the integration of different software technologies have to be solved. We propose an eLearning framework consisting of a learner and a course model; exercises within this framework are supplemented by virtual laboratories and computer algebra systems. We discuss the potentials of this setup on the example of the laboratory VideoEasel and its interface to Maple.
Fusion Image Quality Appraisal Method of Dual-spectrum Night Vision Technology
Authors: Chuang Zhang, Lianfa Bai, Yi Zhang, Baomin Zhang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In dual-spectrum night vision technology, the fusion image quality is the key to appraise the fusion method. The target of dual-spectrum night vision technology is to enhance the definition of the scenery and the target identification probability, according to the above requirement, using the target identification probability, the signal to noise ratio and the new grayscale accrete matrix three methods to appraise the fusion images. The experimental targets are the fusion image of the low light level (LLL) image and the infrared image, the fusion image of the LLL image and the ultraviolet image, the fusion image of the LLL image and the laser assistant image and the fusion image of the dual-spectrum LLL images. The experimental results indicates the appraisal results of three fusion methods are consistently, specially the gray-scale accrete matrix technique can evaluate quantitatively image definition.
Content domain expertise in the learning community
Authors: Anthony J. Petrosino
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

As knowledge-centered educational learning environments become increasingly popular among proponents of sustained educational inquiry and reform [Collins, Greeno, & Resnick, 1994; CTGV, 1992; Magnusson & Palincsar, 1995; Scardamalia & Bereiter, 1994; Schauble, Glaser, Duschl, Schulze, & John, 1995], issues of the existing content domain knowledge of the classroom teacher arise. What depth can the average teacher be expected to have in any one specific domain when their training has been specifically aimed at making the teacher a generalist in a number of academic areas? Recently, a McDonnell Foundation implementation project entitled Schools For Thought [Lamon, Secules, Petrosino, Hackett, Bransford, and Goldman; in press] has been developed which incorporates a number of content domain experts in the field of science, literature, and mathematics to actively participate as a resource for both classroom teachers and students as curriculum and classroom activities are developed and utilized. As this bridge is forged between experts in the field (content experts) and experts in the classroom (teachers), the "real world" is being brought into traditional educational settings with exciting results. This paper will focus on the roles that have evolved concerning content experts in classrooms dedicated to a "learning community" model either in person (assisting teachers at weekly meetings, helping with assessment, presenting "benchmark" lessons in class) or on-line electronically (corresponding with the classroom community via electronic mail or "seeding" questions on local area networks).
A new cost function for adaptive beamforming using cyclostationary signal properties
Authors: L. Castedo, C.-Y. Tseng, L. J. Griffiths
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A new cost function is proposed for adaptive beamforming that exploits the property of cyclostationary signals to generate spectral lines by use of a particular class of nonlinear transformations. Analysis results are presented which demonstrate that the beamformer can extract the desired signal using only the information from the spectral lines. It is also shown that interference can be eliminated even when it exhibits the same cyclostationary properties as the desired signal. This new approach is particularly useful for continuous adaptive implementation since the optimal weights can be computed using a simple stochastic gradient algorithm.
An Improved Genetic Algorithm for Spatial Clustering
Authors: Dajun Dai, Tonny J. Oyana
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

This paper proposes a real-coded genetic algorithm (GA) with a new flexible gene structure for spatial clustering problems. The basic idea is to improve the solution quality and rate of cluster detection by employing flexible ellipses moving and shifting in all directions. Based on synthetic and real datasets, a performance test is conducted to evaluate the quality of the improvements in the proposed genetic algorithm. The result indicates configuration of the new gene structure and solution representation allows for full exploration of the solution spaces as well as provides better solution quality and cluster detection rates.
Securing the Borealis Data Stream Engine
Authors: Wolfgang Lindner, Jorg Meier
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

As data stream management systems (DSMSs) become more and more popular, there is an increasing need to protect such systems from adversaries. In this paper we present an approach to secure DSMSs. We propose a general security framework and an access control model to secure DSMSs. We implement our framework into an existing data stream management system and show that our approach not only works, by protecting the system from major security threats, but also has little impact on the overall system performance.
Autonomically Improving the Security and Robustness of Structured P2P Overlays
Authors: Gerald Kunzmann, Andreas Binzenhofer
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

Recent research efforts have shown that peer-topeer (p2p) mechanisms incorporate a potential that goes well beyond simple file sharing. Compared to the classic client-server architecture, these systems do not suffer from a single point of failure. However, there is still the danger that an adversary is able to attack a specific subpart of the system. This is especially true for structured p2p networks like Chord. A well targeted attack could cause disruptions in its global ring structure and result in severe performance degradations, loss of resources or major malfunctions. In this paper we introduce a self-protecting approach to prevent such disruptions before they actually happen. However, since it is practically impossible to avoid all failures and attacks, we also present selfrepairing algorithms, which are able to automatically detect disruptions and initiate appropriate countermeasures to reestablish the structure of the overlay.
Playing by the Rules
Authors: Charlene O'Hanlon
Venue: Queue (2006)

Some of my favorite childhood memories are of playing games with my sister&mdash;both structured games such as Monopoly or hopscotch and imagination-fueled games such as cops and robbers or roller derby girls (don&rsquo;t ask). Regardless of whether the game had established regulations, often our play would devolve into what I call Calvinball, a term coined in the comic strip Calvin and Hobbes referring to the act of making up the rules as you go along.
Socio-technical factors of practice transmission in an online creative tool community
Authors: Eric Cook, Stephanie D. Teasley, Mark Ackerman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Digital artists using modular visual production environments can now create highly customized creative tools such as virtual musical instruments, as well as readily sharing and reusing such tools. Aspects of this process both impede and support practice learning. This poster describes an ongoing case study analyzing the socio-technical factors influencing development and transmission of practice and informal learning within one example community, the users of Native Instrument's Reaktor&trade; software.
Improving the performance of I/O-intensive applications on clusters of workstations
Authors: Xiao Qin, Hong Jiang, Yifeng Zhu, David R. Swanson
Venue: Cluster Computing (2006)

Load balancing in a workstation-based cluster system has been investigated extensively, mainly focusing on the effective usage of global CPU and memory resources. However, if a significant portion of applications running in the system is I/O-intensive, traditional load balancing policies can cause system performance to decrease substantially. In this paper, two I/O-aware load-balancing schemes, referred to as IOCM and WAL-PM, are presented to improve the overall performance of a cluster system with a general and practical workload including I/O activities. The proposed schemes dynamically detect I/O load imbalance of nodes in a cluster, and determine whether to migrate some I/O load from overloaded nodes to other less- or under-loaded nodes. The current running jobs are eligible to be migrated in WAL-PM only if overall performance improves. Besides balancing I/O load, the scheme judiciously takes into account both CPU and memory load sharing in the system, thereby maintaining the same level of performance as existing schemes when I/O load is low or well balanced. Extensive trace-driven simulations for both synthetic and real I/O-intensive applications show that: (1) Compared with existing schemes that only consider CPU and memory, the proposed schemes improve the performance with respect to mean slowdown by up to a factor of 20; (2) When compared to the existing approaches that only consider I/O with non-preemptive job migrations, the proposed schemes achieve improvements in mean slowdown by up to a factor of 10; (3) Under CPU-memory intensive workloads, our scheme improves the performance over the existing approaches that only consider I/O by up to 47.5%.
Evaluation of Automatic Generation of an Instruction Set Simulator for Educational Use
Authors: Hideaki Yanagisawa, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

To develop an embedded system, in which processors are used, a skilled assembler is necessary. An instruction set simulator is essential for training assembly programming, and the preparation of a software development environment (such as simulator, assembler, disassembler, and compiler) for a new processor can put a great strain on processor developers. We have been developing C-DASH (C-like Design Automation Shell), a Hardware/Software codesign tool for processors that can generate an instruction set level simulator based on a CUI (Character User Interface). In this paper, we construct a GUI (Graphical User Interface) for a simulator and describe the utilization of the simulator for education. We used the simulator in classroom and evaluate the simulator.
Comparative factory analysis of standard FOUP capacities
Authors: Kranthi Mitra Adusumilli, Robert L. Wright
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Wafers in a 300-mm semiconductor fabrication facility are transported throughout the factory in carriers called front opening unified pods (FOUPs). Two standard capacities of FOUPs are 25 and 13 wafers. This paper describes a simulation study designed to compare the performance of a factory employing different FOUP capacities. The main performance measure considered is work-in-process (WIP) and the resulting cycle time. Batching policy, order arrival rate, average order size, the Automated Material Handling System (AMHS) and the number of batch tools largely effect the performance of the models. Most of the empirical results show that the 25-wafer FOUP capacity provides a lower WIP level in a moderately loaded semiconductor factory.
Opportunistic content distribution in an urban setting
Authors: Jérémie Leguay, Anders Lindgren, James Scott, Timur Friedman, Jon Crowcroft
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

This paper investigates the feasibility of a city-wide content distribution architecture composed of short range wireless access points. We look at how a target group of intermittently and partially connected mobile nodes can improve the diffusion of information within the group by leveraging fixed and mobile nodes that are exterior to the group. The fixed nodes are data sources, and the external mobile nodes are data relays, and we examine the trade off between the use of each in order to obtain high satisfaction within the target group, which consists of data sinks. We conducted an experiment in Cambridge, UK, to gather mobility traces that we used for the study of this content distribution architecture. In this scenario, the simple fact that members of the target group collaborate leads to a delivery ratio of 90%. In addition, the use of external mobile nodes to relay the information slightly increases the delivery ratio while significantly decreasing the delay.
Performing Verification and Validation for KT-OSS Development
Authors: Dae-Woo Kim, Hyun-Min Lim, Sang-Kon Lee
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

This paper describes verification and validation activities in KT-OSS (Korea Telecom Operations Supports System) development. In this paper, the verification and verification phases for KT-OSS development are based on the general software development lifecycle and add an additional phase to the lifecycle. To success KT-OSS development, we needed appropriate tests which focused on functionality, reliability, usability, efficiency in the development process of KT-OSS. This paper describes various tests performed in the KT-OSS development process and tests for maintaining the developed system according to the phases. And to control the quality for KT-OSS, we organized a testing & evaluation department which is independent from a development department. Through these testing activities, we have developed KT-OSS and released it successfully.
Web-Based Visualization of 3D Geospatial Data Using Java3D
Authors: Gobe Hobona, Philip James, David Fairbairn
Venue: IEEE Computer Graphics and Applications (2006)

Spatial database servers allow for the storage and access of 3D geospatial data using Open Geospatial Consortium standards. The Geospatial Database Online Visualization Environment (GeoDOVE) is a prototype 3D Web-based geographic information system that demonstrates how Java3D can reduce bandwidth and allow direct connectivity to spatially enabled database systems.
Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets
Authors: Lijuan Zhang, Alexander Thomasian
Venue: Proceedings of the 2nd international workshop on Computer vision meets databases (2005)

Similarity search implemented via k-Nearest-Neighbor (k-NN) queries is an extremely useful paradigm in content based image retrieval (CBIR), which is costly on high-dimensional indices due to the curse of dimensionality. We improve k-NN query processing by utilizing the double filtering effect of clustering and indexing on a persistent version of the Ordered-Partition tree (OP-tree) index, which is highly efficient in processing k-NN queries. The OP-tree is made persistent by writing it onto disk after serialization, i.e. arranging its nodes into contiguous memory locations, so that the high transfer rate of modern disk drives is exploited. We first report experimental results to optimize OP-tree parameters. We then compare OP-trees and sequential scans with options for the Karhunen-Lo&egrave;ve transform and Euclidean distance calculation. Comparisons against OMNI-based sequential scan are also reported. We finally compare a clustered and persistent version of the OP-tree against a clustered version of the SR-tree and the VA-File method. It is observed that the OP-tree index outperforms the other two methods and that the improvement increases with the number of dimensions.
Sketchy Illustrations for Presenting the Design of Interactive CSG
Venue: Proceedings of the conference on Information Visualization (2006)

communicate visual ideas and can be used to present and reconsider drafts and concepts in product design. This paper introduces a real-time illustration technique that sketches the design and spatial assembly of CSG models. The illustration technique generates a graphical decomposition of the CSG model into disjunctive layers to extract 1) the perceptually important edges that outline the model's outer and inner features and 2) the surface shading of the outer and inner faces. Then, the technique applies uncertainty to these layers to simulate a sketchy effect. Finally, the technique composes the sketched layers in depth-sorted order while ensuring a correct depth behavior in the frame buffer. Because the sketchy illustrations are frame-to-frame coherent, the technique can be used as a tool for interactive presentation and reconsideration of the design and spatial assembly of CSG models.
Generating scheduling constraints for discrete event dynamic systems
Authors: Wai Kin Chan, Lee W. Schruben
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In most scheduling literature, constraints are seemingly generated in an ad-hoc manner using intuitive arguments. This could result in overlooking some constraints or including unnecessary constraints. Schruben (2000) has shown how the dynamics of some discrete event systems can be modeled as the solutions of optimization programs. In this paper, we use this idea to generate mathematical programming models systematically for scheduling resources in discrete event dynamic systems. Two examples are presented: a multiple server queue and a semiconductor manufacturing cluster tool. An interesting result was that the mathematical structure of the scheduling program generated from a simulation of a cluster tool found in the literature leads to a different, more concise and illuminating cluster tool simulation model that would have been difficult to discover otherwise. The corresponding optimal scheduling problem is surprising in that it does not include explicit representation of the resource that is actually being scheduled!