ppxscal/embedding_network huggingface dataset:
Achieving seamless component composition through scenario-based deep adaptation and generation
Authors: Xiaodong Liu, Beihu Wang, Jon Kerridge
Venue: Science of Computer Programming (2005)

Mismatches between pre-qualified existing components and the particular reuse context in applications have been a major factor hindering component reusability and successful composition. Although component adaptation has acted as a key solution of eliminating these mismatches, deep adaptation is often either impossible or incurring heavy overheads in the components. This paper proposes an approach, namely Scenario-based dynamic component Adaptation and Generation (SAGA), to achieve deep adaptation with little code overhead through XML-based component specification, interrelated adaptation scenarios and corresponding component adaptation and generation.
Speculative Security Checks in Sandboxing Systems
Authors: Yoshihiro Oyama, Koichi Onoue, Akinori Yonezawa
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

Sandboxing systems are extremely useful for secure execution of untrusted applications. Many of the sandboxing systems proposed so far provide security by intercepting system calls invoked by an application and controlling their execution. However, a problem in existing sandboxing systems is the amount of overhead required for security checks performed after system call interceptions. In this paper, we propose a sandboxing system that executes speculative security checks. The proposed system predicts the behavior of a sandboxed application and executes speculative security checks in parallel with the application, thus reducing the overhead. Behavior is predicted based on system call profiles in past executions of the application. We implemented the system on Linux and made a preliminary evaluation.
Statistical estimation of link availability and its impact on routing in wireless ad hoc networks: Research Articles
Authors: A. Bruce McDonald, Taieb F. Znati
Venue: Wireless Communications Mobile Computing (2004)

In this paper, an analytical framework is developed and validated via simulation for statistical estimation of the evolution of the separation between a pair of mobile nodes in an ad hoc network. Simulation results demonstrate that path selection based on minimization of the product of the link statistic significantly outperforms minimum-hop and fixed threshold-based &lsquo;path-stability&rsquo; schemes. A hierarchical mobility model integrating the dynamic effects of velocity, group movement and geographic scope is used to generalize the results. Another significant result is the performance enhancements hold in large networks irregardless of the assumptions used for statistical estimation. The effect of merging many independent groups appears to restore independent mobility. Finally, results show that at the highest mobility levels, 90&percnt; of the longest surviving paths fail within 60&thinsp;s. None of the strategies approach this optimal value. This important result suggests that optimal predictive mechanisms alone are insufficient to ensure scalable routing in ad hoc networks. Copyright &copy; 2004 John Wiley & Sons, Ltd.
GRID Based Federated Digital Library
Authors: Kurt Maly, Mohammad Zubair, Vamshi Chilukamarri, Pratik Kothari
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

With the growing acceptance of the Open Archive Initiative (OAI) [16] framework, a number of digital libraries are becoming OAI compliant. This is making it feasible to build an effective federated digital library, which harvests metadata from the OAI-compliant libraries and provides a unified search service over the aggregated metadata. Arc [10] is an example of such a federated digital library. Assuming that a rapid increase (e.g., several orders of magnitude) in the adoption of OAI-PMH [16] occurs, we now have a different problem: how to efficiently discover, harvest and index the burgeoning OAI-PMH corpus. In this project, we are working on using Grid and cluster technology to address these performance issues. In this paper, we focus on the use of Grid for parallelizing the harvesting task for an OAI-based federated digital library. We propose a Grid-based architecture for parallel harvesting that supports: dynamic allocation of harvesting nodes, scheduling of harvesting tasks to maximize the performance, and uniform load distribution for the indexing node. We have implemented and evaluated the proposed architecture on a Grid based on the GT3 toolkit
Accurate Measurement of Multi-Tone Power Ratio (MTPR) of ADSL Devices Using Low Cost Testers
Authors: G. Srinivasan, S. Cherubal, P. Variyam, M. Teklu, C. P. Wang, D. Guidry, A. Chatterjee
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Measurement of Multi-Tone Power Ratio (MTPR) on the transmitter output of a central office ADSL analog front end device (AFE) poses stringent requirements on the linearity of the ATE digitizer. Cost of the ATE digitizer that can perform this test in a specification compliant manner is prohibitively high. In this paper, a test technique to perform TX MTPR test on a Central Office ADSL device using low-cost automatic test equipment (ATE) is proposed. The proposed technique is based on adding optimum dither noise to the output of the DUT, to improve the performance of the low cost ATE digitizer. The dither reduces the distortion caused by the static errors in the ATE digitizer by randomizing these nonlinear errors. Results obtained using the proposed method on ASDL AFE devices show an improvement of ~7dB in MTPR measurement with very good repeatability.
AFS&mdash;a secure distributed filesystem, Part III
Authors: Alf Wachsmann
Venue: Linux Journal (2005)

