ppxscal/embedding_network huggingface dataset:
Combining shape and physical modelsfor online cursive handwriting synthesis
Authors: Jue Wang, Chenyu Wu, Ying-Qing Xu, Heung-Yeung Shum
Venue: International Journal on Document Analysis and Recognition (2005)

This paper proposes a novel learning-based approach to synthesizing cursive handwriting of a user's personal handwriting style by combining shape and physical models. In the training process, some sample paragraphs written by a user are collected and these cursive handwriting samples are segmented into individual characters by using a two-level writer-independent segmentation algorithm. Samples for each letter are then aligned and trained using shape models. In the synthesis process, a delta log-normal model based conditional sampling algorithm is proposed to produce smooth and natural cursive handwriting of the user's style from models.
Ab initio modeling of structure and defects at the HfO2/Si interface
Authors: J. L. Gavartin, L. Fonseca, G. Bersuker, A. L. Shluger
Venue: Microelectronic Engineering (2005)

article-90-abstract
Radiometric Compensation in a Projector-Camera System Based Properties of Human Vision System
Authors: Dong Wang, Imari Sato, Takahiro Okabe, Yoichi Sato
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We introduce a novel technique for performing radiometric compensation for a projector-camera system that projects images onto a textured planar surface, which is designed to minimize perceptual artifacts visible to observers according to a model of the human vision system. A projector-camera system has previously been proposed for projecting images onto an arbitrary surface using radiometric compensation, however the dynamic range of a projector is physically limited there are some textures that cannot be compensated correctly. Also, human eyes are sensitive to artifacts introduced in this way. Our technique is designed to provide compensated images with perceptually less noticeable artifacts while preserving enough brightness and contrast in the output. We develop an optimization framework based on a perceptually-based physical error metric to minimize perceptible artifacts in the final compensated images by compressing the contrast of the input images.
Applying a Taxonomy of Formation Control in Developing a Robotic System
Authors: Harry Chia-Hung Hsu, Alan Liu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Designing cooperative multi-robot systems (MRS) requires expert knowledge both in control and artificial intelligence. Formation control is an important research within the research field of MRS. Since many researchers use different ways in approaching formation control, we try to give a taxonomy in order to help researchers design formation systems in a systematical way. We can analyze formation structures in two categories: control abstraction and robot distinguishability. The control abstraction can be divided into three layers: formation shape, reference type, and robotic control. Furthermore, robots can be classified as anonymous robots or identification robots depending on whether robots are distinguishable according to their inner states. We use this taxonomy to analyze some ground-based formation systems and to state current challenges of formation control. Such information becomes the design knowhow in developing a formation system, and a case study of designing a multi-team formation system is introduced to demonstrate the usefulness of the taxonomy.
Towards self-protecting ubiquitous systems: monitoring trust-based interactions
Authors: Colin English, Sotirios Terzis, Paddy Nixon
Venue: Personal and Ubiquitous Computing (2005)

The requirement for spontaneous interaction in ubiquitous computing creates security issues over and above those present in other areas of computing, deeming traditional approaches ineffective. As a result, to support secure collaborations entities must implement self-protective measures. Trust management is a solution well suited to this task as reasoning about future interactions is based on the outcome of past ones. This requires monitoring of interactions as they take place. Such monitoring also allows us to take corrective action when interactions are proceeding unsatisfactorily. In this vein, we first present a trust-based model of interaction based on event structures. We then describe our ongoing work in the development of a monitor architecture which enables self-protective actions to be carried out at critical points during principal interaction. Finally, we discuss some potential directions for future work.
Noise Analysis of Fault Tolerant Active Pixel Sensors
Authors: Cory Jung, Mohammad H. Izadi, Michelle L. La Haye
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

As digital imagers grow in pixel count and area, the ability to correct for pixel defects becomes more important. A fault tolerant Active Pixel Sensor (APS) has previously been designed and fabricated that can correct for stuck high and stuck low defects. Analyses of the pixel noise for a standard APS and a fault tolerant APS are presented that consider reset noise, photocurrent shot noise, dark current shot noise, transistor thermal noise, transistor flicker noise, operational amplifier noise, and feedback resistor thermal noise. Under worst case conditions (no illumination), the noise of the fault tolerant APS is 1.106× more than a standard APS. At a typical illumination level, the fault tolerant APS noise is nearly unchanged to that of a standard APS. Previous research has shown that the fault tolerant APS is more sensitive than a standard APS, thus the overall signal-to-noise ratio of the fault tolerant APS should be greater than the standard APS except under very low light conditions.
Web Services Interoperability Testing Based on Ontology
Authors: Ying Yu, Ning Huang, Ming Ye
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper deals with the interoperability errors in the process of Web services. The communication data are first captured and then stored in the ontology library. The analysis is done in light of the JESS reasoning system on the basis of the analysis rules. The testing system is flexible, for it can distinguish new error types by adding the corresponding rules into the ontology library. To identify more errors, a simulation of network communication failure is conducted on the basis of the control rules. The elements of Petri-net are mapped to the ontology library to replay the operation process to help users gain a better understanding of it.
Dual Device User Interface Design for Ubiquitous Language Learning: Mobile Phone and Interactive Television (iTV)
Authors: Sanaz Fallahkhair, Lyn Pemberton, Richard Griffiths
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper we describe the design and development of a system that facilitates language learning from a combination of two devices, interactive television (iTV) and mobile phone. We present a number of requirements for technologies to support informal language learning based on theories of language learning, theories of formal and informal learning, our own studies of adult language learners and the affordances of iTV as a medium to support learning. We describe TAMALLE (Television and Mobile phone Assisted Language Learning Environment), a prototype system based on these requirements and discuss some of the user interface design issues that arise in the context of cross platform dual device systems for ubiquitous learning.
"KODAMA": mischievous echoes
Authors: Hisako Kroiden Yamakawa
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

I created "KODAMA" to demonstrate my sensation of solidified human voices in conversation."KODAMA" is an interactive installation. The "KODAMA" are tree fairies that live in the forest who listen to human voices and mimic their sounds. They are visually depicted as bubbles or pockets of air that move around a projection of the forest. Their movement on screen is controlled by the movement of the audience detected by motion sensors. The audience's voices are captured and re-played by the "KODAMA".
Abstracting Genes to Gene Ontology Terms Allows Comparison across Multiple Species
Authors: Amar Kumar, Marnie A. Higgins, John N. Calley, Scott M. McAhren, Bartley W. Halstead, Ernst R. Dow, Hong Gao, George H. Searfoss
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Comparing lists of genes generated from microarray analyses is tedious and subjective. The numbers of genes that change can be in the thousands and each gene typically has multiple functions. Clustering approaches simply produce smaller groups of genes. Furthermore, comparing experiments across species interjects an additional complication to data analysis — the genomes are not the same, making direct gene comparisons difficult or impossible. We were able to partially address this issue by abstracting the genes to gene ontology (GO) terms and testing for significance using a hypergeometric distribution function. To test the algorithm, mouse, rat, and dog were treated with LPS, a bacterial cell wall component that causes an acute phase response, and gene expression changes were compared. The GO terms are displayed using a hyperbolic viewer, allowing the biologist to navigate the data in a known framework. A GO term can be readily identified as significantly enriched in all 3 species, although there are relatively few identical genes.
Optimizing a virtual speech display: Comments on Brungart and Simpson, ICAD 2003
Authors: Douglas S. Brungart, Brian D. Simpson
Venue: ACM Transactions on Applied Perception (TAP) (2005)

In our 2003 ICAD Paper &ldquo;Optimizing the Spatial Configuration of a Seven Talker Speech Display,&rdquo; we described a hybrid near-far spatial configuration that maximizes performance in a multitalker listening task. In this brief addendum, we describe our scientific motivation for that study, describe a supplementary experiment that extended the earlier work to two additional spatial configurations, and place the results of the study in the context of current and future research in audio displays.
PLL-Based Fractional-N Frequency Synthesizers
Authors: Farhad Zarkeshvari, Peter Noel, Tad Kwasniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Recent trends in the commercial use of fractional-N frequency synthesis can be attributed to the characteristic of independent loop bandwidth-channel spacing that results in low phase noise and relaxes the Phase-Locked Loop (PLL) design constraints. This paper reviews several techniques used to implement fractional-N frequency synthesizers and discusses the advantages and disadvantages. It also addresses design options and associated trade-offs.
What's on Your Hard Drive?
Authors: Charlene O'Hanlon
Venue: Queue (2005)

