ppxscal/embedding_network huggingface dataset:
The spatial conservative congruence transformation for manipulator stiffness modeling with coordinate and noncoordinate bases
Authors: Shih-Feng Chen
Venue: Journal of Robotic Systems (2005)

This paper presents systematic methods to approach the spatial conservative congruence transformation (SCCT) and applies it to the stiffness transformation and matrices of robotic systems via the strategy of changing basis. Through geometrical analysis, the realization of the Cartesian stiffness of manipulators is shown to be basis dependent. We illustrate that the SCCT is conservative as well as directly represents the spatial stiffness mapping relationship for robotic stiffness control. Examples of the serial manipulators are given to help one to better understand the source of the asymmetric 6&times;6 Cartesian stiffness matrix in the presence of external loads using the SCCT algorithm. The SCCT suggests an explicit and generalized stiffness transformation relationship for robotic systems. &copy; 2005 Wiley Periodicals, Inc. 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
Blending E-Commerce Theory and Application
Authors: Violetta Galant
Venue: IEEE Distributed Systems Online (2005)

A review of Data Warehousing and Business Intelligence for E-Commerce, by Alan R. Simon and Steven L. Shaffer.
A way-halting cache for low-energy high-performance systems
Authors: Chuanjun Zhang, Frank Vahid, Jun Yang, Walid Najjar
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2005)

Caches contribute to much of a microprocessor system's power and energy consumption. Numerous new cache architectures, such as phased, pseudo-set-associative, way predicting, reactive-associative, way-shutdown, way-concatenating, and highly-associative, are intended to reduce power and/or energy, but they all impose some performance overhead. We have developed a new cache architecture, called a way-halting cache, that reduces energy further than previously mentioned architectures, while imposing no performance overhead. Our way-halting cache is a four-way set-associative cache that stores the four lowest-order bits of all ways' tags into a fully associative memory, which we call the halt tag array. The lookup in the halt tag array is done in parallel with, and is no slower than, the set-index decoding. The halt tag array predetermines which tags cannot match due to their low-order 4 bits mismatching. Further accesses to ways with known mismatching tags are then halted, thus saving power. Our halt tag array has an additional feature of using static logic only, rather than dynamic logic used in highly associative caches, making our cache simpler to design with existing tools. We provide data from experiments on 29 benchmarks drawn from Powerstone, Mediabench, and Spec 2000, based on our layouts in 0.18 micron CMOS technology. On average, we obtained 55&percnt; savings of memory-access related energy over a conventional four-way set-associative cache. We show that savings are greater than previous methods, and nearly twice that of highly associative caches, while imposing no performance overhead and only 2&percnt; cache area overhead.
A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation
Authors: H. Edwin Romeijn, Ravindra K. Ahuja, James F. Dempsey, Arvind Kumar
Venue: SIAM Journal on Optimization (2005)

This paper considers the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient. This radiation kills both cancerous and normal cells, so the radiation therapy must be carefully planned to deliver a clinically prescribed dose to certain targets while sparing nearby organs and tissues. Currently, a technique called intensity modulated radiation therapy (IMRT) is considered to be the most effective radiation therapy for many forms of cancer. In IMRT, the patient is irradiated from several different directions. From each direction, one or more irregularly shaped radiation beams of uniform intensity are used to deliver the treatment. This paper deals with the problem of designing a treatment plan for IMRT that determines an optimal set of such shapes (called apertures) and their corresponding intensities. This is in contrast with established two-stage approaches where, in the first phase, each radiation beam is viewed as consisting of a set of individual beamlets, each with its own intensity. A second phase is then needed to approximate and decompose the optimal intensity profile into a set of apertures with corresponding intensities. The problem is formulated as a large-scale convex programming problem, and a column generation approach to deal with its dimensionality is developed. The associated pricing problem determines, in each iteration, one or more apertures to be added to our problem. Several variants of this pricing problem are discussed, each corresponding to a particular set of constraints that the apertures must satisfy in one or more of the currently available types of commercial IMRT equipment. Polynomial-time algorithms are presented for solving each of these variants of the pricing problem to optimality. Finally, the effectiveness of our approach is demonstrated on clinical data.
A framework for determining necessary query set sizes to evaluate web search effectiveness
Authors: Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, Abdur Chowdhury
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a given size. To validate this framework, we have constructed and made available a precision-oriented test collection consisting of manual binary relevance judgments for each of the top ten results of ten web search engines across 896 queries and the single best result for each of those queries. Results from this bootstrapping approach over typical query set sizes indicate that examining repeated statistical tests is imperative, as a single test is quite likely to find significant differences that do not necessarily generalize. We also find that the number of queries needed for a repeatable evaluation in a dynamic environment such as the web is much higher than previously studied.
System level design language extensions for timed/untimed digital-analog combined system design
Authors: Yu Liu, Thanyapat Sakunkonchak, Satoshi Komatsu, Masahiro Fujita
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Recently, System Level Design Languages (SLDL) which can describe both hardware and software aspects of the design are getting attentions. Mixed-signal extensions of SLDL enable current discrete-oriented SLDL to describe and simulate not only digital systems but also Digital-Analog mixed-signal systems. The synchronization between discrete and continuous system is wildly regarded as a critical part in the extensions. In this paper, we present an event-driven synchronization approach for both timed and untimed system-level designs through which discrete and continuous time systems are synchronized via Analog-Digital(AD) events and Digital-Analog(DA) events. We also demonstrate how the synchronization method can be incorporated into SLDL, such as SpecC[4]'s simulation kernel. In the extended kernel, a new simulation cycle, AD time cycle is introduced. A preliminary evaluation on a spike-based current mode ADC[8] with CNT-based continuous description shows that the extended kernel works well under the timed/untimed system-level description.
SSI-OSCAR: A Cluster Distribution for High Performance Computing Using a Single System Image
Authors: Geoffroy Vallee, Stephen L. Scott, Christine Morin, Jean-Yves Berthou, Hugues Prisker
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The ease use and management of clusters needs tools to install, update and transparently manage distributed clusters resources. The management of clusters (node installations and updates) is a well-known problem and some high performance computing specific distributions are available today. These distributions, like OSCAR, allow users to install and manage clusters without specialized knowledge, allowing quick cluster deployment. The ease use of cluster is possible globally and transparently managing cluster resources. Single System Image (SSI) has this approach and some projects provide a SSI for Linux clusters. But today, there is no solution combining these two advantages: integration of a SSI and a distribution for high performance computing on Linux clusters. This paper presents SSI-OSCAR which aims at providing such a solution, combining OSCAR and the Kerrighed SSI.
The Impact of Technology on Relationships within Organizations
Authors: Bonnie Rubenstein Montano, Robin Dillon
Venue: Information Technology and Management (2005)

While much research has been undertaken to examine how technology impacts individuals and groups in organizations, as well as how it impacts organizations in their entirety, attention has not been directed at how technology impacts the relationships between these different levels in an organization--individual, group, and organization-wide. This paper seeks to address this void. Specifically, a grounded theory approach is used to begin development of a theory for how technology impacts these relationships. Based on a semi-structured survey, the resultant model is presented. Eight technology variables are identified in the model as responsible for impacting the relationships between the different levels of an organization. As a first foray into this area, the findings in this paper can serve as the foundation for further theory development and empirical testing.
A web service for solving queuing network models using PMIF
Authors: Jerònia Rosselló, Catalina M. Lladó, Ramon Puigjaner, Connie U. Smith
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

A performance model interchange format (PMIF) is a common representation for queuing network model data that can be used to move models among modeling tools. This paper demonstrates how Web services can be used to facilitate the use of modeling tools that can interface with the PMIF. The paper describes the design and implementation of a PMIF Web service for the modeling tool Qnap. Additionally, it shows experimental results that prove the viability of such a Web service.
Mozilla accessibility on Unix/Linux
Authors: Louie Zhao, Jay Yan, Kyle Yuan
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Web Accessibility (Ally) has been developed in recent years. Till recent days, no web browser on Unix/Linux has Ally support. This means the powerful Unix and the free Linux operating system is unusable by the disabled. People who had a computer, but could not afford $500 for Microsoft Windows, were unable to use his computer. This was the problem we were trying to address by adding Ally support into Mozilla on Unix/Linux. Mozilla was chosen because it's the most important open source cross-platform web browser and the dominant web browser on Unix/Linux. Although Mozilla is designed to be cross-platform, Ally support is platform-specific. This paper addresses how we solved the problem of architecting Ally support for Mozilla on Unix/Linux.
Estimating the eye gaze from one eye
Authors: Jian-Gang Wang, Eric Sung, Ronda Venkateswarlu
Venue: Computer Vision and Image Understanding (2005)

