Towards a smooth design process for static communicative node‐link diagrams

Node‐link infographics are visually very rich and can communicate messages effectively, but can be very difficult to create, often involving a painstaking and artisanal process. In this paper we present an investigation of node‐link visualizations for communication and how to better support their creation. We begin by breaking down these images into their basic elements and analyzing how they are created. We then present a set of techniques aimed at improving the creation workflow by bringing more flexibility and power to users, letting them manipulate all aspects of a node‐link diagram (layout, visual attributes, etc.) while taking into account the context in which it will appear. These techniques were implemented in a proof‐of‐concept prototype called GraphCoiffure, which was designed as an intermediary step between graph drawing/editing software and image authoring applications. We describe how GraphCoiffure improves the workflow and illustrate its benefits through practical examples.     

How In-Home Technologies Mediate Caregiving Relationships in Later Life

In-home technologies can support older adults' activities of daily living, provide physical safety and security, and connect elders to family and friends. They facilitate aging in place while reducing caregiver burden. One of older adults' primary concerns about in-home technologies is their potential to reduce human contact, particularly from cherished caregivers. In this exploratory in situ study, we provided an ecosystem of networked monitoring technologies to six older adults and their caregivers. We analyzed the amount and content of communication between them. The amount of noncomputer-mediated communication did not decrease through the 6-week study. The content of communication coalesced into four themes: communication about the technologies, communication facilitated by technologies, intrusiveness of technologies, and fun and playfulness with the technologies. Results suggest that in-home technologies, designed with sensitivity to older adults' primary motivations, have the potential to shape and tailor important relationships in later life.     

Managing digital collections: Towards a strategic framework for the development of appropriate and effective organisational data policies. Part I 1

This article begins by looking at changes in the student body in recent years as useful indicators of how libraries need to alter and adapt their student library provision. Among the concepts explored are the student as consumer-customer, the Google generation, greater than ever competition among students especially for the job market, new technology as fashion accessory as much as learning tool, the widening participation agenda for higher education, and the almost ubiquitous presence of multi-functional electronic devices.

There is an examination of some challenges for librarians in meeting the needs and demands of this new generation of students. These include the balancing of electronic and print provision, the future of the physical library environment, push rather than pull to deliver library services, anytime anywhere access to information, integration with other university services, and helping to fit students for the world of work.

The main message of the article is that librarians are not under threat from the giant search engines as long as they embrace the interactive technologies which students so willingly and expertly use, and adapt them to get library services out to students as customers.     

A framework to model and manipulate constraints for over-constrained geographic applications

Geographic applications are often over-constrained because of the stakeholders’ multiple requirements and the various spatial, alphanumeric and temporal constraints to be satisfied. In most cases, solving over-constrained problems is based on the relaxation of some constraints according to values of preferences. This article proposes the modelling and the management of constraints in order to provide a framework to integrate stakeholders in the expression and the relaxation of their constraints. Three families of constraints are defined: static vs. dynamic, intra-entity vs. inter-entities and intra-instance vs. inter-instances. Constraints are modelled from two points of view: system with the complexity in time of the different involved operators and user with stakeholders’ preferences. The methodology of constraints relaxation is based on primitive, complex and derived operations. These operations allow a modification of the constraints in order to provide a relevant solution to a simulation. The developed system was applied to reduce the streaming/floods risks in the territory of Pays de Caux (Seine Maritime, France).     

The making of the Xian terra‐cotta soldiers

Abstract

This paper describes the making of a short film on the Xian terra‐cotta soldiers using our integrated HU‐MANOID software. The method of creating and animating the soldiers’ faces is first presented. Then, we show how our approach, based on metaballs and spline surfaces, was used for designing and deforming soldiers’ bodies. For the animation of the bodies, we describe the motion control methods. Clothes for the soldiers are then described as well as horses and decor design. For the rendering, we explained our strategy using parallel machines. Finally, problems of integration are addressed.     

On the Easy Use of Scientific Computing Services for Large Scale Linear Algebra and Parallel Decision Making with the P-Grade Portal

Scientific research is becoming increasingly dependent on the large-scale analysis of data using distributed computing infrastructures (Grid, cloud, GPU, etc.). Scientific computing (Petitet et al. 1999) aims at constructing mathematical models and numerical solution techniques for solving problems arising in science and engineering. In this paper, we describe the services of an integrated portal based on the P-Grade (Parallel Grid Run-time and Application Development Environment) portal (http://www.p-grade.hu) that enables the solution of large-scale linear systems of equations using direct solvers, makes easier the use of parallel block iterative algorithm and provides an interface for parallel decision making algorithms. The ultimate goal is to develop a single sign on integrated multi-service environment providing an easy access to different kind of mathematical calculations and algorithms to be performed on hybrid distributed computing infrastructures combining the benefits of large clusters, Grid or cloud, when needed.     

Camera Control in Computer Graphics

Recent progress in modelling, animation and rendering means that rich, high fidelity virtual worlds are found in many interactive graphics applications. However, the viewer's experience of a 3D world is dependent on the nature of the virtual cinematography, in particular, the camera position, orientation and motion in relation to the elements of the scene and the action. Camera control encompasses viewpoint computation, motion planning and editing. We present a range of computer graphics applications and draw on insights from cinematographic practice in identifying their different requirements with regard to camera control. The nature of the camera control problem varies depending on these requirements, which range from augmented manual control (semi‐automatic) in interactive applications, to fully automated approaches. We review the full range of solution techniques from constraint‐based to optimization‐based approaches, and conclude with an examination of occlusion management and expressiveness in the context of declarative approaches to camera control.     

A generalization of the Curtis–Hedlund theorem

Let A be a set and let G be a group, and equip A^G with its prodiscrete uniform structure. Let τ:A^G→A^G be a map. We prove that τ is a cellular automaton if and only if τ is uniformly continuous and G-equivariant. We also give an example showing that a continuous and G-equivariant map τ:A^G→A^G may fail to be a cellular automaton when the alphabet set A is infinite.     

Topological Repairing of 3D Digital Images

We present here a new randomized algorithm for repairing the topology of objects represented by 3D binary digital images. By “repairing the topology”, we mean a systematic way of modifying a given binary image in order to produce a similar binary image which is guaranteed to be well-composed. A 3D binary digital image is said to be well-composed if, and only if, the square faces shared by background and foreground voxels form a 2D manifold. Well-composed images enjoy some special properties which can make such images very desirable in practical applications. For instance, well-known algorithms for extracting surfaces from and thinning binary images can be simplified and optimized for speed if the input image is assumed to be well-composed. Furthermore, some algorithms for computing surface curvature and extracting adaptive triangulated surfaces, directly from the binary data, can only be applied to well-composed images. Finally, we introduce an extension of the aforementioned algorithm to repairing 3D digital multivalued images. Such an algorithm finds application in repairing segmented images resulting from multi-object segmentations of other 3D digital multivalued images.