26496434
Visual interfaces to digital libraries
Today's digital libraries (DLs) are content rich, multimedia, multilingual collections that are distributed and accessed worldwide. Designing useful interfaces to access, understand, and manage this knowledge has become an active and challenging field of study. Visual interfaces to DLs aim to shift the user's mental load from slow reading to faster perceptual processes such as visual pattern recognition. They draw on progress in the new field of Information Visualization.The workshop in 2002 continues the theme started at JCDL 2001. In addition, the growth of the field warrants new perspectives on some of the issues we have addressed last year.
206109439
How did university departments interweave the Web: A study of connectivity and underlying factors
This paper presents two studies of the use of the WWW in Scottish universities and American land-grant universities. First, we investigated the relationship between the organisational profile of a university department in Scotland and its structural connectivity on the WWW. A Spearman rank order correlation analysis revealed a number of strong correlation relationships between structural connectivity measures and the organisational profile based on research assessment exercise ratings, teaching quality assessments, student‐staff ratios and funding levels. Linkage patterns from 13 Scottish academic sites to commercial sites in Britain and America highlighted the impact of culture and the appropriateness of information technologies on the acceptance of the WWW. The second study is a content survey of WWW-based education activities in American land-grant universities to investigate successful applications of these enabling techniques in education. The two studies together highlighted cultural, political and technological interactions in the use of the WWW. q 1998 Elsevier Science B.V. All rights reserved
468820
Tracing knowledge diffusion
Knowledge diffusion is the adaptation of knowledge in a broad range of scientific and engineering research and development. Tracing knowledge diffusion between science and technology is a challenging issue due to the complexity of identifying emerging patterns in a diverse range of possible processes. In this article, we describe an approach that combines complex network theory, network visualization, and patent citation analysis in order to improve the means for the study of knowledge diffusion. In particular, we analyze patent citations in the field of tissue engineering. We emphasize that this is the beginning of a longer-term endeavor that aims to develop and deploy effective, progressive, and explanatory visualization techniques for us to capture the dynamics of the evolution of patent citation networks. The work has practical implications on resource allocation, strategic planning, and science policy.
45076304
Spatial Semantic Virtual Worlds: The Structural Duality and Beyond
15424500
Semantically modified diffusion limited aggregation for visualizing large-scale networks
Diffusion-limited aggregation (DLA) is a model of fractal growth. Computer models can simulate the fast aggregation of millions of particles. We propose a modified version of DLA, called semantically modified DLA (SM-DLA), for visualizing large-scale networks. SM-DLA introduces similarity measures between particles so that instead of attaching to the nearest particle in the aggregation, a new particle is stochastically directed to attach to particles that are similar to it. The results of our initial experiment with a co-citation network using SM-DLA are encouraging, suggesting that the algorithm has the potential as an alternative paradigm for visualizing large-scale networks. Further studies in this direction are recommended.
46129433
Behavioural Patterns of Collaborative Writing with Hypertext - A State Transition Approach
This study investigates behavioural patterns of collaborative writing with a hypertext system by using a state-transition approach. State-transition models are empirically developed for capturing the dynamic nature of collaborative writing. Users were frequently engaged in tasks such as exploration, organization, and editing, whereas the use of collaborative support functions was transient in nature. The study shows that state-transition analysis is an important approach to task analysis, requirements engineering, and human-computer interaction studies. This study has produced some valuable experiences and lessons for researchers and practitioners in collaborative writing.
2980352
Global Memory Net Offers New Innovative Access to Tsurumi's Old Japanese Waka Poems and Tales, and Maps
This paper describes how Global Memory Net (GMNet) has been able to provide new kind of innovative access to the invaluable content of the classical Japanese ancient poems and maps at Tsurumi University that was not available for public access before. The collaboration began with the development of a prototype collection, based on images included in two publications of the Tsurumi University Library – the Eighty Selections of Waka Poems and Tales from the Classical Japanese Literature and the Japanese Maps in the Old Age. As the project developed, coinciding with the technology development of GMNet in bilingual retrieval as well as with sound presentations, the inclusion of sound files for each of the Waka selection was considered a very desirable feature since Waka poems are generally only readable by very small number of specialists. 
 
