ppxscal/embedding_network huggingface dataset:
Restorer: a visualization technique for handling missing data
Authors: Ray Twiddy, John Cavallo, Shahram M. Shiri
Venue: Proceedings of the conference on Visualization '94 (1994)

Pseudocoloring is a frequently used technique in scientific visualization for mapping a color to a data value. When using pseudocolor and animation to visualize data that contain missing regions displayed as black or transparent, the missing regions popping in and out can distract the viewer from the more relevant information. Filling these gaps with interpolated data could lead to a misinterpretation of the data. This paper presents a method for combining pseudocoloring and grayscale in the same colormap. Valid data are mapped to colors in the colormap. The luminance values of the colors bounding areas of missing data are used in interpolating over these regions. The missing data are mapped to the grayscale portion of the colormap. This approach has the advantages of eliminating distracting gaps caused by missing data and distinguishing between those areas that represent valid data and those areas that do not. This approach was inspired by a technique used in the restoration of paintings.
Two content protection schemes for digital items
Authors: Paula Steinby
Venue: Acta Cybernetica (2003)

Modern techniques make digital articles easy to copy and manipulate. Content protection systems aim at protecting the rights of producers and distributors. These mostly rely on data encryption, digital watermarking, and special-purpose devices. In this paper, we describe two content protection schemes, both of which make use of tamper-resistant devices and device-dependent decryption keys. One of the schemes uses a modified El Gamal system, in the other one we combine watermarking with encryption.
Augmenting Simulated Annealing to Build Interaction Test Suites
Authors: Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Component based software development is prone to unexpectedinteraction faults. The goal is to test as manypotential interactions as is feasible within time and budgetconstraints. Two combinatorial objects, the orthogonalarray and the covering array, can be used to generate testsuites that provide a guarantee for coverage of all t-setsof component interactions in the case when the testing ofall interactions is not possible. Methods for constructionof these types of test suites have focused on two main areas.The first is finding new algebraic constructions that producesmaller test suites. The second is refining computationalsearch algorithms to find smaller test suites more quickly. Inthis paper we explore one method for constructing coveringarrays of strength three that combines algebraic constructionswith computational search. This method leveragesthe computational efficiency and optimality of size obtainedthrough algebraic constructions while benefiting from thegenerality of a heuristic search. We present a few examplesof specific constructions and provide some new bounds forsome strength three covering arrays.
On familial longitudinal Poisson mixed models with gamma random effects
Authors: Brajendra C. Sutradhar, Vandna Jowaheer
Venue: Journal of Multivariate Analysis (2003)

Poisson mixed models are used to analyze a wide variety of cluster count data. These models are commonly developed based on the assumption that the random effects have either the log-normal or the gamma distribution. Obtaining consistent as well as efficient estimates for the parameters involved in such Poisson mixed models has, however, proven to be difficult. Further problem gets mounted when the data are collected repeatedly from the individuals of the same cluster or family. In this paper, we introduce a generalized quasilikelihood approach to analyze the repeated familial data based on the familial structure caused by gamma random effects. This approach provides estimates of the regression parameters and the variance component of the random effects after taking the longitudinal correlations of the data into account. The estimators are consistent as well as highly efficient.
Adding Distinct Congruence Classes
Authors: Y. O. Hamidoune
Venue: Combinatorics, Probability and Computing (1998)

Let S be a generating subset of a cyclic group G such that 0=&notin;S and &#x2223;S&#x2223;&ge;5. We show that the number of sums of the subsets of S is at least min(&#x2223;G&#x2223;, 2&#x2223;S&#x2223;). Our bound is best possible. We obtain similar results for abelian groups and mention the generalization to nonabelian groups.
A Churchmanian Theory of Knowledge Management System Design
Authors: Sandra M. Richardson, James F. Courtney
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper employs Churchman's [13] inquiring systems as a kernel theory on which to base knowledge management systems (KMS) design. We build on Churchman's nine requirements for an object to constitute a system and his Singerian inquiring system to develop the notion of Churchmanian knowledge management systems (CKMS) and principles for their design. We define a CKMS as a purposeful and ethical information system that creates exoteric knowledge and provides a link between knowledge and action in an organization. The design principles involve a strong emphasis on ethical behavior, the development of success measures for CKMS, the need to ensure that the CKMS enhances the dignity of mankind, a highly participatory design process, the desire to unify the designers, the decision makers and clients, the need to shape CKMS components in relation to the system as a whole, and the need for a "guarantor" to validate knowledge residing in the CKMS.
A theory of mixin modules: algebraic laws and reduction semantics
Authors: Davide Ancona, Elena Zucca
Venue: Mathematical Structures in Computer Science (2002)

Mixins are modules that may contain deferred components, that is, components not defined in the module itself; moreover, in contrast to parameterised modules (like ML functors), they can be mutually dependent and allow their definitions to be overridden. In a preceding paper we defined a syntax and denotational semantics of a kernel language of mixin modules. Here, we take instead an axiomatic approach, giving a set of algebraic laws expressing the expected properties of a small set of primitive operators on mixins. Interpreting axioms as rewriting rules, we get a reduction semantics for the language and prove the existence of normal forms. Moreover, we show that the model defined in the earlier paper satisfies the given axiomatisation.
Methodological issues in MIS cross-cultural research
Authors: Elena Karahanna, Roberto Evaristo, Mark Srite
Venue: Advanced topics in global information management (2003)

This paper presents a discussion of methodological issues that are relevant and idiosyncratic to cross-cultural research. One characteristic that typifies cross-cultural studies is their comparative nature, i.e., they involve a comparison across two separate cultures on a focal phenomenon. When differences across cultures are observed, the question arises as to whether the results are true cultural differences or merely measurement artifacts. Methodological considerations in cross-cultural research focus on ruling out alternative explanations for these differences and thus enhancing the interpretability of the results. The paper presents an overview of key methodological issues in cross-cultural research and reviews methods of preventing or detecting methodological problems.
CAVT: a congestion avoidance visualization tool
Authors: Michael Welzl, Max Mühlhäuser
Venue: ACM SIGCOMM Computer Communication Review (2003)

We present CAVT, a simple yet powerful tool to visualize the behavior of congestion control mechanisms. Essentially being a simulator that builds upon the well-known Chiu/Jain vector diagrams, CAVT provides researchers, teachers and students with a new abstraction level that has already shown its value in practice.
Autonomous Navigation and Positioning for Indoor Wireless Measurements using Mobile Robots
Authors: Alejandro Aragón Zavala
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Personal Wireless Communications haveexperienced a tremendous growth in the last decade.In indoor scenarios, such as underground stations orbuildings, the signal received at the mobile propagatesin a different way than in outdoor environments.Therefore, measurement techniques used in outdoorcells cannot be used indoors, especially whendetermining the position of the mobile test equipment.Alternative methods of navigation and positioning arerequired for specific indoor measurement campaigns.Three mobile robot platforms have been developed toimprove the accuracy of characterisation of the indoorpropagation channel. The aim of each system is toprovide an accurate mechanism for determiningrelative position within acceptable error bounds,depending on the specific characteristics of themeasurement campaign and especially where othermethods of positioning are not available. This paperdescribes each of the robots developed, emphasisingthe penetration that robotics has had in the wirelessmobile communication industry, as a useful andaffordable tool to improve propagation measurementtechniques.
Carpenter: finding closed patterns in long biological datasets
Authors: Feng Pan, Gao Cong, Anthony K. H. Tung, Jiong Yang, Mohammed J. Zaki
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example, many gene expression datasets may contain 10,000-100,000 columns but only 100-1000 rows.Such datasets pose a great challenge for existing (closed) frequent pattern discovery algorithms, since they have an exponential dependence on the average row length. In this paper, we describe a new algorithm called CARPENTER that is specially designed to handle datasets having a large number of attributes and relatively small number of rows. Several experiments on real bioinformatics datasets show that CARPENTER is orders of magnitude better than previous closed pattern mining algorithms like CLOSET and CHARM.
Time-Space Discretization of the Nonlinear Hyperbolic System \protect\mbox\boldmath\lowercase$u_tt = \operatornamediv (\sigma(\mbox\boldmath\uppercase$D$u)+ \mbox\boldmath\uppercase$D$u_t)$
Authors: Carsten Carstensen, Georg Dolzmann
Venue: SIAM Journal on Numerical Analysis (2004)

The numerical treatment of the hyperbolic system of nonlinear wave equations with linear viscosity, $u_{tt}= {\rm div}(\sigma(Du)+Du_t)$, is studied for a large class of globally Lipschitz continuous functions $\sigma$, including nonmonotone stress-strain relations. The analyzed method combines an implicit Euler scheme in time with Courant (continuous and piecewise affine) finite elements in space for a class of varying time steps with varying meshes. Explicit a priori error bounds in $L^\infty(L^2)$, $L^2(W^{1,2})$, and W1,2(L2) are established for the solutions of the fully discrete scheme.
A program for aligning sentences in bilingual corpora
Authors: William A. Gale, Kenneth W. Church
Venue: Computational Linguistics (1993)

Researchers in both machine translation (e.g., Brown et al. 1990) and bilingual lexicography (e.g., Klavans and Tzoukermann 1990) have recently become interested in studying bilingual corpora, bodies of text such as the Canadian Hansards (parliamentary proceedings), which are available in multiple languages (such as French and English). One useful step is to align the sentences, that is, to identify correspondences between sentences in one language and sentences in the other language.This paper will describe a method and a program (align) for aligning sentences based on a simple statistical model of character lengths. The program uses the fact that longer sentences in one language tend to be translated into longer sentences in the other language, and that shorter sentences tend to be translated into shorter sentences. A probabilistic score is assigned to each proposed correspondence of sentences, based on the scaled difference of lengths of the two sentences (in characters) and the variance of this difference. This probabilistic score is used in a dynamic programming framework to find the maximum likelihood alignment of sentences.It is remarkable that such a simple approach works as well as it does. An evaluation was performed based on a trilingual corpus of economic reports issued by the Union Bank of Switzerland (UBS) in English, French, and German. The method correctly aligned all but 4% of the sentences. Moreover, it is possible to extract a large subcorpus that has a much smaller error rate. By selecting the best-scoring 80% of the alignments, the error rate is reduced from 4% to 0.7%. There were more errors on the English-French subcorpus than on the English-German subcorpus, showing that error rates will depend on the corpus considered; however, both were small enough to hope that the method will be useful for many language pairs.To further research on bilingual corpora, a much larger sample of Canadian Hansards (approximately 90 million words, half in English and and half in French) has been aligned with the align program and will be available through the Data Collection Initiative of the Association for Computational Linguistics (ACL/DCI). In addition, in order to facilitate replication of the align program, an appendix is provided with detailed c-code of the more difficult core of the align program.
Simplified Bluetooth Device Discovery -- Analysis and Simulation
Authors: Gergely V. Záruba, Vishant Gupta
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Bluetooth is a promising wireless technology enabling (portable) devices to form short-range star-shaped wireless networks (or wireless personal area networks - PAN). Bluetooth relies on a frequency hopping physical layer, implying that hosts are not able to communicate unless they have previously discovered each by synchronizing their frequency hopping patterns. This further implies, that even if all nodes are within direct communication range, only those nodes that are synchronized within the personal area network can over-hear a transmission. To support any-to-any communication such personal area networks (or in Bluetooth terminology piconets and possibly scatternets) need to be established among nodes. Thus, it is of utmost importance to be able to model or predict the time required for nodes to discover each other, i.e., to synchronize them. This paper provides a mathematical analysis and corresponding simulation results for the Bluetooth discovery (inquiry) time in a fully connected (personal area network) situation with the population as a parameter. The simplification to the analysis andsimulation is due to the intermediate train changes in the inquiry process as it is outlined in the paper.
How to capture absolute human skeletal posture
Authors: Shoichiro Iwasawa, Kiyoshi Kojima, Kenji Mase, Shigeo Morishima
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Commercially available motion capture products give us fairly precise movements of human body segments but do not measure enough information to define skeletal posture in its entirety. This sketch describes how to obtain the complete posture of skeletal structure with the help of marker locations relative to bones that are derived from MRI data sets.
Towards scalable location-aware services: requirements and research issues
Authors: Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

The emergence of location-aware services calls for new real time spatio-temporal query processing algorithms that deal with large numbers of mobile objects and queries. Online query response is an important characterization of location-aware services. A delay in the answer to a query gives invalid and obsolete results, simply because moving objects can change their locations before the query responds. To handle large numbers of spatio-temporal queries efficiently, we propose the idea of sharing as a means to achieve scalability. In this paper, we introduce several types of sharing in the context of continuous spatio-temporal queries. Examples of sharing in the context of real-time spatio-temporal database systems include sharing the execution, sharing the underlying space, sharing the sliding time windows, and sharing the objects of interest. We demonstrate how sharing can be integrated into query predicates, e.g., selection and spatial join processing. The goal of this paper is to outline research directions and approaches that will lead to scalable and efficient location-aware services.
Microstructural investigation of electrodeposited CuAg-thin films
Authors: S. Strehle, S. Menzel, H. Wendrock, J. Acker, K. Wetzig
Venue: Microelectronic Engineering (2003)

In this article we present microstructural investigations of electrodeposited CuAg-alloy metallization thin films. The deposition was carried out on Si(100)/SiO2Ta/TaN/Cu-seed substrates at room temperature without any additives. It was found that the mean grain size decreases with increasing dc current density whereas a dependence on the Ag content was not observed. Additionally the crystalline structure and, particularly, the formation of CuAg-solid solutions and grain boundary segregation is discussed on the basis of XRD measurements. The Ag content within a supersaturated copper matrix increases with increasing dc current density.
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
Authors: Chulho Shin, Young-Taek Kim, Eui-Young Chung, Kyu-Myung Choi, Jeong-Taek Kong, Soo-Kwan Eo
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an SoC design. Furthermore, bus IP vendors provide software tools that automatically generate RTL codes of a bus once its designer configures it. Configurability, however, imposes more challenges upon designers because complexity involved in optimization increases exponentially as the number of parameters grows. In this paper, we present a novel approachwith which effort requirement can be dramatically reduced. An automated optimization tool we developed is used and it exploits a genetic algorithm for fast design exploration. This paper shows that the time for the optimizing task can be reduced by more than 90% when the tool is used and, more significantly the task can be done without an expert's hand while ending up with a better solution.
On the systematic construction of molecular basis sets
Authors: S. Wilson
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The algebraic approximation [1,2,3], that is the use of finite basis set expansions, lies at the heart of practical computational quantum chemistry. The choice of basis set is crucial since it ultimately determines the accuracy and therefore the utility of a particular application. Yet much of the "art" of contemporary quantum chemistry lies in the selection of an appropriate basis set for the problem in hand. Here we discuss systematic techniques for the construction of molecular basis sets; that is, methods which aim to explore the way in which a particular property or properties converge with increasing size of basis set.
Dynamic Multicast Routing for Mobile Networks
Authors: Ying Liu, Jianping Wu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Multicast is a mechanism widely used in the Internet to disseminate information. Multicast delivery paths may need to be frequently restructured along with host migrations. But all existing multicast routing proposals implicitly assume static hosts when configuring the multicast delivery tree. The delivery trees established for static multicast cannot be changed easily or efficiently in all cases due to the propagation of these trees to many routers, and the potentially large cost associated with making changes to the trees' structure. This paper presents a dynamic multicast routing for mobile hosts. We first construct the multicast tree for static group members using the strategy based on shortest-path trees and minimal spanning trees but biases routes through group members. When establishing the tree for static memberswe adopt a specific cost function that combines link cost and nodes degrees, so that a maximum set of mobile receivers could join the tree later on with a minimum cost. The experimental results show that the algorithm proposed could find the multicasting tree with lower cost than the SPT does. Its performance also compares well other known heuristics.
Experiments in speech recognition using a modular MLP architecture for acoustic modelling
Authors: T. Jeff Reynolds, Christos A. Antoniou
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

We have been investigating for some time the use of a layered modular/ensemble neural network architecture for acoustic modelling. In the particular instantiation investigated so far, this architecture decomposes the task of acoustic modelling by phone. In a first layer at least one multilayer perceptron (or 'primary detector') is trained to discriminate each phone and, in a second layer, outputs from the first layer are combined into posterior probabilities by further MLPs. In this paper we show how our approach provides good acoustic modelling in a series of experiments on the TIMIT speech corpus. Firstly we show that decomposition itself provides a gain through greater precision in MLP training. Secondly we show that primary detectors trained on different front-ends can be profitably combined. Our analysis of the correlations between different detectors for the same phone shows that some independent information is provided by different front-ends. Thirdly we show how to employ information from a wide context within our architectural framework and that this provides performance equivalent to the best context-dependent acoustic modelling systems.
User assisted text classification and knowledge management
Authors: Anne Kao, Lesley Quach, Steve Poteet, Steve Woods
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

While there are many aspects to managing corporate knowledge, one key issue is how to organize corporate documents into categories of interest. In this paper, we focus on using user assisted text classification in conjunction with a web portal, multiple document management systems and an ontology, to provide a powerful solution for organizing information about a company's technology. We propose a system that interacts with an author using an automatic text classifier to suggest controlled keywords to be used as metadata. The proposed approach does not require professional librarians or that the end users have extensive training. The use of a controlled vocabulary allows for a more consistent description of corporate documents, and promotes easier access by people across the company. It is easier to find similar documents which use different nomenclature. Finally, the interactive nature of the system results in a more correct and precise description of each document than a fully automatic system would.