Eye gaze estimation via images has been well investigated and all methods worked on images with the full face. This makes the eye details small and accuracy is affected. We address this problem by zooming in on a single eye. In this paper, we will show the validity of the method and investigate the performance with controlled synthetic data and also with real images. The principle is to rely on the fact that the outer boundary of the iris is a circle. With a fully calibrated camera, its elliptical image can be back-projected into the 3D space yielding two possible circles. To disambiguate, the solution is found by making use of anthropomorphic knowledge of the structure of the eyeball. Hence, getting a larger eye image with a zoom camera enabled us to achieve higher resolutions and thereby higher accuracies. The robustness of the algorithm was verified by extensive statistical trials conducted on synthetic data and real images. The two key contributions in this paper are to show that it is possible to estimate eye gaze with only one eye image and that consequently this achieves higher accuracy of eye gaze estimation.
Bibliographic component extraction from references based on a text recognition error model
Authors: Atsuhiro Takasu, Kenro Aihara
Venue: Systems and Computers in Japan (2005)

Citation linkage is important for information retrieval and navigation in digital libraries. This paper proposes a novel method to extract bibliographic components from reference strings obtained from scanned document images. The proposed method uses an extended hidden Markov model representing both OCR error patterns and the syntactical structure of references simultaneously. Rule-based systems usually have difficulty in obtaining rules. The proposed method gives a solution to this problem by parameter estimation of the model from training data. We applied the proposed method to references obtained by OCR with a large bibliographic database, and achieved about 90&percnt; extraction accuracy. Furthermore, the error analysis shows that the proposed method can find the approximate position of bibliographic components in the reference with very high accuracy. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 13&ndash;22, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20323
Continuous Consistency Management in Distributed Real-Time Databases with Multiple Writers of Replicated Data
Authors: Sanny Gustavsson, Sten F. Andler
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

We introduce a continuous convergence protocol for handling locally committed and possibly conflicting updates to replicated data. The protocol supports local consistency and predictability while allowing replicas to deterministically diverge and converge as updates are committed and replicated. We discuss how applications may exploit the protocol characteristics and describe an implementation where conflicting updates are detected, qualified by a partial update order, and resolved using application-specific forward conflict resolution.
Diagnosability of star graphs under the comparison diagnosis model
Authors: Jun Zheng, Shahram Latifi, Emma Regentova, Kai Luo, Xiaolong Wu
Venue: Information Processing Letters (2005)

In this paper, the diagnosability of n-dimensional star graph Sn under the comparison diagnosis model has been studied. It is proved that Sn is (n - 1)-diagnosable under the comparison diagnosis model when n ≥ 4.
A development framework for value-centred design
Authors: Gilbert Cockton
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

HCI's focus has shifted from the system, via the user, to the context of use. All are necessary but not sufficient for effective interactive systems design, which requires a 'fourth' value-centred focus. System-, user- and context-centred HCI must be co?ordinated within a value?centred framework with four main processes: opportunity identification, design, evaluation and iteration. The latter two are separate, since iteration requires skills and knowledge beyond those typically available to evaluators. Value-centred development adds new activities and artifacts to existing development methodologies. Opportunity identification has the goal of stating the intended value for a digital product or service. Value delivery scenarios refocus design on value in the world, as does value impact analysis for evaluation. The co?ordination of existing and new HCI activities within a value-centred framework is outlined using examples from an ongoing design project.
Design of a linear system using a simplified plant model
Authors: O. F. Opeiko
Venue: Automation and Remote Control (2005)

A method of designing a linear system by reducing the order of the plant model in compliance with the system performance index was proposed and applied to the continuous linear control system.
An efficient approach for computing non-Gaussian ARMA model coefficients using Pisarenko's method: Research Articles
Authors: Adnan Al-Smadi
Venue: International Journal of Circuit Theory and Applications (2005)

This paper addresses the problem of estimating the coefficients of a general autoregressive moving average (ARMA) model from only third order cumulants (TOCs) of the noisy observations of the system output. The observed signal may be corrupted by additive coloured Gaussian noise. The system is driven by a zero-mean independent and identically distributed (i.i.d.) non-Gaussian sequence. The input is not observed. The unknown model coefficients are obtained using eigenvalue&ndash;eigenvector decomposition. The derivation of this procedure is an extension of Pisarenko harmonic autocorrelation-based (PHA) method to third order statistics. It will be shown that the desired ARMA coefficients vector corresponds to the eigenvector associated with the minimum eigenvalue of a data covariance matrix of TOCs. The proposed method is also compared with well-known algorithms as well as with the PHA method. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Synthesizing Realistic Computational Grids
Authors: Dong Lu, Peter A. Dinda
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the hardware and software available on each node and link. This paper defines our requirements for grid generation and presents GridG, our extensible generator. We describe GridG in two steps: topology generation and annotation. For topology generation, we have both model and mechanism. We extend Tiers, an existing tool from the networking community, to produce graphs that obey recently discovered power laws of Internet topology. We also contribute to network topology theory by illustrating a contradiction between two laws and proposing a new version of one of them. For annotation, GridG captures intra- and inter-host correlations between attributes using conditional probability rules. We construct a set of rules, including one based on empirical evidence of OS concentration in subnets, that produce sensible host annotations.
Display of virtual braille dots by lateral skin deformation: feasibility study
Authors: Vincent Lévesque, Jérôme Pasquero, Vincent Hayward, Maryse Legault
Venue: ACM Transactions on Applied Perception (TAP) (2005)

When a progressive wave of localized deformations occurs tangentially on the fingerpad skin, one typically experiences the illusion of a small object sliding on it. This effect was investigated because of its potential application to the display of Braille. A device was constructed that could produce such deformation patterns along a line. Blind subjects' ability to read truncated Braille characters (&lsquo;&cir;&cir;&rsquo;, &lsquo;&cir;&bull;&rsquo;, &lsquo;&bull;&cir;&rsquo;, and &lsquo;&bull;&bull;&rsquo;) using the device was experimentally tested and compared to their performance with a conventional Braille medium. While subjects could identify two-character strings with a high rate of success, several factors need to be addressed before a display based on this principle can become practical.
Response to "The NeXT Computer" by Tim Dietrich
Authors: Thomas Byrne
Venue: ACM SIGSMALL/PC Notes (1990)

Just a few quick lines to express gratitude for the August 1989 issue. Tim Dietrich's "The NeXT Computer" was exactly what was needed at the right moment. I would like to know more about this system specifically about any plans to expand into multiuser capability, support for plotters and scanners, spreadsheet (123, EXEL), running MS DOS things (perhaps on a board), transfering MS DOS things, preserving the value of past investment (what can be ported over and what can't).
Generalized Optical Flow in the Scale Space
Authors: Haifeng Gong, Qing Yang, Chunhong Pan, Hanqing Lu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Scale space is a natural way to handle multi-scale problem. Yang and Ma considered the correspondence between scales, and proposed optical flow in the scale space. In this paper, we generalized Yang and Ma's work to generic images. We first genralize the Horn-Schunck algorithm to multidimentional multichannel image sequence. Since the global smothness constraint for regularization is no longer suitable in general cases, we introduced localized smoothness weight regularization. At last, we apply the proposedmethod in color image scale-space pullback, together with another localized smoothness trick considering flow density.
Real-time multidepth stream compression
Authors: Sang-Uok Kum, Ketan Mayer-Patel
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2005)

The goal of tele-immersion has long been to enable people at remote locations to share a sense of presence. A tele-immersion system acquires the 3D representation of a collaborator's environment remotely and sends it over the network where it is rendered in the user's environment. Acquisition, reconstruction, transmission, and rendering all have to be done in real-time to create a sense of presence. With added commodity hardware resources, parallelism can increase the acquisition volume and reconstruction data quality while maintaining real-time performance. However, this is not as easy for rendering since all of the data need to be combined into a single display.In this article, we present an algorithm to compress data from such 3D environments in real-time to solve this imbalance. We present a compression algorithm which scales comparably to the acquisition and reconstruction, reduces network transmission bandwidth, and reduces the rendering requirement for real-time performance. This is achieved by exploiting the coherence in the 3D environment data and removing them in real-time. We have tested the algorithm using a static office data set as well as a dynamic scene, the results of which are presented in the article.