Titlebook: Intelligent Information and Database Systems; Third International Ngoc Thanh Nguyen,Chong-Gun Kim,Adam Janiak Conference proceedings 2011

重力

neurologist

動(dòng)物

Bob-Tree: An Efficient B?+?-Tree Based Index Structure for Geographic-Aware Obfuscationis the most popular technique aiming at protecting this sensitive information. However, all of the conventional obfuscation techniques are geometry-based and separated from the database level. Thus, the query processing has two time-consuming phases due to the number of disk accesses required to ret

Colonnade

A Mutual and Pseudo Inverse Matrix – Based Authentication Mechanism for Outsourcing Servicevantages such as cost savings and service benefits. However, the delegation of database management to service provider, which is not fully trusted, introduces many significant security and privacy issues. They can be referred to as authentication, data confidentiality and integrity, data privacy, se

大約冬季

Anonymizing Shortest Paths on Social Network Graphsding safety and privacy concerns. To prevent privacy being breached and modeling a social network as a weighted graph, many effective anonymization techniques have been proposed. In this work, we consider the edge weight anonymity problem. In particular, to protect the weight privacy of the shortest

符合規(guī)定

Mining Latent Sources of Causal Time Series Using Nonlinear State Space ModelingSM) techniques named nonlinear dynamical factor analysis (NDFA) to mine the latent factors which are the original sources for producing the observations of causal time series. The purpose of mining indirect sources rather than the time series observation is that much better results can be obtained f

飛來飛去真休

Time Series Subsequence Matching Based on a Combination of PIP and Clippinging which is based on IPIP, our new method for time series dimensionality reduction. The IPIP method is a combination of PIP (Perceptually Important Points) method and clipping technique in order that the new method not only satisfies the lower bounding condition, but also provides a bit level repre

迅速成長

manifestation

嚴(yán)峻考驗(yàn)