Reconfigure servers without changing mount points on the clients with this Kerberos-authenticated network filesystem.
Visualizing Very Large-Scale Earthquake Simulations
Authors: Kwan-Liu Ma, Aleksander Stompel, Jacobo Bielak, Omar Ghattas, Eui Joong Kim
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

This paper presents a parallel adaptive rendering algorithm and its performance for visualizing time-varying unstructured volume data generated from large-scale earthquake simulations. The objective is to visualize 3D seismic wave propagation generated from a 0.5 Hz simulation of the Northridge earthquake, which is the highest resolution volume visualization of an earthquake simulation performed to date. This scalable high-fidelity visualization solution we provide to the scientists allows them to explore in the temporal, spatial, and visualization domain of their data at high resolution. This new high resolution explorability, likely not presently available to most computational science groups, will help lead to many new insights. The performance study we have conducted on a massively parallel computer operated at the Pittsburgh Supercomputing Center helps direct our design of a simulation-time visualization strategy for the higher-resolution, 1Hz and 2 Hz, simulations.
Online learning of aggregate knowledge about non-linear preferences applied to negotiating prices and bundles
Authors: D. J. A. Somefun, T. B. Klos, J. A. La Poutré
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper, we consider a form of multi-issue negotiation where a shop negotiates both the contents and the price of bundles of goods with his customers. We present some key insights about, as well as a procedure for, locating mutually beneficial alternatives to the bundle currently under negotiation. The essence of our approach lies in combining aggregate (anonymous) knowledge of customer preferences with current data about the ongoing negotiation process.The developed procedure either works with already obtained aggregate knowledge or, in the absence of such knowledge, learns the relevant information online. We conduct computer experiments with simulated customers that have non-linear preferences. We show how, for various types of customers, with distinct negotiation heuristics, our procedure (with and without the necessary aggregate knowledge) increases the speed with which deals are reached, as well as the number and the Pareto efficiency of the deals reached compared to a benchmark.
Book review: Inside AutoCAD: The Complete AutoCad Guide,, by D. Raker and H. Rice (New Riders Publishing)
Venue: ACM SIGSMALL/PC Notes (1992)

Computer Aided Design (CAD) is one of the fastest growing areas of small system usage. Such programs operate in the area where 'workstations' and 'personal computers' overlap, and AutoCAD, from Autodesk, has been a best seller. Versions of AutoCAD run under MS-DOS, OS/2 and on UNIX environments. Inside AutoCAD is an extensive tutorial on this very large and capable drawing system. This edition features release 11, with references back to release 10. The fifth edition focuses on release 10.
An algorithm for model-based stable pupil detection for eye tracking system
Authors: Takeshi Takegami, Toshiyuki Gotoh, Ghen Ohyama
Venue: Systems and Computers in Japan (2004)

This paper considers eye images observed by a system such as an infrared eye-movement observation system in which the relative position of the head and camera is kept constant. A highly accurate detection method for the pupil image is proposed. Assuming that the eyeball has a spherical shape and the contour of the pupil is a circle, the pupil is observed as an ellipse accompanying movement of the eyeball. By accurately detecting this pupil image of elliptical shape, it is possible to detect the eye direction stably. Various methods of detecting an ellipse have been presented, and the Hough transform is one of these. The Hough transform has the feature that it is less affected by noise and occlusion. In the detection of ellipses in general, the number of degrees of freedom is represented by five parameters to be determined, which may produce problems of computational complexity and memory requirements. On the other hand, in order that the pupil may rotate around the eyeball center, the pupil image observed depends on a position and a direction from the eyeball center, without becoming general ellipse form. In this study, the above constraint is utilized, and an algorithm is discussed in which the pupil is detected with high accuracy based on the eyeball model. In the algorithm, the processing efficiency of the whole system is considered. In the algorithm, first, initial detection of the pupil is performed by ellipse fitting based on the edges in multiple observed images, and the parameters of the eyeball model are estimated on the basis of the results. Then, the Hough transform is applied on the basis of the estimated eyeball parameters, and the pupil contour is detected with high accuracy. The experimental results show that the accuracy and stability of pupil contour detection is improved, indicating that the proposed method is effective. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 21&ndash;31, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10544
Automatically building conceptual graphs using VerbNet and WordNet
Authors: Svetlana Hensman, John Dunnion
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

