ppxscal/embedding_network huggingface dataset:
Global namespace for files
Authors: O. T. Anderson, L. Luan, C. Everhart, M. Pereira, R. Sarkar, J. Xu
Venue: IBM Systems Journal (2004)

We propose a name service that enables construction of a uniform, global, hierarchical namespace, a key feature needed to create a file-system grid. Combined with other grid replication and location-lookup mechanisms, it supports independence of position for users and applications as well as transparency of data location in a scalable and secure fashion. This name service enables federation of individual files as well as file-system trees that are exported by a variety of distributed file systems and is extensible to include nonfile-system data such as databases or live data feeds. Such a federated namespace for files can be rendered by network file servers, such as NFS (Network File System) or CIFS (Common Internet File System) servers, proxies supporting the NAS (network-attached storage) protocol, or grid data service interfaces. File access proxies, which handle protocol translation, can also include caching and replication support to enhance data access performance. A uniform namespace with global scope and hierarchical ownership allows sharing file data between and within organizations without compromising security or autonomy.
Panoptes: scalable low-power video sensor networking technologies
Authors: Wu-Chi Feng, Ed Kaiser, Wu Chang Feng, Mikael Le Baillif
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2005)

Video-based sensor networks can provide important visual information in a number of applications including: environmental monitoring, health care, emergency response, and video security. This article describes the Panoptes video-based sensor networking architecture, including its design, implementation, and performance. We describe two video sensor platforms that can deliver high-quality video over 802.11 networks with a power requirement less than 5 watts. In addition, we describe the streaming and prioritization mechanisms that we have designed to allow it to survive long-periods of disconnected operation. Finally, we describe a sample application and bitmapping algorithm that we have implemented to show the usefulness of our platform. Our experiments include an in-depth analysis of the bottlenecks within the system as well as power measurements for the various components of the system.
Remote collaboration on desk-sized displays: Research Articles
Authors: Mark Ashdown, Peter Robinson
Venue: Computer Animation and Virtual Worlds (2005)

Work on remote collaboration has often focused on the person space created by a conventional videoconference where the participants see each other's faces, but we argue that a task space containing shared visual information is more important for most tasks. Trends in display technology mean that large visual task spaces can be created to maximize the shared context between collaborators. We have created a system called the Escritoire that presents users with a desk-sized projected display with bimanual input that allows documents and images to be arranged and modified by multiple remote collaborators. We describe the software architecture, the protocol that is used between the client and server programs, and the pen traces we have added to allow participants to gesture to each other in the large visual space to enrich their communication. Our user trials have shown that participants were able to use the system with a minimum of training, and found the traces useful in the collaborative setting. In future we will be connecting three or more sites together to explore the issues that arise with multi-party interaction on large shared desks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Feature construction for reduction of tabular knowledge-based systems
Authors: Selwyn Piramuthu
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Tabular knowledge-based systems are known to be extremely versatile for verification and validation of knowledge bases. However, a major disadvantage of these systems is the combinatorial explosion that accompanies addition of new attributes or condition entries in the table. One of the means of alleviating this problem in tabular knowledge-based systems is through modularization, which is the process of breaking a big comprehensive table into smaller tables that are easy to deal with. In this study, we propose and illustrate another means to deal with this problem through use of feature construction methodology. The proposed method can be used synergistically with modularization to alleviate problems associated with combinatorial explosion in tabular knowledge bases.
Document classification through interactive supervision of document and term labels
Authors: Shantanu Godbole, Abhay Harpale, Sunita Sarawagi, Soumen Chakrabarti
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Effective incorporation of human expertise, while exerting a low cognitive load, is a critical aspect of real-life text classification applications that is not adequately addressed by batch-supervised high-accuracy learners. Standard text classifiers are supervised in only one way: assigning labels to whole documents. They are thus deprived of the enormous wisdom that humans carry about the significance of words and phrases in context. We present HIClass, an interactive and exploratory labeling package that actively collects user opinion on feature representations and choices, as well as whole-document labels, while minimizing redundancy in the input sought. Preliminary experience suggests that, starting with essentially an unlabeled corpus, very little cognitive labor suffices to set up a labeled collection on which standard classifiers perform well.
Reflectance from Images: A Model-Based Approach for Human Faces
Authors: Martin Fuchs Volker Blanz
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

