Pub Date : 2009-09-22DOI: 10.1109/GRC.2009.5255090
Hancheng Liao
Software estimation is an important prerequisite for project development management. In this paper, after concisely introducing the basic software development life cycle theory and analyzing the responsibilities for all kinds of software developers, what basic essences estimator should have are proposed and positions of estimation engineers in a typical matrix organization structure for are located. In addition, the relationships between estimator and another software developer are discussed, and then designate measuring points in the classical software development model. Finally, a summary of estimation in software development processes is presented.
{"title":"Research on software development estimation","authors":"Hancheng Liao","doi":"10.1109/GRC.2009.5255090","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255090","url":null,"abstract":"Software estimation is an important prerequisite for project development management. In this paper, after concisely introducing the basic software development life cycle theory and analyzing the responsibilities for all kinds of software developers, what basic essences estimator should have are proposed and positions of estimation engineers in a typical matrix organization structure for are located. In addition, the relationships between estimator and another software developer are discussed, and then designate measuring points in the classical software development model. Finally, a summary of estimation in software development processes is presented.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131006525","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255088
Renbing Lin, Jiyi Wang
This paper is devoted to the discussion of the relationship between intuitionistic fuzzy rough set models and intuitionistic fuzzy topologies on a finite universe. The IFT Condition for intuitionistic fuzzy topology is proposed. It is proved that the set of all lower approximation sets based on a reflexive and transitive intuitionsitic fuzzy relation consists of a intuitionistic fuzzy topology which satisfies IFT Condition.
{"title":"On the topological properties of intuitionistic fuzzy rough sets","authors":"Renbing Lin, Jiyi Wang","doi":"10.1109/GRC.2009.5255088","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255088","url":null,"abstract":"This paper is devoted to the discussion of the relationship between intuitionistic fuzzy rough set models and intuitionistic fuzzy topologies on a finite universe. The IFT Condition for intuitionistic fuzzy topology is proposed. It is proved that the set of all lower approximation sets based on a reflexive and transitive intuitionsitic fuzzy relation consists of a intuitionistic fuzzy topology which satisfies IFT Condition.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"279 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133417372","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255109
Y. Kudo, T. Murai, S. Miyamoto
We propose a concept of explicit and implicit influences of structural characteristics among classes to treat characteristics about how to combine objects in the object-oriented rough set model proposed by the authors. The object-oriented rough set model treats semi-structured data in the framework of rough sets by using structural hierarchies among objects, and semi-structured decision rules represent structural characteristics among objects, which enable us to capture what to combine objects. However, it is generally difficult to capture characteristics about how to combine objects by semi-structured decision rules. Thus, in this paper, we consider estimating structural characteristics about how to combine objects in the object-oriented rough set model.
{"title":"On an extraction method of structural characteristics in object-oriented rough set models","authors":"Y. Kudo, T. Murai, S. Miyamoto","doi":"10.1109/GRC.2009.5255109","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255109","url":null,"abstract":"We propose a concept of explicit and implicit influences of structural characteristics among classes to treat characteristics about how to combine objects in the object-oriented rough set model proposed by the authors. The object-oriented rough set model treats semi-structured data in the framework of rough sets by using structural hierarchies among objects, and semi-structured decision rules represent structural characteristics among objects, which enable us to capture what to combine objects. However, it is generally difficult to capture characteristics about how to combine objects by semi-structured decision rules. Thus, in this paper, we consider estimating structural characteristics about how to combine objects in the object-oriented rough set model.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"63 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133140786","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255117
S. Tsui
With the emergence of high-throughput genome sequencers from various companies including Applied Biosystems, Illumina and Roche, the conventional approach of genomic investigation has been revolutionized and new applications involving these sequencers have been designed and adopted not only in genome centres, but also in general laboratories working on biological and biomedical research. These genome sequencers are capable of generating terabytes of raw data daily, posing a big challenge to various aspects of bioinformatics and computational biology, e.g. data quality assurance, data storage, cross platform data analysis standards, data comparison, data annotation and gene network analysis. The problem will become more prominent when this technology is applicable in areas such as clinical diagnosis and personalized medicine. In foreseeable future, we believe bioinformatics will be one of the major bottlenecks of the further development of biological sciences. In this talk, we present some of the genome projects in the Centre for Microbial Genomics of Proteomics of the Chinese University of Hong Kong as examples to unravel the difficulties we come across in the area of bioinformatics. Then, based on our understanding of the recent development in computational biology, possible solutions will be discussed and explored. We believe this talk can provide useful insights and future research directions for audiences who are interested in bioinformatics and computation biology.
{"title":"High-throughput DNA sequencing and bioinformatics: Bottlenecks and opportunities","authors":"S. Tsui","doi":"10.1109/GRC.2009.5255117","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255117","url":null,"abstract":"With the emergence of high-throughput genome sequencers from various companies including Applied Biosystems, Illumina and Roche, the conventional approach of genomic investigation has been revolutionized and new applications involving these sequencers have been designed and adopted not only in genome centres, but also in general laboratories working on biological and biomedical research. These genome sequencers are capable of generating terabytes of raw data daily, posing a big challenge to various aspects of bioinformatics and computational biology, e.g. data quality assurance, data storage, cross platform data analysis standards, data comparison, data annotation and gene network analysis. The problem will become more prominent when this technology is applicable in areas such as clinical diagnosis and personalized medicine. In foreseeable future, we believe bioinformatics will be one of the major bottlenecks of the further development of biological sciences. In this talk, we present some of the genome projects in the Centre for Microbial Genomics of Proteomics of the Chinese University of Hong Kong as examples to unravel the difficulties we come across in the area of bioinformatics. Then, based on our understanding of the recent development in computational biology, possible solutions will be discussed and explored. We believe this talk can provide useful insights and future research directions for audiences who are interested in bioinformatics and computation biology.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800614","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255010
R. Zheng, Mingchuan Zhang, Qingtao Wu, Guanfeng Li, Wangyang Wei
Under the intrusion or abnormal attack, how to autonomously supply undegraded service to users is the ultimate goal of network securiy technology. Firstly, combined with martingale difference principle, a Service Self Optimization Algorithm based on Autonomic Computing-S2OAC is proposed. Secondly, according to the prior self optimizing knowledge and parameter information of inner environment, S2OAC searches the convergence trend of self optimizing function and executes the dynamic self optimization, aiming at minimum the optimization mode rate and maximum the service performance. Thirdly, set of the best optimization mode is updated and prediction model is renewed, which will implement the static self optimization and improve the accuricy of self optimization prediction. At last, the simulation results validate the efficiency and superiority of S2OAC.
{"title":"A Service Self-Optimization Algorithm based on Autonomic Computing","authors":"R. Zheng, Mingchuan Zhang, Qingtao Wu, Guanfeng Li, Wangyang Wei","doi":"10.1109/GRC.2009.5255010","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255010","url":null,"abstract":"Under the intrusion or abnormal attack, how to autonomously supply undegraded service to users is the ultimate goal of network securiy technology. Firstly, combined with martingale difference principle, a Service Self Optimization Algorithm based on Autonomic Computing-S2OAC is proposed. Secondly, according to the prior self optimizing knowledge and parameter information of inner environment, S2OAC searches the convergence trend of self optimizing function and executes the dynamic self optimization, aiming at minimum the optimization mode rate and maximum the service performance. Thirdly, set of the best optimization mode is updated and prediction model is renewed, which will implement the static self optimization and improve the accuricy of self optimization prediction. At last, the simulation results validate the efficiency and superiority of S2OAC.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128413407","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255102
Wanyi Li, Xiaorong Chen, S. Fan
An efficient, very simple and new approach for real time detection of R-wave is described in this paper, which integrates histogram method and difference method with low time complexity, at the same time, the method has quite good result even when ECGs are tilted due to respiration and in the presence of power line oscillation. Experiments illustrate that this method is so robust and efficient that it had applied to Digital Temporary Pacemaker developed by our team successfully.
{"title":"A histogram and difference based approach for R wave real time detection","authors":"Wanyi Li, Xiaorong Chen, S. Fan","doi":"10.1109/GRC.2009.5255102","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255102","url":null,"abstract":"An efficient, very simple and new approach for real time detection of R-wave is described in this paper, which integrates histogram method and difference method with low time complexity, at the same time, the method has quite good result even when ECGs are tilted due to respiration and in the presence of power line oscillation. Experiments illustrate that this method is so robust and efficient that it had applied to Digital Temporary Pacemaker developed by our team successfully.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679851","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255025
Kun-Ming Yu, Chun-Yuan Lin, Huiyuan Wang, C. Tang, Jiayi Zhou
Drug design is the approach of finding drugs by design using computational tools. When designing a new drug, the structure of the drug molecule can be modeled by classification of potential chemical compounds. Kernel Methods have been successfully used in classifying potential chemical compounds. Frequency of labeled paths has been proposed to map compounds into feature in order to classify the characteristics of target compounds. In this study, we proposed an algorithm based on Kernel method via parallel computing technology to reduce computation time. This less constrain of timing allows us to aim at back tracking a full scheme of all of the possible pre-images, regardless of their difference in molecular structure, only if they shared with the same feature vector. Our method is modified on BB-CIPF and used MPI to reduce the computation time. The experimental results show that our algorithms can reduce the computation time effectively for chemical compound inference problem.
{"title":"Parallel branch-and-bound approach with MPI technology in inferring chemical compounds with path frequency","authors":"Kun-Ming Yu, Chun-Yuan Lin, Huiyuan Wang, C. Tang, Jiayi Zhou","doi":"10.1109/GRC.2009.5255025","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255025","url":null,"abstract":"Drug design is the approach of finding drugs by design using computational tools. When designing a new drug, the structure of the drug molecule can be modeled by classification of potential chemical compounds. Kernel Methods have been successfully used in classifying potential chemical compounds. Frequency of labeled paths has been proposed to map compounds into feature in order to classify the characteristics of target compounds. In this study, we proposed an algorithm based on Kernel method via parallel computing technology to reduce computation time. This less constrain of timing allows us to aim at back tracking a full scheme of all of the possible pre-images, regardless of their difference in molecular structure, only if they shared with the same feature vector. Our method is modified on BB-CIPF and used MPI to reduce the computation time. The experimental results show that our algorithms can reduce the computation time effectively for chemical compound inference problem.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132388971","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255000
Zhuo Wang, Ran Hu, Jianfeng Xu
In this paper, we introduce an M-Commerce security architecture; discuss how the communication takes place between user, mobile station (MS) and access point (AP). We use an new authenticated mechanism between user and MS. And we add Access Point in wireless net in order to avoid being attack and eavesdropping message. We analyze the characters of the architecture with the Summary of Mobile E-commerce Communications Issues. The architecture meets the security need of data transmitting over wireless net. It certifies the feasibility of model that satisfies the security criterion of Mobile E-commerce Communication.
{"title":"Mobile E-commerce security architecture","authors":"Zhuo Wang, Ran Hu, Jianfeng Xu","doi":"10.1109/GRC.2009.5255000","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255000","url":null,"abstract":"In this paper, we introduce an M-Commerce security architecture; discuss how the communication takes place between user, mobile station (MS) and access point (AP). We use an new authenticated mechanism between user and MS. And we add Access Point in wireless net in order to avoid being attack and eavesdropping message. We analyze the characters of the architecture with the Summary of Mobile E-commerce Communications Issues. The architecture meets the security need of data transmitting over wireless net. It certifies the feasibility of model that satisfies the security criterion of Mobile E-commerce Communication.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122120863","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255089
K. W. Lin, Yu-Chin Luo
Fast discovery of frequent patterns is the most extensively discussed problem in data mining fields due to its wide applications. As the size of database increases, the computation time and the required memory increase severely. The difficulty of mining large database launched the research of designing parallel and distributed algorithms to solve the problem. Most of the past studies tried to parallelize the computation by dividing the database and distribute the divided database to other nodes for mining. This approach might leak data out and evidently is not suitable to be applied to sensitive domains like health-care. In this paper, we propose a novel data mining algorithm named FD-Mine that is able to efficiently utilize the nodes to discover frequent patterns in cloud computing environments with data privacy preserved. Through empirical evaluations on various simulation conditions, the proposed FD-Mine delivers excellent performance in terms of scalability and execution time.
{"title":"A fast parallel algorithm for discovering frequent patterns","authors":"K. W. Lin, Yu-Chin Luo","doi":"10.1109/GRC.2009.5255089","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255089","url":null,"abstract":"Fast discovery of frequent patterns is the most extensively discussed problem in data mining fields due to its wide applications. As the size of database increases, the computation time and the required memory increase severely. The difficulty of mining large database launched the research of designing parallel and distributed algorithms to solve the problem. Most of the past studies tried to parallelize the computation by dividing the database and distribute the divided database to other nodes for mining. This approach might leak data out and evidently is not suitable to be applied to sensitive domains like health-care. In this paper, we propose a novel data mining algorithm named FD-Mine that is able to efficiently utilize the nodes to discover frequent patterns in cloud computing environments with data privacy preserved. Through empirical evaluations on various simulation conditions, the proposed FD-Mine delivers excellent performance in terms of scalability and execution time.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123445156","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 : 2009-09-22DOI: 10.1109/GRC.2009.5255085
X. Long, Jing Zhou
Image preprocessing and corner detection are of importance in 3-dimension measurement based on computer technology. A novel image preprocessing method by combining the deconvolution based on Fourier transform with the white Gaussian denosing method based on finite Ridgelet transform is proposed, and a corner detector is given according to the cornerness of the preprocessed image. The simulation and comparison are made between the suggested method and the classic methods, which shows the suggested method can get a good standard performance image and robust corner detection.
{"title":"Research of image preprocessing and corner detection in 3D measurement based on Ridgelet transform","authors":"X. Long, Jing Zhou","doi":"10.1109/GRC.2009.5255085","DOIUrl":"https://doi.org/10.1109/GRC.2009.5255085","url":null,"abstract":"Image preprocessing and corner detection are of importance in 3-dimension measurement based on computer technology. A novel image preprocessing method by combining the deconvolution based on Fourier transform with the white Gaussian denosing method based on finite Ridgelet transform is proposed, and a corner detector is given according to the cornerness of the preprocessed image. The simulation and comparison are made between the suggested method and the classic methods, which shows the suggested method can get a good standard performance image and robust corner detection.","PeriodicalId":388774,"journal":{"name":"2009 IEEE International Conference on Granular Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151437","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
扫码关注我们
求助内容：
应助结果提醒方式：