Graph Mapping Research Articles

A Bigger City Isn't Always Better.

The article discusses the efficiency of cities in relation to their density. Topics addressed include comments criticizing generalized statements on how higher population densities lead to less energy consumption; discussion of trends in Salt Lake City, Utah, Atlanta, Georgia, and Phoenix, Arizona; and a graph mapping carbon dioxide emissions per capita in U.S. cities.

Graph surfaces over three-dimensional Carnot–Carathéodory spaces

The polynomial sub-Riemannian differentiability of the graph mappings of functions defined on three-dimensional Carnot–Caratheodory spaces is proved and an area formula for graph surfaces is derived.

The area of graph surfaces on four-dimensional two-step sub-Lorentzian structures

Sub-Lorentzian analogues of the area formula for graph mappings on four-dimensional subLorentzian structures are proved.

Subregion graph: A path planning acceleration structure for characters with various motion types in very large environments

Modern computer graphics applications commonly feature very large virtual environments and diverse characters which perform different kinds of motions. To accelerate path planning in such a scenario, we propose the subregion graph data structure. It consists of subregions, which are clusters of locally connected waypoints inside a region, as well as subregion connectivities. We also present a fast algorithm to automatically generate a subregion graph from an enhanced waypoint graph map representation, which also supports various motion types and can be created from large virtual environments. Nevertheless, a subregion graph can be generated from any graphbased map representation. Our experiments show that a subregion graph is very compact relative to the input waypoint graph. By firstly planning a subregion path, and then limiting waypoint-level planning to this subregion path, over 8 times average speedup can be achieved, while average length ratios remain as low as 102.5%.

A Hybrid Method for Dynamic Mesh Generation Based on Radial Basis Functions and Delaunay Graph Mapping

AbstractAiming at complex configuration and large deformation, an efficient hybrid method for dynamic mesh generation is presented in this paper, which is based on Radial Basis Functions (RBFs) and Delaunay graph mapping. Based on the computational mesh, a set of very coarse grid named as background grid is generated firstly, and then the computational mesh can be located at the background grid by Delaunay graph mapping technique. After that, the RBFs method is applied to deform the background grid by choosing partial mesh points on the boundary as the control points. Finally, Delaunay graph mapping method is used to relocate the computational mesh by employing area or volume weight coefficients. By applying different dynamic mesh methods to a moving NACA0012 airfoil, it can be found that the RBFs-Delaunay graph mapping hybrid method is as accurate as RBFs and is as efficient as Delaunay graph mapping technique. Numerical results show that the dynamic meshes for all test cases including one two-dimensional (2D) and two three-dimensional (3D) problems with different complexities, can be generated in an accurate and efficient manner by using the present hybrid method.

Оптимизация отображения неоднородно взаимодействующих MPI процессов на вычислительную архитектуру

The problem of mapping the parallel task to the nodes of computing cluster is considered. MPI software with non-uniform communication and heterogeneous interconnect of computing cluster require to appropriate parallel processes mapping for optimization of data exchange. The graph mapping algorithm is developed. It uses parallel program representation as a task graph and cluster topology representation as system graph. The proposed optimization technique is tested on synthetic benchmark and on real QBox software to study its efficiency on large number of computing cores. The positive results of optimization are achieved and the summary is presented in the paper. Speedup of 17–20% is obtained on scalable benchmarks using 300–4800 parallel processes.

Testing The Healing Environment Conditions for Nurses with two Independent Variables: Visibility Enhancement along with Shortening the Walking Distance of the Nurses to Patient - Focused on LogWare stop sequence and space syntax for U-Shape, L- Shape and I-Shape NS-