The tools on our hard drives vary widely in how directly they allow us to access the underlying hardware. Accordingly, many of our readers are most comfortable working as close to the machine as possible. Sometimes called &ldquo;bare metal&rdquo; programmers, they prefer the fewest possible layers of abstraction separating their code from the hardware. Others prefer tools that specialize in tasks less directly tied to the machine, creating models or even coding in Java with nary a thought of bits and bytes. Despite their fundamental differences, both types of tools inspire equal amounts of love and hate in their users, some of whom love tools for the same reasons (such as having a command line interface) that others hate them. We would like to hear more about which ones you love and hate, whatever your bias, at www.acmqueue.com.
Improving key predistribution with deployment knowledge in static sensor networks
Authors: Donggang Liu, Peng Ning
Venue: ACM Transactions on Sensor Networks (TOSN) (2005)

Pairwise key establishment is a fundamental security service for sensor networks. However, establishing pairwise keys in sensor networks is a challenging problem, particularly due to the resource constraints on sensor nodes and the threat of node compromises. This article proposes to use both predeployment and postdeployment knowledge to improve pairwise key predistribution in static sensor networks. By exploiting the predeployment knowledge, this article first develops two key predistribution schemes, a closest pairwise keys scheme and a closest polynomials scheme. The analysis shows that these schemes can achieve better performance if the expected location information is available and that the smaller the deployment error is, the better performance they can achieve. The article then investigates how to use postdeployment knowledge to improve pairwise key predistribution in static sensor networks. The idea is to load an excessive amount of predistributed keys on sensor nodes, prioritize these keys based on sensors' actual locations discovered after deployment, and discard low-priority keys to thwart node compromise attacks. This approach is then used to improve the random subset assignment scheme proposed recently to demonstrate its practicality and effectiveness. The analysis indicates that the postdeployment knowledge can also greatly improve the performance and security of key predistribution.
HUA: An Interactive Calligraphy and Ink-Wash Painting System
Authors: Jibin YIN, Xiangshi REN, Huaidong DING
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper presents a novel Chinese calligraphy and painting system, which servers as an expressive vehicle for interactively creating Chinese traditional calligraphy and ink-wash painting works. We developed a calligraphy-brush model which gives the user natural control of complex calligraphy-brush strokes. This model enhances the realistic sense of the user's manipulating the pen with the pressure sense. We also develop an ink-wash painting model which simulates Tuiyun - a unique Chinese ink-wash painting technique. User feedback has shown that the system is able to create vivid art works easily and smoothly.
A Scalarization Approach for Vector Variational Inequalities with Applications
Authors: Igor V. Konnov
Venue: Journal of Global Optimization (2005)

We consider an approach to convert vector variational inequalities into an equivalent scalar variational inequality problem with a set-valued cost mapping. Being based on this property, we give an equivalence result between weak and strong solutions of set-valued vector variational inequalities and suggest a new gap function for vector variational inequalities. Additional examples of applications in vector optimization, vector network equilibrium and vector migration equilibrium problems are also given
Facing Scalability Issues in Requirements Prioritization with Machine Learning Techniques
Authors: Paolo Avesani, Cinzia Bazzanella, Anna Perini, Angelo Susi
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Case-based driven approaches to requirements prioritization proved to be much more effective than first-principle methods in being tailored to a specific problem, that is they take advantage of the implicit knowledge that is available, given a problem representation. In these approaches, first principle prioritization criteria are replaced by a pairwise preference elicitation process. Nevertheless case-based approaches, using the Analytic Hierarchy Process (AHP) technique, become impractical when the size of the collection of requirements is greater than about twenty since the elicitation effort grows as the square of the number of requirements. We adopt a case-based framework for requirements prioritization, called Case-Based Ranking, which exploits machine learning techniques to overcome the scalability problem. This method reduces the acquisition effort by combining human preference elicitation and automatic preference approximation. Our goal in this paper is to describe the framework in details and to present empirical evaluations which aim at showing its effectiveness in overcoming the scalability problem. The results prove that on average our approach outperforms AHP with respect to the trade-off between expert elicitation effort and the requirement prioritization accuracy.
Feel the Beat: Direct Manipulation of Sound during Playback
Authors: Tue Haste Andersen, Remo Huber, Adjan Kretz, Morten Fjeld
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

We present a tangible user interface for direct manipulation of sound during playback. The interface was inspired by observing DJs and musicians working with computers where looping of sound takes on an important role. Through exploration using hardware and software prototypes we have realized direct mapping of perceptually important sound parameters to a motorized slider, enabling users to monitor and manipulate sound during playback.
Shear&ndash;rotation&ndash;warp volume rendering: Research Articles
Authors: Heewon Kye Byeong-Seok Shin Yeong Gil Shin Helen Hong
Venue: Computer Animation and Virtual Worlds (2005)

Shear&ndash;warp volume rendering has the advantages of a moderate image quality and a fast rendering speed. However, in the case of dynamic changes in the opacity transfer function, the efficiency of memory access drops, as the method cannot exploit pre-classified volumes. In this paper, we propose an efficient algorithm that exploits the spatial locality of memory references for interactive classifications. The algorithm inserts a rotation matrix when factorizing the viewing transformation, so that it may perform a scanline-based traversal in both object space and image space. In addition, we present solutions to some problems of the proposed method, namely inaccurate front-to-back composition, the occurrence of holes, and increased computation. Our method is noticeably faster than traditional shear-warp rendering methods because of an improved utilization of cache memory. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A two-way analysis of variance model with positive definite interaction for homologous factors
Authors: David Causeur, Thierry Dhorne, Arlette Antoni
Venue: Journal of Multivariate Analysis (2005)

A special type of modelling of interaction is investigated in the framework of two-way analysis of variance models for homologous factors. Factors are said to be homologous when their levels are in a meaningful one-to-one relationship, which arise in a wide variety of contexts, as recalled by McCullagh (J. Roy. Statist. Soc. B 62 (2000) 209). The classical linear context for analysis of interaction is extended by positive definiteness restrictions on the interaction parameters. These restrictions aim to provide a spatial representation of the interaction. Properties of the maximum likelihood estimators are derived for a given dimensionality of the model. When the dimension is unknown, an alternative procedure is proposed based on a penalty approach. This approach relies heavily on random matrix theory arguments but we focus on their statistical consequences especially on the reduction of over-fitting problems in the maximum likelihood estimation. Confidence ellipses are provided for an illustrative example.
Toward Efficient Multifeature Query Processing
Authors: H. V. Jagadish Beng Chin Ooi Heng Tao Shen Kian-Lee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range (minimum and maximum values) of the f features with respect to a reference point (the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B^+{\hbox{-}}\rm tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.
Improving lookup latency in distributed hash table systems using random sampling
Authors: Hui Zhang, Ashish Goel, Ramesh Govindan
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and file systems to application-layer multicast. DHT systems essentially build an overlay network, but a path on the overlay between any two nodes can be significantly different from the unicast path between those two nodes on the underlying network. As such, the lookup latency in these systems can be quite high and can adversely impact the performance of applications built on top of such systems.In this paper, we discuss a random sampling technique that incrementally improves lookup latency in DHT systems. Our sampling can be implemented using information gleaned from lookups traversing the overlay network. For this reason, we call our approach lookup-parasitic random sampling (LPRS). LPRS converges quickly, and requires relatively few modifications to existing DHT systems.For idealized versions of DHT systems like Chord, Tapestry, and Pastry, we analytically prove that LPRS can result in lookup latencies proportional to the average unicast latency of the network, provided the underlying physical topology has a power-law latency expansion. We then validate this analysis by implementing LPRS in the Chord simulator. Our simulations reveal that LPRS-Chord exhibits a qualitatively better latency scaling behavior relative to unmodified Chord. The overhead of LPRS is one sample per lookup hop in the worst case.Finally, we provide evidence which suggests that the Internet router-level topology resembles power-law latency expansion. This finding implies that LPRS has significant practical applicability as a general latency reduction technique for many DHT systems. This finding is also of independent interest since it might inform the design of latency-sensitive topology models for the Internet.