bluuebunny/crossref_metadata_2025 huggingface dataset:
Fast Feature‐Based Metamorphosis and Operator Design
Authors: Lee Tong‐Yee , Lin Young‐Ching , Sun Y.N. , Lin Leeween
Published: March 2003

Metamorphosis is a powerful visual technique, for producing interesting transition between two images or volume data. Image or volume metamorphosis using simple features provides flexible and easy control of visual effect. The feature‐based image warping proposed by Beier and Neely is a brute‐force approach. In this paper, first, we propose optimization methods to reduce their warping time without noticeable loss of image quality. Second, we extend our methods to 3D volume data and propose several interesting warping operators allowing global and local metamorphosis of volume data.
Occluder Shadows for Fast Walkthroughs of Urban Environments
Authors: Wonka Peter , Schmalstieg Dieter
Published: March 2003

This paper describes a new algorithm that employs image‐based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and automatically combine a relatively large set of occluders. The algorithm is fast to calculate and therefore also useful for scenes of moderate complexity and walkthroughs with over 20 frames per second. Occlusion is calculated dynamically and does not rely on any visibility precalculation or occluder preselection. Speed‐ups of one order of magnitude can be obtained.
Synchronisation and Load Balancing for Parallel Hierarchical Radiosity of Complex Scenes on a Heterogeneous Computer Network
Authors: Meneveaux Daniel , Bouatouch Kadi
Published: March 2003

In this paper we propose a SPMD parallel hierarchical radiosity algorithm relying on a novel partitioning method which may apply to any kind of architectural scene. This algorithm is based on MPI (Message Passing Interface), a communication library which allows the use of either a heterogeneous set of concurrent computers or a parallel computer or both. The database is stored on a common directory and accessed by all the processors (through NFS in case of a network of computers). As the objective is to handle complex scenes such as building interiors, to cope with the problem of memory size, only a subset of the database resides in memory of each processor. This subset is determined with the help of a partitioning into 3D cells, clustering and visibility calculations. A graph expressing visibility between the resulting clusters is determined, partitioned (with a new method based on classification of K‐means type) and distributed amongst all the processors. Each processor is responsible for gathering energy (using the Gauss‐Seidel method) only for its subset of clusters. In order to reduce the disk transfers due to downloading these subsets of clusters, we use an ordering strategy based on the traveling salesman algorithm. Dynamic load balancing relies on a task stealing approach while termination is detected by configuring the processors into a ring and moving a token around this ring. The parallel iterative resolution is of group iterative type. Its mathematical convergence is proven in the appendix.
Interactive High‐Quality Maximum Intensity Projection
Authors: Mroz Lukas , Hauser Helwig , Gröller Eduard
Published: March 2003

Maximum Intensity Projection (MIP) is a volume rendering technique which is used to visualize high‐intensity structures within volumetric data. At each pixel the highest data value, which is encountered along a corresponding viewing ray is depicted. MIP is, for example, commonly used to extract vascular structures from medical data sets (angiography). Due to lack of depth information in MIP images, animation or interactive variation of viewing parameters is frequently used for investigation. Up to now no MIP algorithms exist which are of both interactive speed and high quality. In this paper we present a high‐quality MIP algorithm (trilinear interpolation within cells), which is up to 50 times faster than brute‐force MIP and at least 20 times faster than comparable optimized techniques. This speed‐up is accomplished by using an alternative storage scheme for volume cells (sorted by value) and by removing cells which do not contribute to any MIP projection (regardless of the viewing direction) in a preprocessing step. Also, a fast maximum estimation within cells is used to further speed up the algorithm.
Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation
Authors: Gopi M. , Krishnan S. , Silva C.T.
Published: March 2003

We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R 3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection‐based approach we use to determine the incident faces on a point. We define our sampling criteria to sample the surface and guarantee a topologically correct mesh after surface reconstruction for such a sampled surface. We also present a new algorithm to find the normal at a vertex, when the surface is sampled according our given criteria. We also present results of our surface reconstruction using our algorithm on unorganized point clouds of various models.
Constructive Volume Geometry
Authors: Chen Min , Tucker John V.
Published: March 2003

We present an algebraic framework, called Constructive Volume Geometryn (CVG), for modelling complex spatial objects using combinational operations. By utilising scalar fields as fundamental building blocks, CVG provides high‐level algebraic representations of objects that are defined mathematically or built upon sampled or simulated datasets. It models amorphous phenomena as well as solid objects, and describes the interior as well as the exterior of objects. We also describe a hierarchical representation scheme for CVG, and a direct rendering method with a new approach for consistent sampling. The work has demonstrated the feasibility of combining a variety of graphics data types in a coherent modelling scheme.
A Novel Approach for Delaunay 3D Reconstruction with a Comparative Analysis in the Light of Applications
Authors: Nonato L. , Minghim R. , Oliveira M. C. F. , Tavares G.
Published: March 2003