With the huge number of documents becoming available in electronic form, finding the right information in a large corpus is becoming an increasingly important and difficult task. We believe that semantic processing is required for accurate information retrieval.This paper describes a framework for the automatic creation of semantic markup and its insertion into XML documents. The availability of such semantic annotation would be of great help when the documents are queried, and, in particular, would facilitate the application of inference techniques, therefore allowing the system to deduce information not explicitly mentioned in the text.
Minimizing center key storage in hybrid one-way function based group key management with communication constraints
Authors: Mingyan Li, Radha Poovendran, David A. McGrew
Venue: Information Processing Letters (2005)

We study the problem of designing a storage efficient secure multicast key management scheme based on one-way function trees (OFT) for a prespecified key update communication overhead. Canetti, Malkin and Nissim presented a hybrid model that divides a group of N members into clusters of M members and assigns each cluster to one leaf node of a key, tree. Using the model, we formulate a constrained optimization problem to minimize the center storage in terms of the cluster size M. Due to the monotonicity of the center storage with respect to M, we convert the constrained optimization into a fixed point equation and derive the optimal M* explicitly. We show that the asymptotic value of the optimal M*, given as µ + a-1/logea loge µ with µ = O(log N) and a being the degree of a key tree, leads to the mini real storage as O (N/logN), when the update communication constraint is given as O(log N). We present an explicit design algorithm that achieves minimal center storage for a given update communication constraint.
The mechanics of trust: a framework for research and design
Authors: Jens Riegelsberger, M. Angela Sasse, John D. McCarthy
Venue: International Journal of Human-Computer Studies (2005)

With an increasing number of technologies supporting transactions over distance and replacing traditional forms of interaction, designing for trust in mediated interactions has become a key concern for researchers in human computer interaction (HCI). While much of this research focuses on increasing users' trust, we present a framework that shifts the perspective towards factors that support trustworthy behavior. In a second step, we analyze how the presence of these factors can be signalled. We argue that it is essential to take a systemic perspective for enabling well-placed trust and trustworthy behavior in the long term. For our analysis we draw on relevant research from sociology, economics, and psychology, as well as HCI. We identify contextual properties (motivation based on temporal, social, and institutional embeddedness) and the actor's intrinsic properties (ability, and motivation based on internalized norms and benevolence) that form the basis of trustworthy behavior. Our analysis provides a frame of reference for the design of studies on trust in technology-mediated interactions, as well as a guide for identifying trust requirements in design processes. We demonstrate the application of the framework in three scenarios: call centre interactions, B2C e-commerce, and voice-enabled on-line gaming.
A Novel Kernel Method for Clustering
Authors: Francesco Camastra
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Kernel Methods are algorithms that, by replacing the inner product with an appropriate positive definite function, implicitly perform a nonlinear mapping of the input data into a high-dimensional feature space. In this paper, we present a kernel method for clustering inspired by the classical K-Means algorithm in which each cluster is iteratively refined using a one-class Support Vector Machine. Our method, which can be easily implemented, compares favorably with respect to popular clustering algorithms, like K-Means, Neural Gas, and Self-Organizing Maps, on a synthetic data set and three UCI real data benchmarks (IRIS data, Wisconsin breast cancer database, Spam database).
Beyond Lambert: Reconstructing Specular Surfaces Using Color
Authors: Satya P. Mallick, Todd E. Zickler, David J. Kriegman, Peter N. Belhumeur
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a photometric stereo method for non-diffuse materials that does not require an explicit reflectance model or reference object. By computing a data-dependent rotation of RGB color space, we show that the specular reflection effects can be separated from the much simpler, diffuse (approximately Lambertian) reflection effects for surfaces that can be modeled with dichromatic reflectance. Images in this transformed color space are used to obtain photometric reconstructions that are independent of the specular reflectance. In contrast to other methods for highlight removal based on dichromatic color separation (e.g., color histogram analysis and/or polarization), we do not explicitly recover the specular and diffuse components of an image. Instead, we simply find a transformation of color space that yields more direct access to shape information. The method is purely local and is able to handle surfaces with arbitrary texture.
An EFSM-based approach for functional ATPG
Authors: Franco Fummi, Cristina Marconcini, Graziano Pravadelli
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents an EFSM-based approach for functional automatic test pattern generation (ATPG). It shows how a particular kind of extended FSM (EFSM) can be efficiently traversed by a pseudo-determinist ATPG to control and propagate faults for a functional description of a design. Functional ATPG on such EFSM models have been showed to be more efficient than the ATPG on the original design. However, test sequences generated on such an EFSM can lose their efficacy when simulated on the original description, since they may show some timing discrepancies. To solve this problem, this paper propose a strategy that manipulates the EFSM model.
Selective main memory compression by identifying program phase changes
Authors: Doron Nakar, Shlomo Weiss
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

During a program's runtime, the stack and data segments of the main memory often contain much redundancy, which makes them good candidates for compression. Compression and decompression however require either extra hardware or substantial processing resources. This paper presents a new approach in which a mostly software solution is suggested but without the processing power penalty that usually accompanies such a solution. This is achieved by not compressing all the memory all of the time. The suggested method is to identify the current working set and to leave it uncompressed for faster access. Pages that are not in the working set may be compressed during the CPU's idle time. Also, compression is only performed during phases which exhibit good spatial locality. These phases are identified by detecting changes in the program's working set. By comparing the current working set's "signature" with the signature at the end of the previous instruction window, a difference parameter is calculated and, when the difference is low enough, the program is in a phase that exhibits good locality and thus compression may begin. Simulation results confirm that this new approach to main memory compression provides good compression ratios for most SPEC CPU2000 programs.
Memorizable interactive proof and zero-knowledge proof systems
Authors: Ning Chen, Jia-Wei Rong
Venue: Journal of Computer Science and Technology (2004)

Interactive proof and zero-knowledge proof systems are two important concepts in cryptography and complexity theory. In the past two decades, a great number of interactive proof and zero-knowledge proof protocols have been designed and applied in practice. In this paper, a simple memorizable zero-knowledge protocol is proposed for graph non-isomorphism problem, based on the memorizable interactive proof system, which is extended from the original definition of interactive proof and is more applicable in reality.
Book reivew: LOGIC PROGRAMMING: FUNCTIONS, RELATIONS AND EQUATIONS. Edited by Doug DeGroot and Gary Lindstrom (Prentice-Hall)
Venue: Issue 101 (July 1987) (1987)

This is an advanced monograph in Combinatorics dealing with what quite often is called "Hungarian" combinatorics; hypergraphs, set systems, etc. Presently, the connections of this part of Combinatorics to Artificial Intelligence and Databases are rather loose, the only application that comes to mind are topics related to cyclic and acyclic databases. Hence we should pose to ourselves the following question: is it worth it (from the professional point of view, of course) to read such books at all and is it worth it, in particular, to review them in a specialized bulletin like SIGART news? Generally the answer to both questions is, in the opinion of this reviewer, negative. Let us point out however that the combinatorics treated in Bollobas book is very interesting and sometimes stunning in its beauty. I wish programs (like AM, Eurisco, etc.) were able to produce such estetic results. For a moment, though, we have no hope of building programs mimicking inventiveness of mathematicians and, finally I do not expect to see such programs written during my lifespan.
On Learning about Learning
Authors: David M. W. Powers
Venue: ACM SIGART Bulletin (1992)

Learning is being increasingly recognized as a central characteristic of intelligence, and hence of artificial intelligence. Similarly adaptivity, dynamism and integration are becoming catch-cries in the computer industry generally, and learning is in various senses involved here too, whether or not the label AI is attached.
Stability of persistence diagrams
Authors: David Cohen-Steiner, Herbert Edelsbrunner, John Harer
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram is stable: small changes in the function imply only small changes in the diagram. We apply this result to estimating the homology of sets in a metric space and to comparing and classifying geometric shapes.
Mitigating the paucity-of-data problem: exploring the effect of training corpus size on classifier performance for natural language processing
Authors: Michele Banko, Eric Brill
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper, we discuss experiments applying machine learning techniques to the task of confusion set disambiguation, using three orders of magnitude more training data than has previously been used for any disambiguation-in-string-context problem. In an attempt to determine when current learning methods will cease to benefit from additional training data, we analyze residual errors made by learners when issues of sparse data have been significantly mitigated. Finally, in the context of our results, we discuss possible directions for the empirical natural language research community.
Fluid integration of rotation and translation
Authors: Russell Kruger, Sheelagh Carpendale, Stacey D. Scott, Anthony Tang
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Previous research has shown that rotation and orientation of items plays three major roles during collaboration: comprehension, coordination and communication. Based on these roles of orientation and advice from kinesiology research, we have designed the Rotate'N Translate (RNT) interaction mechanism, which provides integrated control of rotation and translation using only a single touch-point for input. We present an empirical evaluation comparing RNT to a common rotation mechanism that separates control of rotation and translation. Results of this study indicate RNT is more efficient than the separate mechanism and better supports the comprehension, coordination and communication roles of orientation.