Chong Shen, W. Du, Yonghui Zhang, Shipu Zheng, Yong Bai
This paper presents an XML based policy framework to approach flow distribution issues for multihoming and Mobile Internet Protocol Version 6 (MIPv6) enabled Heterogeneous Wireless Networks (HWN). In such a heterogeneous environment, flow distribution policies are first defined depending on mobility decisions, service agreements and user & provider interactions. Each traffic session is coupled with an identifiable binding identification (BID) while heterogeneous interfaces are regulated by policy engines. In application layer, the protocol/algorithm agnostic Extensible Markup Language (XML) signalling is used to develop a policy management framework. The ultimate goal of the framework is to improve the Quality of Service (QoS), Quality of Experience (QoE), HWN transparency and ubiquitous connectivity.
{"title":"Multihomed HWN Policy Framework Signalling Delivery","authors":"Chong Shen, W. Du, Yonghui Zhang, Shipu Zheng, Yong Bai","doi":"10.1109/ICIS.2011.16","DOIUrl":"https://doi.org/10.1109/ICIS.2011.16","url":null,"abstract":"This paper presents an XML based policy framework to approach flow distribution issues for multihoming and Mobile Internet Protocol Version 6 (MIPv6) enabled Heterogeneous Wireless Networks (HWN). In such a heterogeneous environment, flow distribution policies are first defined depending on mobility decisions, service agreements and user & provider interactions. Each traffic session is coupled with an identifiable binding identification (BID) while heterogeneous interfaces are regulated by policy engines. In application layer, the protocol/algorithm agnostic Extensible Markup Language (XML) signalling is used to develop a policy management framework. The ultimate goal of the framework is to improve the Quality of Service (QoS), Quality of Experience (QoE), HWN transparency and ubiquitous connectivity.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132713802","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 similarity measure for image pairs plays a predominant role in image registration. Generally, mutual information (MI) or normalized mutual information (NMI), been defined by the density functions, is often adopted as the similarity measure in image registration. In this paper, based on the proposed survival entropy (SE), a new similarity measure, refer to as the cross survival entropy (CSE), is introduced by using the cumulative distributions. As a new and more generalized form of similarity measure, comparing with MI and cross-cumulative residual entropy (CCRE), we elucidate some excellent properties of CSE. Numerous contrastive implements have shown that CSE achieves more robustness and more accuracy in image registration, which confirm the validity of SE and CSE.
{"title":"Cross Survival Entropy and Its Application in Image Registration","authors":"Shiwei Yu, Xiaoyun Liu, Wufan Chen","doi":"10.1109/ICIS.2011.35","DOIUrl":"https://doi.org/10.1109/ICIS.2011.35","url":null,"abstract":"The similarity measure for image pairs plays a predominant role in image registration. Generally, mutual information (MI) or normalized mutual information (NMI), been defined by the density functions, is often adopted as the similarity measure in image registration. In this paper, based on the proposed survival entropy (SE), a new similarity measure, refer to as the cross survival entropy (CSE), is introduced by using the cumulative distributions. As a new and more generalized form of similarity measure, comparing with MI and cross-cumulative residual entropy (CCRE), we elucidate some excellent properties of CSE. Numerous contrastive implements have shown that CSE achieves more robustness and more accuracy in image registration, which confirm the validity of SE and CSE.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"50 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114318014","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}
We are at the beginning of the multicore era. When combined with Hyper-Threading Technology, multicore can provide powerful optimization opportunities, increasing system throughput substantially. Inspired by this modern technology, we propose a multi-threaded algorithm, called MT FASTFDS, for mining functional dependencies which harnesses multicore system. Through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.
{"title":"Functional Dependency Mining: Harnessing Multicore Systems","authors":"G. Gasmi, Amira Béji, Y. Slimani, L. Lakhal","doi":"10.1109/ICIS.2011.29","DOIUrl":"https://doi.org/10.1109/ICIS.2011.29","url":null,"abstract":"We are at the beginning of the multicore era. When combined with Hyper-Threading Technology, multicore can provide powerful optimization opportunities, increasing system throughput substantially. Inspired by this modern technology, we propose a multi-threaded algorithm, called MT FASTFDS, for mining functional dependencies which harnesses multicore system. Through a detailed experimental study, we show that our parallel algorithm scales very well with the number of cores available.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114611895","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}
Lei Yan, Sherong Zhang, Wenqi Sa, Bo Sun, Chao Wang
As the two most important technology in three-dimensional design, CAD and CAE are widely applied in hydropower industry, and they play a tremendous role in the development of hydropower industry. Compared with other industries, the present application of both is independent of each other, which would cause the waste and inconsistency of the design resources and information, and seriously affect the efficiency of whole design process. In order to solve this problem, the architecture of CAD/CAE Integrated System is designed, and the "Bridge" Platform is introduced into between CAD and CAE platform to achieve the seamless transfer of data and the transformation from CAD to CAE model. Using the integrated method of database technology and high-level development language, the CAD/CAE integration system of hydropower industry is developed, then used to guide three-dimensional design of a gravity dam pivotal project, and is proved to be effective and practical.
{"title":"Application of CAD/CAE Integrating Technology for the Three-Dimensional Design of Hydropower Industry","authors":"Lei Yan, Sherong Zhang, Wenqi Sa, Bo Sun, Chao Wang","doi":"10.1109/ICIS.2011.56","DOIUrl":"https://doi.org/10.1109/ICIS.2011.56","url":null,"abstract":"As the two most important technology in three-dimensional design, CAD and CAE are widely applied in hydropower industry, and they play a tremendous role in the development of hydropower industry. Compared with other industries, the present application of both is independent of each other, which would cause the waste and inconsistency of the design resources and information, and seriously affect the efficiency of whole design process. In order to solve this problem, the architecture of CAD/CAE Integrated System is designed, and the \"Bridge\" Platform is introduced into between CAD and CAE platform to achieve the seamless transfer of data and the transformation from CAD to CAE model. Using the integrated method of database technology and high-level development language, the CAD/CAE integration system of hydropower industry is developed, then used to guide three-dimensional design of a gravity dam pivotal project, and is proved to be effective and practical.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124739929","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 rapid development of mobile computing and cloud computing trigger novel computing paradigm-----Mobile Cloud Computing. This paper review current research effort towards Mobile Computing. First, we present several challenges for the design of Mobile Cloud Computing service. Second, a concept model has been proposed to analyze related research work. Third, we survey recent Mobile Cloud Computing architecture, application partition & offloading, and context-aware service.
{"title":"A Survey of Research on Mobile Cloud Computing","authors":"Guan Le, Ke Xu, Meina Song, Junde Song","doi":"10.1109/ICIS.2011.67","DOIUrl":"https://doi.org/10.1109/ICIS.2011.67","url":null,"abstract":"The rapid development of mobile computing and cloud computing trigger novel computing paradigm-----Mobile Cloud Computing. This paper review current research effort towards Mobile Computing. First, we present several challenges for the design of Mobile Cloud Computing service. Second, a concept model has been proposed to analyze related research work. Third, we survey recent Mobile Cloud Computing architecture, application partition & offloading, and context-aware service.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123354285","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}
Inspiration form biological immune mechanism, this article gives the formal definition of computer virus in the gene model. Based on immune genetic algorithm, a evolution model of computer virus is proposed, and also the evolution operators which include selection operator, crossover operator, mutation operator and immune operator are established. The simulation experiments were conducted and it indicates that computer viruses and biological viruses have the same natural features, it also has a self-replicating, self-construction and self-evolution of biological characteristics. The evolution model of computer virus can provides research thinking for anti-virus technology to improve and enhance, especially on detecting and preventing unknown viruses or mutations of known virus.
{"title":"Research of the Computer Virus Evolution Model Based on Immune Genetic Algorithm","authors":"Lihua Wu, Yu Zhang","doi":"10.1109/ICIS.2011.72","DOIUrl":"https://doi.org/10.1109/ICIS.2011.72","url":null,"abstract":"Inspiration form biological immune mechanism, this article gives the formal definition of computer virus in the gene model. Based on immune genetic algorithm, a evolution model of computer virus is proposed, and also the evolution operators which include selection operator, crossover operator, mutation operator and immune operator are established. The simulation experiments were conducted and it indicates that computer viruses and biological viruses have the same natural features, it also has a self-replicating, self-construction and self-evolution of biological characteristics. The evolution model of computer virus can provides research thinking for anti-virus technology to improve and enhance, especially on detecting and preventing unknown viruses or mutations of known virus.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126040561","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 this paper, we propose a novel method for detecting and visualizing profile correlation in subspace. The proposed method is able to (1) detect shifting-and-scaling correlated profiles in subspace, where the correlation can be either positive or negative, (2) summarize and visualize the shifting-and-scaling correlation in subspace, and (3) allow users to explore interested correlation subspace interactively. Initially, shifting and scaling were regarded as two different correlation patterns, in which profiles in subspace can overlap by a single shifting and scaling respectively. In later work, a much more generous correlation, shifting-and-scaling correlation, was studied, compared to which, shifting correlation and scaling correlation are just two special cases. Shifting-and-scaling correlation ensures subspace profile coherence not only in tendency as those tendency-based methods do, but also in value change proportion in subspace. However, no work has been focused on visualization of subspace shifting-and-scaling correlation yet. Our work is the first one to enable interactive exploration and visualization of subspace shifting-and-scaling correlation.
{"title":"Detecting and Visualizing Profile Correlation in Subspace","authors":"Xin Xu, Wen Wang, Xin Chen","doi":"10.1109/ICIS.2011.24","DOIUrl":"https://doi.org/10.1109/ICIS.2011.24","url":null,"abstract":"In this paper, we propose a novel method for detecting and visualizing profile correlation in subspace. The proposed method is able to (1) detect shifting-and-scaling correlated profiles in subspace, where the correlation can be either positive or negative, (2) summarize and visualize the shifting-and-scaling correlation in subspace, and (3) allow users to explore interested correlation subspace interactively. Initially, shifting and scaling were regarded as two different correlation patterns, in which profiles in subspace can overlap by a single shifting and scaling respectively. In later work, a much more generous correlation, shifting-and-scaling correlation, was studied, compared to which, shifting correlation and scaling correlation are just two special cases. Shifting-and-scaling correlation ensures subspace profile coherence not only in tendency as those tendency-based methods do, but also in value change proportion in subspace. However, no work has been focused on visualization of subspace shifting-and-scaling correlation yet. Our work is the first one to enable interactive exploration and visualization of subspace shifting-and-scaling correlation.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128166789","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}
Pub Date : 2011-05-16DOI: 10.1109/icis.2011.6129463
Romain Cavagna, M. Abdallah
It is well-known that networked multi resolution contents are designed and optimized to be exchanged between a provider and one or more requesters while allowing the best possible reproduction quality to all requesters. According to participants' terminal computing resources, push or pull modes can be used to distribute the reproduction load (i.e., server scalability versus light weight clients). In the same way, peer-to-peer techniques are available to distribute the transmission load. By focusing on these two ideas, this paper raises the following question: unless it is admitted that peer-to-peer architectures allow to increase the scalability and the responsiveness of the services they support, is there a best tradeoff between multi resolution content reproduction quality and multi resolution content distribution efficiency? In other worlds, can we accurately take into account the distribution strategy at multi resolution content generation levels? The present paper does not provide an answer, but aims at achieving a first step in this direction by proposing a new dedicated C++ GPL v3 tool that serves as a NVE distributed emulation platform. This tool includes a modular multi resolution 3D histogram that can be distributed on top of centralized or peer-to-peer network architectures.
{"title":"Finding the best tradeoff between multi resolution content reproduction quality and multi resolution content distribution efficiency","authors":"Romain Cavagna, M. Abdallah","doi":"10.1109/icis.2011.6129463","DOIUrl":"https://doi.org/10.1109/icis.2011.6129463","url":null,"abstract":"It is well-known that networked multi resolution contents are designed and optimized to be exchanged between a provider and one or more requesters while allowing the best possible reproduction quality to all requesters. According to participants' terminal computing resources, push or pull modes can be used to distribute the reproduction load (i.e., server scalability versus light weight clients). In the same way, peer-to-peer techniques are available to distribute the transmission load. By focusing on these two ideas, this paper raises the following question: unless it is admitted that peer-to-peer architectures allow to increase the scalability and the responsiveness of the services they support, is there a best tradeoff between multi resolution content reproduction quality and multi resolution content distribution efficiency? In other worlds, can we accurately take into account the distribution strategy at multi resolution content generation levels? The present paper does not provide an answer, but aims at achieving a first step in this direction by proposing a new dedicated C++ GPL v3 tool that serves as a NVE distributed emulation platform. This tool includes a modular multi resolution 3D histogram that can be distributed on top of centralized or peer-to-peer network architectures.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128519263","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 this paper, an implementation of Low-Density Parity-Check (LDPC) encoder is introduced, which meets the demand of Chinese Digital Terrestrial Multimedia Broadcasting (DTMB) standard. A design of the LDPC encoder which uses a partially-parallel encoding structure based on the Shift Register Adder Accumulator (SRAA) circuit is studied according to the irregular quasi-cyclic characteristic of LDPC encoding specified by the standard. Then we use the FPGA to implement the design. The simulation and implementation results show that the design meets the requirement of DTMB standard and reduces the resource usage.
{"title":"Implementation of LDPC Encoding to DTMB Standard Based on FPGA","authors":"Xiang Ouyang, Changcheng Ruan, L. Zheng","doi":"10.1109/ICIS.2011.44","DOIUrl":"https://doi.org/10.1109/ICIS.2011.44","url":null,"abstract":"In this paper, an implementation of Low-Density Parity-Check (LDPC) encoder is introduced, which meets the demand of Chinese Digital Terrestrial Multimedia Broadcasting (DTMB) standard. A design of the LDPC encoder which uses a partially-parallel encoding structure based on the Shift Register Adder Accumulator (SRAA) circuit is studied according to the irregular quasi-cyclic characteristic of LDPC encoding specified by the standard. Then we use the FPGA to implement the design. The simulation and implementation results show that the design meets the requirement of DTMB standard and reduces the resource usage.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133403902","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 this paper, we propose a test generation method that combines compositional reasoning theory and counterexample guided abstraction refinement framework. Firstly, the abstract model of system is produced by composing abstract components, then the abstract test cases can be generated by model checking based on abstract model, finally, the concrete test case of the complete original system is generated by refining the abstract model. The abstraction refinement keeps the state space small enough to alleviate the state space explosion problem.
{"title":"Test Generation by Using Component Composition Abstraction Refinement","authors":"Ying Chen, Y. Tian, Hong-wei Zeng","doi":"10.1109/ICIS.2011.55","DOIUrl":"https://doi.org/10.1109/ICIS.2011.55","url":null,"abstract":"In this paper, we propose a test generation method that combines compositional reasoning theory and counterexample guided abstraction refinement framework. Firstly, the abstract model of system is produced by composing abstract components, then the abstract test cases can be generated by model checking based on abstract model, finally, the concrete test case of the complete original system is generated by refining the abstract model. The abstraction refinement keeps the state space small enough to alleviate the state space explosion problem.","PeriodicalId":256762,"journal":{"name":"2011 10th IEEE/ACIS International Conference on Computer and Information Science","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132825861","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
扫码关注我们
求助内容：
应助结果提醒方式：