X. Yu, Shengling Wang, Chun-Chi Liu, Chenyu Wang, Weiman Sun
Nowadays, there is a tendency that the Location-based service (LBS) is becoming more and more popular. That is because LBS can provide customized services according to user's current location information. What is more, it can easily recommend the information of a point of interest (POI) to the user. When a user queries a series of POIs, LBS can return a cluster of these POIs. This paper aims to find a given-sized circle that can cover the maximum total weights of POIs for which people require. The weight of a POI reflects its quality, hence, our aim is to help people find the best POIs nearby. In this paper, every cluster is considered as a point. We stipulate an order to traverse these points and update the maximum weight. The challenge of our proposed algorithm lies in the "cast effect", which means the most of the returned POI clusters may be discarded when some hot POIs are blocked. To overcome this challenge, our proposed algorithm will reduce the impact of the cast effect when calculating the weight of a circle. The simulation and the conclusion are presented at the end of this paper.
{"title":"Circle-Covering Algorithm for Multiple-POI Searching","authors":"X. Yu, Shengling Wang, Chun-Chi Liu, Chenyu Wang, Weiman Sun","doi":"10.1109/IIKI.2016.16","DOIUrl":"https://doi.org/10.1109/IIKI.2016.16","url":null,"abstract":"Nowadays, there is a tendency that the Location-based service (LBS) is becoming more and more popular. That is because LBS can provide customized services according to user's current location information. What is more, it can easily recommend the information of a point of interest (POI) to the user. When a user queries a series of POIs, LBS can return a cluster of these POIs. This paper aims to find a given-sized circle that can cover the maximum total weights of POIs for which people require. The weight of a POI reflects its quality, hence, our aim is to help people find the best POIs nearby. In this paper, every cluster is considered as a point. We stipulate an order to traverse these points and update the maximum weight. The challenge of our proposed algorithm lies in the \"cast effect\", which means the most of the returned POI clusters may be discarded when some hot POIs are blocked. To overcome this challenge, our proposed algorithm will reduce the impact of the cast effect when calculating the weight of a circle. The simulation and the conclusion are presented at the end of this paper.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"145 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":"123047432","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}
Radar Cross Section (RCS) measurement is an important means of quantitative evaluation of weapon equipment's stealth performance. To achieve overall targets' RCS, the way of software control rotation angle is applied to record targets' RCS in the corresponding angle on test. With regards to, the different targets set in a completely different rotation speed according to its size and measure frequency. In the paper, the relation of rotation speed, size and measure frequency of targets are analyzed. Then, a method of choosing rotation speed is purposed. The result is verified through some experiment.
{"title":"Study on Influence of Targets' Rotation Speed on the RCS Measurement","authors":"Xin Liu, Feiliang Liu, Yingnan Zhang","doi":"10.1109/IIKI.2016.106","DOIUrl":"https://doi.org/10.1109/IIKI.2016.106","url":null,"abstract":"Radar Cross Section (RCS) measurement is an important means of quantitative evaluation of weapon equipment's stealth performance. To achieve overall targets' RCS, the way of software control rotation angle is applied to record targets' RCS in the corresponding angle on test. With regards to, the different targets set in a completely different rotation speed according to its size and measure frequency. In the paper, the relation of rotation speed, size and measure frequency of targets are analyzed. Then, a method of choosing rotation speed is purposed. The result is verified through some experiment.","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":"129096248","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}
Investor sentiment will have an important influence on the trend of stock prices. There is rich information about stock reviews in the online community and investor sentiment analysis based on text mining has become a hot research topic in the field of Social Science in recent years. This thesis takes stock review in the Sina Finance and Economics Stock Forum as the research object, applying support vector machine (SVM) method to the emotional tendency of stock reviews, and then concluding BSI investor sentiment index based on the results of text mining. Finally, a multiple linear regression model is established, which testify the relationship between investor sentiment and stock price. It is found that investor sentiment index based on text mining can effectively improve the forecast of stock price.
{"title":"A Study of Relationship between Investor Sentiment and Stock Price Based on Text Mining","authors":"Lemin Yin, Ning Zhang, Lifeng He, Wenmin Fang","doi":"10.1109/IIKI.2016.49","DOIUrl":"https://doi.org/10.1109/IIKI.2016.49","url":null,"abstract":"Investor sentiment will have an important influence on the trend of stock prices. There is rich information about stock reviews in the online community and investor sentiment analysis based on text mining has become a hot research topic in the field of Social Science in recent years. This thesis takes stock review in the Sina Finance and Economics Stock Forum as the research object, applying support vector machine (SVM) method to the emotional tendency of stock reviews, and then concluding BSI investor sentiment index based on the results of text mining. Finally, a multiple linear regression model is established, which testify the relationship between investor sentiment and stock price. It is found that investor sentiment index based on text mining can effectively improve the forecast of stock price.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"12 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":"125769145","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}
Ballistic missiles release baits during its middle course to improve the viability of warheads. Bait is similar to warhead not only in shape, and its surface is coated with metallic or non-metallic materials to simulate the warhead in reflecting infrared, radar and laser and thus covers the warhead. Based on certain assumptions and the finite element simulation software ABAQUS, the process is simulated and analyzed that the spherical light bait deploys from folded state to expanded state, and the target optical properties during bait's expanding process are calculated, from which the relevant conclusions are drawn providing basis for further study of baits.
{"title":"Research on Expanding Process and Target Characteristics of Spherical Baits of Ballistic Missiles","authors":"Xiaochuan Ni, Yi Jiang, L. Zheng, Yao Tang","doi":"10.1109/IIKI.2016.92","DOIUrl":"https://doi.org/10.1109/IIKI.2016.92","url":null,"abstract":"Ballistic missiles release baits during its middle course to improve the viability of warheads. Bait is similar to warhead not only in shape, and its surface is coated with metallic or non-metallic materials to simulate the warhead in reflecting infrared, radar and laser and thus covers the warhead. Based on certain assumptions and the finite element simulation software ABAQUS, the process is simulated and analyzed that the spherical light bait deploys from folded state to expanded state, and the target optical properties during bait's expanding process are calculated, from which the relevant conclusions are drawn providing basis for further study of baits.","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":"132509047","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}
Task scheduling in cloud computing system is a NP-Hard problem. Cloud system is more complex than distributed system because there are large numbers of servers, so the complexity increasesthe system failures. In this paper, we proposed a reliability-driven scheduling algorithm for directed acyclic graph(DAG) tasks. A two-phase method is approached to solve this problem. In the first phase, we determine both reliability requirement and timing constraint which can be satisfied with the minimum total system cost in cloud system, in the second phase we used greedy algorithm to minimize an aggregation of reliability and constraints time. Experiments results show that the proposed algorithm with high reliability can effectively reduce the total cost compared with the previous work.
{"title":"An Improved Reliability-Driven Task Scheduling Algorithm in Cloud System","authors":"Weipeng Jing, Guangsheng Chen","doi":"10.1109/IIKI.2016.54","DOIUrl":"https://doi.org/10.1109/IIKI.2016.54","url":null,"abstract":"Task scheduling in cloud computing system is a NP-Hard problem. Cloud system is more complex than distributed system because there are large numbers of servers, so the complexity increasesthe system failures. In this paper, we proposed a reliability-driven scheduling algorithm for directed acyclic graph(DAG) tasks. A two-phase method is approached to solve this problem. In the first phase, we determine both reliability requirement and timing constraint which can be satisfied with the minimum total system cost in cloud system, in the second phase we used greedy algorithm to minimize an aggregation of reliability and constraints time. Experiments results show that the proposed algorithm with high reliability can effectively reduce the total cost compared with the previous work.","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":"133081625","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}
This paper aims to study the risk aversion on valuing the single-name credit derivatives with the fast-scale stochastic volatility correction. Asymptotic approximation is applied to obtain the closed-form solution of the non-linear PDE, and comparison is made to show the utility before and after the stochastic volatility modification.
{"title":"The Study on the Pricing of Credit Risk under the Fast Stochastic Volatility","authors":"Shican Liu, Xiangyu Ge","doi":"10.1109/IIKI.2016.114","DOIUrl":"https://doi.org/10.1109/IIKI.2016.114","url":null,"abstract":"This paper aims to study the risk aversion on valuing the single-name credit derivatives with the fast-scale stochastic volatility correction. Asymptotic approximation is applied to obtain the closed-form solution of the non-linear PDE, and comparison is made to show the utility before and after the stochastic volatility modification.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"46 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":"132817487","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}
Hongtianchen Xie, Gangyong Jia, Guangjie Han, Jian Wan, Yongjian Ren, Jie Huang, Xindong You
This in recent years, the mixed memory (PDRAM) which is consisted of the phase-change memory (PRAM) and the conventional memory (DRAM) has drawn a lot of attention from both industry and academia. It is a promising alternative to replace the traditional memory architecture. PDRAM has good characteristics as large capacity, good stability and non-volatile, while PRAM has disadvantages of a limited life and large access latency. Traditional policies are not sufficient to be directly applied to the PDRAM memory architecture. They cannot adapt to the new features of the hybrid architecture because of their undifferentiated operation, extensive use of PRAM can cause performance degradation and shorten the life of PDRAM memory. This paper proposed Hybrid-LRU caching scheme to address these problems. Our scheme mainly uses the cache consistency address resolution mode to distinguish between different physical mediums in PDRAM, and then take different actions depending on different physical mediums. We have taken a variety of tradition policies like LRU, FIFO, RANDOM, CFLRU to make experimental comparisons. The experimental results have shown that our scheme can reduce the PRAM utilization rate of 11.8% and improve the performance by 4.6%, energy consumption of write and read operation can be reduced up to 88.2%.
{"title":"Hybrid-LRU Caching Scheme for PDRAM Hybrid Memory Architecture in Cloud Computing","authors":"Hongtianchen Xie, Gangyong Jia, Guangjie Han, Jian Wan, Yongjian Ren, Jie Huang, Xindong You","doi":"10.1109/IIKI.2016.22","DOIUrl":"https://doi.org/10.1109/IIKI.2016.22","url":null,"abstract":"This in recent years, the mixed memory (PDRAM) which is consisted of the phase-change memory (PRAM) and the conventional memory (DRAM) has drawn a lot of attention from both industry and academia. It is a promising alternative to replace the traditional memory architecture. PDRAM has good characteristics as large capacity, good stability and non-volatile, while PRAM has disadvantages of a limited life and large access latency. Traditional policies are not sufficient to be directly applied to the PDRAM memory architecture. They cannot adapt to the new features of the hybrid architecture because of their undifferentiated operation, extensive use of PRAM can cause performance degradation and shorten the life of PDRAM memory. This paper proposed Hybrid-LRU caching scheme to address these problems. Our scheme mainly uses the cache consistency address resolution mode to distinguish between different physical mediums in PDRAM, and then take different actions depending on different physical mediums. We have taken a variety of tradition policies like LRU, FIFO, RANDOM, CFLRU to make experimental comparisons. The experimental results have shown that our scheme can reduce the PRAM utilization rate of 11.8% and improve the performance by 4.6%, energy consumption of write and read operation can be reduced up to 88.2%.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"234 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":"122372769","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}
Shanshan Ruan, S. El-Ashram, Zahid Mahmood, R. Mehmood, Waqas Ahmad
Clustering by fast search and find of density peaks (DP) is a new density based clustering method and has gained much popularity among the researcher. DP provided the new insight to detect cluster centers and noise in the dataset. DP reveals that a cluster center is a point that have higher density as compared with its neighbor points and have a large distance from other higher density peak points. DP detects each density peak in dataset and discover cluster center with the help of decision graph with minimum human interpretation. After successful identification of cluster centers rest of points are assigned to each cluster center based on the minimum nearest neighbor. DP works very well when each cluster consists of single density however, for more complex and density connected clusters it cannot finds the accurate clusters. To make DP effective equally for more complex datasets, we introduce a novel approach to detect miss classified density and then assign separate density to appropriate cluster. To evaluate the robustness of proposed method we utilized three complex synthetic datasets and compared with DP.
{"title":"Density Peaks Clustering for Complex Datasets","authors":"Shanshan Ruan, S. El-Ashram, Zahid Mahmood, R. Mehmood, Waqas Ahmad","doi":"10.1109/IIKI.2016.20","DOIUrl":"https://doi.org/10.1109/IIKI.2016.20","url":null,"abstract":"Clustering by fast search and find of density peaks (DP) is a new density based clustering method and has gained much popularity among the researcher. DP provided the new insight to detect cluster centers and noise in the dataset. DP reveals that a cluster center is a point that have higher density as compared with its neighbor points and have a large distance from other higher density peak points. DP detects each density peak in dataset and discover cluster center with the help of decision graph with minimum human interpretation. After successful identification of cluster centers rest of points are assigned to each cluster center based on the minimum nearest neighbor. DP works very well when each cluster consists of single density however, for more complex and density connected clusters it cannot finds the accurate clusters. To make DP effective equally for more complex datasets, we introduce a novel approach to detect miss classified density and then assign separate density to appropriate cluster. To evaluate the robustness of proposed method we utilized three complex synthetic datasets and compared with DP.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"12 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":"124277219","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 deterministic models, the key feature of a stochastic differential equation (SDE) model is its ability to generate a large number of different trajectories. To tackle the challenge, a number of methods have been proposed to infer reliable estimates. But these methods dominantly used the explicit methods for solving SDEs, and thus are not appropriate to deal with experimentaldata with large variations. In this work we develop a new method by using implicit methods to solve SDEs, which is aimed at generating stable simulations for stiff SDE models. The particle swarm optimization method is used as an efficient searching method to explore the optimal estimate in the complex parameter space. Using the interest term structure model as the test system, numerical results showed that the proposed new method is an effective approach for generating reliable estimates of unknown parameters in SDE models.
{"title":"Inference of Term Structure Models","authors":"Yanli Zhou, Xiangyu Ge, Yonghong Wu, Tianhai Tian","doi":"10.1109/IIKI.2016.74","DOIUrl":"https://doi.org/10.1109/IIKI.2016.74","url":null,"abstract":"Compared with deterministic models, the key feature of a stochastic differential equation (SDE) model is its ability to generate a large number of different trajectories. To tackle the challenge, a number of methods have been proposed to infer reliable estimates. But these methods dominantly used the explicit methods for solving SDEs, and thus are not appropriate to deal with experimentaldata with large variations. In this work we develop a new method by using implicit methods to solve SDEs, which is aimed at generating stable simulations for stiff SDE models. The particle swarm optimization method is used as an efficient searching method to explore the optimal estimate in the complex parameter space. Using the interest term structure model as the test system, numerical results showed that the proposed new method is an effective approach for generating reliable estimates of unknown parameters in SDE models.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"4 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":"122344877","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}
Dapeng Chen, Xiaolong Zhang, Guang Zhang, Yazhou Zhang, Xiaoli Li
It is an increasing number of the applications of new materials in modern aircraft manufacture, especially composites are largely used in some key parts, such as the rudder and wing. However, more non-destructive problems appear because of the restriction of the traditional non-destructive testing methods for the new materials. In this paper, the principle of infrared thermography about two kinds of heat stimulation methods is introduced, several composite and metal materials used in the aircraft is manufactured as the specimen for the inspection experiments, the temperature decreasing data after heat stimulation is processed and the defects are shown in the thermal images, furthermore, the results of CFRP impact damages inspected by using different kinds of heat stimulations are shown as a comparison, and the advantages and disadvantages of the two methods for this kind of material is analyzed, In addition, the characteristic and develop trend of this technology in aircraft is summarized.
{"title":"Infrared Thermography and Its Applications in Aircraft Non-destructive Testing","authors":"Dapeng Chen, Xiaolong Zhang, Guang Zhang, Yazhou Zhang, Xiaoli Li","doi":"10.1109/IIKI.2016.24","DOIUrl":"https://doi.org/10.1109/IIKI.2016.24","url":null,"abstract":"It is an increasing number of the applications of new materials in modern aircraft manufacture, especially composites are largely used in some key parts, such as the rudder and wing. However, more non-destructive problems appear because of the restriction of the traditional non-destructive testing methods for the new materials. In this paper, the principle of infrared thermography about two kinds of heat stimulation methods is introduced, several composite and metal materials used in the aircraft is manufactured as the specimen for the inspection experiments, the temperature decreasing data after heat stimulation is processed and the defects are shown in the thermal images, furthermore, the results of CFRP impact damages inspected by using different kinds of heat stimulations are shown as a comparison, and the advantages and disadvantages of the two methods for this kind of material is analyzed, In addition, the characteristic and develop trend of this technology in aircraft is summarized.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"12 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":"121034710","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
扫码关注我们
求助内容：
应助结果提醒方式：