首页 > 最新文献

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)最新文献

英文 中文
A Study on the Influencing Factors of Consumers' Financial Behavior in Online Shopping 消费者网上购物金融行为的影响因素研究
Zhao Cheng-Guo, Xiong Lv-Shan, Luo Jia-lu
Under the Internet economy, online shopping is together with Internet financial behavior. This paper uses dimension analysis method to study the impact mechanism of online shopping consumers' financial behavior based on the background of Internet economy. The questionnaire survey, SPSS multi-sample t test is used to analyze the data and YAAHP software is used to analyze the influencing factors. It finds that the consumers' own factors and the internet platform factors have significant impact on the consumers' financial behavior in online shopping, while the social economic factors are not obvious. Finally, this paper puts forward the targeted countermeasures and suggestions from three aspects.
在互联网经济条件下,网上购物与互联网金融行为并行不悖。本文基于互联网经济背景,运用维度分析法研究网络购物消费者金融行为的影响机制。问卷调查,采用SPSS多样本t检验对数据进行分析,采用YAAHP软件对影响因素进行分析。研究发现,消费者自身因素和网络平台因素对消费者网购金融行为的影响显著,而社会经济因素的影响不明显。最后,本文从三个方面提出了针对性的对策建议。
{"title":"A Study on the Influencing Factors of Consumers' Financial Behavior in Online Shopping","authors":"Zhao Cheng-Guo, Xiong Lv-Shan, Luo Jia-lu","doi":"10.1109/IIKI.2016.51","DOIUrl":"https://doi.org/10.1109/IIKI.2016.51","url":null,"abstract":"Under the Internet economy, online shopping is together with Internet financial behavior. This paper uses dimension analysis method to study the impact mechanism of online shopping consumers' financial behavior based on the background of Internet economy. The questionnaire survey, SPSS multi-sample t test is used to analyze the data and YAAHP software is used to analyze the influencing factors. It finds that the consumers' own factors and the internet platform factors have significant impact on the consumers' financial behavior in online shopping, while the social economic factors are not obvious. Finally, this paper puts forward the targeted countermeasures and suggestions from three aspects.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125445128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improve E-Commerce Recommendation by Classification Tree and Fuzzy Sets 利用分类树和模糊集改进电子商务推荐
Lianhong Ding, Yanhong Zheng
In order to enhance the performance of E-Commerce recommendation, a hybrid filtering approach based on the taxonomy of E-Commerce platform is put forward. The classification tree of products is used to find the users with similar shopping intention. The sparsity of user ratings, major problem for collaborative filtering, is overcome. A two-granularity user profile is built to reflect the customer's shopping interests. User profile is firstly described as a set of leaf nodes of the classification tree. Then, each category of the user profile is refined by the theory of fuzzy set. Fuzzy sets make user profile and item representation more accurate. At the same time, tags instead of key words extracted from item content, are used for the building of user profiles and representation of items. It overcomes the analysis difficulty and large calculation problems for content-based filtering.
为了提高电子商务推荐的性能,提出了一种基于电子商务平台分类的混合过滤方法。使用产品分类树来寻找具有相似购物意向的用户。克服了用户评价的稀疏性,这是协同过滤的主要问题。构建一个双粒度用户配置文件来反映客户的购物兴趣。首先将用户概要描述为分类树的一组叶节点。然后,利用模糊集理论对用户画像的各个类别进行细化。模糊集使用户档案和项目表示更加准确。同时,使用标签代替从项目内容中提取的关键词来构建用户档案和表示项目。它克服了基于内容的过滤的分析困难和计算量大的问题。
{"title":"Improve E-Commerce Recommendation by Classification Tree and Fuzzy Sets","authors":"Lianhong Ding, Yanhong Zheng","doi":"10.1109/IIKI.2016.73","DOIUrl":"https://doi.org/10.1109/IIKI.2016.73","url":null,"abstract":"In order to enhance the performance of E-Commerce recommendation, a hybrid filtering approach based on the taxonomy of E-Commerce platform is put forward. The classification tree of products is used to find the users with similar shopping intention. The sparsity of user ratings, major problem for collaborative filtering, is overcome. A two-granularity user profile is built to reflect the customer's shopping interests. User profile is firstly described as a set of leaf nodes of the classification tree. Then, each category of the user profile is refined by the theory of fuzzy set. Fuzzy sets make user profile and item representation more accurate. At the same time, tags instead of key words extracted from item content, are used for the building of user profiles and representation of items. It overcomes the analysis difficulty and large calculation problems for content-based filtering.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"524 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A New Neural Network Model for Rock Porosity Prediction 岩石孔隙度预测的神经网络新模型
Youxiang Duan, Yu Li, Gentian Li, Qifeng Sun
Artificial neural network has brought a new way for prediction of geological reservoir physical parameters (e.g. porosity, permeability and saturation). However, it becomes strong pertinence and bad universal in parameters prediction. According to the thought of committee machine, the paper presents a new neural network model, which is based on BP neural network, radial basis function (RBF) neural network and support vector regression (SVR) model. And then, a single layer perceptron (SLP) combines different individual neural network to adjust of network structure and reap beneficial advantages of all model. Eventually, a committee neural network (CNN) was constructed. It eliminated the defects of individual neural network in porosity prediction and improved the accuracy of the prediction. Three well logs are applied for experiment. One was used to establish the CNN model, and the other two were employed to assess the reliability of constructed CNN model. Results show that the CNN model performed better than individual neural network model.
人工神经网络为地质储层物性参数(如孔隙度、渗透率、饱和度)的预测提供了一种新的方法。但在参数预测方面针对性强,通用性差。根据委员会机的思想,提出了一种基于BP神经网络、径向基函数(RBF)神经网络和支持向量回归(SVR)模型的新型神经网络模型。然后,单层感知器(SLP)结合不同的单个神经网络来调整网络结构,从而获得所有模型的有利优势。最终,构建了一个委员会神经网络(CNN)。消除了单个神经网络在孔隙度预测中的缺陷,提高了预测精度。实验采用了3口测井曲线。其中一个用于建立CNN模型,另外两个用于评估构建的CNN模型的可靠性。结果表明,CNN模型优于单个神经网络模型。
{"title":"A New Neural Network Model for Rock Porosity Prediction","authors":"Youxiang Duan, Yu Li, Gentian Li, Qifeng Sun","doi":"10.1109/IIKI.2016.44","DOIUrl":"https://doi.org/10.1109/IIKI.2016.44","url":null,"abstract":"Artificial neural network has brought a new way for prediction of geological reservoir physical parameters (e.g. porosity, permeability and saturation). However, it becomes strong pertinence and bad universal in parameters prediction. According to the thought of committee machine, the paper presents a new neural network model, which is based on BP neural network, radial basis function (RBF) neural network and support vector regression (SVR) model. And then, a single layer perceptron (SLP) combines different individual neural network to adjust of network structure and reap beneficial advantages of all model. Eventually, a committee neural network (CNN) was constructed. It eliminated the defects of individual neural network in porosity prediction and improved the accuracy of the prediction. Three well logs are applied for experiment. One was used to establish the CNN model, and the other two were employed to assess the reliability of constructed CNN model. Results show that the CNN model performed better than individual neural network model.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130384972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Research on News Topic-Driven Market Flucatuation and Predication 新闻话题驱动的市场波动与预测研究
Y. Rao, Xuhui Zhong, Shumin Lu
In order to forecast the price movement of stock with the correlated news events, an enhanced Topic-driven model with the positional weight of feature words and label of stocks, named LP-LDA model, is proposed to represent and analyze the intrinsic mechanism in financial market. The experiment results show that LP-LDA has a better performance than traditional LDA model. Especially, when the number of topics are increasing, the running time of LP-LDA model are 0.69s, 0.78 s and 1.15s at 100, 200 and 300 topics, respectively, which are better than LDA. Furthermore, Degree of Influence (DoI) is defined to describe the considerable influence about the news events on the price movement of certain stock, which provides a new mechanism to measure the fluctuating price. The experiment results shown that the coefficient of correlation between news topic and return rate of stock is 0.9137, which is much higher than other results of experiment.
为了利用相关新闻事件预测股票的价格走势,提出了一种带有特征词位置权重和股票标签的增强型主题驱动模型,即LP-LDA模型,用于表征和分析金融市场的内在机制。实验结果表明,LP-LDA模型比传统的LDA模型具有更好的性能。尤其当主题数增加时,LP-LDA模型在100、200和300主题时的运行时间分别为0.69秒、0.78秒和1.15秒,均优于LDA。进一步,定义了影响度(DoI)来描述新闻事件对某只股票价格变动的可观影响,为衡量股价波动提供了一种新的机制。实验结果表明,新闻话题与股票收益率的相关系数为0.9137,远高于其他实验结果。
{"title":"Research on News Topic-Driven Market Flucatuation and Predication","authors":"Y. Rao, Xuhui Zhong, Shumin Lu","doi":"10.1109/IIKI.2016.93","DOIUrl":"https://doi.org/10.1109/IIKI.2016.93","url":null,"abstract":"In order to forecast the price movement of stock with the correlated news events, an enhanced Topic-driven model with the positional weight of feature words and label of stocks, named LP-LDA model, is proposed to represent and analyze the intrinsic mechanism in financial market. The experiment results show that LP-LDA has a better performance than traditional LDA model. Especially, when the number of topics are increasing, the running time of LP-LDA model are 0.69s, 0.78 s and 1.15s at 100, 200 and 300 topics, respectively, which are better than LDA. Furthermore, Degree of Influence (DoI) is defined to describe the considerable influence about the news events on the price movement of certain stock, which provides a new mechanism to measure the fluctuating price. The experiment results shown that the coefficient of correlation between news topic and return rate of stock is 0.9137, which is much higher than other results of experiment.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Key Techniques of Cross-Language Medical Term Alignment 跨语言医学术语比对关键技术
Yuqi Yang, Guangzhi Zhang, R. Bie, Sungjoong Kim, Dongil Shin
Health is closely related to everyone. Integrating different medical data sets will bring tremendous value for human. Basing on Chinese and English disease medical term, we use text mining technique in terms of two dimensions of the disease from the name and text description of the semantic clustering to achieve initial alignment disease terminology. First, we translate the Chinese data set through the API translation. Then we assign weights for each feature item to obtain feature vector for each disease node disease. Finally, we calculate the similarity of diseases and K-means clustering. We conduct experiments to evaluate the method on real-world and authoritative dataset, and the results prove that it has better rationality and superiority. The method can be extended to the initial alignment of multilingual texts with the same concept after improving.
健康与每个人息息相关。整合不同的医疗数据集将为人类带来巨大的价值。以中英文疾病医学术语为基础,利用文本挖掘技术从疾病名称和文本描述两个维度对疾病术语进行语义聚类,实现疾病术语的初始对齐。首先,我们通过API翻译对中文数据集进行翻译。然后对每个特征项分配权重,得到每个疾病节点疾病的特征向量。最后,我们计算疾病的相似度和K-means聚类。我们在真实世界和权威数据集上对该方法进行了实验评估,结果证明该方法具有更好的合理性和优越性。该方法经过改进,可以推广到具有相同概念的多语种文本的初始对齐。
{"title":"Key Techniques of Cross-Language Medical Term Alignment","authors":"Yuqi Yang, Guangzhi Zhang, R. Bie, Sungjoong Kim, Dongil Shin","doi":"10.1109/IIKI.2016.26","DOIUrl":"https://doi.org/10.1109/IIKI.2016.26","url":null,"abstract":"Health is closely related to everyone. Integrating different medical data sets will bring tremendous value for human. Basing on Chinese and English disease medical term, we use text mining technique in terms of two dimensions of the disease from the name and text description of the semantic clustering to achieve initial alignment disease terminology. First, we translate the Chinese data set through the API translation. Then we assign weights for each feature item to obtain feature vector for each disease node disease. Finally, we calculate the similarity of diseases and K-means clustering. We conduct experiments to evaluate the method on real-world and authoritative dataset, and the results prove that it has better rationality and superiority. The method can be extended to the initial alignment of multilingual texts with the same concept after improving.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126310884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Diseases Clustering for Multi-source Medical Sets 多源医疗集的疾病聚类
Liangchi Li, Shuaijing Xu, Shenling Wang, Xianlin Ma
The construction of medical database has been constructed to some degrees, but the data redundancy between many medical sets has great influence on searching cross different sets. In this paper, the first step is to use three major domestic medical sets as the foundation of the research. And the Natural Language processing technologies is applied to realize the segmentation of disease description. Then, we use TF-IDF to calculate the weight of the feature words in the disease description, and establish the disease feature vector. Based on this vector, the similarity of disease feature vectors is measured by the cosine similarity method. Finally, the effect of k-means and k-center clustering algorithm on the alignment of the disease text is compared. The experimental results show that the k-center clustering algorithm has better performance compared to k-means. And the result of the clustering is reasonable to some extent.
医学数据库的构建已经有了一定的进展,但多个医学集之间的数据冗余对跨集搜索有很大的影响。本文首先以国内三大医疗设备为研究基础。并应用自然语言处理技术实现疾病描述的分割。然后,利用TF-IDF计算疾病描述中特征词的权重,建立疾病特征向量。在此基础上,采用余弦相似度法测量疾病特征向量的相似度。最后,比较了k-means和k-center聚类算法对疾病文本对齐的影响。实验结果表明,与k-means算法相比,k-center聚类算法具有更好的性能。聚类结果在一定程度上是合理的。
{"title":"The Diseases Clustering for Multi-source Medical Sets","authors":"Liangchi Li, Shuaijing Xu, Shenling Wang, Xianlin Ma","doi":"10.1109/IIKI.2016.37","DOIUrl":"https://doi.org/10.1109/IIKI.2016.37","url":null,"abstract":"The construction of medical database has been constructed to some degrees, but the data redundancy between many medical sets has great influence on searching cross different sets. In this paper, the first step is to use three major domestic medical sets as the foundation of the research. And the Natural Language processing technologies is applied to realize the segmentation of disease description. Then, we use TF-IDF to calculate the weight of the feature words in the disease description, and establish the disease feature vector. Based on this vector, the similarity of disease feature vectors is measured by the cosine similarity method. Finally, the effect of k-means and k-center clustering algorithm on the alignment of the disease text is compared. The experimental results show that the k-center clustering algorithm has better performance compared to k-means. And the result of the clustering is reasonable to some extent.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127270394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Vibration Measurement with Electrical Speckle Shearing Pattern Interferometry 用电散斑剪切干涉法测量振动
Chao Jing, Zhongling Liu, Chunlei Guo, Yu Zhang, Yimo Zhang
Electrical speckle shearing pattern interferometry (ESSPI), being a kind of high-precision noncontact real-time measurement method in the whole field, has been used in the field of deformation measurement and harmonic vibration measurement deviating from rough object plane in the optical scale. The method can also be used in the field of nondestructive test (NDT). Two general methods, time-average methods and stroboscopic method, are studied to measure harmonic vibration deviating from object plane and corresponding mathematical models of electrical speckle shearing interfering stripes distribution are set up based on the theory of statistical optics. The vibration measuring system based on ESSPI is designed and the experiments are done to verify measurement availability of the above two methods. The experiment results with time-average method and those with stroboscopic method are compared to prove the following conclusions. The contrast of speckle stripes in electrical speckle shearing interfering stripe images with time-average method is decreased obviously with increase of the stripes level and therefore the time-average method is generally used in qualitative analysis of vibration. The speckle stripes quality in the electrical speckle shearing interfering stripe images with stroboscopic method is better than that with time-average method and the instant vibration distribution can be analyzed quantitatively with stroboscopic method too.
电散斑剪切干涉法(ESSPI)作为一种全领域的高精度非接触实时测量方法,已在光学尺度上应用于偏离粗糙物平面的变形测量和谐波振动测量领域。该方法也可用于无损检测领域。研究了时间平均法和频闪法两种测量偏离物面谐波振动的一般方法,并基于统计光学理论建立了相应的电散斑剪切干涉条纹分布的数学模型。设计了基于ESSPI的振动测量系统,并通过实验验证了上述两种测量方法的有效性。比较了时间平均法和频闪法的实验结果,证明了以下结论。时间平均法电散斑剪切干涉条纹图像中散斑条纹的对比度随着条纹电平的增加而明显降低,因此通常采用时间平均法进行振动定性分析。频闪法得到的电散斑剪切干涉条纹图像的散斑条纹质量优于时间平均法,并可定量分析瞬时振动分布。
{"title":"Vibration Measurement with Electrical Speckle Shearing Pattern Interferometry","authors":"Chao Jing, Zhongling Liu, Chunlei Guo, Yu Zhang, Yimo Zhang","doi":"10.1109/IIKI.2016.119","DOIUrl":"https://doi.org/10.1109/IIKI.2016.119","url":null,"abstract":"Electrical speckle shearing pattern interferometry (ESSPI), being a kind of high-precision noncontact real-time measurement method in the whole field, has been used in the field of deformation measurement and harmonic vibration measurement deviating from rough object plane in the optical scale. The method can also be used in the field of nondestructive test (NDT). Two general methods, time-average methods and stroboscopic method, are studied to measure harmonic vibration deviating from object plane and corresponding mathematical models of electrical speckle shearing interfering stripes distribution are set up based on the theory of statistical optics. The vibration measuring system based on ESSPI is designed and the experiments are done to verify measurement availability of the above two methods. The experiment results with time-average method and those with stroboscopic method are compared to prove the following conclusions. The contrast of speckle stripes in electrical speckle shearing interfering stripe images with time-average method is decreased obviously with increase of the stripes level and therefore the time-average method is generally used in qualitative analysis of vibration. The speckle stripes quality in the electrical speckle shearing interfering stripe images with stroboscopic method is better than that with time-average method and the instant vibration distribution can be analyzed quantitatively with stroboscopic method too.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127728396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differentially Private k-Anonymity: Achieving Query Privacy in Location-Based Services 差分私有k-匿名:实现基于位置服务的查询隐私
Jinbao Wang, Zhipeng Cai, Chunyu Ai, Donghua Yang, Hong Gao, Xiuzhen Cheng
While location based services (LBS) are facilitating our daily life, the privacy issues including location privacy and query privacy are also arising. Existing efforts aiming to preserving query privacy rely on third party servers or fail to provide guaranteed privacy degree. In this paper we combine the concepts of differential privacy and k-anonymity to establish a novel notion of differentially private k-anonymity (DPkA) for query privacy in LBS. The sufficient and necessary condition for the availability of 0-DPkA is recognized and a mechanism M0 to achieve 0-DPkA is given. For other cases that 0-DPkA is impossible, this paper presents an algorithm to achieve ε-DPkA with bounded ε.
基于位置的服务在便利我们日常生活的同时,也产生了位置隐私和查询隐私等隐私问题。现有的旨在保护查询隐私的努力依赖于第三方服务器或无法提供保证的隐私程度。本文将差分隐私和k-匿名的概念结合起来,建立了一种新的差分隐私k-匿名(DPkA)概念。给出了实现0-DPkA的充要条件,并给出了实现0-DPkA的机制。对于其他不可能实现0-DPkA的情况,本文提出了一种ε有界条件下实现ε- dpka的算法。
{"title":"Differentially Private k-Anonymity: Achieving Query Privacy in Location-Based Services","authors":"Jinbao Wang, Zhipeng Cai, Chunyu Ai, Donghua Yang, Hong Gao, Xiuzhen Cheng","doi":"10.1109/IIKI.2016.67","DOIUrl":"https://doi.org/10.1109/IIKI.2016.67","url":null,"abstract":"While location based services (LBS) are facilitating our daily life, the privacy issues including location privacy and query privacy are also arising. Existing efforts aiming to preserving query privacy rely on third party servers or fail to provide guaranteed privacy degree. In this paper we combine the concepts of differential privacy and k-anonymity to establish a novel notion of differentially private k-anonymity (DPkA) for query privacy in LBS. The sufficient and necessary condition for the availability of 0-DPkA is recognized and a mechanism M0 to achieve 0-DPkA is given. For other cases that 0-DPkA is impossible, this paper presents an algorithm to achieve ε-DPkA with bounded ε.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129332774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
The Challenges of NEMO in 6LoWPAN Smart Building Area NEMO在6LoWPAN智能建筑领域的挑战
Mohammadreza Sahebi Shahamabadi, B. Ali, N. Noordin, M. Rasid, A. Jara
The network mobility (NEMO) management for a mobile network of IPv6 low-power personal area network (6LoWPAN) in smart buildings has attracted much interest recently, this is partly due to the emergence of the internet of things (IoT). For the specific case of hospital environments, NEMO provides continued connectivity with the Internet for patients attached with 6LoWPAN mobile nodes (MNs) regardless of patients' locations. NEMO comprises a set of mobile network nodes (MNNs) that could move together as a single unit, and each of these mobile networks has a mobile router (MR) that can change its attachment point to the Internet as the network moves together. Even though NEMO has a low signaling cost, but there is a need to understand their challenges for a 6LoWPAN mobile network in smart buildings. If the MR loses its energy, the connectivity with the network will be lost. In this paper, to illustrate the challenges of NEMO in smart buildings like hospital environments, the traffic load at MR will be evaluated against the number of MNNs, number of handovers, and data arrival rate. This has been simulated by OMNet++4.3.1 and Contiki.
智能建筑中IPv6低功耗个人区域网络(6LoWPAN)移动网络的网络移动性(NEMO)管理最近引起了人们的广泛关注,部分原因是由于物联网(IoT)的出现。对于医院环境的具体情况,NEMO为连接6LoWPAN移动节点(MNs)的患者提供与互联网的持续连接,而不管患者的位置如何。NEMO由一组移动网络节点(mnn)组成,这些移动网络节点可以作为一个单元一起移动,每个移动网络都有一个移动路由器(MR),可以在网络一起移动时改变其与互联网的连接点。尽管NEMO具有较低的信令成本,但有必要了解他们在智能建筑中建立6LoWPAN移动网络所面临的挑战。如果MR失去能量,将失去与网络的连通性。在本文中,为了说明NEMO在智能建筑(如医院环境)中的挑战,将根据mnn的数量、切换次数和数据到达率来评估MR的流量负载。这已经通过omnet++ 4.3.1和Contiki进行了模拟。
{"title":"The Challenges of NEMO in 6LoWPAN Smart Building Area","authors":"Mohammadreza Sahebi Shahamabadi, B. Ali, N. Noordin, M. Rasid, A. Jara","doi":"10.1109/IIKI.2016.110","DOIUrl":"https://doi.org/10.1109/IIKI.2016.110","url":null,"abstract":"The network mobility (NEMO) management for a mobile network of IPv6 low-power personal area network (6LoWPAN) in smart buildings has attracted much interest recently, this is partly due to the emergence of the internet of things (IoT). For the specific case of hospital environments, NEMO provides continued connectivity with the Internet for patients attached with 6LoWPAN mobile nodes (MNs) regardless of patients' locations. NEMO comprises a set of mobile network nodes (MNNs) that could move together as a single unit, and each of these mobile networks has a mobile router (MR) that can change its attachment point to the Internet as the network moves together. Even though NEMO has a low signaling cost, but there is a need to understand their challenges for a 6LoWPAN mobile network in smart buildings. If the MR loses its energy, the connectivity with the network will be lost. In this paper, to illustrate the challenges of NEMO in smart buildings like hospital environments, the traffic load at MR will be evaluated against the number of MNNs, number of handovers, and data arrival rate. This has been simulated by OMNet++4.3.1 and Contiki.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Separable Digital Protractor Based on IMU for Angle Measurement 一种基于IMU的可分离数字量角器的角度测量
Yijun Chen, Guangzhi Zhang, Junqi Guo, R. Mehmood, Yizhen Liu
To achieve a digital access to measurement of relative attitude between two separate objects, a separable digital protractor based on IMU is designed. The protractor consists of a pair of arms, with an IMU and a Bluetooth applied on each of them. Data of the two IMUs are transmitted to a processor on one arm and are used for IMU pose estimation. Since the IMU is rigidly tied to the arm, each estimated IMU pose is just that of the attached arm. By comparing the poses of the arms, we can achieve measurement of their relative attitude. Quaternion and Kalman Filter are used for pose representation and estimation respectively. Experiments are conducted on the accuracy and feasibility. Results show the angle measurement error is less than 2o, which is within the tolerance of most applications. With the help of wireless technology, the proposed protractor can bring lots of convenience in angle measurement for separate objects.
为了实现对两个独立物体之间相对姿态测量的数字化访问,设计了一种基于IMU的可分离数字量角器。量角器由一对臂组成,每个臂上都有一个IMU和一个蓝牙。两个IMU的数据传输到一个手臂上的处理器,用于IMU姿态估计。由于IMU被牢牢地绑在手臂上,所以每个IMU的估计姿势都是附着在手臂上的姿势。通过比较手臂的姿态,我们可以测量它们的相对姿态。四元数滤波和卡尔曼滤波分别用于姿态表示和姿态估计。实验验证了该方法的准确性和可行性。结果表明,测角误差小于20,在大多数应用场合的公差范围内。在无线技术的帮助下,该量角器可以为分离物体的角度测量带来很多方便。
{"title":"A Separable Digital Protractor Based on IMU for Angle Measurement","authors":"Yijun Chen, Guangzhi Zhang, Junqi Guo, R. Mehmood, Yizhen Liu","doi":"10.1109/IIKI.2016.4","DOIUrl":"https://doi.org/10.1109/IIKI.2016.4","url":null,"abstract":"To achieve a digital access to measurement of relative attitude between two separate objects, a separable digital protractor based on IMU is designed. The protractor consists of a pair of arms, with an IMU and a Bluetooth applied on each of them. Data of the two IMUs are transmitted to a processor on one arm and are used for IMU pose estimation. Since the IMU is rigidly tied to the arm, each estimated IMU pose is just that of the attached arm. By comparing the poses of the arms, we can achieve measurement of their relative attitude. Quaternion and Kalman Filter are used for pose representation and estimation respectively. Experiments are conducted on the accuracy and feasibility. Results show the angle measurement error is less than 2o, which is within the tolerance of most applications. With the help of wireless technology, the proposed protractor can bring lots of convenience in angle measurement for separate objects.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122514605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1