This paper presents a novel algorithm for volumetric reconstruction of objects from planar sections using Delaunay triangulation, which solves the main problems posed to models defined by reconstruction, particularly from the viewpoint of producing meshes that are suitable for interaction and simulation tasks. The requirements for these applications are discussed here and the results of the method are presented. Additionally, it is compared to another commonly used reconstruction algorithm based on Delaunay triangulation, showing the advantages of the reconstructions obtained by our technique.
Rendering Silhouettes with Virtual Lights
Authors: Martín Domingo , Torres Juan Carlos
Published: March 2003

We present a new method for obtaining non‐photorealistic images. These images have two main visual components: silhouettes and non‐realistic colouring. Silhouettes are lines that define the form of an object. They are used in classical animation and illustration as the main expressive components. In these applications, if it is necessary, colouring can be added once the drawings are made. For instance, generally, in illustration, colouring is flat and does not transmit volume information whilst silhouettes do it in an economical way. The proposed method is based on the Virtual Lights model, which allows us to use external components, the virtual lights, to define silhouettes. In this way, the designer is free to control where, when and how the silhouettes must appear. The method can be used with B‐rep geometric models.
Modeling with Time and Events in Computer Animation
Authors: Kalra Devendra , Barr Alan H.
Published: March 2003

In this paper, we present a general, systematic and consistent treatment of time and events for computer animation. We first formalize the concepts of events and create a time primitive called an event unit. We then present a succession of organization schemes to compose event units for generating complex motion sequences. We present a directed graph representation for the organization of time and events that suggests the form of an event‐based time programming language. Details of implementation of a general event simulation system are given. Our approach provides a clean partitioning for the problem of motion design, a hierarchical scheme to compose motion behaviors from time primitives and a programming model for organizing animation. Traditional methods of kinematic controls and key frame interpolation are special cases of our general scheme. In addition, our treatment of events can be combined with kinematics, dynamics or constraint‐based systems to generate powerful motion modeling systems.
Accurate Image Generation and Interactive Image Editing with the A‐buffer
Authors: Lau Wing Hung , Wiseman Neil
Published: March 2003

The A‐buffer suggested by Carpenter [2] is a hidden surface removal method which deals with arbitrary overlapping edges in a pixel. In this paper, we suggest a way of increasing the subpixel resolution by storing the bitmask index rather than the bitmask. This allows much more accurate images to be generated while at the same time, minimising memory usage. It also allows zooming to reveal more information. We also suggest an enhancement to the A‐buffer by allowing the creation of dynamic objects. These dynamic objects can then be edited (deleted, moved, etc.) interactively as image modification and assembly is going on. This new buffer forms part of the image composition system we have been working on.
Computing Dynamic Changes to BSP Trees
Authors: Chrysanthou Y. , Slater M.
Published: March 2003

This paper investigates a new method for dynamically changing Binary Space Partition (BSP) trees. A BSP tree representation of a 3D polygonal scene provides an ideal data structure for rapidly performing the hidden surface computations involved in changing the viewpoint. However, BSP trees have generally been thought to be unsuitable for applications where the geometry of objects in the scene changes dynamically. The purpose of this paper is to introduce a dynamic BSP tree algorithm which does allow for such changes, and which maintains the simplicity and integrity of the BSP tree representation. The algorithm is extended to include dynamic changes to shadows. We calibrate the algorithms by transforming a range of objects in a scene, and reporting on the observed timing results.
Realistic Generation and Real Time Animation of Images of the Human Colon
Authors: Haritsis Angelo , Gillies Duncan , Williams Christopher
Published: March 2003

A simulator has been built to teach doctors the skill of handling a flexible endoscope for gastrointestinal investigations. Trainees use a dummy endoscope in which the control actions are transduced into voltages and sensed by the computer. The simulator computes the position and viewing direction of the endoscope within an internal model of the human colon. Then a renderer draws the view, reproducing as far as possible what would be seen during a real colonoscopy. Since the system must generate at least ten frames per second for realistic animation, standard rendering techniques, such as ray tracing, could not be used. Consequently a new method was devised, based on identifying coherent regions along each scan line which can be rendered by table lookup. The method allows shaded Lambertian surfaces to be drawn at a frame rate of 15 per second, using modest computing resources. Although several approximations were required in the analysis, the computer images of the internal surfaces of the human colon present a high degree of visual realism.
Normal orientation methods for 3D offset curves, sweep surfaces and skinning
Authors: Siltanen Pekka , Woodward Charles
Published: March 2003

Computing an offset curve to a 3D curve involves the basic problem of normal orientation in space. The same thing is encountered when interpolating surfaces with 3D sweep or skinning methods. Different methods for normal orientation are discussed an this article. A new method is presented for normal orientation on general parametric curves.
X: Why Z?
Authors: Bowen Jonathan P.
Published: March 2003

Window management systems are now used extensively for user interfaces to computer systems. In particular, X11 has come to dominate the workstation market as a widely accepted industry standard on many different hardware platforms. However, no formal standard currently exists for this window system, both in terms of an international standards body (although this is being addressed), and in terms of a precise (mathematical) specification of what the interface is intended to do. This paper advocates the use of a formal notation to describe such an important system to avoid ambiguity and undesired or unintended variations between different implementations of the same system.

Theformal notation used for demonstration purposes, Z, is based on set theory, and has been developed at the Programming Research Group in Oxford.
A New Two Dimensional Line Clipping Algorithm for Small Windows
Authors: Day J. D.
Published: March 2003

A new algorithm for clipping lines against rectangular windows is described. It is suitable for computations in both object space (floating point arithmetic) and image space (integer arithmetic). The algorithm is compared with other object and image space algorithms and shown to be superior for small windows.
Parallel Progressive Ray‐tracing
Authors: Notkin Irena , Gotsman Craig
Published: March 2003

A dynamic task allocation algorithm for ray‐tracing by progressive refinement on a distributed‐memory parallel computer is described. Parallelization of progressive ray‐tracing is difficult because of the inherent sequential nature of the sample location generation process, which is optimized (and different) for any given image. We report on experimental results obtained from our implementation of this algorithm on a Meiko parallel computer. The three performance measures of the algorithm, namely, load‐balance, speedup, and image quality, are shown to be good.
A Cooperative Architecture for Hypermedia Editing – CoMEdiA
Authors: Santos Adelino
Published: March 2003

CoMEdiA is a cooperative hypermedia editing prototype, which enables co‐authors to cooperatively produce hypermedia documents. It allows co‐authors to communicate their ideas, drafts, guidelines, constraints, and annotations with other co‐authors in order to exchange information (remotely or face‐to‐face), improvepassages and modify notes until a final document is achieved. We did not concentrate on the depth but on the breadth of the features. Our efforts were on integrating and coordinating concepts from collaboration, multimedia, and hyper organization rather than on making a specialized system in any of them. Our first step was to investigate issues in group editing and cooperation. Then we started by having text in our documents, later static images, and 2D‐Graphics. This procedure was adopted because we felt these were the most simple media to integrate and process.
A Note on 3D‐Clip Optimisation
Authors: Hübl Josef
Published: March 2003

In order to optimize the transformation‐clipping‐pipeline of PHIGS or GKS‐3D it is sometimes necessary to determine whether a plane intersects a perpendicular volume or not. The solution to this problem is not very complicated. This paper offers a more effective procedure that handles this task.
DIGIS A Graphical User Interface Design Environment for Non‐Programmers
Authors: de Bruin Hans , Bouwman Peter , van den Bos Jan
Published: March 2003

DIGIS (Direct Interactive Generation of Interactive Systems) is a graphical UI design environment for non‐programmers that facilitates the design of all aspects of a UI with direct manipulation techniques. DIGIS is based on four models: an object model, a system task model, an interaction model and a dialogue control model. These four models describe an interactive system at a high conceptual level which allows a UI designer to quickly construct a high quality direct manipulation UI that supports undo‐redo, context‐sensitive help and guidance, and connect the UI with the (existing) application.
Abstract Interaction Objects
Authors: Duke D.J. , Harrison M.D.
Published: March 2003

The concept of an ‘interactor’ has been introduced by Faconti and Paterno' [6] as an abstraction of an entity in interactive graphics capable of both input and output. However the notion of interaction object need not be confined to graphics systems; it represents a useful structure for thinking and reasoning about the behaviour of interactive systems in general. As part of Esprit Basic Research Action 7040 (Amodeus‐2) we are using the concept of interactor, and existing work on state‐based processes and agents, to develop a model and theory of interactive systems. In this paper we describe two formal models for interaction objects and sketch how they can be used to build a small vocabulary of operators to support the rigorous specification of a graphics system. Our model differs from the approach of Faconti and Paterno' in that it abstracts away from any specific graphics framework and is thus suited to the level of abstraction demanded by formal approaches to system development.
Fast Spheres
Authors: Patterson John W.
Published: March 2003

A new method for generating sphere‐like images, using parabolic surfaces delimited by Bresenham's circle‐ generation algorithm, is presented. In many cases the resultant images are indistinguishable from spheres illuminated from a given single direction. The main form of the algorithm uses first and second integer differences to minimise computation and uses typically not more than one floating‐point calculation per sphere. Two variants of the algorithm are given, one optimized for the special case of the light‐source being behind the view‐point, and one in which values are calculated for a z‐buffer hidden‐surface algorithm at the same time as the pixel values. The difference formulae can be exploited by differencing hardware or digital signal processors although very little arithmetic, typically five low‐weight integer operations, including address calculation operations, is required per pixel on a conventional architecture.
Boolean Operations and Spatial Complexity of Face Octrees.
Authors: Pla‐Garcia Núria
Published: March 2003

Most of the existing representation schemes of free form surfaces or objects with free form boundary are not capable to compute efficiently boolean operations and other usual geometric interrogations. Classical octrees, proposed to overcome this drawback, require large amounts of memory. Face Octrees was a proposal suitable in the case of smooth surfaces or objects with smooth boundary. In this paper, different aspects of this model are discussed. In fact, it is focussed on the description of boolean operation algorithms using this model, proving that it solves the first problems, and on the computation of spatial complexity bounds. These bounds allow an evaluation of the fitness of each of the existing octree models in a given situation, showing the advantage of Face Octrees when the boundaries are smooth (curvatures are small).
A New Paradigm for Geometric Processing
Authors: Yamaguchi Fujio , Niizeki Masatoshi
Published: March 2003

A new paradigm for geometric processing is proposed. The paradigm can be featured by the four key phrases: (1) Totally Four Dimensional Homogeneous Processing, (2) 4 × 4 Matrix Method and 4 × 4 Determinant Method, (3) Integer Arithmetic with Adaptive Data‐Length Control Technique, (4) Systematic Paradigm Structures Based on the Duality.
A Rendering Algorithm for Discrete Volume Density Objects
Authors: Blasi Philippe , Le Saec Bertrand , Schlick Christophe
Published: March 2003

We present a new algorithm for simulating the effect of light travelling through volume objects. Such objects (haze, fog, clouds…) are usually modelized by voxel grids which define their density distribution in a discrete tridimensional space. The method we propose is a two‐pass Monte‐Carlo ray‐tracing algorithm that does not make any restrictive assumptions neither about the characteristics of the objects (both arbitrary density distributions and phase functions are allowed) nor about the physical phenomena included in the rendering process (multiple scattering is accounted for). The driving idea of the algorithm is to use the phase function for Monte‐Carlo sampling, in order to modify the direction of the ray during scattering.
GKS‐9x: Some Implementation Considerations
Authors: Damnjanovic L.B. , Duce D.A. , Robinson S.K.
Published: March 2003

The Graphical Kernel System (GKS) was published as an ISO standard for computer graphics programming in August 1985. GKS is now undergoing revision in ISO/IEC and at the time of writing the text of the Draft International Standard of GKS‐9x was being finalized. This paper presents a way in which a key part of the new functionality in GKS‐9x, namely namesets and selection criteria, can be implemented effectively.
Cooperative Visualization of Computational Fluid Dynamics
Authors: Gerald‐Yamasaki Michael J.
Published: March 2003

Tempus Fugit/Interview is a computational fluid dynamics visualization application for which processing is distributed between high performance graphics workstations and supercomputers. Facilities are provided in the application for more than one user to view shared images creating a cooperative visualization environment. The way in which the computation is partitioned between the super computer and the workstations is critical to the capability of the application to present simultaneous, identical, animated images of fluid dynamics to more than one user.
The Method of Dynamic Palette Construction in Realistic Visualization Systems
Authors: Voloboj Aleksej G.
Published: March 2003

The paper describes the colour approximation problem and the method of dynamic palette construction is suggested for its solution. The method uses the graphic display palette based on the computed true colour of the individual picture. Some aspects of human colour perception are considered. Two metrics in colour space are introduced to estimate closeness of the suggested colour approximation. The method was applied to visualize 3D scenes generated by ray tracing.
A Fractal Method for Digital Elevation Model Construction and its Application to a Mountain Region
Authors: Brivio Pietro Alessandro , Marini Daniele
Published: March 2003

This paper presents and discusses the results of a methodology for the construction of Digital Elevation Models (DEM), based on mathematical principles of fractal geometry. Classical approaches to DEM are founded on numerical methods of interpolation or approximation of data extracted from contour lines of standard topographic maps. Fractal geometry opens a new and innovative approach in which the irregularity, erraticity and self similarity of fractal structures mimics at best the typical behaviour of high mountain profiles. The adoption of fractal methods requires the identification of the fractal dimension D for a given data set. The determination of the fractal dimension D can be achieved applying some special mathematical method on finite set of samples. Different methods. for D estimation are presented. Once the fractal dimension is given, it is possible to reconstruct a surface relief using different fractal methods which interpolate the original set of elevation data. Our research has also investigated two different interpolation methods, fBm and IFS, both confirming that the fractal approach is very well suited for high relief terrain modeling. Photo realistic rendering of the computed DEM allows to appreciate the quality of the reconstruction through visual inspection.
Beyond WYSIWYG: Display of Hidden Information in Graphics Editors
Authors: Schleich R. , Dürst M.J.
Published: March 2003

Graphics editors such as computer aided design systems are complex and difficult to use. We attribute this to the fact that only a small part of the information is visible and therefore accessible and understandable. Only the graphics objects themselves are visible, but the relations between these objects remain hidden. We propose an effective way to visualise this information in the form of trees and graphs in so‐called structure browsers. A prototype implements this proposal based on an object‐oriented application framework for graphics editors.
A Semantics‐based Approach for the Design and Implementation of Interaction Objects
Authors: Paterno' F. , Leonardi A.
Published: March 2003

Although tools for developing graphical user interfaces are becoming increasingly popular, they do not usually highlight precisely which key elements developers should take into account. This still entails considerable expertise in developing user interfaces. In this paper we present an approach to overcome these problems. Our approach is based on a model for interaction objects and a corresponding design space. This is supported by a toolkit where the available interaction objects are initially classified by their semantics whereas in most current toolkits they are investigated by their appearance. This facilitates designers and developers in identifying the interactors needed in order to obtain an Interactive System supporting user tasks.
Real Time Fitting of Hand‐Sketched Pressure Brushstrokes
Authors: Pudet Thierry
Published: March 2003

A method is described for fitting the outline of hand‐sketched pressure brushstrokes with Bézier curves. It combines the brush‐trajectory model, in which a stroke is generated by dragging a brush along a given trajectory, with a fast curve fitting algorithm.

The method has been implemented for a vector‐based drawing program in which the user draws with a cordless pressure‐sensitive stylus on a digitizing tablet. From the trajectory followed by the stylus, its associated pressure data, and a specified brush, a stroke of variable width is computed and displayed in real time.

First, the digitized trajectory is fitted, thus removing noise. Then, from polygonal approximations of the fitted trajectory and the brush outline, a polygonal approximation of the stroke outline is computed. Working with polygonal approximations reduces computations to simple geometric operations and greatly simplifies the treatment of dynamic, pressure‐controlled brushes. Last, the polygonal approximation of the stroke outline is fitted. The result is a closed piecewise Bézier curve approximating the brushstroke outline to within an arbitrary error tolerance.

Several examples of hand‐sketched drawings realized with this method are presented.
A Formal Approach to the Specification of Graphic Object Functions
Authors: Torres J.C. , Clares B.
Published: March 2003

Graphic objects are an abstract mathematical model for graphic systems. The model is an algebraic approach to represent graphic information, which include modelling operations. This formalism require some method to describe normal graphic procedures, such as changing the object colour or texture mapping, as these procedures are essential to represent graphic processes.

This paper extends the theory by introducing the concept of graphic object functions. A graphic object function transforms one graphic object into another, changing its visual appearance or its geometric properties. A formal definition of graphic functions is given, with a characterization of two special kinds of graphic object functions: filters and object transference functions. These two kinds of functions can be used to perform normal graphic operations, such as changing colours, texture mapping or clipping.

Equivalence relationships between graphic objects induced by functions are also studied. These relationships establish an hierarchical structure on the graphic object set.
Fast Wavelet Radiosity Method
Authors: Pattanaik Sumanta N. , Bouatouch Kadi
Published: March 2003

Wavelet analysis has been found [1] to be very useful for functional representation and accurate global solution of radiosity. In radiosity we deal with functions in 2D and 4D spaces. Under such conditions, the biggest bottleneck in applying this wavelet analysis seems to be the large number of multidimensional inner products. In this paper, we propose (i) the use of interpolating wavelets for fast inner product computation and consequently for faster wavelet radiosity solution (ii) the use of hierarchical decomposition technique for determining the smoothness of the radiosity function for optimal adaptive subdivision.
Recovering a Smooth Boundary Representation from an Edge Quadtree and from a Face Octree
Authors: Pla‐Garcia N.
Published: March 2003

The Face Octrees are a representation scheme which is very suitable to represent both smooth free form surfaces and solids with smooth boundary, as well as, to perform operations among them. However, the Face Octree representation is non continuous, thus an algorithm to convert this model to a boundary representation can be necessary. The conversion algorithm makes the advantages of this scheme really significant. The current paper is involved in the conversion from the Face Octrees model to a smooth boundary representation. However, first the planar case is treated.
A New Real Time Geometric Transformation Matrix and its Efficient VLSI Implementation
Authors: Ng C. M. , Bustard D. W.
Published: March 2003

The geometric transformation of an image with irregular shapes from a source space to a target space requires a huge number of multiplications and additions for each pixel. Such a through put is impossible to deliver by any processor in real‐time. This paper presents a new transformation matrix which can be used toper form real‐time 2‐D geometric transformations economically. The implementation of the transformation engine that is used to execute the transformation matrix is also presented. Experimental results indicate that real‐time geometric transformations based on a 4 × 4 transformation mesh can be achieved with the use of the transformation engine. This real‐time transformation function is useful in warping and blending of images, and can be easily extended to perform irregular shape transformations with a large number of control points in the transformation mesh.
Colouration Issues in Computer Generated Facial Animation
Authors: Patel M.
Published: March 2003

In everyday interactions with one another we use the face for recognising people and for communicating with them. Despite the considerable amount of research into computer generated facial animation, one particular aspect, that of the colouration of the face appears to have been neglected. In this paper we address issues pertinent to the use of colour for both modelling the appearance of the face and for enhancing communication during facial expression and animation. Colouration is an integral part of the face, which helps in the recognition of faces as well as in the interpretation of the often subtle signals emitted by the human face.
Dilemmas of a Multicultural Theory of Citizenship
Authors: Parekh Bhikhu
Published: March 2003

In his multicultural citizenship Will Kymlicka offers a liberal theory of minority rights. I argue that although his theory is ingenious, it is seriously defective. Since liberalism itself is a specific culture, a liberal theory of multiculturalism is logically incoherent. Kymlicka makes the further mistake of thinking that all cultured communities conceptualise and relate to culture in an identical manner. His discussion of the rights of immigrants rests on a flawed understanding of the nature of immigration, and is highly questionable.
Do We Need a Liberal Theory of Minority Rights? Reply to Carens, Young, Parekh and Forst
Authors: Kymlicka Will
Published: March 2003

In their perceptive critiques of my recent book on Multicultural Citizenship, Iris Young, Joseph Carens, Bhikhu Parekh and Rainer Forst raise a number of interesting and important issues. In this short response to their critiques, I focus on two of them. First, whereas I tried to draw a sharp distinction between immigrants and national minorities, my critics argue that we should think of ethnocultural groups on a more fluid continuum. Second, whereas I tried to ground a theory of minority rights on specifically liberal principles, my critics argue that such an approach is unduly intolerant of non‐liberal ethnocultural groups. In response to these challenging questions, I try to both clarify and strengthen the positions I outlined in my book.
Releasing executive directors for outside directorships – the governance implications
Authors: Ward Martin
Published: March 2003

Sir Adrian Cadbury (1993), commenting on the Cadbury Report, highlights not only the importance placed on outside directors for improved governance but also three areas of concern, namely the appointments process, the availability and the independence of outside directors.

The strengths required for the role of outside director in a quoted PLC are considerable, and suggests that outside directors of listed UK public limited companies require the skills and experience that only existing executive directors of similar PLCs are likely to possess. Release by companies of their directors for outside duties raises its own governance issues. Should shareholders rather than internal management approve such appointments? Who has the right to the director’s fees, the company or the individual? Based on the response of 33 companies, this research finds that a majority (73%) have formal policies covering these governance issues but that between companies there are numerous policy differences.
Changing Scenes In, From and Outside the Board Room: UK corporate governance in practice from 1989 to 1999
Authors: Pye Annie
Published: March 2003

This paper is about changes in ‘corporate directing’, observed from interviews spanning the last ten years with Chairmen, Chief Executives, executive and non‐executive directors in nine large UK organizations. Not only has the economic, political and social context changed, the ‘what’, ‘how’ and ‘why’ of boards has also changed. This paper seeks to illustrate some of these changes, both inside and outside the board room, where the role of fund managers has also changed. It concludes that the Chairman and Chief Executive relationship provides a powerful axis around which board room culture (r)evolves and corporate governing takes place.
CEO Replacement and Compensation Around Dividend Omissions
Authors: Fosberg Richard
Published: March 2003

