Book reviews

Monk, A., Diaper, D., and Harrison, M. D. (1992). People and Computers VII. 534 pages, US$69.96: Cambridge, England: Cambridge University Press. (ISBN 0–521–44591–4)

Duffy, T. M., Palmer, J. E., and Mehlenbacher, B. (1992). Online Help: Design and Evaluation. 260 pages, US$55.00 (cloth) US$26.50 (paper): Norwood, NJ: Ablex Publishing Corp. (ISBN 0–89391–848–2)     

Book reviews

Foley, James D., van Dam, Andrles, Feiner, Steven K., and Hughes, John. Computer Graphics: Principles and Practice (2nd Ed.), Reading, MA: Addison‐Wesley (1990), pp. 1774. $59.95 (U.S. dollars), ISBN 0–201–12110–7.

Berry, Dianne and Hart, Anna (Eds.). Expert Systems: Human Issues. Cambridge, MA: MIT Press (1990), pp. 263. $35.00 (U.S. dollars), ISBN 0–262–02307–5.     

Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid

Given a parametric polynomial family p(s; Q) := {ⁿ _k=0 a_k (q)s^k : q ] Q}, Q R ^m , the robust root locus of p(s; Q) is defined as the two-dimensional zero set _p,Q := {s ] C:p(s; q) = 0 for some q ] Q}. In this paper we are concerned with the problem of generating robust root loci for the parametric polynomial family p(s; E) whose polynomial coefficients depend polynomially on elements of the parameter vector q ] E which lies in an m-dimensional ellipsoid E. More precisely, we present a computational technique for testing the zero inclusion/exclusion of the value set p(z; E) for a fixed point z in C, and then apply an integer-labelled pivoting procedure to generate the boundary of each subregion of the robust root locus _p,E . The proposed zero inclusion/exclusion test algorithm is based on using some simple sufficient conditions for the zero inclusion and exclusion of the value set p(z,E) and subdividing the domain E iteratively. Furthermore, an interval method is incorporated in the algorithm to speed up the process of zero inclusion/exclusion test by reducing the number of zero inclusion test operations. To illustrate the effectiveness of the proposed algorithm for the generation of robust root locus, an example is provided.     

Integral-type generalizations of operators obtained from certain multivariate polynomials

Abstract In this work, we mainly focus on the Kantorovich-type (integral-type) generalizations of the positive linear operators obtained from the Chan-Chyan-Srivastava multivariable polynomials. Using the notion of A-statistical convergence, we obtain various approximation theorems including a statistical Korovkin-type result and rates of A-statistical convergence with the help of the modulus of continuity, Lipschitz class functionals and Peetre’s K-functionals. We also introduce an sth order generalization of our approximating operators. Keywords. Chan-Chyan-Srivastava multivariable polynomials, Korovkin approximation theorem, Kantorovich-type operators, A-statistical convergence, modulus of continuity, Lipschitz class functional, Peetre’s K-functional Mathematics Subject Classification (2000): Primary: 41A25; 41A36, Secondary: 33C45     

Book reviews

Patent Harmonization Harold C. Wegner London, Sweet & Maxwell, 1993 xx + 376 pp., £70.00 (hardback)

Of Authors and Origins: essays on copyright law Brad Sherman & Alain Strowel (Eds) Oxford, Clarendon Press, 1994 xiv + 313 pp., £30.00 (hardback)

Future Air Navigation Systems Werner Guldimann & Stefan Kaiser Dordrecht, Martinus Nijhoff, 1993 Utrecht Studies in Air and Space Law, Vol. 13 viii + 281 pp., £76.50 (hardback)

The Law of Copyright Terence Prime London, Fourmat Publishing, 1992, xxiv + 313 pp., £30.00 (paperback)     

Regular matrix transformations and rates of convergence of positive linear operators

Abstract This paper investigates the effects of matrix summability methods on the A-statistical approximation of sequences of positive linear operators defined on the space of all 2π-periodic and continuous functions on the whole real axis. The two main tools used in this paper are A-statistical convergence and the modulus of continuity. Keywords: Regular infinite matrices, A-statistical convergence, rates of A-statistical convergence, positive linear operators, the Korovkin theorem, modulus of continuity. Mathematics Subject Classification (2000): 41A25, 41A36     

Randomness-Efficient Sampling within NC1

