Thematic orientation of the ISJ within a semantic space of IS research

This study examines research published in the first 24 years of Information Systems Journal's (ISJ) publication history using a thematic space of all information systems (IS) research as the backdrop. To that end, abstracts from all contributing articles published in eight prominent IS journals in the period 1991–2014 were analysed to extract a latent semantic space of five broad research areas. A two‐dimensional projection of the results was used to create a two‐by‐two map, where one dimension represents the European vs. North American style of IS research and another dimension represents a micro vs. macro level of IS research. The ISJ is positioned in the ‘micro and European school’ quadrant. Over the course of the journal's first 24 years, research in the ISJ started with a relative focus on the IT artefact and IS development and gradually moved towards a more balanced position that includes a considerable amount of research on IT for teamwork and collaboration, as well as on IT and individuals.     

The use and acceptance of new media entertainment technology by elderly users: development of an expanded technology acceptance model

Research on elderly people's ICT acceptance and use often relies on the technology acceptance model (TAM) framework, but has been mostly limited to task-oriented uses. This article expands approaches in technology acceptance and use by developing a model to explain entertainment-related uses of new media technology by elderly people. On a theoretical level, we expand the TAM perspective by adding concepts that act as barriers and/or facilitators of technology acceptance, namely technophobia, self-efficacy and previous experience and expertise with technology. We develop an expanded TAM by testing the role of these concepts in two studies on entertainment media technology. In Study 1, we investigate behavioural intention to use 3D cinema among N?=?125 German elderly media users (Age 50+). In Study 2, we focus the actual use of a computer game simulation by N?=?115 German and US elderly media users (Age 50+). Findings in both studies point towards the central role of perceived usefulness, here modelled as enjoyment, as the reason for elderly people's use and acceptance of entertainment media technology. Perceived ease of use is seen as a precondition for enjoyment, particularly for interactive media.     

Bribery in voting with CP-nets

We investigate the computational complexity of finding optimal bribery schemes in voting domains where the candidate set is the Cartesian product of a set of variables and voters use CP-nets, an expressive and compact way to represent preferences. To do this, we generalize the traditional bribery problem to take into account several issues over which agents vote, and their inter-dependencies. We consider five voting rules, three kinds of bribery actions, and five cost schemes. For most of the combinations of these parameters, we find that bribery in this setting is computationally easy.     

A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function

This short note considers and resolves the apparent contradiction between known worst-case complexity results for first- and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre [On Nesterov's smooth Chebyshev–Rosenbrock function, Optim. Methods Softw. (2011)] implying a very large lower bound on the number of iterations required to reach the solution's neighbourhood for a specific problem with variable dimension.     

The Construction of the Multilingual Internet: Unicode,Hebrew, and Globalization

This paper examines the technologies that enable the representation of Hebrew on websites. Hebrew is written from right to left and in non‐Latin characters, issues shared by a number of languages which seem to be converging on a shared solution—Unicode. Regarding the case of Hebrew, I show how competing solutions have given way to one dominant technology. I link processes in the Israeli context with broader questions about the ‘multilingual Internet,’ asking whether the commonly accepted solution for representing non‐Latin texts on computer screens is an instance of cultural imperialism and convergence around a western artifact. It is argued that while minority languages are given an online voice by Unicode, the context is still one of western power.     

Fault tolerance in cellular automata at high fault rates

A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat in this paper. We are concerned with the degree (the number of neighboring cells on which the state transition function depends) needed to achieve fault tolerance when the fault rate is high (nearly 1/2). We consider both the traditional transient fault model (where faults occur independently in time and space) and a recently introduced combined fault model which also includes manufacturing faults (which occur independently in space, but which affect cells for all time). We also consider both a purely probabilistic fault model (in which the states of cells are perturbed at exactly the fault rate) and an adversarial model (in which the occurrence of a fault gives control of the state to an omniscient adversary). We show that there are cellular automata that can tolerate a fault rate 1/2−ξ (with ξ>0) with degree O((1/ξ²)log(1/ξ)), even with adversarial combined faults. The simplest such automata are based on infinite regular trees, but our results also apply to other structures (such as hyperbolic tessellations) that contain infinite regular trees. We also obtain a lower bound of Ω(1/ξ²), even with only purely probabilistic transient faults.     

Mutual information for Lucas-Kanade Tracking (MILK): an inverse compositional formulation

Mutual Information (MI) is popular for registration via function optimisation. This work proposes an inverse compositional formulation of MI for Levenberg-Marquardt optimisation. This yields a constant Hessian, which may be pre-computed. Speed improvements of 15% were obtained, with convergence accuracies similar to those of the standard formulation.     

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.