Agency theory suggests that to motivate a firm’s managers to act in the best interests of the firm’s shareholders, managerial compensation should be directly tied to firm performance. In this study, the measure of firm performance used to test this theory is the decision by a firm to omit its common stock dividend. A dividend omission is taken to indicate that the firm’s management and board of directors believe that the current and future earnings prospects (performance) of the firm are poor. In a sample of firms that omitted their dividend sometime during the years 1987 through 1992, we find that, on average, the CEOs (Chief Executive Officers) of these firms experienced significant decreases in total compensation (wealth) around the time of the dividend omission. Not surprisingly, the CEOs who experienced the greatest compensation loss were the 61.4% of CEOs who lost their jobs. The probability that a CEO would be replaced around the time of the dividend omission was found to be directly related to the CEO’s age and inversely related to the firm’s performance and CEO share ownership.
The Relationship Between Governance Structure and Audit Fees Pre‐Cadbury: some empirical findings
Authors: Peel Michael J. , Clatworthy Mark A.
Published: March 2003

In this paper we provide new evidence on the relationship between internal governance structures (board composition and ownership concentration) and audit fees of UK industrial quoted companies, before the recommendations of the Cadbury Committee were implemented. We also develop a new hypothesis derived from agency theory, in an attempt to explain the puzzling positive relationship between audit and non‐audit fees. In common with post‐Cadbury research, we find no significant evidence that board structure variables, including chairman/chief executive officer split and the proportion of non‐executive directors on the board, impact significantly on external audit fees. Also, while prior research has shown that the aggregated level of institutional and managerial ownership are negatively associated with audit fees, we find that only one constituent of this variable, namely directors’ ownership, has a significant impact.
Corporate Killing as a Corporate Governance Issue
Authors: Belcher Alice
Published: March 2003

In May 2000 the government proposed the introduction of a new offence of corporate killing founded on the concept of “management failure”. Two specific corporate risks are investigated; the risk that the company’s operations will kill one of its employees or a member of the public and the risk that the company will be convicted of an offence indicating corporate responsibility for that killing. The article demonstrates, firstly, that the risks associated with corporate killing fall within the ambit of the Turnbull Guidance. More importantly, it uses this particular, not directly financial, example to illustrate the proposition that Turnbull should not be associated with closure; rather it should be associated with the opening of a new level of corporate governance debate that will focus on corporate behaviour rather than corporate policy.
Corporate Governance in Bahrain
Authors: Hussain Saleh H. , Mallin Chris
Published: March 2003

Corporate governance is developing rapidly in many countries across the world. In this paper we analyse the existing state of corporate governance in a country in the Middle East: Bahrain. We employ a survey methodology, with a questionnaire being sent to all of the companies listed on the Bahrain Stock Exchange Market. An analysis of the responses reveals that Bahraini companies have in place some of the features of corporate governance best practice with boards dominated by non–executive directors, for example, and the separation of the roles of Chair and CEO. However, it is not clear how effective the nomination/appointments process is and directors tend to be fairly entrenched. In terms of risk management and control, the majority of Bahraini companies have an internal audit department and risk management control. Overall, it seems that Bahraini companies have a number of key corporate governance structural features in place, but that there remains further progress to be made.
Employee Creativity and Suggestion Programs: An Empirical Study
Authors: Carrier Camille
Published: March 2003

This paper takes a closer look at a functional strategy known as the innovation or creativity strategy. It is used by growing numbers of companies to take advantage of the imaginative capacities of their entire workforce instead of relying on a handful of specialists or fostering the emergence of a few marginal “heroes” within the organization. The strategy involves the introduction of an improvement program based on employee suggestions. The goal of the research described in this paper was therefore to document twenty two such programs introduced by manufacturing companies in Quebec, to describe the operating methods used, and to summarize and analyze the results. Twelve large companies (more than two hundred employees) and ten SMEs (Small and Medium Sized enterprises with between twenty five and two hundred employees) took part in the survey.
Design As Knowledge Integration Capability
Authors: Carlisle Ysanne , Dean Alison
Published: March 2003

The design literature offers two design process models as alternatives for acquiring and using knowledge in design. The best established is the rational problem solving model which calls for technical recommendations. The reflective practitioner model is appropriate to softer, controversial issues that call for ideological prescriptions. We view these models as complementary, not alternative, strategies which can assist in understanding knowledge integration in the design process. This paper offers a more holistic perspective upon design than that commonly found in the Design Studies literature. Our conceptualisation of design as knowledge integration capability suggests that effective design decision making integrates knowledge contributions and reconciles disparate values to a common purpose. The quality of design decision making increasingly depends on the effective integration of knowledge from a range of sources. This is especially true in the knowledge intensive sectors which we have studied. We offer illustrations from biotechnology and note that technical knowledge inputs can not alone ensure a successful outcome. This has implications for the management and practice of design in multidisciplinary project teams.
Effective Leadership Style: Both Universal and Contingent?
Authors: Arvonen Jouko , Ekvall Göran
Published: March 2003

More than 2,000 employees from different types of private and public organizations in Sweden and USA rated their managers with regard to actual and appropriate leadership style and the operation demands in the departments the managers were responsible for. Three aspects of these domains were measured, namely change, employees and production. The manager’s competence was also rated and used as a criteria for effectiveness. The results revealed that the subordinates do not experience much adjustment between actual leadership behavior and situational demands, but correlations between appropriate leadership style and organizational demands show that they observe a need for such adjustments. There are substantial correlations between rated actual leadership style and competence across situations. However, ANOVAs revealed some interaction effects of style and situation on competence for production‐oriented leadership behavior. The results are viewed as support of the thesis that effective leadership is mainly universal.
Call Centres: Pre‐evaluation of their Usefulness in Local Government
Authors: McElhinney David , Proctor Tony
Published: March 2003

The development of contact‐centres within those local government organisations in the UK is occurring with inadequate strategic consideration. The general themes which emerged during in‐depth surveys strongly support the proposition. Thus, a significant new product development is at risk and may cost each individual organisation many millions of pounds in set‐up costs representing substantial financial commitment. Yet, there is only limited knowledge of capital costs or on‐going revenue costs, strong evidence of internal resistance, a lack of any shared vision, or knowledge of the level of risk. There is only limited understanding of the organisational impact of such an innovation, its potential benefits or added value that it could provide. There is also evidence to support the view that the decision‐making process is following a path of logical incrementalism without clearly stated project objectives or formal project appraisal. There is a creeping commitment to the continuation of such projects, and often a lack of group and intragroup coherence. Nevertheless, there is some evidence of powerful product champions and compliant project teams.
Imagination and Memory
Authors: Garry Maryanne , Polaschek Devon L.L.
Published: March 2003

A growing body of literature shows that imagining contrary-to-truth experiences can change memory. Recent experiments are reviewed to show that when people think about or imagine a false event, entire false memories can be implanted. Imagination inflation can occur even when there is no overt social pressure, and when hypothetical events are imagined only briefly. Overall, studies of imagination inflation show that imagining a counter-factual event can make subjects more confident that it actually occurred. We discuss possible mechanisms for imagination inflation and find that, with evidence supporting the involvement of both source confusion and familiarity in creating inflation, the primary mechanism is still to be determined. We briefly review evidence on individual differences in susceptibility to inflation. Finally, the widespread use of imagination-based techniques in self-help and clinical contexts suggests that there may be practical implications when imagination is used as a therapeutic tool.
Culture and Cognitive Development
Authors: Tomasello Michael
Published: March 2003

Human beings are biologically adapted for culture in ways that other primates are not. The difference can be clearly seen when the social learning skills of humans and their nearest primate relatives are systematically compared. The human adaptation for culture begins to make itself manifest in human ontogeny at around 1 year of age as human infants come to understand other persons as intentional agents like the self and so engage in joint attentional interactions with them. This understanding then enables young children (a) to employ some uniquely powerful forms of cultural learning to acquire the accumulated wisdom of their cultures, especially as embodied in language, and also (b) to comprehend their worlds in some uniquely powerful ways involving perspectivally based symbolic representations.
Metacognitive Development
Authors: Kuhn Deanna
Published: March 2003

Traditional developmental research in memory and reasoning, as well as current investigations in such disparate areas as theory of mind, episte-mological understanding, knowledge acquisition, and problem solving, share the need to invoke a meta-level of cognition in explaining their respective phenomena. The increasingly influential construct of metacognition can be conceptualized in a developmental framework. Young children's dawning awareness of mental functions lies at one end of a developmental progression that eventuates in complex metaknowing capabilities that many adults do not master. During its extended developmental course, metacognition becomes more explicit, powerful, and effective, as it comes to operate increasingly under the individual's conscious control. Enhancing (a) metacognitive awareness of what one believes and how one knows and (b) metastrategic control in application of the strategies that process new information is an important developmental and educational goal.
Why Don't Moral People Act Morally? Motivational Considerations
Authors: Batson C. Daniel , Thompson Elizabeth R.
Published: March 2003

Failure of moral people to act morally is usually attributed to either learning deficits or situational pressures. We believe that it is also important to consider the nature of moral motivation. Is the goal actually to be moral (moral integrity) or only to appear moral while, if possible, avoiding the cost of being moral (moral hypocrisy)? Do people initially intend to be moral, only to surrender this goal when the costs of being moral become clear (overpowered integrity)? We have found evidence of both moral hypocrisy and overpowered integrity. Each can lead ostensibly moral people to act immorally. These findings raise important questions for future research on the role of moral principles as guides to behavior.