Covering a line segment with variable radius discs

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of- view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing

Business process modelling and visualisation to support e-government decision making: Business/IS alignment

© 2017 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-57487-5_4.Alignment between business and information systems plays a vital role in the formation of dependent relationships between different departments in a government organization and the process of alignment can be improved by developing an information system (IS) according to the stakeholders’ expectations. However, establishing strong alignment in the context of the eGovernment environment can be difficult. It is widely accepted that business processes in the government environment plays a pivotal role in capturing the details of IS requirements. This paper presents a method of business process modelling through UML which can help to visualise and capture the IS requirements for the system development. A series of UML models have been developed and discussed. A case study on patient visits to a healthcare clinic in the context of eGovernment has been used to validate the models

Generalized iterated wreath products of cyclic groups and rooted trees correspondence

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a certain type of rooted trees. This provides a Bratteli diagram for the generalized iterated wreath product, a simple recursion formula for the number of irreducible representations, and a strategy to calculate the dimension of each irreducible representation. We calculate explicitly fast Fourier transforms (FFT) for this class of groups, giving literature's fastest FFT upper bound estimate.Comment: 15 pages, to appear in Advances in the Mathematical Science

Axiomatic Characterization of the Mean Function on Trees

A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on X. In this paper the mean function on finite trees is characterized axiomatically

A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions

Maximum gradient embeddings and monotone clustering

Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y)) / d_X(x,y) is at most C (log n)^2, where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, including fault-tolerant versions of k-median and facility location.Comment: 25 pages, 2 figures. Final version, minor revision of the previous one. To appear in "Combinatorica

Approach to Modeling Demand and Supply for a Short-Notice Evacuation

As part of disaster mitigation and evacuation planning, planners must be able to develop effective tactical and operational strategies to manage traffic and transportation needs during an evacuation. One aspect of evacuation planning is the estimation of how many people must be evacuated to provide strategies that are responsive to the number and location of these people. When such estimates are available, it may be possible to implement tactical and operational strategies that closely match the likely demand on the road network during the evacuation. With short notice for an evacuation, people may need to be evacuated directly from current locations. In addition, for some disasters, the spatial extent of the evacuated area may change over time. This problem may be exacerbated by congestion around the evacuated area. An estimation process is proposed for a short-notice evacuation. The method uses on-hand data typically generated through existing travel demand models at many metropolitan planning organizations. It estimates demand using convenient models for trip generation, trip distribution, and travel time generation for these trips, considering a staged evacuation. These demand estimates feed a dynamic simulation model, DynusT, that is used to model the supply characteristics of the roadway network during the evacuation. Such models can be applied using a case study based on a short-notice flooding scenario for Phoenix, Arizona

Congenital bone marrow failure in DNA-PKcs mutant mice associated with deficiencies in DNA repair

The nonhomologous end-joining (NHEJ) pathway is essential for radioresistance and lymphocyte-specific V(D)J (variable [diversity] joining) recombination. Defects in NHEJ also impair hematopoietic stem cell (HSC) activity with age but do not affect the initial establishment of HSC reserves. In this paper, we report that, in contrast to deoxyribonucleic acid (DNA)–dependent protein kinase catalytic subunit (DNA-PKcs)–null mice, knockin mice with the DNA-PKcs(3A/3A) allele, which codes for three alanine substitutions at the mouse Thr2605 phosphorylation cluster, die prematurely because of congenital bone marrow failure. Impaired proliferation of DNA-PKcs(3A/3A) HSCs is caused by excessive DNA damage and p53-dependent apoptosis. In addition, increased apoptosis in the intestinal crypt and epidermal hyperpigmentation indicate the presence of elevated genotoxic stress and p53 activation. Analysis of embryonic fibroblasts further reveals that DNA-PKcs(3A/3A) cells are hypersensitive to DNA cross-linking agents and are defective in both homologous recombination and the Fanconi anemia DNA damage response pathways. We conclude that phosphorylation of DNA-PKcs is essential for the normal activation of multiple DNA repair pathways, which in turn is critical for the maintenance of diverse populations of tissue stem cells in mice

Improving Employment Standards and their Enforcement in Ontario: A Research Brief Addressing Options Identified in the Interim Report of the Changing Workplaces Review

The quality of employment available to Ontarians is a growing concern among legislators, policymakers, and the general public alike. There is widespread recognition that precarious employment and the challenges posed by the associated realignment of risks, costs and power relations between employees and employers require improvements to employees’ legislative protection. Ontario’s Changing Workplaces Review (CWR) affords us an opportunity to take stock of important changes taking place the province’s labour market. As the Terms of Reference introduced at the outset of the CWR note, “far too many workers are experiencing greater precariousness” in employment in Ontario today than in the recent past. Accordingly, with the aim of “creating decent work in Ontario, particularly [for] those who have been made vulnerable by changes in our economy and workplaces,” such terms directed the Special Advisors to investigate the dynamics underlying the magnitude of precariousness in the province’s labour market and to pose options for mitigating this fundamental social and economic problem through reforms to Ontario’s Labour Relations Act (LRA) and Employment Standards Act (ESA)