In this paper, we present an image-based framework that acquires the reflectance properties of a human face. A range scan of the face is not required. Based on a morphable face model, the system estimates the 3D shape and establishes point-to-point correspondence across images taken from different viewpoints and across different individuals' faces. This provides a common parameterization of all reconstructed surfaces that can be used to compare and transfer BRDF data between different faces. Shape estimation from images compensates deformations of the face during the measurement process, such as facial expressions. In the common parameterization, regions of homogeneous materials on the face surface can be defined a priori. We apply analytical BRDF models to express the reflectance properties of each region and we estimate their parameters in a least-squares fit from the image data. For each of the surface points, the diffuse component of the BRDF is locally refined, which provides high detail. We present results for multiple analytical BRDF models, rendered at novel orientations and lighting conditions.
Rotation tests
Authors: Øyvind Langsrud
Venue: Statistics and Computing (2005)

This paper describes a generalised framework for doing Monte Carlo tests in multivariate linear regression. The rotation methodology assumes multivariate normality and is a true generalisation of the classical multivariate tests--any imaginable test statistic is allowed. The generalised test statistics are dependent on the unknown covariance matrix. Rotation testing handles this problem by conditioning on sufficient statistics.Compared to permutation tests, we replace permutations by proper random rotations. Permutation tests avoid the multinormal assumption, but they are limited to relatively simple models. On the other hand, a rotation test can, in particular, be applied to any multivariate generalisation of the univariate F-test.As an important application, a detailed description of how each single response p-value can be non-conservatively adjusted for multiplicity is given. This method is exact and non-conservative (unlike Bonferroni), and it is a generalisation of the ordinary F-test (except for the computation by simulations). Hence, this paper offers an exact Monte Carlo solution to a classical problem of multiple testing.
Run-time performance management of the Siena publish/subscribe middleware
Authors: Mauro Caporuscio, Antinisca Di Marco, Paola Inverardi
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Recently, growing attention is focused on run-time management of Quality of Service (QoS) of complex software systems. In this context, self-adaptation of applications, based on runtime monitoring and dynamic reconfiguration, is considered a useful technique to manage/negotiate QoS. Several defined approaches to dynamic performance management propose the use of on-line model-based evaluation of the managed application in order to choose the new application configuration for improving the QoS. In a previous work we defined a methodology to manage performance of soft-ware system at run-time based on model-based performance evaluation. To avoid unnecessary details the performance model represents the managed application at the Software Architecture level. In this work we apply and implement this approach to dynamic manage the performance of the SIENA publish/subscribe event notification service.
A New Static Differential CMOS Logic with Superior Low Power Performance
Authors: Muhammad E. Elrabaa
Venue: Analog Integrated Circuits and Signal Processing (2005)

A new differential static CMOS logic (DSCL) family is devised. The new circuit is fully static, making it simple to design. The circuit topology of the DSCL and its operation is explained. Delay optimization of the new circuits was performed. It showed the fully static behavior of these circuits. Their performance in terms of delay, power, and area is compared to that of conventional static differential logic and dynamic differential logic. Spice simulations using a 0.18 ¿m technology with a power supply of 1.8 V was utilized to evaluate the performance of the three circuits. Two different sets of simulations were carried out; one with equal input capacitances of all circuits and another with equal circuit delays. For each design, all circuits were optimized for minimum delay. It is shown that at equal input capacitance, the DSCL achieved 40% less delay than the DCVSL at one third the power. Also, at equal delay, the DSCL achieved 20% of the power dissipation of the DCVSL and 78% of the DDCVSL making it the most energy-efficient among the three circuits.
Term identification in the biomedical literature
Authors: Michael Krauthammer, Goran Nenadic
Venue: Journal of Biomedical Informatics (2004)

Sophisticated information technologies are needed for effective data acquisition and integration from a growing body of the biomedical literature. Successful term identification is key to getting access to the stored literature information, as it is the terms (and their relationships) that convey knowledge across scientific articles. Due to the complexities of a dynamically changing biomedical terminology, term identification has been recognized as the current bottleneck in text mining, and--as a consequence--has become an important research topic both in natural language processing and biomedical communities. This article overviews state-of-the-art approaches in term identification. The process of identifying terms is analysed through three steps: term recognition, term classification, and term mapping. For each step, main approaches and general trends, along with the major problems, are discussed. By assessing previous work in context of the overall term identification process, the review also tries to delineate needs for future work in the field.
Adding tuples to Java: a study in lightweight data structures: Research Articles
Authors: C. van Reeuwijk, H. J. Sips
Venue: Concurrency and Computation: Practice Experience (2005)

