The data type of spatial objects

A spatial object consists of data assigned to points in a space. Spatial objects, such as memory states and three dimensional graphical scenes, are diverse and ubiquitous in computing. We develop a general theory of spatial objects by modelling abstract data types of spatial objects as topological algebras of functions. One useful algebra is that of continuous functions, with operations derived from operations on space and data, and equipped with the compact-open topology. Terms are used as abstract syntax for defining spatial objects and conditional equational specifications are used for reasoning. We pose a completeness problem: Given a selection of operations on spatial objects, do the terms approximate all the spatial objects to arbitrary accuracy? We give some general methods for solving the problem and consider their application to spatial objects with real number attributes. © 2011 British Computer Society.

Principles of Extremum and Application to some Problems of Analysis

AMS subject classification: 41A17, 41A50, 49Kxx, 90C25.

Some Inequalities of the Uniform Ergodicity and Strong Stability of Homogeneous Markov Chains

2000 Mathematics Subject Classification: 60J45, 60K25

Motivations for servitization:the impact of product complexity

Purpose – The purpose of this paper is to identify the commonalities and differences in manufacturers’ motivations to servitise. Design/methodology/approach – UK study based on interviews with 40 managers in 25 companies in 12 sectors. Using the concept of product complexity, sectors were grouped using the Complex Products and Systems (CoPS) typology: non-complex products, complex products and systems. Findings – Motivations to servitise were categorised as competitive, demand based (i.e. derived from the customer) or economic. Motivations to servitise vary according to product complexity, although cost savings and improved service quality appear important demand-based motivations for all manufacturers. Non-complex product manufacturers also focus on services to help product differentiation. For CoPS manufacturers, both risk reduction and developing a new revenue stream were important motivations. For uniquely complex product manufacturers, stabilising revenue and increased profitability were strong motivations. For uniquely systems manufacturers, customers sought business transformation, whilst new service business models were also identified. Research limitations/implications – Using the CoPS typology, this study delineates motivations to servitise by sector. The findings show varying motivations to servitise as product complexity increases, although some motivational commonality existed across all groups. Manufacturers may have products of differing complexity within their portfolio. To overcome this limitation the unit of analysis was the strategic business unit. Practical implications – Managers can reflect on and benchmark their motivation for, and opportunities from, servitisation, by considering product complexity. Originality/value – The first study to categorise servitisation motivations by product complexity. Identifying that some customers of systems manufacturers seek business transformation through outsourcing.

Servitization:revisiting the state-of-the-art and research priorities

Purpose – This paper consolidates the servitization knowledge base from an organisational change perspective, identifying developed, developing and undeveloped topics to provide a platform that directs future research. Design/methodology/approach – This paper addresses three objectives : a) it comprehensively examines organisational change management literature for selection of a theoretical framework, b) it classifies extant studies within the framework through a systemic literature review, and (c) it analyses 232 selected papers and proposes a research agenda. Findings – Analysis suggests increasing global awareness of the importance of services to manufacturers. However, some topics, especially related to servitization transformation, remain undeveloped. Research limitations/implications – Although the authors tried to include all publications relevant to servitization, some might not have been captured. Evaluation and interpretation relied on the research team and subsequent research workshops. Practical implications - One of the most significant challenges for practitioners of servitization is how to transform a manufacturing organisation to exploit the opportunity. This paper consolidates literature regarding servitization, identifying progress concerning key research topics and contributing a platform for future research. The goal is to inform research to result eventually in a roadmap for practitioners seeking to servitize. Originality/value - Although extant reviews of servitization identify themes that are examined well, they struggle to identify unanswered questions. This paper addresses this gap by focusing on servitization as a process of organisational change.

The effect of supporting a surgeon's wrist on their hand tremor

Background. Operative tremor can greatly influence the outcome of certain, precise, microsurgical operations. Reducing a surgeons tremor may not only improve the operative results but decrease the operative time. Previous studies have only measured uni or bi directional tremor and therefore have been unable to calculate both the overall tremor amplitude and the tremor reduction by resting the wrists. Materials and methods. We measured the tremor of 21 neurologically normal volunteers while performing a micromanipulation task, with and without wrist support. Measurements were acquired in three dimensions using three accelerometers attached to the hand, allowing an overall tremor amplitude to be calculated. Results. Resting the wrist on a gelled surface decreases an individuals tremor by a factor of 2.67 (P = 0). Conclusions. Supporting the wrists significantly decreases the amplitude of the tremor. Surgeons should consider using wrist supports when performing parts of operations which necessitate a high degree of accuracy. © 2010 Wiley-Liss, Inc.

The efficiency of remanufacturing in a dynamic input–output model

For industrialised economy of ourdays, remanufacturing represents perhaps the largest unexploited resource and opportunity for realising a greater growth of the economy in an environmental-conscious manner. The aim of this paper is to investigate of the impact of remanufacturing in the economy from an economic-efficiency point of view. In static context this phenomenon was analysed in the literature. We use the multi-sector input–output framework in a dynamic context to study intra-period relationships of the sectors of economy. We extend the classical dynamic input–output model taking into consideration the activity of remanufacturing .We try to answer the question, whether the remanufacturing/reuse increases the growth possibility of an economy. We expose a sufficient condition concerning the effectivity of an economy with remanufacturing. By this evaluation we analyse a possible sustainable development of the economy on the basis of the product recovery management of industries.

On the implementation of the L-Nash bargaining solution in two-person bargaining games

The “Nash program” initiated by Nash (Econometrica 21:128–140, 1953) is a research agenda aiming at representing every axiomatically determined cooperative solution to a game as a Nash outcome of a reasonable noncooperative bargaining game. The L-Nash solution first defined by Forgó (Interactive Decisions. Lecture Notes in Economics and Mathematical Systems, vol 229. Springer, Berlin, pp 1–15, 1983) is obtained as the limiting point of the Nash bargaining solution when the disagreement point goes to negative infinity in a fixed direction. In Forgó and Szidarovszky (Eur J Oper Res 147:108–116, 2003), the L-Nash solution was related to the solution of multiciteria decision making and two different axiomatizations of the L-Nash solution were also given in this context. In this paper, finite bounds are established for the penalty of disagreement in certain special two-person bargaining problems, making it possible to apply all the implementation models designed for Nash bargaining problems with a finite disagreement point to obtain the L-Nash solution as well. For another set of problems where this method does not work, a version of Rubinstein’s alternative offer game (Econometrica 50:97–109, 1982) is shown to asymptotically implement the L-Nash solution. If penalty is internalized as a decision variable of one of the players, then a modification of Howard’s game (J Econ Theory 56:142–159, 1992) also implements the L-Nash solution.

Pairwise comparison matrices and the error-free property of the decision maker

Pairwise comparison is a popular assessment method either for deriving criteria-weights or for evaluating alternatives according to a given criterion. In real-world applications consistency of the comparisons rarely happens: intransitivity can occur. The aim of the paper is to discuss the relationship between the consistency of the decision maker—described with the error-free property—and the consistency of the pairwise comparison matrix (PCM). The concept of error-free matrix is used to demonstrate that consistency of the PCM is not a sufficient condition of the error-free property of the decision maker. Informed and uninformed decision makers are defined. In the first stage of an assessment method a consistent or near-consistent matrix should be achieved: detecting, measuring and improving consistency are part of any procedure with both types of decision makers. In the second stage additional information are needed to reveal the decision maker’s real preferences. Interactive questioning procedures are recommended to reach that goal.

A simplified implementation of the least squares solution for pairwise comparisons matrices

This is a follow up to "Solution of the least squares method problem of pairwise comparisons matrix" by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed. For lower inconsistency and decreased accuracy, our proposed solutions run in seconds instead of days. As such, they may be useful for researchers willing to use the least squares method (LSM) instead of the geometric means (GM) method.

A method for solving LSM problems of small size in the AHP

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. It provides with ratio-scale measurements of the prioirities of elements on the various leveles of a hierarchy. These priorities are obtained through the pairwise comparisons of elements on one level with reference to each element on the immediate higher level. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM), Logarithmic Least Squares Method (LLSM), Weighted Least Squares Method (WLSM) and Chi Squares Method (X2M) are of the tools for computing the priorities of the alternatives. This paper studies a method for generating all the solutions of the LSM problems for 3 × 3 matrices. We observe non-uniqueness and rank reversals by presenting numerical results.

Solution of the Least Squares Method problem of pairwise comparison matrices

The aim of the paper is to present a new global optimization method for determining all the optima of the Least Squares Method (LSM) problem of pairwise comparison matrices. Such matrices are used, e.g., in the Analytic Hierarchy Process (AHP). Unlike some other distance minimizing methods, LSM is usually hard to solve because of the corresponding nonlinear and non-convex objective function. It is found that the optimization problem can be reduced to solve a system of polynomial equations. Homotopy method is applied which is an efficient technique for solving nonlinear systems. The paper ends by two numerical example having multiple global and local minima.

On pairwise comparison matrices that can be made consistent by the modification of a few elements

Pairwise comparison matrices are often used in Multi-attribute Decision Making forweighting the attributes or for the evaluation of the alternatives with respect to a criteria. Matrices provided by the decision makers are rarely consistent and it is important to index the degree of inconsistency. In the paper, the minimal number of matrix elements by the modification of which the pairwise comparison matrix can be made consistent is examined. From practical point of view, the modification of 1, 2, or, for larger matrices, 3 elements seems to be relevant. These cases are characterized by using the graph representation of the matrices. Empirical examples illustrate that pairwise comparison matrices that can be made consistent by the modification of a few elements are present in the applications.

A branch and efficiency algorithm for the optimal design of supply chain networks

Supply chain operations directly affect service levels. Decision on amendment of facilities is generally decided based on overall cost, leaving out the efficiency of each unit. Decomposing the supply chain superstructure, efficiency analysis of the facilities (warehouses or distribution centers) that serve customers can be easily implemented. With the proposed algorithm, the selection of a facility is based on service level maximization and not just cost minimization as this analysis filters all the feasible solutions utilizing Data Envelopment Analysis (DEA) technique. Through multiple iterations, solutions are filtered via DEA and only the efficient ones are selected leading to cost minimization. In this work, the problem of optimal supply chain networks design is addressed based on a DEA based algorithm. A Branch and Efficiency (B&E) algorithm is deployed for the solution of this problem. Based on this DEA approach, each solution (potentially installed warehouse, plant etc) is treated as a Decision Making Unit, thus is characterized by inputs and outputs. The algorithm through additional constraints named “efficiency cuts”, selects only efficient solutions providing better objective function values. The applicability of the proposed algorithm is demonstrated through illustrative examples.