Periodicity is one of the most common phenomena in the physical world. The problem of periodicity analysis （or period detection） is a research topic in several areas, such as signal processing and data mining. Howev...Periodicity is one of the most common phenomena in the physical world. The problem of periodicity analysis （or period detection） is a research topic in several areas, such as signal processing and data mining. However, period detection is a very challenging problem, due to the sparsity and noisiness of observational datasets of periodic events. This paper focuses on the problem of period detection from sparse and noisy observational datasets. To solve the problem, a novel method based on the approximate greatest common divisor （AGCD） is proposed. The proposed method is robust to sparseness and noise, and is efficient. Moreover, unlike most existing methods, it does not need prior knowledge of the rough range of the period. To evaluate the accuracy and efficiency of the proposed method, comprehensive experiments on synthetic data are conducted. Experimental results show that our method can yield highly accurate results with small datasets, is more robust to sparseness and noise, and is less sensitive to the magnitude of period than compared methods.展开更多
针对云服务器中海量密文文件的存储与检索需求,基于错误学习(learning with errors,LWE)问题以及近似最大公约数(approximate greatest common divisor,AGCD)问题设计一种新型同态加密方案,并通过建立加密关键词索引提出了新的检索方案...针对云服务器中海量密文文件的存储与检索需求,基于错误学习(learning with errors,LWE)问题以及近似最大公约数(approximate greatest common divisor,AGCD)问题设计一种新型同态加密方案,并通过建立加密关键词索引提出了新的检索方案。安全性分析与实验测试表明,方案可有效保护用户数据在存储与检索阶段的隐私,与传统的密文检索方案相比,具有较高的检索效率及准确性。展开更多
基金Project supported by the National Natural Science Foundation of China （No. 60673082）
文摘Periodicity is one of the most common phenomena in the physical world. The problem of periodicity analysis （or period detection） is a research topic in several areas, such as signal processing and data mining. However, period detection is a very challenging problem, due to the sparsity and noisiness of observational datasets of periodic events. This paper focuses on the problem of period detection from sparse and noisy observational datasets. To solve the problem, a novel method based on the approximate greatest common divisor （AGCD） is proposed. The proposed method is robust to sparseness and noise, and is efficient. Moreover, unlike most existing methods, it does not need prior knowledge of the rough range of the period. To evaluate the accuracy and efficiency of the proposed method, comprehensive experiments on synthetic data are conducted. Experimental results show that our method can yield highly accurate results with small datasets, is more robust to sparseness and noise, and is less sensitive to the magnitude of period than compared methods.
文摘针对云服务器中海量密文文件的存储与检索需求,基于错误学习(learning with errors,LWE)问题以及近似最大公约数(approximate greatest common divisor,AGCD)问题设计一种新型同态加密方案,并通过建立加密关键词索引提出了新的检索方案。安全性分析与实验测试表明,方案可有效保护用户数据在存储与检索阶段的隐私,与传统的密文检索方案相比,具有较高的检索效率及准确性。
