2365001
Bridging the Gap: The Use of Pathfinder Networks in Visual Navigation
Abstract This paper describes a generic approach to the design of a 3D virtual environment for visual navigation. The basic design principle is that users need to understand how an environment is organised and how they can utilise the knowledge to find their way through the environment. In this paper, we focus on the relationship between implicit semantic structures associated with a collection of domain-specific documents and users' cognitive needs in the context of visual navigation. We extend the notion of Pathfinder networks in order to represent implicit semantic structures in a 3D virtual environment. Users' cognitive needs in visual navigation are conceptualised based on the concept of cognitive maps.
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.
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.
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
45076304
Spatial Semantic Virtual Worlds: The Structural Duality and Beyond
2888098
Evolutionary interactive music composition
This paper proposes the CFE framework---Composition, Feedback, and Evolution---and presents an interactive music composition system. The system composes short, manageable pieces of music by interacting with users. The most important features of the system include creating customized music according to the user preference and providing the facilities specifically designed for producing large amounts of music. We present the structure as well as the implementation of the system and the auxiliary functionalities that enhance the system. We also introduce the auto-feedback test with which we verify and evaluate the interactive music composition system.
27757598
Assessing the effectiveness of online asynchronous case method
This paper reports a field experiment that evaluates the use of the case method in an online asynchronous learning (OAL) environment. Our findings suggest that OAL should be used to promote students' participation, rather than cognitive learning gains. Teaching the case method in F2F environment can help learners achieve higher cognitive learning gains.
15500231
Image Copy Detection via Grouping in Feature Space Based on Virtual Prior Attacks
In the past, many researches on image copy detection focused on finding a feature that is robust enough for various kinds of image attacks. But it is difficult to find a globally effective feature that is appropriate for many situations. In this paper, we introduce a classification framework to this problem, instead of solving the feature-selection problem. In our approach, novel features are generated by applying virtual prior attacks to copyrighted images, and the copy-detection problem is converted to a classification one that is more robust to solve. Our approach can combine existing image copy detectors and further raise their performances.
38249565
An extreme problem concerning k-arc-cyclic property for a class of tournaments
B. Alspach has proved that a regular tournament is arc-pancyclic. Zhu and Tian proved that if a tournament T = (V, A) with vertex set V, arc set A and order p satisfies that for any arc (vi, vj) of T, if d+(vj)+d-(vi)⩾p−2, then T is arc-pancyclic, where p⩾7. In this paper we study an extreme problem concerning the k-arc-cyclic property for a class of tournaments. 
 
We say that a tournament T=(V, A) satisfies the condition O(p, q) if d+(v)+d-(u)⩾p−q for any arc (u, v) of T, where q is a positive integer and |V|=p. Zhu, Tian, Chen and Zhang proved that if a tournament T satisfies the condition O(p, q) and p⩾3q+3, then T is arc-pancyclic. Let S(p, q) be the set{T=(V, A): T is a tournament with p vertices and T satisfies the condition O(p, q)}; let Ck(u, v) be the set {cycles of T with length k using the arc (u, v)}. The aim of this paper is that for a given integer q, we can find an integer m(q, k) such that if p⩾m(q, k), then for any T ϵ S(p, q), T is k-arc-cyclic; if p⩽m(q, k)−1, then there exists T ϵ S(p, q) such that T is not k-arc-cyclic. We have found that m(q, 4)=5q−7, and m(q, 5)=⌊p∗(q)⌋+1 or ⌈p∗(q)⌉+1, where p∗(q)=(1+312)q−(1+43·3 12).
19946044
On edge-Hamiltonian property of Cayley graphs
Abstract Let G be a group generated by X . A Cayley graph over G is defined as a graph G ( X ) whose vertex set is G and whose edge set consists of all unordered pairs [ a,b ] with a , b ϵ G and a -1 b ϵ X ∩ X -1 , where X -1 denotes the set { x -1 ∣ x ϵ X }. When X is a minimal generating set or each element of X is of even order, it can be shown that G ( X ) is Hamiltonian if it is edge-Hamiltonian. Hence every Cayley graph of order a power of 2 is edge-Hamiltonian.