Purpose: Maximizing human comfort in design of medical environments depends immensely on specialized architects particularly critical care design; the study proposes Evidence-Based Design as an apparent analog to Evidence-Based Medicine. Healthcare facility designs are substantially based on the findings of study in an effort to design environments that augment care by improving patient safety and being therapeutic. On SPSS (Statistical Package for Social Science) t-test is applied to simulate two independent variables of PDR (Pre Design-Research) and POE (Post- Occupancy Evaluation). PDR is conducted on relatively new hospital Hallym University Dongtan Sacred Heart Hospital to analyse visibility from researchers' point of view, here the ICU is arranged in I-Shape. POE is applied on Dongguk University Ilsan Hospital to simulate walking on LogWare where two NS are designed based on L- Shape and Seoul St. Mary's Hospital, The Catholic University of Korea where five NS are functional for ICU Intensive Care Unit, Surgical Intensive Care Unit (SICU), Medical Intensive Care Unit (MICU), Critical Care Unit (CCU), Korean Oriental Medical Care Unit which are mostly arranged in U-Shape, and walking pattern is recognized to be in a zigzag path. Method: T-Test is applied on two dependent communication variables: walkability and visibility, with confidence interval of 95%. This study systematically analyses the Nurse Station (NS) typo-morphology, and simulates nurse horizontal circulation, by computing round route visits to patient's bed, then estimating minimum round route on LogWare stop sequence software. The visual connectivity is measured on depth map graphs. Hence the aim is to reduce staff stress and fatigue for better patients care by minimizing staff horizontal travel time and to facilitate nurse walk path and support space distribution by increasing effectiveness in delivering care. Result: Applying visibility graph and isovist field on space syntax on I- Shape, L- Shape and U- Shape ICU (SICU, MICU and CCU) configuration, I-shape facilitated 20% more patients in linear view as they stir to rise from their beds from nurse station compared to U-shape. In conclusion, it was proved that U-Shape supply minimum walking and maximum visibility; and L shape provides just visibility as the nurse is at pivot. I shape provides panoramic view from the Nurse Station but very rigorous walking.

Delaunay graph and radial basis function for fast quality mesh deformation

A novel mesh deformation technique is developed based on the Delaunay graph mapping (DGM) method and the radial basis function (RBF) method. The algorithm combines the advantages of the efficiency of DGM mesh deformation and the better control of the near surface mesh quality from the RBF method. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each of the sub-domains, the radial basis function is applied to build a much smaller sized translation matrix between the original mesh and the deformed mesh, resulting in a similar efficiency for the mesh deformation as compared to the fast Delaunay graph mapping method. Furthermore, by separating the translation and rotation motion, the mesh quality near the wall can be substantially improved for extremely large rotational deformation. The paper will show how the near-wall mesh quality is controlled and improved by the new method while the computational time is maintained to be comparable to the original Delaunay graph mapping method.

A Runtime FPGA Placement and Routing Using Low-Complexity Graph Traversal

Dynamic Partial Reconfiguration (DPaR) enables efficient allocation of logic resources by adding new functionalities or by sharing and/or multiplexing resources over time. Placement and routing (P&R) is one of the most time-consuming steps in the DPaR flow. P&R are two independent NP-complete problems, and, even for medium size circuits, traditional P&R algorithms are not capable of placing and routing hardware modules at runtime. We propose a novel runtime P&R algorithm for Field-Programmable Gate Array (FPGA)-based designs. Our algorithm models the FPGA as an implicit graph with a direct correspondence to the target FPGA. The P&R is performed as a graph mapping problem by exploring the node locality during a depth-first traversal. We perform the P&R using a greedy heuristic that executes in polynomial time. Unlike state-of-the-art algorithms, our approach does not try similar solutions, thus allowing the P&R to execute in milliseconds. Our algorithm is also suitable for P&R in fragmented regions. We generate results for a manufacturer-independent virtual FPGA. Compared with the most popular P&R tool running the same benchmark suite, our algorithm is up to three orders of magnitude faster.

Dynamics on Networks of Manifolds

We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph fibrations give rise to maps of dynamical systems. Consequently surjective graph fibrations give rise to invariant subsystems and injective graph fibrations give rise to projections of dynamical systems.

Symmetry Type Graphs of Polytopes and Maniplexes

We extend the notion of symmetry type graphs of maps to include maniplexes and (abstract) polytopes, using them to study k-orbit maniplexes (where the automorphism group has k orbits on flags). In particular, we show that there are no fully-transitive k-orbit 3-maniplexes with k > 1 an odd number. We classify 3-orbit maniplexes and determine all face transitivities for 3- and 4-orbit maniplexes. Moreover, we give generators of the automorphism group of a maniplex, given its symmetry type graph. Finally, we extend these notions to oriented maniplexes, and we provide a classification of oriented 2-orbit maniplexes and a generating set for their orientation-preserving automorphism group.

On PLCs Control Program Hardware Implementation Selected Problems of Mapping and Scheduling

