2965625
Visualizing the evolution of a subject domain: a case study
We explore the potential of information visualization techniques in enhancing existing methodologies for domain analysis and modeling. In this case study, we particularly focus on visualizing the evolution of the hypertext field based on author co-citation patterns, including the use of a sliding-window scheme to generate a series of annual snapshots of the domain structure, and a factor-referenced color-coding scheme to highlight predominant specialties in the field.
42451139
Visualizing scientific paradigms: An introduction
This special topic issue includes a collection of seven articles on visualizing scientific paradigms. All articles in this special issue reflect the influence of Thomas Kuhn’s structure of scientific revolutions on our understanding of the growth of scientific knowledge. On the other hand, each article represents a unique perspective of how one may pursue the quest for transforming something as intangible and empirically evasive as invisible colleges and competing paradigms into something that is more accessible and traceable to scholars and professions of various disciplines, ranging from historians, philosophers, and educators to scientists and engineers. The opening article is Henry Small’s personal account of the endeavor in probing scientific paradigms using science mapping. His article, entitled “Paradigms, Citations and Maps of Science: A Personal History,” provides a valuable introduction to the key issues involved in this area and reveals an overview of promising avenues as well as challenging routes. He identifies an emerging trend that reflects and redefines Kuhn’s paradigms and emphasizes the empirical viability of research methodologies in understanding the growth of scientific knowledge. He suggests that revolutionary and normal science should be seen as extremes on a continuum of rates of change rather than, as Kuhn originally asserted, as an all-or-none proposition. The second and third articles take a prominent historical perspective in depicting the evolution of scientific citations. Eugene Garfield and his collaborators’ article is entitled “Why Do We Need Algorithmic Historiography?” They explain the rationale for creating HistCite, their new program that produces historiographs of scholarly topics. These historiographs help analysts and historians identify key events, people, and journals in a particular field. Scholars can evaluate the evolution of a scientific paradigm by studying the genealogic profile of such evolution. The third article is entitled “Timeline Visualization of Research Fronts.” Steven Morris and his colleagues focus on temporal changes in research fronts and explain the power of timeline visualizations. They first cluster documents into research fronts based on bibliographic coupling and then visualize research fronts using horizontal timeline tracks. Documents from research fronts are plotted along corresponding timeline tracks. Because time line visualizations can reveal temporal relations among research fronts and their member documents, time lines are potentially useful tools in identifying new research fronts as well as existing research expertise and research excellence. Although both the fourth and fifth articles have connections to Pathfinder networks, they address different topics. Howard White’s article, entitled “Pathfinder Networks and Author Cocitation Analysis: A Remapping of Paradigmatic Information Scientists,” clarifies an important methodological issue, whereas Chen and Kuljis focus on a general framework for visualizing scientific paradigms in their article. Author Cocitation Analysis (ACA) is a long established methodology for studying intellectual structures. Researchers have routinely used Pearson correlation coefficients rather than raw cocitation counts as the measure of similarity between author pairs. Howard White compellingly demonstrates the advantages of using raw cocitation counts in Pathfinder network visualizations of author cocitation structures. He compares Pathfinder networks of the information scientists derived from raw cocitation counts and Pearson correlation coefficients, respectively. In the fifth article “The Rising Landscape: A Visual Exploration of Superstring Revolutions in Physics,” Chen and Kuljis introduce a general framework for visualizing the growth of scientific paradigms based on Kuhn’s theory on scientific revolutions. They illustrate the use of this framework in a case study of superstring revolutions in physics. The evolution of cocitation networks is depicted and explained through animated visualizations of citations and cocitation links. Visual-spatial properties as well as structural patterns associated with superstring revolutions are identified. The sixth and seventh articles deal with heterogeneous data sources. In their article entitled “Indicator-Assisted Evaluation and Funding of Research: Visualizing the Influ© 2003 Wiley Periodicals, Inc.
1853084
Trailblazing the literature of hypertext: author co-citation analysis (1989–1998)
This paper presents the analysis and modelling of two data sets associated with the literature of hypertext as represented by the ACM Hypertext conference series. This work explores new ways of organising and accessing the vast amount of interrelated information. The first data set, including all the full papers published in this series (1987 1998), is structured and visualised as a semantic space. This semantic space provides an access point for each paper in this collection. The second data set, containing author co-citation counts based on nine conferences in the series (1989 1998), is analysed and mapped in its entirety and in three evenly distributed sub-periods. Specialties  major research fronts in the field of hypertext  are identified based on the results of a factor analysis and corresponding author co-citation maps. The names of authors in these maps are linked to the bibliographical and citation summaries of these authors on the WWW.
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.
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
35624108
Optimal Parallel Routing in Star Graphs
Star graphs have been recently proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star graphs. Our result improves previous results for the problem.
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.
43110
A study of self-adjusting quality of service control schemes
We report simulation methods and results for analyzing a self-adjusting quality of service (QoS) control scheme for multimedia/telecommunication systems based on resource reservation. We study the case in which high priority clients' QoS requirement is not changed throughout the service period, while low priority clients' QoS may be adjusted by the system between the maximum and minimum QoS levels specified in order to adapt to the load of the system. The goal of the system design is to optimize the system reward as a result of servicing clients with different QoS and reward/penalty requirements. A QoS manager in these systems can do a table lookup operation using the simulation result reported to optimize the system total reward dynamically in response to changing workloads during the run time. The simulation result is particularly applicable to multimedia and telecommunication systems in which dynamic QoS negotiation/renegotiation is used as a mechanism to optimize the overall system performance.
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.
16331940
Optimal Parallel Routing in Star Networks
Star networks have recently been proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star networks. Our result improves previous results for the problem.