Java classes are very flexible, but this comes at a price. The main cost is that every class instance must be dynamically allocated. Also, their access by reference introduces pointer de-references and complicates program analysis. These costs are particularly burdensome for small, ubiquitous data structures such as coordinates and state vectors. For such data structures a lightweight representation is desirable, allowing such data to be handled directly, similar to primitive types. A number of proposals introduce restricted or mutated variants of standard Java classes that could serve as lightweight representation, but the impact of these proposals has never been studied. Since we have implemented a Java compiler with lightweight data structures we are in a good position to do this evaluation. Our lightweight data structures are tuples. As we will show, using tuples can result in significant performance gains: for a number of existing benchmark programs we gain more than 50&percnt; in performance relative to our own compiler, and more than 20&percnt; relative to Sun's Hotspot 1.4 compiler. We expect similar performance gains for other implementations of lightweight data structures. With respect to the expressiveness of Java, lightweight variants of standard Java classes have little impact. In contrast, tuples add a different language construct that, as we will show, can lead to substantially more concise program code. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Benchmarking the CLI for I/O-Intensive Computing
Authors: Xiao Qin, Tao Xie, Ahalya Nathan, Vijaya K. Tadepalli
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

Common Language Infrastructure, or CLI, is a standardized virtual machine, which increasingly becomes popular on a wide range of platforms. In this paper we developed three I/O-intensive benchmarks for the CLI using various techniques. The first benchmark is designed in accordance with an application behavioural model that rebuilds the behavior of real world I/O-intensive applications. The second benchmark is a trace driven simulator that simulates five I/O-intensive applications. The third benchmark is a micro I/O-Intensive benchmark used to emulate a simple web server. In addition, the performances of the benchmarks are evaluated on the SSCLI. The results suggest that the CLI is a potential virtualmachine for I/O-intensive computing.
Purpose based access control of complex data for privacy protection
Authors: Ji-Won Byun, Elisa Bertino, Ninghui Li
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently proposed a privacy preserving access control model for relational databases,where purpose information associated with a given data element specifies the intended use of the data element. In this paper, we extend our previous work to handle other advanced data managementsystems, such as the ones based on XML and the ones based on the object-relational data model. Another contribution of our paper isthat we address the problem of how to determine the purpose forwhich certain data are accessed by a given user. Our proposedsolution relies on the well-known RBAC model as well as the notionof conditional role which is based on the notions of role attributeand system attribute.
A Haptic Interaction Technique for Volume Images Based on Gradient Diffusion
Authors: Erik Vidholm, Ingela Nystrom
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The manual step in semi-automatic segmentation of medical volume images typically involves initialization procedures such as placement of seed-points or positioning of surface models inside the object to be segmented. The initialization is then used as input to an automatic algorithm. We investigate how such initialization tasks can be facilitated by using haptic feedback. This paper describes a haptic interaction technique based on gradient vector flow (GVF) that allows a user to stay centered inside the object while still feeling the object boundaries. Our method is not limited to elongated structures, which is a common restriction for other approaches. Initial tests of the method shows encouraging results for differently shaped objects.
Integrating Boolean and vector models of information retrieval with passage retrieval
Authors: Michel Beigbeder
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

In the context of information retrieval, we propose here to merge in a single mathematical framework: the Boolean model, the vector space model, and passage retrieval in a single mathematical framework based on signal theory. In this framework, we define the weight wd,t of the term t in the document d not as a number, but as a function.
Analyzing unidentified locked-joint failures in kinematically redundant manipulators
Authors: Manish Goel, Anthony A. Maciejewski, Venkataramanan Balakrishnan
Venue: Journal of Robotic Systems (2005)

Robots are frequently used for operations in hostile environments. The very nature of these environments, however, increases the likelihood of robot failures. Common failure-tolerance techniques rely on effective failure detection and identification. Since a failure may not always be successfully identified, or, even if identified, may not be identified soon enough, it becomes important to consider the behavior of manipulators with unidentified failures. This work investigates the behavior of robots experiencing unidentified locked-joint failures in a general class of tasks characterized by point-to-point motion. Based on the analysis, a procedure for workspace evaluation is developed that allows for the identification of regions in the manipulator's workspace in which tasks may be completed even with such failures. &copy; 2005 Wiley Periodicals, Inc.
Interconnect capacitance extraction for system LCD circuits
Authors: Yoshihiro Uchida, Sadahiro Tani, Masanori Hashimoto, Shuji Tsukiyama, Isao Shirakawa
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper discusses interconnect capacitance extraction for system LCD circuits, where coupling capacitance is much significant since a ground plane locates far away unlike LSI interconnects. We focus on a pattern matching method with interpolation to implement an accurate and efficient capacitance extraction system, and present good implementations that are suitable for system LCD circuits. To reduce computational cost, interconnect structures are spatially divided into several sub-regions considering capacitance coupling range, and analyzed in each sub-region using a capacitance database pre-characterized by a 3-D field solver. This paper evaluates tradeoff curves between characterization cost and extraction accuracy for four division methods in lattice structures that are basic and common structures in LCD driver circuits. Experimental results reveal efficient division methods for accurate capacitance extraction.
Power-conserving computation of order-statistics over sensor networks
Authors: Michael B. Greenwald, Sanjeev Khanna
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We study the problem of power-conserving computation of order statistics in sensor networks. Significant power-reducing optimizations have been devised for computing simple aggregate queries such as COUNT, AVERAGE, or MAX over sensor networks. In contrast, aggregate queries such as MEDIAN have seen little progress over the brute force approach of forwarding all data to a central server. Moreover, battery life of current sensors seems largely determined by communication costs --- therefore we aim to minimize the number of bytes transmitted. Unoptimized aggregate queries typically impose extremely high power consumption on a subset of sensors located near the server. Metrics such as total communication cost underestimate the penalty of such imbalance: network lifetime may be dominated by the worst-case replacement time for depleted batteries.In this paper, we design the first algorithms for computing order-statistics such that power consumption is balanced across the entire network. Our first main result is a distributed algorithm to compute an &epsilon;-approximate quantile summary of the sensor data such that each sensor transmits only O(log2 n/&epsilon;) data values, irrespective of the network topology, an improvement over the current worst-case behavior of &Omega;(n). Second, we show an improved result when the height, h, of the network is significantly smaller than n. Our third result is that we can exactly compute any order statistic (e.g., median) in a distributed manner such that each sensor needs to transmit O(log3 n) values.Further, we design the aggregates used by our algorithms to be decomposable. An aggregate Q over a set S is decomposable if there exists a function, f, such that for all S = S1 &cup; S2, Q(S) = f(Q(S1), Q(S2)). We can thus directly apply existing optimizations to decomposable aggregates that increase error-resilience and reduce communication cost.Finally, we validate our results empirically, through simulation. When we compute the median exactly, we show that, even for moderate size networks, the worst communication cost for any single node is several times smaller than the corresponding cost in prior median algorithms. We show similar cost reductions when computing approximate order-statistic summaries with guaranteed precision. In all cases, our total communication cost over the entire network is smaller than or equal to the total cost of prior algorithms.
Book review: The Big Mac Book by: Neil J. Salkind (Que Corporation 1989)
Venue: ACM SIGSMALL/PC Notes (1991)

When given the opportunity to review The Big Mac Book, I was exited at the possibility of picking up bits and pieces of information that I had not known before. Unfortunately, I was somewhat disappointed when I finished reading the almost-1000 page tome at what little information I had actually picked up. 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
Impact of channel conditions on the throughput optimization in 802.11 DCF: Research Articles
Authors: Xiaodong Wang, Jun Yin, Dharma P. Agrawal
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we evaluate the impact of transmission error rate on the contention and the system throughput in IEEE 802.11 DCF. We identify the trade-off between the desire to reduce the ratio of overhead in the data packet by adopting larger packet size and the need to reduce the packet error rate by using smaller packet length. Meanwhile, we provide a novel approach to model the different channel conditions incurred by different nodes. This work has applications in performance optimization by establishing trade-offs between transmission error rate and transmission power, modulation, coding scheme, packet size. Our results substantiate the intuition that in a contention-based system like 802.11 DCF, the channel variation of any single node in the system not only impacts the throughput of itself, but also affects the throughput of other nodes and the system throughput. Our work shows that to achieve maximum optimization of the throughput, the channel conditions of all the nodes in the system have to be taken into account. Otherwise the optimization is suboptimal. Copyright &copy; 2005 John Wiley & Sons, Ltd.