The paper will present a bird's eye view of how Tsurumi's rare collection is organized, presented with much enhanced access in GMNetsystem. Through this project, the Tsurumi team has gained considerable important experiences. The overall process for them was very time consuming even though the technology of GMNet was already in place. These valuable experiences will be discussed and shared.
20073710
On a class of Hamiltonian laceable 3-regular graphs
Abstract Using the concept of brick-products, Alspach and Zhang showed in Alspach and Zhang (1989) that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamiltonian path. In this paper, we shall study the Hamiltonian laceability of brick-products C(2n, m, r) with only one cycle (i.e. m = 1). To be more specific, we shall provide a technique with which we can show that when the chord length r is 3, 5, 7 or 9, the corresponding brick-products are Hamiltonian laceable. Let s = gcd((r + 1)/2, n) and t = gcd((r − 1)/2, n). We then show that the brick-product C(2n, 1, r) is Hamiltonian laceable if (i) st is even; (ii) s is odd and rs  r + 1 + 3s (mod 4n); or (iii) t is odd and rt  r − 1 − 3t (mod 4n). In general, when n is sufficiently large, say n ⩾ r2 − r + 1, then the brick-product is also Hamiltonian laceable.
28229953
Thai's Invaluable Memory Celebrated Via Global Memory Net
In this digital era, the mode of universal access for information seeking and knowledge acquisition differs greatly from the traditional ways. We have witnessed the exciting convergence of content, technology, and global collaboration in the development of digital libraries, which has offered us unbounded opportunities for dynamic information access and delivery. This author has experienced much of the transformations from analog to digital in the last two decades through her own R&D activities – from the creation of interactive videodiscs and multimedia CDs on the First Emperor of China's terracotta warriors and horses in the 1980s and 1990s to leading a current international digital library project, Global Memory Net (GMNet), supported by the US National Science Foundation. In presenting her vision for linking world digital resources together for universal access, she will share with the audience the latest development of Global Memory Net In honor of H.R.H. Princess Maha Chakri Sirindhorn at the special occasion of her 50th Birthday. The invaluable images of H.R.H. Princess and the Royal Family, as well as some of the most attractive sites of Thailand, such as the Grand Palace, etc. are included in GMNet as a part of the rare Thai Memory.
8200860
Digital imagery for significant cultural and historical materials
Digital imagery for significant cultural and historical materials is an emerging research field that bridges people, culture, and technologies. In this paper, we first discuss the great importance of this field. Then we focus on its four interrelated subareas: (1) creation and preservation, (2) retrieval, (3) presentation and usability, and (4) applications and use. We propose several mechanisms to encourage collaboration and argue that the field has high potential impact on our digital society. Finally, we make specific recommendations on what to pursue in this field.
41927192
On the fault-tolerant pancyclicity of crossed cubes
A graph is pancyclic if it contains all cycles from lengths 4 to |V(G)|. An n-dimensional crossed cube, an important variation of hypercube denoted as CQ/sub n/, has been proved to be pancyclic because it contains all cycles whose lengths range from 4 to |V(CQ/sub n/)|. Since vertex and edge faults may occur when a network is used, it is practical and meaningful to evaluate the performance of a faulty network. Moreover the vertex fault-tolerant Hamiltonicity and the edge fault-tolerant Hamiltonicity measure the performances of the Hamiltonian properties in the faulty networks. From this fault-tolerant concept, we propose using the fault-tolerant pancyclicity of networks to measure the performance of faulty networks. In this paper we consider a faulty crossed n-cube with vertex and/or edge faults here. Let the faulty set F be a subset of V(CQ/sub n/)/spl cup/E(CQ/sub n/). We prove that any cycle of length l(4/spl les/l/spl les/|V(CQ/sub n/)|-f/sub /spl nu//) can be embedded into a faulty crossed n-cube CQ/sub n/-F with dilation 1, where |F|=f/sub /spl nu//+f/sub e/ is less than n-2, f/sub /spl nu// is the number of faulty vertices of F, f/sub e/ is the number of faulty edges of F, and n is greater than 2. The results can readily be used in the optimum embedding of a ring of the specified length in a faulty crossed cube.