Mobile opportunistic networks can effectively improve network resource utilities and system performance. In this paper, we propose a cooperation-based routing algorithm to achieve mobile opportunistic communications. To this end, mobile agent nodes are designed to attain information sensitivity and remaining energy of the cluster nodes. For the neighbor cluster nodes with remaining energy and information sensitivity being best among other neighbor cluster nodes, we select them as the next cluster nodes acting as mobile agent nodes. Through the cooperation, the information about node's remaining energy and information sensitivity is shared among nodes. In this way, the optimal multi-hop forwarding routing can be established to adapt to the locally changing network topology. At the same time, network nodes can have more opportunities to access networks. Simulation results show that our approach is effective.
{"title":"A Cooperation-Based Routing Algorithm in Mobile Opportunistic Networks","authors":"Yao Fu, Dingde Jiang, Deyu Zhang, Houbing Song, Hongyuan Wang, Xiaoping Zhou","doi":"10.1109/IIKI.2016.1","DOIUrl":"https://doi.org/10.1109/IIKI.2016.1","url":null,"abstract":"Mobile opportunistic networks can effectively improve network resource utilities and system performance. In this paper, we propose a cooperation-based routing algorithm to achieve mobile opportunistic communications. To this end, mobile agent nodes are designed to attain information sensitivity and remaining energy of the cluster nodes. For the neighbor cluster nodes with remaining energy and information sensitivity being best among other neighbor cluster nodes, we select them as the next cluster nodes acting as mobile agent nodes. Through the cooperation, the information about node's remaining energy and information sensitivity is shared among nodes. In this way, the optimal multi-hop forwarding routing can be established to adapt to the locally changing network topology. At the same time, network nodes can have more opportunities to access networks. Simulation results show that our approach is effective.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"3 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":"127902366","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}
Jie Zhang, Zhiyuan Li, Yidou You, R. Huang, Jin Liu, Xu Chen
AsterixDB Big Data Management System isone of the non-relational databases, developed and researched by researcher in UC Irvine, UC Riverside, andUC San Diego. One of the basic storage structures of AsterixDB is a log structured merge tree, and the log structured merge tree cannot get away from merging operations. When we research in this project closely, we foundthat a better merge policy helps improve the CURD performance of log structured merge tree in a great level. The existing merging policies show a lot of drawbackswhen data size gets bigger and bigger. Our method aimsat optimizing merge policy utilizing a new scheduler–Level Scheduler which was proposed in [6]. Experimentsshow that our merge algorithm is much more efficient.
{"title":"Optimization of Merge Policy in AsterixDB Big Data Management System","authors":"Jie Zhang, Zhiyuan Li, Yidou You, R. Huang, Jin Liu, Xu Chen","doi":"10.1109/IIKI.2016.29","DOIUrl":"https://doi.org/10.1109/IIKI.2016.29","url":null,"abstract":"AsterixDB Big Data Management System isone of the non-relational databases, developed and researched by researcher in UC Irvine, UC Riverside, andUC San Diego. One of the basic storage structures of AsterixDB is a log structured merge tree, and the log structured merge tree cannot get away from merging operations. When we research in this project closely, we foundthat a better merge policy helps improve the CURD performance of log structured merge tree in a great level. The existing merging policies show a lot of drawbackswhen data size gets bigger and bigger. Our method aimsat optimizing merge policy utilizing a new scheduler–Level Scheduler which was proposed in [6]. Experimentsshow that our merge algorithm is much more efficient.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"27 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":"123708759","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}
Shuaijing Xu, Guangzhi Zhang, R. Bie, Wenshuang Liang, Cheonshik Kim, Dongkyoo Shin
Rapid development of computer and network technology has greatly promoted the biological information science. People have made satisfactory achievements in the study of high-throughput interaction map and pathogenic gene identification, and have been able to verify the candidate associations between genes and disease. However, a large amount of implicit knowledge between diseases, symptoms and genes have not been discovered. With the arrival of the age of big data, the number and variety of biomedical data sets have had a huge breakthrough. The rapid growth of biomedical big data provides the possibility of discovering biomedical implied relationship and assessing the strength association between entities. This paper puts forward an implicit association mining algorithm combining Monte Carlo method with the Newton's law of cooling. The algorithm synthesizes path, known-correlation intensity and dynamic changes of associated network topology. It can effectively find out potential and meaningful association between biomedical entities, and can evaluate the strength of the association based on probability.
{"title":"Implicit Correlation Intensity Mining Based on the Monte Carlo Method with Attenuation","authors":"Shuaijing Xu, Guangzhi Zhang, R. Bie, Wenshuang Liang, Cheonshik Kim, Dongkyoo Shin","doi":"10.1109/IIKI.2016.23","DOIUrl":"https://doi.org/10.1109/IIKI.2016.23","url":null,"abstract":"Rapid development of computer and network technology has greatly promoted the biological information science. People have made satisfactory achievements in the study of high-throughput interaction map and pathogenic gene identification, and have been able to verify the candidate associations between genes and disease. However, a large amount of implicit knowledge between diseases, symptoms and genes have not been discovered. With the arrival of the age of big data, the number and variety of biomedical data sets have had a huge breakthrough. The rapid growth of biomedical big data provides the possibility of discovering biomedical implied relationship and assessing the strength association between entities. This paper puts forward an implicit association mining algorithm combining Monte Carlo method with the Newton's law of cooling. The algorithm synthesizes path, known-correlation intensity and dynamic changes of associated network topology. It can effectively find out potential and meaningful association between biomedical entities, and can evaluate the strength of the association based on probability.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"29 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":"114259314","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}
In order to forecast the price movement with the correlation between two different stocks, the model of Stock Social Network (SSN) is proposed to represent and analyze the intrinsic complex relationship. We choose 313 stocks from 9 industries to build an evolution model of SSN, which predicted that some stocks clusters are isolated and the nodes and edges in SSN are decreasing distinctly step by step with the change of threshold δ from 0.7, 0.75 and 0.8, respectively. Meanwhile, the coverage rate of nodes in SSN arrives 0.2076 at δ = 0.8, in reverse, the 79.24% nodes is trimmed during the process of evolution of SSN. Based on these results, we design a new portfolio strategy based on new index, named CSSNI, to optimize the asset pricing model. The results show that the ratio of return is 0.92666 based on the CSSNI, which is much better than the result by traditional strategy.
{"title":"Social Network-Based Stock Correlation Analysis and Prediction","authors":"Y. Rao, Xuhui Zhong, Shumin Lu","doi":"10.1109/IIKI.2016.102","DOIUrl":"https://doi.org/10.1109/IIKI.2016.102","url":null,"abstract":"In order to forecast the price movement with the correlation between two different stocks, the model of Stock Social Network (SSN) is proposed to represent and analyze the intrinsic complex relationship. We choose 313 stocks from 9 industries to build an evolution model of SSN, which predicted that some stocks clusters are isolated and the nodes and edges in SSN are decreasing distinctly step by step with the change of threshold δ from 0.7, 0.75 and 0.8, respectively. Meanwhile, the coverage rate of nodes in SSN arrives 0.2076 at δ = 0.8, in reverse, the 79.24% nodes is trimmed during the process of evolution of SSN. Based on these results, we design a new portfolio strategy based on new index, named CSSNI, to optimize the asset pricing model. The results show that the ratio of return is 0.92666 based on the CSSNI, which is much better than the result by traditional strategy.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"273 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":"130594373","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}
High Resolution Range Profile (HRRP) reflects the size and partial structure feature, and is an effective feature for target recognition. A statistic wide-band feature method based on Optimal Path is proposed, and it can extract accurately the statistic feature of HRRP to realize the stable and unstable targets. The method firstly estimates the scattering points for HRRP based on Optimal Path Means, and more calculates the self-relation feature of all scattering points, and utilizes the value of feature to judge the wave characteristic of target movement, finally can recognize stable targets. Simulation examples show that the proposed feature is steady compared with the common wide-band features, such as radial length, central moments feature, and the entropy of HRRP, and can get a well classified result in the low Signal-to-Noise (SNR) condition.
高分辨率距离像(High Resolution Range Profile, HRRP)反映了目标的大小和局部结构特征，是目标识别的有效特征。提出了一种基于最优路径的统计宽带特征提取方法，该方法能够准确提取出HRRP的统计特征，从而实现稳定目标和不稳定目标。该方法首先基于最优路径均值对HRRP散射点进行估计，然后计算各散射点的自关联特征，利用特征值判断目标运动的波动特性，最终实现对稳定目标的识别。仿真实例表明，与常用的径向长度、中心矩特征、HRRP熵等宽带特征相比，该特征具有较好的稳定性，在低信噪比条件下可以得到较好的分类结果。
{"title":"The Statistical Wide-Band Feature Method of HRRP Based on Optimal Path Means","authors":"Tao Zhao, Chunzhu Dong","doi":"10.1109/IIKI.2016.38","DOIUrl":"https://doi.org/10.1109/IIKI.2016.38","url":null,"abstract":"High Resolution Range Profile (HRRP) reflects the size and partial structure feature, and is an effective feature for target recognition. A statistic wide-band feature method based on Optimal Path is proposed, and it can extract accurately the statistic feature of HRRP to realize the stable and unstable targets. The method firstly estimates the scattering points for HRRP based on Optimal Path Means, and more calculates the self-relation feature of all scattering points, and utilizes the value of feature to judge the wave characteristic of target movement, finally can recognize stable targets. Simulation examples show that the proposed feature is steady compared with the common wide-band features, such as radial length, central moments feature, and the entropy of HRRP, and can get a well classified result in the low Signal-to-Noise (SNR) condition.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"47 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":"134382614","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}
Global navigation satellite system can only work in line of sight environment, and it fails to operate in non-line of sight to the sky. The emerging 5G cellular networks will provide the ability of device to device real-time communication, at the same time, millimeter-wave transmission is regarded as a key technique, which can provide the location precise of centimeter or millimeter level. In this paper, two millimeter-wave with Raised-Cosine carrier are introduced, and the precisions are simulated and analyzed which will provide some reference to the future waveform design in 5G.
{"title":"Study on the Ranging Estimation Based on Millimeter-Wave with Raised-Cosine Carrier","authors":"Xue-rong Cui, Xiao Chen, Huiying Song, Juan Li","doi":"10.1109/IIKI.2016.107","DOIUrl":"https://doi.org/10.1109/IIKI.2016.107","url":null,"abstract":"Global navigation satellite system can only work in line of sight environment, and it fails to operate in non-line of sight to the sky. The emerging 5G cellular networks will provide the ability of device to device real-time communication, at the same time, millimeter-wave transmission is regarded as a key technique, which can provide the location precise of centimeter or millimeter level. In this paper, two millimeter-wave with Raised-Cosine carrier are introduced, and the precisions are simulated and analyzed which will provide some reference to the future waveform design in 5G.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"31 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":"133958330","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}
Weishan Zhang, Bo Li, Dehai Zhao, Faming Gong, Q. Lu
Maximizing benefits from a cloud cluster with minimum computational costs is challenging. An accurate prediction to cloud workload is important to maximize resources usage in the cloud environment. In this paper, we propose an approach using recurrent neural networks (RNN) to realize workload prediction, where CPU and RAM metrics are used to evaluate the performance of the proposed approach. In order to obtain optimized parameter set, an orthogonal experimental design is conducted to find the most influential parameters in RNN. The experiments with Google Cloud Trace data set shows that the RNN based approach can achieve high accuracy of workload prediction, which lays a good foundation for optimizing the running of a cloud computing environment.
{"title":"Workload Prediction for Cloud Cluster Using a Recurrent Neural Network","authors":"Weishan Zhang, Bo Li, Dehai Zhao, Faming Gong, Q. Lu","doi":"10.1109/IIKI.2016.39","DOIUrl":"https://doi.org/10.1109/IIKI.2016.39","url":null,"abstract":"Maximizing benefits from a cloud cluster with minimum computational costs is challenging. An accurate prediction to cloud workload is important to maximize resources usage in the cloud environment. In this paper, we propose an approach using recurrent neural networks (RNN) to realize workload prediction, where CPU and RAM metrics are used to evaluate the performance of the proposed approach. In order to obtain optimized parameter set, an orthogonal experimental design is conducted to find the most influential parameters in RNN. The experiments with Google Cloud Trace data set shows that the RNN based approach can achieve high accuracy of workload prediction, which lays a good foundation for optimizing the running of a cloud computing environment.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"22 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":"133076478","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}
Compared with the traditional multi-source data, the data of scientific and technical literature are mainly based on different scientific and technological documents. Their contents are more emphasis on technical and correlation. The paper took the data of scientific and technical periodical papers, patent and scientific and technical policies as examples, described the characteristics of data about multi-source scientific and technical literature, the method of data processing. And it introduced the author's research work on data processing and analysis for multi-source scientific and technical literature. Experiments showed that proposed model and method in the paper had certain effect. It was necessary to explore the application of multi-source scientific and technical literature.
{"title":"Processing and Mining of Multi-source Scientific and Technical Literature Data","authors":"Wen Zeng","doi":"10.1109/IIKI.2016.89","DOIUrl":"https://doi.org/10.1109/IIKI.2016.89","url":null,"abstract":"Compared with the traditional multi-source data, the data of scientific and technical literature are mainly based on different scientific and technological documents. Their contents are more emphasis on technical and correlation. The paper took the data of scientific and technical periodical papers, patent and scientific and technical policies as examples, described the characteristics of data about multi-source scientific and technical literature, the method of data processing. And it introduced the author's research work on data processing and analysis for multi-source scientific and technical literature. Experiments showed that proposed model and method in the paper had certain effect. It was necessary to explore the application of multi-source scientific and technical literature.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"42 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120906812","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}
As a new concept propulsion system, pulse detonation engines (PDE) show many advantages compared to other conventional propulsion system. In the future, pulse detonation engines will be expected to become the propulsion system of hypersonic flight vehicle. However, exhaust plume is the infrared radiation source of detection, tracking and recognition. Two-dimensional axisymmetric and unsteady Navier-Stokes equations were numerically solved and detailed chemical reaction kinetics of hydrogen/air mixture was used. With the fields of pressure, temperature and main components of the exhaust plume as input data, the line-by-line method and LOS method was used to calculate the infrared spectral radiation properties of the plume. The plume flow field structure and infrared radiation characteristics are analyzed in detail. The effect of the different nozzle structure on plume radiation was analyzed.
{"title":"The Research on Plume Flow Field and Infrared Radiation Characteristic of Pulse Detonation Engine","authors":"Hongxia Mao, Xingdong Bao, Jie Wu, Li Zheng","doi":"10.1109/IIKI.2016.112","DOIUrl":"https://doi.org/10.1109/IIKI.2016.112","url":null,"abstract":"As a new concept propulsion system, pulse detonation engines (PDE) show many advantages compared to other conventional propulsion system. In the future, pulse detonation engines will be expected to become the propulsion system of hypersonic flight vehicle. However, exhaust plume is the infrared radiation source of detection, tracking and recognition. Two-dimensional axisymmetric and unsteady Navier-Stokes equations were numerically solved and detailed chemical reaction kinetics of hydrogen/air mixture was used. With the fields of pressure, temperature and main components of the exhaust plume as input data, the line-by-line method and LOS method was used to calculate the infrared spectral radiation properties of the plume. The plume flow field structure and infrared radiation characteristics are analyzed in detail. The effect of the different nozzle structure on plume radiation was analyzed.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"78 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":"128379626","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}
The challenge of taking care of aged patients who lost control of their bladders and bowel movements is to respond to the patients' needs in a timely manner, which often requires a caretaker (e.g., a family member or a hired assistant) to stay on watch 24/7. In light of advance in cloud computing, we present a real-time low-cost low-power monitoring and notification system that can continuously monitor the patient bedding conditions, detect the conditions that help is needed and notify the care-takers. The system consists of TI SensorTags, Raspberry Pis, and IBM Bluemix. The TI SensorTag is a sensing device, while Raspberry Pi acts as a messenger receiving data collected by TI SensorTags via Bluetooth technology and transmitting the data to Bluemix, a cloud based platform developed by IBM, via WiFi. The low power Bluetooth communication enables a longer sensor battery life. The system design and operation of a working prototype will be described in this paper.
{"title":"An IoT-based Real Time Low Cost Low Power Monitoring and Notification System for Aged Care","authors":"Quang Nguyen, C. Gong, Liran Ma","doi":"10.1109/IIKI.2016.11","DOIUrl":"https://doi.org/10.1109/IIKI.2016.11","url":null,"abstract":"The challenge of taking care of aged patients who lost control of their bladders and bowel movements is to respond to the patients' needs in a timely manner, which often requires a caretaker (e.g., a family member or a hired assistant) to stay on watch 24/7. In light of advance in cloud computing, we present a real-time low-cost low-power monitoring and notification system that can continuously monitor the patient bedding conditions, detect the conditions that help is needed and notify the care-takers. The system consists of TI SensorTags, Raspberry Pis, and IBM Bluemix. The TI SensorTag is a sensing device, while Raspberry Pi acts as a messenger receiving data collected by TI SensorTags via Bluetooth technology and transmitting the data to Bluemix, a cloud based platform developed by IBM, via WiFi. The low power Bluetooth communication enables a longer sensor battery life. The system design and operation of a working prototype will be described in this paper.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"10 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":"125525794","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：