15821497
An Examination Of Barriers To Benefits-realisation From Enterprise Systems In The Public Service
Examination of barriers to benefits-realisation from Enterprise Systems (ES) has potential to provide an innovative perspective on strategic management of large-scale packaged software, and on the extended virtual enterprise explicitly or implicitly deployed across the ES life-cycle. Private sector experience has revealed distinctive conditions applying to ES that create barriers to benefit-realisation. For public service organisations, ES have the potential to enable the provision of end-to-end integrated services, consistent with the demands of public accountability, but are encumbered by a poor track record in large systems implementation and associated process-reengineering. This research analyses the Australian Public Service ES experience, with the aim of dismantling barriers to public sector exploitation of ES. Early results reflect conventional perceptions of implementation issues, but application of the distinctive Dephi-based methodology designed for this study is expected to yield a basis for shared action on the part of government administration, vendors and consultants.
15943063
Enterprise Systems Success: A Measurement Model
This paper presents a validated measurement model and instrument for assessing enterprise systems success from multiple perspectives. The final validated study model employs 27 measures of the four dimensions: information quality, system quality, individual impact, and organizational impact. The model is empirically tested with survey data gathered from 27 public sector organizations that implemented SAP R/3 in the late 1990s. The study consists of an exploratory inventory survey (model building) to identify the salient success dimensions and measures, followed by a confirmatory weights survey, for testing model validity (model testing). Test results demonstrate the discriminant validity of the four dimensions, as well as their convergence on a single higher-order phenomenon: enterprise systems success (ESS). Criterion validity testing further demonstrates the additivity of the four dimensions of success, and the completeness of the resultant overarching, second-order measure of ESS.
31407079
Dynamic Connectivity for Axis-Parallel Rectangles
In this paper we give a fully dynamic data structure to maintain the connectivity of the intersection graph of n axis-parallel rectangles. The amortized update time (insertion and deletion of rectangles) is O (n10/11polylog n) and the query time (deciding whether two given rectangles are connected) is O(1). It slightly improves the update time (O (n0.94)) of the previous method while drastically reducing the query time (near O(n1/3)). Our method does not use fast matrix multiplication results and supports a wider range of queries.
16750516
Spanners with Slack
Given a metric (V,d), a spanner is a sparse graph whose shortest-path metric approximates the distance d to within a small multiplicative distortion. In this paper, we study the problem of spanners with slack: e.g., can we find sparse spanners where we are allowed to incur an arbitrarily large distortion on a small constant fraction of the distances, but are then required to incur only a constant (independent of n) distortion on the remaining distances? We answer this question in the affirmative, thus complementing similar recent results on embeddings with slack into l p spaces. For instance, we show that if we ignore an e fraction of the distances, we can get spanners with O(n) edges and O(log 1 ∈) distortion for the remaining distances. We also show how to obtain sparse and low-weight spanners with slack from existing constructions of conventional spanners, and these techniques allow us to also obtain the best known results for distance oracles and distance labelings with slack. This paper complements similar results obtained in recent research on slack embeddings into normed metric spaces.
9693247
Space-Efficient Algorithms for Klee's Measure Problem
We give space-efficient geometric algorithms for three related problems. Given a set of n axis-aligned rectangles in the plane, we calculate the area covered by the union of these rectangles (Klee’s measure problem) in O(n log n) time with O( √ n) extra space. If the input can be destroyed and there are no degenerate cases and input coordinates are all integers, we can solve Klee’s measure problem in O(n log n) time with O(log n) extra space. Given a set of n points in the plane, we find the axis-aligned unit square that covers the maximum number of points in O(n log n) time with O(log n) extra space.
5766157
More planar two-center algorithms
Abstract This paper considers the planar Euclidean two-center problem: given a planar n-point set S, find two congruent circular disks of the smallest radius covering S. The main result is a deterministic algorithm with running time O(nlog2nlog2logn), improving the previous O(nlog9n) bound of Sharir and almost matching the randomized O(nlog2n) bound of Eppstein. If a point in the intersection of the two disks is given, then we can solve the problem in O(nlogn) time with high probability.
43482019
Three problems about simple polygons
We give three related algorithmic results concerning a simple polygon P: 1. Improving a series of previous work, we show how to find a largest pair of disjoint congruent disks inside P in linear expected time. 2. As a subroutine for the above result, we show how to find the convex hull of any given subset of the vertices of P in linear worst-case time. 3. More generally, we show how to compute a triangulation of any given subset of the vertices or edges of P in almost linear time.