The paper shows the FPGA dedicated method of mapping a PLC program written according to the IEC61131-3 standard. There is described complete synthesis process from the program description to hardware implementation through mapping and scheduling procedures. PLCs’ programming languages are translated into common intermediate graph form. It enables massive parallel implementation. There is presented an originally developed graph structure with attribute edges. Finally the graph mapping methodologies are discussed. A general hardware mapping concept and algorithms for utilizing specific FPGA components are presented. An efficient mapping of the DSP48 block is shown. It attempts to utilize all features of the block in pipelined calculation model. The consideration are summarized with implementation result comparison for general hardware mapping and with use of DSP48 units.

Barrier free visibility for staff in ICU Focused on space syntax for circulation in Asian ICU

The main contribution of paper is for designersthrough identification of appropriate shape geometry required forcare givers in a hospital by using space syntax technique.Healthcare management field is at a boom now a days, andfacilitating nurse is one of the important aspect coming up infuture, thus a lot of new courses in this field are also beenintroduced and management is in demand. Focus is on creatingthe optimal conditions for innovation in healthcare, which hasmore to do with team dynamics and mindset than standardprocesses and tools. Researchers are rigorously working toimprove patient safety by increasing and improving interface withnurse. This study systematically analyses the Nurse Stationtypo-morphology, and simulates nurse vision. The visualconnectivity is measured on depth map graphs. Hence the aim isto reduce staff stress and fatigue by support space distribution byincreasing effectiveness in delivering care. A depth mapcomparative analysis of three types of the Surgical Intensive CareUnit (SICU), Medical Intensive Care Unit MICU and CriticalCare Unit CCU found at hospitals Hallym University MedicalCenter, South Korea (HUMC), is analyzed here. Concussively, itwas proved that L-Shape provides maximum visibility, where as Ishape provides vast vista of a panoramic view from the NurseStation.

3 Barrier free visibility for staff in ICU Focused on space syntax for circulation in Asian ICU

The main contribution of paper is for designersthrough identification of appropriate shape geometry required forcare givers in a hospital by using space syntax technique.Healthcare management field is at a boom now a days, andfacilitating nurse is one of the important aspect coming up infuture, thus a lot of new courses in this field are also beenintroduced and management is in demand. Focus is on creatingthe optimal conditions for innovation in healthcare, which hasmore to do with team dynamics and mindset than standardprocesses and tools. Researchers are rigorously working toimprove patient safety by increasing and improving interface withnurse. This study systematically analyses the Nurse Stationtypo-morphology, and simulates nurse vision. The visualconnectivity is measured on depth map graphs. Hence the aim isto reduce staff stress and fatigue by support space distribution byincreasing effectiveness in delivering care. A depth mapcomparative analysis of three types of the Surgical Intensive CareUnit (SICU), Medical Intensive Care Unit MICU and CriticalCare Unit CCU found at hospitals Hallym University MedicalCenter, South Korea (HUMC), is analyzed here. Concussively, itwas proved that L-Shape provides maximum visibility, where as Ishape provides vast vista of a panoramic view from the NurseStation.

Barrier free visibility for staff in ICU Focused on space syntax for circulation in Asian ICU

The main contribution of paper is for designers through identification of appropriate shape geometry required forcare givers in a hospital by using space syntax technique. Healthcare management field is at a boom now a days, and facilitating nurse is one of the important aspect coming up in future, thus a lot of new courses in this field are also been introduced and management is in demand. Focus is on creating the optimal conditions for innovation in healthcare, which has more to do with team dynamics and mindset than standard processes and tools. Researchers are rigorously working to improve patient safety by increasing and improving interface with nurse. This study systematically analyses the Nurse Station typo-morphology, and simulates nurse vision. The visual connectivity is measured on depth map graphs. Hence the aim is to reduce staff stress and fatigue by support space distribution by increasing effectiveness in delivering care. A depth map comparative analysis of three types of the Surgical Intensive Care Unit (SICU), Medical Intensive Care Unit MICU and Critical Care Unit CCU found at hospitals Hallym University Medical Center, South Korea (HUMC), is analyzed here. Concussively, it was proved that L-Shape provides maximum visibility, where as I shape provides vast vista of a panoramic view from the Nurse Station.

Revealing the City That We Cannot See

We here investigate the potential of participatory sensor networks derived from location sharing systems, such as Foursquare, to understand the human dynamics of cities. We propose the City Image visualization technique, which builds a transition graph mapping people's movements between location categories, and demonstrate its use to identify similarities and differences of human dynamics across cities by clustering cities according to their citizens' routines. We also analyze centrality metrics of the transition graphs built for different cities, considering transitions between specific venues. We show that these metrics complement the City Image technique, contributing to a deeper understanding of city dynamics.

Non-wandering Sets for Dendrite Maps

Let $$(X,d)$$ be a metric space, and $$f$$ be a continuous map from $$X$$ to $$X$$ , and denote by $$P(f)$$ , $$\omega (f)$$ and $$\Omega (f)$$ the sets of periodic points, $$\omega $$ -limit points and non-wandering points of $$f$$ , respectively. It is well known that for an interval map $$f$$ , the following statements hold: (1) $$\omega (f)=\bigcap _{n=1}^{+\infty }f^n(\Omega (f))$$ . (2) Any isolated point of $$P( f )$$ is also an isolated point of $$\Omega ( f )$$ . (3) $$x\in \Omega ( f )$$ if and only if there exist points $$ x_k\longrightarrow x$$ and positive integers $$n_k\longrightarrow \infty $$ such that $$ f^{ n_k} (x_k) = x$$ . In [Mai and Sun (Topol Appl, 154, 2306–2311, 2007); Mai et al. (J Math Anal Appl, 383, 553–559, 2011)], we generalized those results to graph maps. It is natural to ask whether those results can be generalized to dendrite maps. The aim of this paper is to show that the answer is negative.

Parametrizing projections with selfadjoint operators

Let H=H+⊕H− be an orthogonal decomposition of a Hilbert space, with E+, E− the corresponding projections. Let A be a selfadjoint operator in H which is codiagonal with respect to this decomposition (i.e. A(H+)⊂H− and A(H−)⊂H+). We consider three maps which assign a selfadjoint projection to A:1.The graph map Γ: Γ(A)=projection onto the graph of A|H+.2.The exponential map of the Grassmann manifold P of H (the space of selfadjoint projections in H) at E+: exp⁡(A)=eiπ2AE+e−iπ2A.3.The map p, called here the Davis' map, based on a result by Chandler Davis, characterizing the selfadjoint contractions which are the difference of two projections.The ranges of these maps are studied and compared.Using Davis' map, one can solve the following operator matrix completion problem: given a contraction a:H−→H+, complete the matrix(⁎a/2a⁎/2⁎)to a projection P, in order that ‖P−E+‖ is minimal.

A structure property of “vertical” integral currents, with an application to the distributional determinant

We deal with integral currents in Cartesian products of Euclidean spaces that satisfy a “verticality” assumption. The main example is the boundary of the graph of some classes vector-valued and non-smooth Sobolev maps, provided that the boundary current has finite mass. In fact, the action of such currents is non-zero only on forms with a high number (depending on the Sobolev regularity) of differentials in the direction of the vertical space. We prove that such vertical currents live on a set that projects on the horizontal space into a nice set with integer dimension. The dimension of the concentration set is related to the level of verticality that is assumed. Therefore, for boundary of graphs of Sobolev maps, this dimension decreases as the Sobolev exponent increases. As an application, we then prove a concentration property concerning the singular part of the distributional determinant and minors.

Pathways towards the integration of periurban agrarian ecosystems into the spatial planning system

The potential of periurban agrarian ecosystems is recognized as one of the cornerstones for improving urban sustainability; however, this potential has been disregarded in spatial planning and decision making. The main goal of the PAEc-SP project was to assess the feasibility of integrating periurban agricultural areas into spatial planning by developing a viable ecosystem services-based methodology. The research unfolded along three axes: i) mapping ecosystem services in periurban areas, distinguishing between the current state and the future potential by applying a set of indicators; ii) analyzing the regulatory framework, identifying gaps in the consideration of agrarian ecosystem services; and iii) analyzing the perceptions of these areas held by local actors. Provisioning services (food) are widely recognized by actors and plans, but this leads to weak protection. Cultural services (identity, recreation) are also recognized by all actors and addressed by local urban planning, though this is not connected to farming practices. Regulating services (CO2 storage, water quality) are barely addressed by spatial planning and actors do not value them either. Supporting services (biodiversity) are mostly associated with natural areas. Most technicians are reluctant to changes, while new farmers and civil society demand a new holistic approach. The reluctant attitude to change of some actors and the inadequate understanding of ecosystem services, render it imperative to adopt a comprehensive approach through a participatory process of urban planning. Mapping ecosystem services, calculations, and graphs are a valuable communication tool both in discussing the consequences of the loss of agrarian ecosystems with different actors and in planning future scenarios.