Reducing Processing Time for Real-Time Mobile Hosted Location Based Services

2006 ◽  
Author(s):  
Paul Gilbertson ◽  
Reuben Edwards ◽  
Paul Coulton
Keyword(s):  
Real Time ◽  
Processing Time ◽  
Location Based Services

scholarly journals IoT Notary : Attestable Sensor Data Capture in IoT Environments

2022 ◽  
Vol 3 (1) ◽  
pp. 1-30
Author(s):  
Nisha Panwar ◽  
Shantanu Sharma ◽  
Guoxi Wang ◽  
Sharad Mehrotra ◽  
Nalini Venkatasubramanian ◽  
...  
Keyword(s):  
Real Time ◽  
Location Based Services ◽  
Third Party ◽  
Sensor Data ◽  
Published Data ◽  
Resource Limited ◽  
User Data ◽  
Data Capturing ◽  
Iot Devices ◽  
The University

Contemporary IoT environments, such as smart buildings, require end-users to trust data-capturing rules published by the systems. There are several reasons why such a trust is misplaced—IoT systems may violate the rules deliberately or IoT devices may transfer user data to a malicious third-party due to cyberattacks, leading to the loss of individuals’ privacy or service integrity. To address such concerns, we propose IoT Notary , a framework to ensure trust in IoT systems and applications. IoT Notary provides secure log sealing on live sensor data to produce a verifiable “proof-of-integrity,” based on which a verifier can attest that captured sensor data adhere to the published data-capturing rules. IoT Notary is an integral part of TIPPERS, a smart space system that has been deployed at the University of California, Irvine to provide various real-time location-based services on the campus. We present extensive experiments over real-time WiFi connectivity data to evaluate IoT Notary , and the results show that IoT Notary imposes nominal overheads. The secure logs only take 21% more storage, while users can verify their one day’s data in less than 2 s even using a resource-limited device.

An efficient solution for fast generation of multi-GNSS real-time products

2021 ◽  
Author(s):  
Hongjie Zheng ◽  
Hanyu Chang ◽  
Yongqiang Yuan ◽  
Qingyun Wang ◽  
Yuhao Li ◽  
...  
Keyword(s):  
Data Processing ◽  
Real Time ◽  
Processing Time ◽  
Efficient Solution ◽  
Gpu Computing ◽  
Sampling Rate ◽  
Precise Orbit Determination ◽  
Processing Unit ◽  
Processing Efficiency ◽  
Central Processing

<p>Global navigation satellite systems (GNSS) have been playing an indispensable role in providing positioning, navigation and timing (PNT) services to global users. Over the past few years, GNSS have been rapidly developed with abundant networks, modern constellations, and multi-frequency observations. To take full advantages of multi-constellation and multi-frequency GNSS, several new mathematic models have been developed such as multi-frequency ambiguity resolution (AR) and the uncombined data processing with raw observations. In addition, new GNSS products including the uncalibrated phase delay (UPD), the observable signal bias (OSB), and the integer recovery clock (IRC) have been generated and provided by analysis centers to support advanced GNSS applications.</p><p>       However, the increasing number of GNSS observations raises a great challenge to the fast generation of multi-constellation and multi-frequency products. In this study, we proposed an efficient solution to realize the fast updating of multi-GNSS real-time products by making full use of the advanced computing techniques. Firstly, instead of the traditional vector operations, the “level-3 operations” (matrix by matrix) of Basic Liner Algebra Subprograms (BLAS) is used as much as possible in the Least Square (LSQ) processing, which can improve the efficiency due to the central processing unit (CPU) optimization and faster memory data transmission. Furthermore, most steps of multi-GNSS data processing are transformed from serial mode to parallel mode to take advantage of the multi-core CPU architecture and graphics processing unit (GPU) computing resources. Moreover, we choose the OpenBLAS library for matrix computation as it has good performances in parallel environment.</p><p>       The proposed method is then validated on a 3.30 GHz AMD CPU with 6 cores. The result demonstrates that the proposed method can substantially improve the processing efficiency for multi-GNSS product generation. For the precise orbit determination (POD) solution with 150 ground stations and 128 satellites (GPS/BDS/Galileo/GLONASS/QZSS) in ionosphere-free (IF) mode, the processing time can be shortened from 50 to 10 minutes, which can guarantee the hourly updating of multi-GNSS ultra-rapid orbit products. The processing time of uncombined POD can also be reduced by about 80%. Meanwhile, the multi-GNSS real-time clock products can be easily generated in 5 seconds or even higher sampling rate. In addition, the processing efficiency of UPD and OSB products can also be increased by 4-6 times.</p>

scholarly journals Real-Time Monitoring of Jet Trajectory during Jetting Based on Near-Field Computer Vision

Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 690 ◽  
Author(s):  
Jinsong Zhu ◽  
Wei Li ◽  
Da Lin ◽  
Ge Zhao
Keyword(s):  
Computer Vision ◽  
Prediction Model ◽  
Real Time ◽  
Processing Time ◽  
Near Field ◽  
Image Correction ◽  
Noise Elimination ◽  
Sensor Device ◽  
Jet Trajectory ◽  
Novel Method

A novel method of near-field computer vision (NFCV) was developed to monitor the jet trajectory during the jetting process, which was used to precisely predict the falling point position of the jet trajectory. By means of a high-resolution webcam, the NFCV sensor device collected near-field images of the jet trajectory. Preprocessing of collected images was carried out, which included squint image correction, noise elimination, and jet trajectory extraction. The features of the jet trajectory in the processed image were extracted, including: start-point slope (SPS), end-point slope (EPS), and overall trajectory slope (OTS) based on the proposed mean position method. A multiple regression jet trajectory range prediction model was established based on these trajectory characteristics and the reliability of the model was verified. The results show that the accuracy of the prediction model is not less than 94% and the processing time is less than 0.88s, which satisfy the requirements of real-time online jet trajectory monitoring.

ENPP: Extended Non-preemptive PP-aware Scheduling for Real-time Cloud Services

2016 ◽  
Vol 6 (5) ◽  
pp. 2291
Author(s):  
Fereshteh Hoseini ◽  
Mostafa Ghobaei Arani ◽  
Alireza Taghizadeh
Keyword(s):  
Resource Allocation ◽  
Real Time ◽  
Processing Time ◽  
Resource Constraints ◽  
Cloud Services ◽  
Scheduling Problems ◽  
Hard Problems ◽  
Real Time Applications ◽  
Simulation Results ◽  
Np Hard Problems

<p class="Abstract">By increasing the use of cloud services and the number of requests to processing tasks with minimum time and costs, the resource allocation and scheduling, especially in real-time applications become more challenging. The problem of resource scheduling, is one of the most important scheduling problems in the area of NP-hard problems. In this paper, we propose an efficient algorithm is proposed to schedule real-time cloud services by considering the resource constraints. The simulation results show that the proposed algorithm shorten the processing time of tasks and decrease the number of canceled tasks.</p>

scholarly journals Real-time Neural Networks Implementation Proposal for Microcontrollers

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1597
Author(s):  
Caio José B. V. Guimarães ◽  
Marcelo A. C. Fernandes
Keyword(s):  
Neural Networks ◽  
Real Time ◽  
Intelligent Systems ◽  
Implementation Strategy ◽  
Processing Time ◽  
Mean Squared Error ◽  
Low Cost ◽  
Real Time Applications ◽  
Time Required ◽  
Process Classification

