首页 > 最新文献

2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)最新文献

英文 中文
Application of P-cycle in OpenADR communication network protection P-cycle在OpenADR通信网络保护中的应用
Yingjie Lv, Wei Cen, Yi-Lun Fu, Chao Lu, Bin Li
In this paper, we have studied the application of P-cycle in OpenADR communication network. The notions of OpenADR and P-cycle are presented in section I . Then section II put forward a set of algorithms to create P-cycles to protect specific tree network, and simulation results of the algorithm is illustrated in section III. Results show that the algorithm is efficient to calculate P-cycle of high quality for OpenADR communication network.
本文研究了P-cycle在OpenADR通信网络中的应用。OpenADR和P-cycle的概念在第1节中介绍。第二节提出了一组创建p环保护特定树状网络的算法,第三节给出了该算法的仿真结果。结果表明,该算法能够有效地计算出OpenADR通信网络中高质量的p环。
{"title":"Application of P-cycle in OpenADR communication network protection","authors":"Yingjie Lv, Wei Cen, Yi-Lun Fu, Chao Lu, Bin Li","doi":"10.1109/ICSESS.2016.7883125","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883125","url":null,"abstract":"In this paper, we have studied the application of P-cycle in OpenADR communication network. The notions of OpenADR and P-cycle are presented in section I . Then section II put forward a set of algorithms to create P-cycles to protect specific tree network, and simulation results of the algorithm is illustrated in section III. Results show that the algorithm is efficient to calculate P-cycle of high quality for OpenADR communication network.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615630","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}
引用次数: 3
Data-centric publish-subscribe approach for Distributed Complex Event Processing deployment in smart grid Internet of Things 智能电网物联网中分布式复杂事件处理部署的以数据为中心的发布-订阅方法
X. Zu, Yan Bai, Xu Yao
Smart grid is an important application of Internet Of Things (IOT). Monitoring data in large-scale smart grid are massive, real-time and dynamic that collected by a lot of sensors, services components etc. There are many challenges in deploying and managing distributed real time monitoring systems. This paper adopted data-centric approach in deploying Distributed Complex Event Processing (DCEP) monitoring system based on OMG Data Distribution Service (DDS) middleware, to bring about a more robust and scalable distributed monitoring system, and that easier to maintain and enhance over time. The DDS data-centric publish-subscribe programming model with support for a number of QoS properties gives many advantages for supporting DCEP components communications, that reliably transports events from data producers to Event Processing Agents (EPAs), between internal DCEP Processing Node (PN), and from the EPAs to the event consumers. This paper analyzed DCEP requirements in IoT, and its PN configuration and deployment flow, designed a DDS/DCEP integration architecture for smart grid IoT monitoring system, and gave a detail design about DCEP development and configuration method based on DDS data-centric programming model, that can simplify the DCEP complex deployment work. This work has beneficial for DECP large scale development & deployment research.
智能电网是物联网的重要应用。大型智能电网的监测数据是海量的、实时的、动态的,由大量传感器、服务组件等采集。分布式实时监控系统的部署和管理存在许多挑战。本文采用以数据为中心的方法部署基于OMG数据分布服务(DDS)中间件的分布式复杂事件处理(DCEP)监控系统,使分布式监控系统更加健壮和可扩展,并且随着时间的推移更易于维护和增强。支持许多QoS属性的DDS以数据为中心的发布-订阅编程模型为支持DCEP组件通信提供了许多优势,这种通信可以可靠地将事件从数据生产者传输到事件处理代理(EPAs)、在内部DCEP处理节点(PN)之间以及从EPAs传输到事件消费者。分析了物联网中DCEP的需求及其PN配置和部署流程,设计了一种面向智能电网物联网监控系统的DDS/DCEP集成架构,并详细设计了基于DDS数据中心编程模型的DCEP开发和配置方法,简化了DCEP复杂的部署工作。该工作对DECP的大规模开发与部署研究具有一定的指导意义。
{"title":"Data-centric publish-subscribe approach for Distributed Complex Event Processing deployment in smart grid Internet of Things","authors":"X. Zu, Yan Bai, Xu Yao","doi":"10.1109/ICSESS.2016.7883166","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883166","url":null,"abstract":"Smart grid is an important application of Internet Of Things (IOT). Monitoring data in large-scale smart grid are massive, real-time and dynamic that collected by a lot of sensors, services components etc. There are many challenges in deploying and managing distributed real time monitoring systems. This paper adopted data-centric approach in deploying Distributed Complex Event Processing (DCEP) monitoring system based on OMG Data Distribution Service (DDS) middleware, to bring about a more robust and scalable distributed monitoring system, and that easier to maintain and enhance over time. The DDS data-centric publish-subscribe programming model with support for a number of QoS properties gives many advantages for supporting DCEP components communications, that reliably transports events from data producers to Event Processing Agents (EPAs), between internal DCEP Processing Node (PN), and from the EPAs to the event consumers. This paper analyzed DCEP requirements in IoT, and its PN configuration and deployment flow, designed a DDS/DCEP integration architecture for smart grid IoT monitoring system, and gave a detail design about DCEP development and configuration method based on DDS data-centric programming model, that can simplify the DCEP complex deployment work. This work has beneficial for DECP large scale development & deployment research.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131864329","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}
引用次数: 6
A real-time algorithm for finding frequent items over sliding window 在滑动窗口上查找频繁项目的实时算法
Jing Li, Jun Liu, Wenli Zhou
The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.
本文提出了一种寻找滑动窗口上频繁元素的改进算法。它不假设输入项目的频率分布。它的主要结构仅由几个地图和短队列组成。通过使用哈希表和其他数据结构来管理计数器,大大减少了运行时间。经过充分的实验和逻辑分析,运行时间降至常数。
{"title":"A real-time algorithm for finding frequent items over sliding window","authors":"Jing Li, Jun Liu, Wenli Zhou","doi":"10.1109/ICSESS.2016.7883025","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883025","url":null,"abstract":"The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134347289","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
A method for the translation from UML into Event-B 将UML转换为Event-B的方法
Sun Weixuan, Zhang Hong, Fu Yangzhen, Feng Chao
The semi-formal language UML has become a standard notation for describing analysis and design models of complex software systems. But it's difficult to be verified formally. In order to solve this problem, a method to translate the UML models to the Event-B models has been proposed. The specific research is on the translation of the use case diagram and sequence diagram in UML. In the use case diagram, the users, the use cases and the relationship between them are taken into main consideration; In the sequence diagram, the objects of communication, the messages and the sending sequence of the messages are taken into main consideration. The translated models could be verificatied formally by the proof obligations in the platform of Rodin. Thus the purpose of formal verification for the semi-formal UML models has been achieved. Then the problem existing in the models could be found and the accuracy of the models could be guaranteed.
半形式化语言UML已经成为描述复杂软件系统的分析和设计模型的标准符号。但这很难得到正式证实。为了解决这一问题,提出了一种将UML模型转换为Event-B模型的方法。具体研究了UML中用例图和序列图的翻译。在用例图中,主要考虑用户、用例以及它们之间的关系;在序列图中,主要考虑通信对象、消息和消息的发送顺序。翻译后的模型可以通过罗丹平台的证明义务进行正式验证。这样就达到了对半形式化UML模型进行形式化验证的目的。从而发现模型中存在的问题,保证模型的准确性。
{"title":"A method for the translation from UML into Event-B","authors":"Sun Weixuan, Zhang Hong, Fu Yangzhen, Feng Chao","doi":"10.1109/ICSESS.2016.7883083","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883083","url":null,"abstract":"The semi-formal language UML has become a standard notation for describing analysis and design models of complex software systems. But it's difficult to be verified formally. In order to solve this problem, a method to translate the UML models to the Event-B models has been proposed. The specific research is on the translation of the use case diagram and sequence diagram in UML. In the use case diagram, the users, the use cases and the relationship between them are taken into main consideration; In the sequence diagram, the objects of communication, the messages and the sending sequence of the messages are taken into main consideration. The translated models could be verificatied formally by the proof obligations in the platform of Rodin. Thus the purpose of formal verification for the semi-formal UML models has been achieved. Then the problem existing in the models could be found and the accuracy of the models could be guaranteed.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134466729","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
Optimization of the overload detection algorithm for virtual machine consolidation 虚拟机整合过载检测算法的优化
Chao Chen, Kejing He, Dongyan Deng
With the increasing demand of computing resources, a lot of large-scale data centers have been established around the world. Data centers provide efficient and convenient computing services while consume enormous energy at the same time. Therefore, reducing the energy consumption in data center is important and meaningful. Virtual machine consolidation (VMC) is an effective strategy that can improve the energy efficiency of data centers. In this research, we have put forward a new overload detection algorithm on the basis of existing algorithms to achieve better tradeoff between energy and service level agreement (SLA) violation. The prediction process of the proposed algorithm is mainly based on the utilization history of VMs. The experimental results demonstrate that compared with the original host-based framework, the proposed VM-based framework reduces the average ESV by 23.4%.
随着对计算资源需求的不断增长,世界各地建立了大量的大型数据中心。数据中心在提供高效、便捷的计算服务的同时,也消耗着巨大的能源。因此,降低数据中心的能耗是非常重要和有意义的。虚拟机整合(VMC)是一种有效的策略,可以提高数据中心的能源效率。在本研究中,我们在现有算法的基础上提出了一种新的过载检测算法,以实现能源和服务水平协议(SLA)违反之间更好的权衡。该算法的预测过程主要基于虚拟机的使用历史。实验结果表明,与原来的基于主机的框架相比,本文提出的基于虚拟机的框架平均降低了23.4%的ESV。
{"title":"Optimization of the overload detection algorithm for virtual machine consolidation","authors":"Chao Chen, Kejing He, Dongyan Deng","doi":"10.1109/ICSESS.2016.7883050","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883050","url":null,"abstract":"With the increasing demand of computing resources, a lot of large-scale data centers have been established around the world. Data centers provide efficient and convenient computing services while consume enormous energy at the same time. Therefore, reducing the energy consumption in data center is important and meaningful. Virtual machine consolidation (VMC) is an effective strategy that can improve the energy efficiency of data centers. In this research, we have put forward a new overload detection algorithm on the basis of existing algorithms to achieve better tradeoff between energy and service level agreement (SLA) violation. The prediction process of the proposed algorithm is mainly based on the utilization history of VMs. The experimental results demonstrate that compared with the original host-based framework, the proposed VM-based framework reduces the average ESV by 23.4%.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133374875","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
Design and implementation of TV two-dimensional code publishing system 电视二维码发布系统的设计与实现
Feifei Guo, Yu Liang
The emergence of TV two-dimensional code not only makes the traditional TV media and new media to connect more closely, but also achieves the “mobile - television - network” direct interaction, greatly promoting the trend of media convergence. This paper, basing on the two-dimensional code generation techniques - PHP QR code, uses the MVC framework and Open API technology to design and complete the TV two-dimensional code publishing system, and finally realizes dual screen interaction between mobile phone and TV.
电视二维码的出现不仅使传统电视媒体与新媒体的联系更加紧密,而且实现了“手机-电视-网络”的直接互动,极大地推动了媒体融合的趋势。本文以二维码生成技术——PHP二维码为基础,采用MVC框架和Open API技术,设计并完成了电视二维码发布系统,最终实现了手机和电视的双屏交互。
{"title":"Design and implementation of TV two-dimensional code publishing system","authors":"Feifei Guo, Yu Liang","doi":"10.1109/ICSESS.2016.7883155","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883155","url":null,"abstract":"The emergence of TV two-dimensional code not only makes the traditional TV media and new media to connect more closely, but also achieves the “mobile - television - network” direct interaction, greatly promoting the trend of media convergence. This paper, basing on the two-dimensional code generation techniques - PHP QR code, uses the MVC framework and Open API technology to design and complete the TV two-dimensional code publishing system, and finally realizes dual screen interaction between mobile phone and TV.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130294688","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 dual-wavelength erbium-doped fiber laser based on annular cavity 基于环形腔的双波长掺铒光纤激光器
Wenjun Zhang, Jincai Lin, Ning Jia
A dual-wavelength erbium-doped fiber laser (DW-EDFL) which can output double wavelengths of 1530nm, and 1550nm is proposed in this paper. The optimal condition for optimum output power of two wavelengths is extracted and demonstrated. When the length of EDFL is 4.13m the output power of the two wavelengths can reach 2mW. Additionally, two variable optical attenuators (VOA) are used to balance gain and loss of two signal lights in the ring resonator.
提出了一种可输出1530nm和1550nm双波长掺铒光纤激光器(DW-EDFL)。提出并论证了两种波长的最佳输出功率的最佳条件。当EDFL长度为4.13m时,两个波长的输出功率可达2mW。此外,两个可变光衰减器(VOA)用于平衡环形谐振器中两个信号的增益和损耗。
{"title":"A dual-wavelength erbium-doped fiber laser based on annular cavity","authors":"Wenjun Zhang, Jincai Lin, Ning Jia","doi":"10.1109/ICSESS.2016.7883175","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883175","url":null,"abstract":"A dual-wavelength erbium-doped fiber laser (DW-EDFL) which can output double wavelengths of 1530nm, and 1550nm is proposed in this paper. The optimal condition for optimum output power of two wavelengths is extracted and demonstrated. When the length of EDFL is 4.13m the output power of the two wavelengths can reach 2mW. Additionally, two variable optical attenuators (VOA) are used to balance gain and loss of two signal lights in the ring resonator.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124404493","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
Research for pedestrian detection classifier 行人检测分类器的研究
Dong Huo, Hui Liu, Zhenhong Shang, Runxin Li
The image features play an important role in object detection and recognition, the method of object detection based on Histogram of Oriented Gradient(HOG) for its good detection result receives extensive attention to many researchers. This article describes the approaches to Histogram of Oriented Gradient and support vector machine, focusing on studying the HOG feature and application, detailing the process of HOG feature extracted and the design of classifiers in pedestrian detection. In this paper, pedestrian sample library was built and the Histogram of Oriented Gradient feature of the samples was extracted. The pedestrian classifier was obtained by using support vector machine and the performance of the classifier was tested.
图像特征在目标检测和识别中起着重要的作用,基于梯度直方图(Histogram of Oriented Gradient, HOG)的目标检测方法以其良好的检测效果受到众多研究者的广泛关注。本文介绍了面向梯度直方图和支持向量机的方法,重点研究了HOG特征及其应用,详细介绍了HOG特征提取过程和分类器在行人检测中的设计。本文建立了行人样本库,提取了样本的梯度特征直方图。利用支持向量机得到行人分类器,并对分类器的性能进行了测试。
{"title":"Research for pedestrian detection classifier","authors":"Dong Huo, Hui Liu, Zhenhong Shang, Runxin Li","doi":"10.1109/ICSESS.2016.7883202","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883202","url":null,"abstract":"The image features play an important role in object detection and recognition, the method of object detection based on Histogram of Oriented Gradient(HOG) for its good detection result receives extensive attention to many researchers. This article describes the approaches to Histogram of Oriented Gradient and support vector machine, focusing on studying the HOG feature and application, detailing the process of HOG feature extracted and the design of classifiers in pedestrian detection. In this paper, pedestrian sample library was built and the Histogram of Oriented Gradient feature of the samples was extracted. The pedestrian classifier was obtained by using support vector machine and the performance of the classifier was tested.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124830393","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
Implementation of partitional clustering on ILPD dataset to predict liver disorders 基于ILPD数据集的分区聚类预测肝脏疾病的实现
M. Babu, M. Ramjee, Somesh Katta, S. K.
Cluster Analysis methods are very important, popular data summarization techniques applied in diverse environments. These techniques retrieve the hidden patterns in large datasets in the form of characterized patterns which can be interpreted further in different contexts. Widespread use of medical information systems and explosive growth of medical databases require traditional manual data analysis coupled with efficient computer assisted analysis. Medical Diagnosis is a difficult process which needs proficiency as well as experience to cope with a disease. Data segmentation is an application in medical domain used to analyze patient records, disease trends and health care resource utilization, which in turn assist a physician in Medical Diagnosis. In the present paper a technique based on classification techniques is proposed to predict liver disorders accurately. The main objective is to examine whether the proposed method can obtain better prediction accuracy to traditional classification algorithms. The classification results using the proposed method are found to be very promising and accurate.
聚类分析方法是一种重要的、流行的数据汇总技术,应用于各种环境中。这些技术以特征模式的形式检索大型数据集中的隐藏模式,这些特征模式可以在不同的上下文中进一步解释。医疗信息系统的广泛使用和医疗数据库的爆炸性增长需要传统的人工数据分析与高效的计算机辅助分析相结合。医学诊断是一个困难的过程,既需要熟练程度,又需要经验来应对疾病。数据分割是医学领域的一种应用,用于分析患者记录、疾病趋势和医疗资源利用情况,从而辅助医生进行医疗诊断。本文提出了一种基于分类技术的准确预测肝脏疾病的方法。主要目的是检验该方法是否能获得比传统分类算法更好的预测精度。结果表明,该方法具有较高的分类精度和较好的应用前景。
{"title":"Implementation of partitional clustering on ILPD dataset to predict liver disorders","authors":"M. Babu, M. Ramjee, Somesh Katta, S. K.","doi":"10.1109/ICSESS.2016.7883256","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883256","url":null,"abstract":"Cluster Analysis methods are very important, popular data summarization techniques applied in diverse environments. These techniques retrieve the hidden patterns in large datasets in the form of characterized patterns which can be interpreted further in different contexts. Widespread use of medical information systems and explosive growth of medical databases require traditional manual data analysis coupled with efficient computer assisted analysis. Medical Diagnosis is a difficult process which needs proficiency as well as experience to cope with a disease. Data segmentation is an application in medical domain used to analyze patient records, disease trends and health care resource utilization, which in turn assist a physician in Medical Diagnosis. In the present paper a technique based on classification techniques is proposed to predict liver disorders accurately. The main objective is to examine whether the proposed method can obtain better prediction accuracy to traditional classification algorithms. The classification results using the proposed method are found to be very promising and accurate.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410553","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}
引用次数: 9
Capture global Kad lookup traffic 捕获全局Kad查找流量
Zhibo Liu, Qiang Li
Kad is the most popular P2P file sharing system. It is very difficult to capture all the users' lookup traffic because of its full distributed feature. Previous work could only monitors a subset of the lookup traffic. In this paper, we propose a lightweight method to monitor the global lookup traffic by inserting two ‘nearest neighbor’ peers into the peer at the last iteration of Kad lookup path. Since one of the inserted peer is closer than the last peer definitely, the user's search request would be redirected to the trap node. The experiment performed on eMule0.50a shows that this approach could capture most lookup traffic.
Kad是最流行的P2P文件共享系统。由于其完整的分布式特性,很难捕获所有用户的查找流量。以前的工作只能监视查找流量的一个子集。在本文中,我们提出了一种轻量级的方法,通过在Kad查找路径的最后一次迭代时向对等体中插入两个“最近邻”对等体来监控全局查找流量。由于插入的对等体中肯定有一个比最后一个更近,因此用户的搜索请求将被重定向到trap节点。在eMule0.50a上进行的实验表明,这种方法可以捕获大多数查找流量。
{"title":"Capture global Kad lookup traffic","authors":"Zhibo Liu, Qiang Li","doi":"10.1109/ICSESS.2016.7883199","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883199","url":null,"abstract":"Kad is the most popular P2P file sharing system. It is very difficult to capture all the users' lookup traffic because of its full distributed feature. Previous work could only monitors a subset of the lookup traffic. In this paper, we propose a lightweight method to monitor the global lookup traffic by inserting two ‘nearest neighbor’ peers into the peer at the last iteration of Kad lookup path. Since one of the inserted peer is closer than the last peer definitely, the user's search request would be redirected to the trap node. The experiment performed on eMule0.50a shows that this approach could capture most lookup traffic.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133229705","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
期刊
2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)
全部 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