Organizational, Technological and Regulatory Challenges for Realizing Electronic Government

In this paper we discuss the main challenges faced by electronic government initiatives. First, the components of and the demand for electronic government services are identified. Then we point out infrastructure requirements on the technological level for both the service providers and the customers. Organizational challenges are discussed with a focus on integration and coordination requirements. The need for regulation is shown in respect to public information access and security concerns with transaction services

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition

A geometric graph is angle-monotone if every pair of vertices has a path between them that---after some rotation---is $x$- and $y$-monotone. Angle-monotone graphs are $\sqrt 2$-spanners and they are increasing-chord graphs. Dehkordi, Frati, and Gudmundsson introduced angle-monotone graphs in 2014 and proved that Gabriel triangulations are angle-monotone graphs. We give a polynomial time algorithm to recognize angle-monotone geometric graphs. We prove that every point set has a plane geometric graph that is generalized angle-monotone---specifically, we prove that the half-$\theta_6$-graph is generalized angle-monotone. We give a local routing algorithm for Gabriel triangulations that finds a path from any vertex $s$ to any vertex $t$ whose length is within $1 + \sqrt 2$ times the Euclidean distance from $s$ to $t$. Finally, we prove some lower bounds and limits on local routing algorithms on Gabriel triangulations.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Subcutaneous tumor seeding after biopsy in gliomatosis cerebri

We observed a patient with subcutaneous seeding from gliomatosis cerebri with a low-grade histopathology. A 33-year-old woman with neurofibromatosis type 1 presented with progressive headache, diplopia, dysphagia, and a rightward instability. On neurological examination dysarthria, gait ataxia, and left-sided central facial and hypoglossal palsies were determined. MRI of the brain demonstrated diffuse, infiltrative non-enhancing lesions in the pons, both cerebellar hemispheres, the parahippocampal gyrus, and the thalamus. A stereotactic biopsy demonstrated an astrocytoma WHO grade 2. These characteristics confirmed gliomatosis cerebri. Three months later, the patient presented with hydrocephalus and a subcutaneous swelling directly underneath the surgical scar. The subcutaneous swelling was removed and the hydrocephalus was treated by ventriculoperitoneal shunting. Histopathological examination confirmed a subcutaneous manifestation of low-grade oligoastrocytoma. Gliomatosis cerebri with low-grade histology can seed subcutaneously

Open Government Data: A Focus on Key Economic and Organizational Drivers

Grounding the analysis on multidisciplinary literature on the topic, the existing EU legislation and relevant examples, this working paper aims at highlighting some key economic and organizational aspects of the "Open Government Data" paradigm and its drivers and implications within and outside Public Administrations. The discussion intends to adopt an "Internet Science" perspective, taking into account as enabling factors the digital environment itself, as well as specific models and tools. More "traditional" and mature markets grounded on Public Sector Information are also considered, in order to indirectly detect the main differences with respect to the aforementioned paradig

Representing Directed Trees as Straight Skeletons

The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed