15274470
The rising landscape: A visual exploration of superstring revolutions in physics
Knowledge domain visualization is a visual exploratory approach to the study of the development of a knowledge domain. In this study, we focus on the practical issues concerning modeling and visualizing scientific revolutions. We study the growth patterns of specialties derived from citation and cocitation data on string theory in physics. Special attention is given to the two superstring revolutions since the 1980s. The superstring revolutions are visualized, animated, and analyzed using the general framework of Thomas Kuhn's structure of scientific revolutions. The implications of taking this approach are discussed.
45097070
Spatial ability and visual navigation: an Empirical Study
Abstract In this paper, we describe an empirical study of individuals' spatial navigation strategies and a number of performance and preference measures with regard to the design of a novel 3D visualisation. The underlying semantic space of the user interface consists of a collection of papers from the three most recent ACM SIGCHI conference proceedings, visualised as a virtual reality network. This network was automatically constructed based on semantic similarities derived from latent semantic analysis. We studied die search strategies and general preferences of eleven subjects who used this system to find papers on various topics. The study has led to a number of interesting findings, which should be valuable for designers and evaluators of 3D user interfaces. The results highlight the importance of structural elements in the design of a semantically based user interface, because search strategies of users relied heavily on these mechanisms in the design. The results of this study also demonstrate that...
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.
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.
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.
21349955
A unified optimization framework for microelectronics industry
In this paper, an object-oriented unified optimization framework (UOF) for general problem optimization is proposed. Based on evolutionary algorithms, numerical deterministic methods, and C++ objective design, the UOF possesses real-world applications for various optimization problems. The UOF is with interface between defining a general problem and generic solver; hence the two areas are bridged. The UOF's components are categorized into problem and solver parts, and they work independently. Therefore, the reusable high level code allows the adaptation to new problem and solver quickly. Practical applications in microelectronics industry confirm the functionality of the developed unified optimization framework.
11896625
Distributed meta-programming
Distributed meta-programming (DMP), which allows code to be generated and distributed at run-time, has already become a common practice. However, code generation currently often relies on rather ad hoc approaches that represent code as plain text, making DMP notoriously error-prone. This unfortunate situation is further exacerbated due to issues such as mobility (of code) and locality and heterogeneity (of resources), which complicate testing and debugging drastically.In this paper, we study distributed meta-programming from a type-theoretic perspective, presenting a language to facilitate the construction of programs that may generate and distribute code at run-time. The approach we take makes use of a form of typeful code representation developed in a previous study on meta-programming, and it guarantees statically that only well-typed code (according to some chosen type discipline) can be constructed at run-time and sent to proper locations for execution. We also mention a prototype implementation in support of the practicality of our approach to DMP, providing a solid proof of concept.
46218447
Parallelizing Progressive Computation for Skyline Queries in Multi-disk Environment
Given a set of d-dimensional points, skyline query returns the points that are not dominated by any other point on all dimensions. In this paper, we study an interesting scenario of skyline retrieval, where multi-dimensional points are distributed among multiple disks. Efficient algorithms for parallelizing progressive skyline computation are developed, using the parallel R-trees. The core of our scheme is to visit more entries from some disks simultaneously and enable effective pruning strategies with dominance checking to prune away the non-qualifying entries. Extensive experiments with synthetic data confirm that our proposed algorithms are both efficient and scalable.
28223559
Constructions of point-colour-symmetric graphs
Throuhout this paper, we shall restrict ourselves to finite graphs G which are undirected and line-coloured. For any points x, y in G, we shall write x y to mean that x and y are adjacent and by x w1 y to mean that x y and the colour of the line joining x and y is i. Also, we shall denote the line joining x and y by Xy; the colour of Xy by c(xy); and the set {c(Xy)l x y in Gl by C(G). Let G and H be (undirected, line-coloured) graphs. A one to one mapping ffrom G onto His called an isomorphism if the following two conditions are satisfied: