{"title":"Sink-oriented data dissemination mechanism in mobile Wireless Sensor Networks","authors":"Li Yue, Dongliang Xie, Jiatong Zhao","doi":"10.1109/ICSESS.2013.6615364","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615364","url":null,"abstract":"WSN (Wireless Sensor Network) is becoming more and more important in environmental monitoring where sinks are usually roaming. To handle the challenges result from sink mobility, many grid-based routing protocols are proposed such as TTDD. However, the idea that exploits the source nodes for grid building may cause high energy consumption and data delivery delay, especially in the emergency respond scenarios with multiple-mobile sinks. So we put forward a sink-oriented data dissemination mechanism to overcome those problems. We prove that our proposal can save much more energy and have lower first delay through theoretical analysis and network simulations.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129616975","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}
{"title":"A new adaptive transmission mode selection algorithm in hybrid media stream deliver network","authors":"Zhang Xingming, Ke Lin, Z. Shijian","doi":"10.1109/ICSESS.2013.6615428","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615428","url":null,"abstract":"Because of the problems of the existing transmission mode for streaming media system that could not guarantee the reception quality of the data while keeping the high distribution efficiency, a new adaptive transmission mode selection algorithm is proposed in this paper. In the algorithm, with a new node state model which divides the node state into data receive quality and consolidated state, the client node selects the transmission mode adaptively based on the existing data buffer model, while the server nodes choose the super nodes to push the data to. The simulation results show that this algorithm enhances the distribution efficiency, while the system scalability is improved under the control of the server load.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789857","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}
{"title":"A fault tolerant K-means algorithm based on storage-class memory","authors":"G. Lu, Xu Li, Kai Lu","doi":"10.1109/ICSESS.2013.6615471","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615471","url":null,"abstract":"Checkpointing is a pervasive method to provide fault-tolerance in high performance computing systems. However, with the rapid growth of system scale, more frequent checkpointing are needed, thus making the overhead brought by checkpointing intolerable. In this paper we present a checkpoint-free fault tolerance method. It takes advantage of non-volatile property of storage-class memory (SCM) to store execution-relevant data. Our method introduces negligible overhead to the algorithm when failures strikes and substantially reduces the recovery overhead. We add fault-tolerant capacity to K-means clustering algorithm using our method. Experimental results indicate that our approach introduces much less overhead than checkpointing does.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130759315","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}
Kaifang Wan, Xiao-guang Gao, Xuequan Liu, Sijie Cui
{"title":"A Cloud Cooperative Attack System for networking anti-stealth combat","authors":"Kaifang Wan, Xiao-guang Gao, Xuequan Liu, Sijie Cui","doi":"10.1109/ICSESS.2013.6615362","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615362","url":null,"abstract":"To meet the requirements of anti-stealth combat, this paper provides an overview of cloud computing technologies and discusses the superiority of its military application. A new concept of tactical cloud is proposed and based on which we put forward a Cloud Cooperative Attack System (CCAS) scheme for networking anti-stealth combat which can help promote the cooperating effectiveness significantly. To anatomize the system, the principle is described and the capabilities are indicated, and after that we design the composition expressly and provide a description of the system functions. A sample use case reveals the work process and verifies capacity of anti-stealth antagonizing of CCAS, and at last we point out some issues of CCAS and discuss how they can affect the performance of the system. The research here provides a reference to the developing of the new generation fire control system which brings it a wide prospect for further engineering application.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128523748","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}
{"title":"A requirement evolution system for medical service composition","authors":"Bin Mu, Peiqiong Wang, Shijin Yuan","doi":"10.1109/ICSESS.2013.6615317","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615317","url":null,"abstract":"We propose a system to address the requirement change management in medical composed service (MCS). A MCS is collaboration between autonomous web services to provide a value-added service for its patients in medical area. The purpose of this research is to implement a requirement evolution system for medical service composition to support engineers to add, remove and manage medical services change issue. Firstly, the users can view the current medical composed service and detailed information of the service. Secondly, the users can import the change file or operate the graphic interface directly to manage the services, such as add a service from the available service list, and remove a service from the current composed service. The system works well to react to the requirement changes. It generates a BPEL file after the requirement evolution, thus indicating the effectiveness of the system.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117094552","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}
{"title":"The model-based service fault diagnosis with probability analysis","authors":"Zhichun Jia, Rong Chen, Xing Xing","doi":"10.1109/ICSESS.2013.6615417","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615417","url":null,"abstract":"With the development of web service, it's important to localize the fault activity and explain the faulty reason. In this paper, we propose a model-based diagnosis method of web service fault. In our method, we firstly built service model using Petri nets, then rank the diagnosed activities by computing the faulty probability of all activities, finally use the defined diagnosis rules to find out the faulty activity in the given diagnosis sequence. Our method not only improves the diagnostic accuracy, but also raises the diagnostic efficiency. Our experimental results show our method is effective and outperforms the existing model-based method.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122466472","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}
{"title":"Fault detection method based on file naming algorithm for ocean observing network","authors":"Zhanbin Li, Hui Qu, Yanning Hua, Ke Liu, Liang Zhou, Peng Chen","doi":"10.1109/ICSESS.2013.6615457","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615457","url":null,"abstract":"Ocean observing network is foundational facility for marine disaster prevention. Base on the file naming algorithm of ocean observing data, a fault detection method for ocean observing network is proposed in this paper. By analyzing file naming and storing rules of ocean observing data, the file naming algorithm is designed. Further, the data receiving exception can be detected and located to the data source node by executing file naming algorithm. Last, combining with network circuit detecting result, the fault type can be distinguished and the faulty object can be located precisely. For illustration, a fault detection example with minutely data files is utilized to show the effect. Empirical results show that the fault detection method based on file naming algorithm can locate the faulty object in 10 minutes, and can provide operation protecting for ocean observing network.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121858060","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}
{"title":"Logic process merging for conservative parallel simulation of logic circuits","authors":"Lingfeng Wang, Yangdong Deng","doi":"10.1109/ICSESS.2013.6615484","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615484","url":null,"abstract":"Parallel simulation of digital logic circuits is a classic problem of parallel computing by featuring irregular, fine-grained parallelism. In the context of simulating digital IC design, the granularity of Logic Process (LP), which is the basic unit of parallel execution, is generally too small when compared to the scheduling and synchronization overhead of multi-core processors. In addition, the irregular communication pattern among different LPs makes it difficult to predict and optimize the inter-processor communication traffic. We propose a LP merging algorithm to address the above problems. The proposed algorithm coarsens the internal structure of input circuits to minimize communication and other overhead. At the same time, our algorithm preserves the inherent concurrency of the simulation. We elaborate the unique set of constraint for LP merging and the corresponding solutions. Experiments on real-world IP cores show that our LP merging algorithm results in a 20% reduction in the number of communication channels, the overall performance is boosted by 30% and the concurrency is maintained at a sufficient level.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123011757","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}
{"title":"Self-adaptive clustering data stream algorithm based on SSMC-tree","authors":"Kehua Yang, Heqing Gao, Lin Chen, Qiong Yuan","doi":"10.1109/ICSESS.2013.6615320","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615320","url":null,"abstract":"Due to the data stream is real-time, fast, unlimited, one-pass, clustering data stream requires algorithms which are capable to process the data stream in the limited time and memory. In this paper, we propose a clustering algorithm based on the improved similarity search tree (SSMC-Tree), and introduce buffer, hitchhike processing and local aggregation strategy, it can adapt to different speed data stream. We adopt an outlier processing mechanism by introducing potential core-micro-cluster buffer and outlier micro-cluster buffer to process noise in the data stream. Experimental results show that our algorithm can adapt to the high-speed data stream with noise.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126586541","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}
{"title":"Research on methods to identify the opinion leaders in internet community","authors":"Long Ziyi, Cheng Jing, Sun Donghong, H. Yongfeng","doi":"10.1109/ICSESS.2013.6615459","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615459","url":null,"abstract":"With the rapid development of WEB2.0, Internet forums have become an information exchanged platform where netizens can freely express their opinions. In Internet consensus environment, it is very important to appropriately control and lead the consensus and the opinion leaders play critical roles in Internet community. This paper, by combining the characteristics of Internet forums, established a PageRank Model to identify the opinion leaders based on the influence of linguistic contents and the sentiment tendentiousness. The PageRank Model adopts the product of the influences of the contents and sentiments (i.e., integrated influence) as the weighted value of two ID numbers and achieves the PR value via the PageRank calculation, thereby identifying the opinion leader of the forum. Tests have verified that the original PageRank vector of the Inlink has its advantages, compared with other methods, the ID of the opinion leader's articles identified by the PageRank Model can cover 80% of the forum IDs, which is in compliance with the 2-8 law. Therefore the algorithms based on the PageRank Model can identify effectively the opinion leaders in Internet community.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828237","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}