1,329,346 Hits in 5.6 sec

Dynamic Management of Real-Time Location Data on GPS-Enabled Mobile Phones

Sean Barbeau, Miguel A. Labrador, Alfredo Perez, Philip Winters, Nevine Georggi, David Aguilar, Rafael Perez
2008 2008 The Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies  
Both algorithms were implemented in TRAC-IT, a Java Micro Edition (Java ME) application designed to automatically collect user travel behavior; the proposed algorithms allow TRAC-IT to build an accurate  ...  In this paper, two complementary algorithms are presented: the Critical Point (CP) algorithm, which filters data points to be transmitted to the server, and the location-aware state machine, which dynamically  ...  The algorithm generates a null output, and no data are sent to the server as it does not have enough information to determine whether this second point is a critical point.  ... 
doi:10.1109/ubicomm.2008.83 fatcat:zijif5mrp5ekvivhwjugns6pru

A Comparative Performance Evaluation of Indoor Geolocation Technologies

Ahmad HATAMI, Bardia ALAVI, Kaveh PAHLAVAN, Muzaffer KANAAN
2006 Interdisciplinary Information Sciences  
As more location aware services are emerging in the market, the needs for accurate and reliable localization has increased and in response to this need a number of technologies and associated algorithms  ...  We describe a repeatable framework for comparative performance evaluation of localization algorithms. Using this framework we compare the performances of two TOA-based and two RSS-based algorithms.  ...  Allen Levesque for his constructive review and comments.  ... 
doi:10.4036/iis.2006.133 fatcat:dhbhjgkfnja6zaodcy2cnrsuem

Run-Time Support to Manage Architectural Variability Specified with CVL [chapter]

Gustavo G. Pascual, Mónica Pinto, Lidia Fuentes
2013 Lecture Notes in Computer Science  
In this paper we present an alternative approach for the automatic run-time generation of application configurations and the reconfiguration plans.  ...  We also specify a case study and we use it to evaluate our approach, showing that it is efficient and suitable for devices with scarce resources.  ...  This information provides an optimization criterion for run-time reconfiguration and, therefore, using it we can generate different configurations at run-time which maximize the utility of the application  ... 
doi:10.1007/978-3-642-39031-9_24 fatcat:antsb3ug6jfe5msxodra7ydeuq

Location and Orientation Based Augmented Reality Mobile Application for Enhancing Heritage Landmark History and Information

Savitri Galih, Sultan Iansyah, Herdis Yudistira
2019 Universal Journal of Electrical and Electronic Engineering  
Augmented Reality technology in Mobile Device can provide better experience for people to to access and gather information at the location of cultural heritage or tourism landmark point in cultural heritage  ...  Based on the testing and implementation evaluation, our application can mark the cultural heritage or historical landmark and overlay it with the story behind the place to enhance the visitor experience  ...  Augmented Reality in Mobile Computing Augmented Reality is defined as "an enhanced version 40 Location and Orientation Based Augmented Reality Mobile Application for Enhancing Heritage Landmark History  ... 
doi:10.13189/ujeee.2019.061307 fatcat:qcagtx4smrhaxohnb2t632tfue

An Effective Privacy Architecture to Preserve User Trajectories in Reward-Based LBS Applications

A Hasan, Qiang Qu, Chengming Li, Lifei Chen, Qingshan Jiang
2018 ISPRS International Journal of Geo-Information  
The data logs generated by a reward-based LBS application have trajectories with exact locations and the corresponding user identities, which can be used for spam advertisements, individual-based assaults  ...  methods. productive and generates lower expenditure for healthcare costs [1] .  ...  Figure 2 is an example of a global location set, and we extracted it from OpenStreetMap data by using Algorithm 1.  ... 
doi:10.3390/ijgi7020053 fatcat:wkrlkddfizgo5jr3bdrf6qyosi

Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization

Sutapa Samanta, Manoj K. Jha
2012 International Journal of Operations Research and Information Systems  
Not only that the quality of solutions for any problem determines the efficiency and the applicability of an algorithm, the computation time plays an DOI: 10.4018/joris.2012010102 important role too.  ...  These heuristics (such as, Genetic Algorithm (GA), Ant Algorithm Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization ABSTRACT The emergence  ... 
doi:10.4018/joris.2012010102 fatcat:ve3hwb5cv5cqhiv3l2nxvfgo3m

On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia

Sandi Baressi Šegota, Ivan Lorencin, Kazuhiro Ohkura, Zlatan Car
2019 Journal of Maritime & Transportation Science  
The problem is solved using two evolutionary computing methods – the genetic algorithm (GA) and the simulated annealing (SA) - and comparing the results (are compared) by an extensive search of the solution  ...  This paper applies that problem formulation in the maritime environment, specifically a path planning problem for a tour boat visiting popular tourist locations in Medulin, Croatia.  ...  Acknowledgment This research has been (partly) supported by the CEEPUS network CIII-HR-0108, the European Regional Development Fund under the grant KK. (DATACROSS) and the University of Rijeka  ... 
doi:10.18048/2019.57.05. fatcat:ehfg2huh2vhlhg35xwcio7mm44

Computationally Recoverable Camouflage: A Universal Model for Privacy-Aware Location-Based Services [article]

Changsha Ma, Zhisheng Yan, Chang Wen Chen
2017 arXiv   pre-print
Due to high diversity of LBSs, it is critical to build a universal model that is able to handle privacy protection for broader range of applications.  ...  In particular, we propose a novel camouflage algorithm with formal privacy guarantee that considers both location context and social context, enabling LBS users to scalably expose camouflage information  ...  for generating a camouflaged point.  ... 
arXiv:1603.07711v2 fatcat:6xjvqx4p6bbf7ba7nikrwfceim

Optimal Search in Planar Subdivisions

David Kirkpatrick
1983 SIAM journal on computing (Print)  
We present a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely O (log n)  ...  The subdivision search problem is the following: given a subdivision S with n line segments and a query point P, determine which region of S contains P.  ...  Shamos' algorithm is generalized by Lee and Preparata [15] to an O((lg r/)2) search-time, O(n) space, and O(n lg n) preprocessing-time algorithm for the location in arbitrary subdivisions.  ... 
doi:10.1137/0212002 fatcat:xjol6hwh3na6hf45pvat6skppa

An Efficient IoV Trajectory Compression Method in Vehicle Terminals Using Width-Direction-Angle

Huibing Zhang, Xiaoli Hu, Weihua Bai, Hongbo Zhang, Keqin Li, Ya Zhou, Yuming Lin
2019 IEEE Access  
It adopts different compression methods for rectilinear and swerving vehicle trajectories, which allows for highly efficient compression and high similarity between the compressed and original trajectories  ...  Relative to the existing compression algorithms, the proposed algorithm reduced compression time and storage space to adapt for the development of the large-scale IoV applications.  ...  In addition, the generation of semantic information requires an excessive amount of time, such that the real-time performance of these algorithms is not sufficient for application to IoV intensive streaming  ... 
doi:10.1109/access.2019.2919800 fatcat:pbujh5wezfe2jlme7welth7c6u

Page 2213 of Mathematical Reviews Vol. , Issue 99c [page]

1991 Mathematical Reviews  
Then an ellipsoid algorithm is established and justified for such general location problems.  ...  As distance measures between the demand points and the new location point, gauges are used instead of only norms, which enhances the application to real world problems.  ... 

Generation of Unit-Width Curve Skeletons Based on Valence Driven Spatial Median (VDSM) [chapter]

Tao Wang, Irene Cheng
2008 Lecture Notes in Computer Science  
However, most 3D thinning algorithms cannot guarantee generating a unit-width curve skeleton, which is desirable in many applications, e.g. 3D object similarity match and retrieval.  ...  Among all connectivity-preservation skeletonization methods, 3D thinning algorithms are generally faster than the others.  ...  Definition 9: An object point is called an exit if it is an end point or a middle point, and is 26-connected to one object point of a crowded region.  ... 
doi:10.1007/978-3-540-89639-5_100 fatcat:s2tym2c3fvanhdufignhgb7w7u

Dynamic displacement field reconstruction through a limited set of measurements: Application to plates

M. Chierichetti, M. Ruzzene
2012 Journal of Sound and Vibration  
This procedure is detailed for a plate structure subjected to a harmonic concentrated load.  ...  Algebraic relationships between experimental measurements and equivalent modal loads allow the identification of the full-field dynamic response from few experimental data.  ...  Olivier Bauchau for his support and advise. Maria Chierichetti wishes also to acknowledge Zonta International for its support through the Amelia Earhart Fellowship.  ... 
doi:10.1016/j.jsv.2012.05.031 fatcat:cp7itxh5jrcwvgx6wk6toziyfi

Tis-Bad: A Time Series-Based Deobfuscation Algorithm

A Labrador, P. Wightman, A Santander, D Jabba, M. Jimeno
2015 Investigación e Innovación en Ingenierías  
We evaluate the TIS-BAD algorithm against the Rand and N-Rand obfuscation algorithms, including both location and time scrambling, for straight and non-straight routes.  ...  This work presents a formal definition of a deobfuscation technique for noise-based obfuscation algorithms called TIS-BAD (Time Series - Based Deobfuscation) which implements an exponentially weighted  ...  Fig. 1 . 1 Example of the application of the TIS-BAD algorithm over an obfuscated path. Fig. 2 . 2 Example of the Markovian automaton to generate paths for the semi-straight mobility pattern.  ... 
doi:10.17081/invinno.3.1.2035 fatcat:lnhjgqxdnve6rhegwpddlh3kce

Generating random regions in Spatial cloaking algorithm for location privacy preservation

Mrs. Suchita R. Shastry
2013 IOSR Journal of Computer Engineering  
The second algorithm for query processing generates the region of different shapes which minimizes the chances of getting the user disclosed to adversary.  ...  Network users expect to access services relevant to their locations, and preserve their privacy without disclosing their exact location.  ...  Given only an ASR and the query type/parameters, the LBS needs to search for the POIs that satisfy the query for any possible user location within the ASR.  ... 
doi:10.9790/0661-0944649 fatcat:a3fevr4wmna57jgaiqc523cnhe
« Previous Showing results 1 — 15 out of 1,329,346 results