ppxscal/embedding_network huggingface dataset:
Program auralization: Author's comments on Vickers and Alty, ICAD 2000
Authors: Paul Vickers
Venue: ACM Transactions on Applied Perception (TAP) (2005)

In this paper, we reflect upon the investigations into external auditory representations of programs (program auralization) reported by Vickers and Alty at ICAD 2000. First, we place the work in its historical and thematic context and explore the motivation that lay behind it. We then outline the process by which we got to the stage of being able to report empirical results in 2000 and compare the work with that done by other researchers in the field. Finally, we assess the major contribution that this work made to the field of auditory display and look to the future outlining the work still to be done since the paper was first published (we also look at work done by others in this area since 2000).
Intrinsic dimensionality estimation of submanifolds in Rd
Authors: Matthias Hein, Jean-Yves Audibert
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a new method to estimate the intrinsic dimensionality of a submanifold M in Rd from random samples. The method is based on the convergence rates of a certain U-statistic on the manifold. We solve at least partially the question of the choice of the scale of the data. Moreover the proposed method is easy to implement, can handle large data sets and performs very well even for small sample sizes. We compare the proposed method to two standard estimators on several artificial as well as real data sets.
Investigations Into Graceful Degradation of Evolutionary Developmental Software
Authors: Peter Bentley
Venue: Natural Computing: an international journal (2005)

Today's software is brittle. A tiny corruption in an executable will normally result in terminal failure of that program. But nature does not seem to suffer from the same problems. A multicellular organism, its genes evolved and developed, shows graceful degradation: should it be damaged, it is designed to continue to work. This paper describes an investigation into software with the same properties. Three programs, one human-designed, one evolved using genetic programming, and one evolved and developed using a fractal developmental system are compared. All three calculate the square root of a number. The programs are damaged by corrupting their compiled executable code, and the ability for each of them to survive such damage is assessed. Experiments demonstrate that only the evolutionary developmental code shows graceful degradation after damage.
Immune Clone Algorithm for Mining Association Rules on Dynamic Databases
Authors: Hongwei Mo, Lifang Xu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The paper seeks to generate large itemsets in a dynamic transaction database using immune clone algorithm. Intra transactions, Inter transactions and distributed transactions are considered for mining association rules. The time of complexity of DMARICA (Dynamic Mining of Association Rules using Immune Clone Algorithm) is analyzed, with Fast Updata (FUP) algorithm for intra transactions and E-Apriori for inter transactions. The problem of mining association rules in the distributed environment is explored by Distributed DMARICA (DDMARICA). The study shows that DMARICA outperforms both FUP and E-Apriori in terms of execution time and scalability, without comprising the quality or completeness of rules generated. DMARICA is also compared with DMARG(Dynamic Mining of Association Rules using Genetic Algorithm). And it has better performance than that of DMARG.
Distributed Management of Ontologies on the Grid
Authors: Mario Cannataro, Pietro Hiram Guzzi, Tommaso Mazza, Pierangelo Veltri
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Although many tools and methodologies exist for ontology editing and management, integrated ontology management systems working on the Grid have not been defined yet. The paper presents the design of an ontology manager, OnBrowser, and its application in a grid environment scenario for managing distributed ontologies. OnBrowser provides access to "knowledge objects" coding ontology portions and referring to Grid metadata.
An Efficient and Accurate Method for 3D-Point Reconstruction from Multiple Views
Authors: Bing Liu, Maoyuan Yu, Dennis Maier, Reinhard Männer
Venue: International Journal of Computer Vision (2005)

In this paper we consider the problem of finding the position of a point in space given its projections in multiple images taken by cameras with known calibration and pose. Ideally the 3D point can be obtained as the intersection of multiple known rays in space. However, with noise the rays do not meet at a single point generally. Therefore, it is necessary to find a best point of intersection. In this paper we propose a modification of the method (Ma et al., 2001. Journal of Communications in Information and Systems, (1):51---73) based on the multiple-view epipolar constraints. The solution is simple in concept and straightforward to implement. It includes generally two steps: first, image points are corrected through approximating the error model to the first order, and then the 3D point can be reconstructed from the corrected image points using any generic triangulation method. Experiments are conducted both on simulated data and on real data to test the proposed method against previous methods. It is shown that results obtained with the proposed method are consistently more accurate than those of other linear methods. When the measurement error of image points is relatively small, its results are comparable to those of maximum likelihood estimation using Newton-type optimizers; and when processing image-point correspondences cross a small number of views, the proposed method is by far more efficient than the Newton-type optimizers.
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
Authors: Leslie Ann Goldberg, Russell Martin, Mike Paterson
Venue: SIAM Journal on Computing (2005)

Recursively-constructed couplings have been used in the past for mixing on trees. We show how to extend this technique to nontree-like graphs such as lattices. Using this method, we obtain the following general result. Suppose that $G$ is a triangle-free graph and that for some $\degree \geq 3$, the maximum degree of $G$ is at most $\degree$. We show that the spin system consisting of $q$-colorings of $G$ has strong spatial mixing, provided $q > \alpha \degree-\gamma$, where $\alpha\approx 1.76322$ is the solution to $\alpha^\alpha=e$, and $\gamma = \frac{4\alpha^3-6\alpha^2-3\alpha+4}{2(\alpha^2-1)}\approx 0.47031$. Note that we have no additional lower bound on $q$ or $\degree$. This is important for us because our main objective is to have results which are applicable to the lattices studied in statistical physics, such as the integer lattice $\zset^d$ and the triangular lattice. For these graphs (in fact, for any graph in which the distance-$k$ neighborhood of a vertex grows subexponentially in $k$), strong spatial mixing implies that there is a unique infinite-volume Gibbs measure. That is, there is one macroscopic equilibrium rather than many. Our general result gives, for example, a ``hand proof'' of strong spatial mixing for $7$-colorings of triangle-free $4$-regular graphs. (Computer-assisted proofs of this result were provided by Salas and Sokal [\textit{J. Stat. Phys}., 86 (1997), pp.\ 551--579] (for the rectangular lattice) and by Bubley, Dyer, Greenhill, and Jerrum [\textit{SIAM J. Comput.}, 29 (1999), pp.\ 387--400].) It also gives a hand proof of strong spatial mixing for $5$-colorings of triangle-free $3$-regular graphs. (A computer-assisted proof for the special case of the hexagonal lattice was provided earlier by Salas and Sokal [\textit{J. Stat. Phys}., 86 (1997), pp.\ 551--579].) Toward the end of the paper we show how to improve our general technique by considering the geometry of the lattice. The idea is to construct the recursive coupling from a system of recurrences rather than from a single recurrence. We use the geometry of the lattice to derive the system of recurrences. This gives us an analysis with a horizon of more than one level of induction, which leads to improved results. We illustrate this idea by proving strong spatial mixing for $q=10$ on the lattice $\zset^3$. Finally, we apply the idea to the triangular lattice, adding computational assistance. This gives us a (machine-assisted) proof of strong spatial mixing for $10$-colorings of the triangular lattice. (Such a proof for $11$ colors was given by Salas and Sokal [\textit{J. Stat. Phys}., 86 (1997), pp.\ 551--579].) For completeness, we also show that our strong spatial mixing proof implies rapid mixing of Glauber dynamics for sampling proper colorings of neighborhood-amenable graphs. (It is known that strong spatial mixing often implies rapid mixing, but existing proofs seem to be written for $\zset^d$.) Thus our strong spatial mixing results give rapid
AR Storyboard: An Augmented Reality Based Interactive Storyboard Authoring Tool
Authors: Midieum Shin, Byung-soo Kim, Jun Park
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

In early stages of production, storyboards are used for visually describing the story and the script. In this paper, an Augmented Reality based storyboard-authoring tool is introduced. Proposed tool is easy-to-use, and provides intuitive interface for scene composition and camera pose/motion control. Using AR Storyboard, non-experienced users may compose 3D scenes for a storyboard using interfaces in his/her real environments.
Three-stage Handwriting Stroke Extraction Method with Hidden Loop Recovery
Authors: Vladimir Pervouchine, Graham Leedham, Konstantin Melikhov
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A method for extraction of strokes from handwriting characters and graphemes is presented. The method allows the modelling of the original pen tip trajectory close to that perceived by humans, thus allowing its use in writer identification and verification tasks. The method is also capable of identifying retraced strokes and recovering hidden loops. Strokes are represented as cubic splines. The method extracts strokes in three stages: vectorisation, merging of skeletal branches and loop recovery, and final adjustment of near-junction and loop pieces. The evaluation of the method is performed by using its results for structural feature extraction and writer classification based on the features.
A Sky Dome Visualisation for Identification of Astronomical Orientations
Authors: Georg Zotti, Meister Eduard Groller
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

