70,409 research outputs found
DRSP : Dimension Reduction For Similarity Matching And Pruning Of Time Series Data Streams
Similarity matching and join of time series data streams has gained a lot of
relevance in today's world that has large streaming data. This process finds
wide scale application in the areas of location tracking, sensor networks,
object positioning and monitoring to name a few. However, as the size of the
data stream increases, the cost involved to retain all the data in order to aid
the process of similarity matching also increases. We develop a novel framework
to addresses the following objectives. Firstly, Dimension reduction is
performed in the preprocessing stage, where large stream data is segmented and
reduced into a compact representation such that it retains all the crucial
information by a technique called Multi-level Segment Means (MSM). This reduces
the space complexity associated with the storage of large time-series data
streams. Secondly, it incorporates effective Similarity Matching technique to
analyze if the new data objects are symmetric to the existing data stream. And
finally, the Pruning Technique that filters out the pseudo data object pairs
and join only the relevant pairs. The computational cost for MSM is O(l*ni) and
the cost for pruning is O(DRF*wsize*d), where DRF is the Dimension Reduction
Factor. We have performed exhaustive experimental trials to show that the
proposed framework is both efficient and competent in comparison with earlier
works.Comment: 20 pages,8 figures, 6 Table
Predicting a User's Next Cell With Supervised Learning Based on Channel States
Knowing a user's next cell allows more efficient resource allocation and
enables new location-aware services. To anticipate the cell a user will
hand-over to, we introduce a new machine learning based prediction system.
Therein, we formulate the prediction as a classification problem based on
information that is readily available in cellular networks. Using only Channel
State Information (CSI) and handover history, we perform classification by
embedding Support Vector Machines (SVMs) into an efficient pre-processing
structure. Simulation results from a Manhattan Grid scenario and from a
realistic radio map of downtown Frankfurt show that our system provides timely
prediction at high accuracy.Comment: The 14th IEEE International Workshop on Signal Processing Advances
for Wireless Communications (SPAWC), Darmstadt : Germany (2013
Geometric transport along circular orbits in stationary axisymmetric spacetimes
Parallel transport along circular orbits in orthogonally transitive
stationary axisymmetric spacetimes is described explicitly relative to Lie
transport in terms of the electric and magnetic parts of the induced
connection. The influence of both the gravitoelectromagnetic fields associated
with the zero angular momentum observers and of the Frenet-Serret parameters of
these orbits as a function of their angular velocity is seen on the behavior of
parallel transport through its representation as a parameter-dependent Lorentz
transformation between these two inner-product preserving transports which is
generated by the induced connection. This extends the analysis of parallel
transport in the equatorial plane of the Kerr spacetime to the entire spacetime
outside the black hole horizon, and helps give an intuitive picture of how
competing "central attraction forces" and centripetal accelerations contribute
with gravitomagnetic effects to explain the behavior of the 4-acceleration of
circular orbits in that spacetime.Comment: 33 pages ijmpd latex article with 24 eps figure
Formal Representation of the SS-DB Benchmark and Experimental Evaluation in EXTASCID
Evaluating the performance of scientific data processing systems is a
difficult task considering the plethora of application-specific solutions
available in this landscape and the lack of a generally-accepted benchmark. The
dual structure of scientific data coupled with the complex nature of processing
complicate the evaluation procedure further. SS-DB is the first attempt to
define a general benchmark for complex scientific processing over raw and
derived data. It fails to draw sufficient attention though because of the
ambiguous plain language specification and the extraordinary SciDB results. In
this paper, we remedy the shortcomings of the original SS-DB specification by
providing a formal representation in terms of ArrayQL algebra operators and
ArrayQL/SciQL constructs. These are the first formal representations of the
SS-DB benchmark. Starting from the formal representation, we give a reference
implementation and present benchmark results in EXTASCID, a novel system for
scientific data processing. EXTASCID is complete in providing native support
both for array and relational data and extensible in executing any user code
inside the system by the means of a configurable metaoperator. These features
result in an order of magnitude improvement over SciDB at data loading,
extracting derived data, and operations over derived data.Comment: 32 pages, 3 figure
Anomaly Detection and Removal Using Non-Stationary Gaussian Processes
This paper proposes a novel Gaussian process approach to fault removal in
time-series data. Fault removal does not delete the faulty signal data but,
instead, massages the fault from the data. We assume that only one fault occurs
at any one time and model the signal by two separate non-parametric Gaussian
process models for both the physical phenomenon and the fault. In order to
facilitate fault removal we introduce the Markov Region Link kernel for
handling non-stationary Gaussian processes. This kernel is piece-wise
stationary but guarantees that functions generated by it and their derivatives
(when required) are everywhere continuous. We apply this kernel to the removal
of drift and bias errors in faulty sensor data and also to the recovery of EOG
artifact corrupted EEG signals.Comment: 9 pages, 14 figure
- …