The adoption of intelligent systems with Artificial Neural Networks (ANNs) embedded in hardware for real-time applications currently faces a growing demand in fields such as the Internet of Things (IoT) and Machine to Machine (M2M). However, the application of ANNs in this type of system poses a significant challenge due to the high computational power required to process its basic operations. This paper aims to show an implementation strategy of a Multilayer Perceptron (MLP)-type neural network, in a microcontroller (a low-cost, low-power platform). A modular matrix-based MLP with the full classification process was implemented as was the backpropagation training in the microcontroller. The testing and validation were performed through Hardware-In-the-Loop (HIL) of the Mean Squared Error (MSE) of the training process, classification results, and the processing time of each implementation module. The results revealed a linear relationship between the values of the hyperparameters and the processing time required for classification, also the processing time concurs with the required time for many applications in the fields mentioned above. These findings show that this implementation strategy and this platform can be applied successfully in real-time applications that require the capabilities of ANNs.

scholarly journals Real-Time Route Search by Locations

2020 ◽  
Vol 34 (01) ◽  
pp. 574-581
Author(s):  
Lisi Chen ◽  
Shuo Shang ◽  
Tao Guo
Keyword(s):  
Real Time ◽  
Data Streams ◽  
High Efficiency ◽  
Route Planning ◽  
Real Data ◽  
Location Based Services ◽  
Good Time ◽  
Efficient Route ◽  
Route Search ◽  
Insight Into

With the proliferation of GPS-based data (e.g., routes and trajectories), it is of great importance to enable the functionality of real-time route search and recommendations. We define and study a novel Continuous Route-Search-by-Location (C-RSL) problem to enable real-time route search by locations for a large number of users over route data streams. Given a set of C-RSL queries where each query q contains a set of places q.O to visit and a threshold q.θ, we continuously feed each query q with routes that has similarity to q.O no less than q.θ. We also extend our proposal to support top-k C-RSL problem where each query continuously maintains k most similar routes. The C-RSL problem targets a variety of applications, including real-time route planning, ridesharing, and other location-based services that have real-time demand. To enable efficient route matching on a large number of C-RSL queries, we develop novel parallel route matching algorithms with good time complexity. Extensive experiments with real data offer insight into the performance of our algorithms, indicating that our proposal is capable of achieving high efficiency and scalability.

SVM-BASED PHONEME CLASSIFICATION AND LIP SHAPE REFINEMENT IN REAL-TIME LIP-SYNCH SYSTEM

2006 ◽  
Vol 20 (07) ◽  
pp. 1029-1051 ◽  
Author(s):  
HANSEOK KO ◽  
DAVID K. HAN
Keyword(s):  
Real Time ◽  
Processing Time ◽  
Support Vector ◽  
Mel Frequency Cepstral Coefficients ◽  
Phoneme Classification ◽  
Second Stage ◽  
Single Frame ◽  
Time Operation ◽  
Real Time Operation ◽  
Coarse To Fine

In this paper, we present a real time lip-synch system that activates 2-D avatar's lip motion in synch with incoming speech utterance. To achieve the real time operation of the system, the processing time was minimized by "merge and split" procedures resulting in coarse-to-fine phoneme classification. At each stage of phoneme classification, the support vector machine (SVM) method was applied to reduce the computational load while maintaining the desired accuracy. The coarse-to-fine phoneme classification, is accomplished via two_stages of feature extraction: in the first stage, each speech frame is acoustically analyzed for three classes of lip opening using Mel Frequency Cepstral Coefficients (MFCC) as a feature; in the second stage, each frame is further refined for detailed lip shape using formant information. The method was implemented in 2-D lip animation and it was demonstrated that the system was effective in accomplishing real-time lip-synch. This approach was tested on a PC using the Microsoft Visual Studio with an Intel Pentium IV 1.4 Giga Hz CPU and 384 MB RAM. It was observed that the methods of phoneme merging and SVM achieved about twice the speed in recognition than the method employing the Hidden Markov Model (HMM). A typical latency time per a single frame observed using the proposed method was in the order of 18.22 milliseconds while an HMM method under identical conditions resulted about 30.67 milliseconds.

Sign in / Sign up

Export Citation Format

Share Document