The statistical computing environment XploRe and state-of-the-art density and regression smoothing

1993 ◽  
Vol 3 (1) ◽  
pp. 23-26 ◽  
Author(s):  
M. G. Schimek ◽  
K. G. Schmaranz
2014 ◽  
Vol 556-562 ◽  
pp. 5352-5355
Author(s):  
Yin Bo Shao ◽  
Jing Wei Xie ◽  
Yuan Quan Li ◽  
Sun Ying Gao ◽  
Chang Qing Ji

Reverse Nearest Neighbour (RNN) queries play an important role in applications such as internet of vehicles, decision support systems, profile based marketing and so on. Recently, more attention has been paid to the problem of efficient distributed RNN computation in mobile cloud computing environment. A major downside of the existing RNN is its inherent sequential nature and using in-memory algorithm, which limits its applicability to massive data. In this paper, we propose a novel distributed caching based method to efficiently improve the performance of the RNN calculation in a distributed environment. Extensive experiments using both real and synthetic datasets demonstrated that our proposed methods are the state-of-the-art algorithms in scalable RNN queries.


Author(s):  
Robert Bartels ◽  
W. Hardle ◽  
S. Klinke ◽  
B. A. Turlach

2018 ◽  
Vol 7 (8) ◽  
pp. 293 ◽  
Author(s):  
Binbin Lu ◽  
Huabo Sun ◽  
Paul Harris ◽  
Miaozhong Xu ◽  
Martin Charlton

In this study, we introduce the R package shp2graph, which provides tools to convert a spatial network into an ‘igraph’ graph of the igraphR package. This conversion greatly empowers a spatial network study, as the vast array of graph analytical tools provided in igraph are then readily available to the network analysis, together with the inherent advantages of being within the R statistical computing environment and its vast array of statistical functions. Through three urban road network case studies, the calculation of road network distances with shp2graph and with igraph is demonstrated through four key stages: (i) confirming the connectivity of a spatial network; (ii) integrating points/locations with a network; (iii) converting a network into a graph; and (iv) calculating network distances (and travel times). Throughout, the required R commands are given to provide a useful tutorial on the use of shp2graph.


This publication discusses high-performance energyaware cloud (HPEAC) computing state-of-the-art strategies to acknowledgement and categorization of systems and devices, optimization methodologies, and energy / power control techniques in particular. System types involve single machines, clusters, networks, and clouds, while CPUs, GPUs, multiprocessors, and hybrid systems are known to be device types. Objective of Optimization incorporates multiple calculation blends, such as “execution time”, “consumption of energy”& “temperature” with the consideration of limiting power/energy consumption. Control measures usually involve scheduling policies, frequency based policies (DVFS, DFS, DCT), programmatic API’s for limiting the power consumptions (such as” Intel- RAPL”,” NVIDIA- NVML”), standardization of applications, and hybrid techniques. We address energy / power management software and APIs as well as methods and conditions in modern HPEACC systems for forecasting and/or simulating power/energy consumption. Eventually, programming examples are discussed, i.e. programs & tests used in specific works. Based on our study, we point out some areas and there significant issues related to tools & technologies, important for handling energy aware computations in HPEAC computing environment


COMPSTAT ◽  
1996 ◽  
pp. 135-148
Author(s):  
Swetlana Schmelzer ◽  
Thomas Kötter ◽  
Sigbert Klinke ◽  
Wolfgang Härdle

Sign in / Sign up

Export Citation Format

Share Document