We construct a randomness-efficient averaging sampler that is computable by uniform constant-depth circuits with parity gates (i.e., in uniform AC ⁰[⊕]). Our sampler matches the parameters achieved by random walks on constant-degree expander graphs, allowing us to apply a variety expander-based techniques within NC ¹. For example, we obtain the following results:

Book Review

Abstract

The Visual Mind, Art and Mathematics Emmer, Michele (ed) The MIT Press. Cambridge, Massachusetts. The Leonardo Book series. ISBN 0-262-05048-X. Price £35

Multilingual Multimedia: Bridging the Language Barrier with Intelligent Systems Yazdani, Masoud (ed) Intellect Books, Oxford, 1993 ISBN-l-871516-30-7. Price £14.95     

Biomechanics and performance when using a standard and a vertical computer mouse

Objective: to compare the biomechanics and performance while using a vertical computer mouse (VM) and a standard mouse (SM). Methods: muscle activation (electromyography), forearm movements (electrogoniometers), performance (Fitts' Law test) and satisfaction (questionnaire) of 16 subjects were evaluated. Results: there were significant differences between the VM and the SM, respectively, on motion (28° vs. 42° pronation, p = 0.001; 5° ulnar vs. 7° radial deviation, p = 0.016) and muscle activity (13% vs. 16% of extensor carpi activity, p = 0.006; 10% vs. 13% extensor digitorum activity, p = 0.001). VM user satisfaction was good (68); however, time to target was longer (4.2 vs. 3.4 s, p < 0.001). Conclusions: using the VM decreased wrist pronation and lowered wrist extensor muscle activity, but additional training and familiarisation time may be required to improve user performance.

Practitioner Summary: Using a vertical mouse can decrease the exposure to biomechanical risk factors for computer mouse use-related musculoskeletal disorders. Using a vertical computer mouse resulted in less wrist pronation and lower wrist extensor muscle activity. But, training and familiarisation are required.     

A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse

A Schur-type algorithm is presented for the simultaneous triangular factorization of a given (non-degenerate) structured matrix and its inverse. The algorithm takes the displacement generator of a Hermitian, strongly regular matrixR as an input, and computes the displacement generator of the inverse matrixR ⁻¹ as an output. From these generators we can directly deduce theLD ⁻¹ L ^* (lower-diagonal-upper) decomposition ofR, and theUD ⁻¹ U ^* (upper-diagonallower) decomposition ofR ⁻¹. The computational complexity of the algorithm isO(rn ²) operations, wheren andr denote the size and the displacement rank ofR, respectively. Moreover, this method is especially suited for parallel (systolic array) implementations: usingn processors the algorithm can be carried out inO(n) steps.     

The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

In this paper we separate many-one reducibility from truth-table reducibility for distributional problems in DistNP under the hypothesis that P ≠ NP . As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT with a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT with a less redundant distribution unless P = NP . We extend this separation result and define a distributional complexity class C with the following properties: (1) C is a subclass of DistNP, this relation is proper unless P = NP. (2) C contains DistP, but it is not contained in AveP unless DistNP \subseteq AveZPP. (3) C has a ≤ ^p _m -complete set. (4) C has a ≤ ^p _tt -complete set that is not ≤ ^p _m -complete unless P = NP. This shows that under the assumption that P ≠ NP, the two completeness notions differ on some nontrivial subclass of DistNP.     

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (FVS) problem, and the weighted feedback edge set (FES) problem. In the {FVS} (resp. FES) problem, one is given a directed graph with weights (each of which is at least one) on the vertices (resp. edges), and is asked to find a subset of vertices (resp. edges) with minimum total weight that intersects every directed cycle in the graph. These problems are among the classical NP-hard problems and have many applications. We also consider a generalization of these problems: subset-fvs and subset-fes, in which the feedback set has to intersect only a subset of the directed cycles in the graph. This subset consists of all the cycles that go through a distinguished input subset of vertices and edges, denoted by X . This generalization is also NP-hard even when |X|=2 . We present approximation algorithms for the subset-fvs and subset-fes problems. The first algorithm we present achieves an approximation factor of O(log ² |X|) . The second algorithm achieves an approximation factor of O(min{log τ ^* log log τ ^* , log n log log n)} , where τ ^* is the value of the optimum fractional solution of the problem at hand, and n is the number of vertices in the graph. We also define a multicut problem in a special type of directed networks which we call circular networks, and show that the subset-fes and subset-fvs problems are equivalent to this multicut problem. Another contribution of our paper is a combinatorial algorithm that computes a (1+ɛ) approximation to the fractional optimal feedback vertex set. Computing the approximate solution is much simpler and more efficient than general linear programming methods. All of our algorithms use this approximate solution. Received May 31, 1995; revised June 11, 1996, and October 9, 1996.     

Book reviews

Laver, Murray Information Technology: Agent of Change. 189 pages, hardcopy 39.50, paperback 14.95, Cambridge, U.K.: Cambridge University Press, 1989 ISBN 0 521 35035 2 (hbk.), ISBN 0 521 35955 2

Edited by Long, John and Whitefield, Andy. Cambridge Series on Human‐Computer Interaction 1: Cognitive Ergonomics and Human‐Computer Interaction, Cambridge University Press, Cambridge (1989), pp. 259. $49.50, ISBN O‐521–37179–1.     

Correlation between the gradients of the quadratic functional and its clipped prototype

Applicability of clipping of quadratic functional E = −0.5x ⁺ Tx + Bx in the minimization problem is considered (here x is the configurational vector and B ∈ R ^N is real valued vector). The probability that the gradient of this functional and the gradient of clipped functional ɛ = −0.5x ⁺ τx + bx are collinear is shown to be very high (the matrix τ is obtained by clipping of original matrix T: τ_ij = sgnT _ij ). It allows the conclusion that minimization of functional ɛ implies minimization of functional E. We can therefore replace the laborious process of minimizing functional E by the minimization of its clipped prototype ɛ. Use of the clipped functional allows sixteen-times reduction of the computation time and computer memory usage.     

Book reviews

Booth, Paul. An Introduction to Human Computer Interaction. 268 pages, $39.95 (Hardback), $19.95 (Paperback): Hillsdale, NJ: Lawrence Erlbaum Associates, 1989, ISBN O‐86377–122‐X (Hbk); ISBN O‐86377–123–8 (Pbk)     

Exploratory factor analysis and validity of the virtual reality symptom questionnaire and computer use survey

Abstract

The widespread use of virtual reality head-mounted-displays (HMDs) calls for a re-examination of the impact of prolonged exposure to fixed visual displays at close ocular proximity. The purpose of this study is to validate the Virtual Reality Symptoms Questionnaire (VRSQ), created to understand symptoms of prolonged HMDs use, and Computer Use Survey (CUS), created to assess general physical and visual discomfort symptoms. Participants (N?=?100) recorded their general discomfort symptoms using the CUS, performed an interactive task using a HMD for thirty minutes, and then answered the CUS again along with the VRSQ. VRSQ, analysed using an exploratory factor analysis, indicated a clear two-factor solution, and demonstrated very good internal consistency (α?=?0.873). The CUS, also analysed using an exploratory factor analysis, indicated a four-factor solution, and demonstrated good internal consistency (α?=?0.838).

Practitioner Summary: A quantitative-experimental study was conducted to explore the factor structure and validate both the Virtual Reality Symptoms Questionnaire (VRSQ), and the Computer Use Survey (CUS). Findings indicate the VRSQ and CUS are precise and accurate survey instruments for evaluating discomfort after VR-HMD use and the latter for computer use.

Abbreviations: VRSQ: virtual reality symptom questionnaire; CUS: computer use survey; OLED: organic light-emitting diode; MSQ: pensacola motion symptom questionnaire; SSQ: simulator sickness questionnaire; 3?D: three-dimensional computer generated space; VR: virtual reality; VR-HMD: virtual reality head-mounted-display; HMDs: head-mounted-displays; EFA: exploratory factor analysis     

Maintenance of a Piercing Set for Intervals with Applications

   Abstract. We show how to maintain efficiently a minimum piercing set for a set S of intervals on the line, under insertions and deletions to/from S. A linear-size dynamic data structure is presented, which enables us to compute a new minimum piercing set following an insertion or deletion in time O(c( S) log |S|), where c (S) is the size of the new minimum piercing set. We also show how to maintain a piercing set for S of size at most (1+ɛ)c (S), for 0 < ɛ ≤ 1 , in

Book review

Emmeche, Claus, translated by Steven Sampson, (1994). The Garden in the Machine: The Emerging Science of Artificial Life, 199 pages: Princeton, NJ: Princeton University Press. (ISBN 0–691–03330–7)