It has long been known that ancient temples were frequently oriented along the cardinal directions or to certain points along the horizon where Sun or Moon rise or set on special days of the year. In the last decades, archaeologists have found evidence of even older building structures buried in the soil, with doorways that also appear to have distinct orientations. This paper presents a novel diagram combining archaeological maps with a folded-apart, flattened view of the whole sky, showing the local horizon and the daily paths of sun, moon and brighter stars. By use of this diagram, interesting groupings of astronomical orientation directions, e.g. to certain sunrise and sunset points could be identified, which were evidently used to mark certain days of the year. Orientations to a few significant stars very likely indicated the beginning of the agricultural year in the middle neolithic period.
Design of SPICE Experience Factory Model Accumulation and Utilization of Process Assessment Experience
Authors: Gihan Kim, Minkwang Lee, Jongphil Lee, Kyungwhan Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

With growing interest in Software process improvement (SPI), many companies are introducing international process models and standards. SPICE is most widely used process assessment model in the SPI work today. In the process of introducing and applying SPICE, practical experiences contribute to enhancing the project performance. The experience helps people to make decisions under uncertainty, and to find better compromises. This paper suggests a SPICE Experience Factory (SEF) model to use SPICE assessment experience. For this, we collected SPICE assessment results which were conducted in Korea from 1999 to 2004. The collected data does not only contain rating information but also specifies strengths and improvement point for each assessed company and its process. To use this assessment result more efficiently, root words were derived from each result items. And root words were classified into four 1)measurement, 2)work product, 3)process performance, and 4) Process Definition and Deployment. Database was designed and constructed to save all analyzed data in forms of root words. Database also was designed to efficiently search information the organization needs by strength/ improvement point, or root word for each level. This paper describes procedures of SEF model and presents methods to utilize it. By using the proposed SEF model, even organizations which plan to undergo SPICE assessment for the first time can establish the optimal improvement strategies.
The impact of aging on access to technology
Authors: Sara J. Czaja
Venue: Issue 83 (September 2005) (2005)

Two major demographic trends underscore the importance of considering adaptation to technology by older adults: the aging of the population and rapid dissemination of technological innovations. In the past decade, developments in computer and information technologies have occurred at an unprecedented rate and technology has become an integral component of work, education, communication and entertainment. Technology is also increasingly used within the health care arena for service delivery, in-home monitoring, interactive communication (e.g., between patient and physician), transfer of health information and peer support. For example, in 2003, 76 % of Americans reported that they used the Internet and 65% have Internet access at home (UCLA Internet Report -- "Surveying the Digital Future", 2003). Use of automatic teller machines, interactive telephone-based menu systems, cellular telephones, and VCRs is also quite common. Furthermore, telephones, television, home security systems and other communication devices are becoming more integrated with computer network resources providing faster and more powerful interactive services. In essence in order to function independently and successfully interact with the environment, people of all ages need to interact with some form of technology.
Tailored, multimedia versus traditional educational interventions for patients with low back pain: a randomized clinical trial
Authors: Stephen L. Goffar
Venue:  (2005)

Low back pain is a common ailment in the general population and in the military, resulting in a lost work time and even disability in both groups. Educational interventions based on a fear-avoidance beliefs model are the present standard of care, but lack consistently demonstrated improvement outcomes in fear-avoidance beliefs, disability, and pain. Drawing from research in education psychology, education technology, and behavior change, this study lays a theoretical foundation for design and delivery of a dynamic, interactive multimedia educational intervention consisting of tailored behavior change messages aimed at educating back pain patients and eliciting positive health behavior changes. The effectiveness of this innovation is compared to two traditional educational interventions in a randomized clinical trial. One hundred and fifty military patients with back pain were randomly assigned to one of three instructional interventions: pamphlet (IP), group health education class (GHE), or the computer-based, tailored, multimedia instructional module (TMI). Fear-avoidance beliefs, disability, and pain outcomes were measured before the intervention and at 2, 4, 6, 12, and 26 weeks post intervention. Fifty-one subjects consistently provided follow-up data (IP, N = 14; GHE, N = 11; TMI, N = 26). A repeated measures ANOVA yielded no significant between-groups differences in disability, or pain levels. Controlling for severity of initial levels of fear-avoidance beliefs (FABQphys) revealed significant between-group differences, F(2, 45) = 3.22, p = 0.0493. Only the TMI group demonstrated statistically significant within-group improvements in disability (RDQ) [t(25) = 3.27, p = 0.0032] and pain levels [t(25) = 2.95, p = .0004]. The TMI group also consistently reported clinically significant improvements in pain and disability eight weeks earlier than the traditional IP or GHE groups. Secondary data suggest that the TMI module had a greater motivational effect on subjects than either traditional education intervention. A significantly greater number of patients from the TMI group remained engaged in this research effort [&chi;2(2) = 11.23, p = <0.01]. Results demonstrate that a dynamic, tailored, multimedia instructional module is a viable alternative to the traditional pamphlet and group educational interventions used in the military primary care setting for patients with low back pain. Further research is suggested to determine whether making the tailored multimedia module available on demand might further improve outcomes.
Multimodal analysis of recorded video for e-learning
Authors: Thomas Martin, Alain Boucher, Jean-Marc Ogier
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we present a model for multimodal content analysis. We distinguish between media and modality, which helps us to define and characterize three inter-modal relations. Then we apply this model for recorded course analysis for e-learning. Different useful relations between modalities are explained and detailed for this application.
Statistical hypotheses testing for fuzzy data
Authors: Hsien-Chung Wu
Venue: Information Sciences: an International Journal (2005)

The method of handling fuzziness upon the usual method of statistical hypotheses testing is proposed. We transact the h-level set of fuzzy data for the sake of invoking usual method of statistical hypotheses testing. We propose the decision rules that are used to accept or reject the null and alternative hypotheses with the notions of degrees of optimism and pessimism by solving optimization problems. We also provide a computational procedure and an example to clarify the discussions in this paper.
The greedy algorithm for the minimum common string partition problem
Authors: Marek Chrobak, Petr Kolman, Jiří Sgall
Venue: ACM Transactions on Algorithms (TALG) (2005)

In the Minimum Common String Partition problem (MCSP), we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the number of the substrings in the partition. This problem is NP-hard, even for a special case, denoted 2-MCSP, where each letter occurs at most twice in each input string. We study a greedy algorithm for MCSP that at each step extracts a longest common substring from the given strings. We show that the approximation ratio of this algorithm is between &Omega;(n0.43) and O(n0.69). In the case of 2-MCSP, we show that the approximation ratio is equal to 3. For 4-MCSP, we give a lower bound of &Omega;(log n).
Putting Detectors in Their Place
Authors: Arshad Jhumka, Martin Hiller
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

In this paper, we address the problem of locating detectors in a given program under resource constraints. A detector is a program component that asserts the validity of a predicate in a program. The detector location problem is to identify which program actions need to be monitored by detectors such that certain given dependability properties are met. In this paper, we focus on the following dependability properties: (i) high detection coverage, (ii) low detection latency, and (iii) low false alarms rate. Our main contributions are: (i) We first provide a formal definition of the detector location problem under resource constraints, and (ii) We subsequently show that the problem is NP-complete, (iii) We investigate a special case of the detector location problem that can be solved in polynomial time, and present a sound and complete algorithm that solves the problem. We present an example to show the applicability of our approach, which is intended in the area of dependable embedded systems. Keywords: Detectors, location, design, formal methods, resource constraints, embedded systems.
Evaluation of Integration of ACBL and AOCC Caching Algorithms
Authors: Yueping Lu, Peter Bodorik, Dawn Jutla
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Transactional caching algorithms proposed for object database management systems (ODBMSs) have been classified into detection and avoidance categories, depending on whether they allow access to stale data. Although studies have shown that in most situations the leading detection-based algorithms tend to outperform those that use avoidance, most ODBMSs use a variation of the leading avoidance-based algorithm because detection algorithms in certain situations lead to abort rates that are unacceptable for some, typically interactive, applications. The Interoperable Server-side Caching (ISCT) algorithm allows both types of algorithms to interoperate in the same environment while being supported by an interoperable server. Clients use either the leading detection-based algorithm, called Adaptive Optimistic Concurrency Control (AOCC), or the leading avoidance-based algorithm, called Adaptive Call-Back Locking (ACBL). The caching operations of the client-side algorithms are not affected ¿ only the server-side is adapted to interoperate with both types of clients. This paper presents the results of performance evaluation that compares the three algorithms under various loads. Evaluation shows that the interoperable server-side caching algorithm increases throughput in environments where some applications can use the high-throughput AOCC algorithm while other applications use a detection-based ACBL algorithm. To compare the algorithms a new workloads, in which different applications exhibit different server load characteristics, were developed.
Implicit surface modelling as an eigenvalue problem
Authors: Christian Walder, Olivier Chapelle, Bernhard Schölkopf
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimisation problem in the embedding function that defines the implicit by way of its zero level set. By assuming that the solution is a mixture of radial basis functions of varying widths we attain the globally optimal solution by way of an equivalent eigenvalue problem, without using or constructing as an intermediate step the normal vectors of the manifold at each data point. We demonstrate the system on two and three dimensional data, with examples of missing data interpolation and set operations on the resultant shapes.