Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficient. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Each node in a Waon network controls the number of objects assigned to the node for load balancing of objects. In addition, Waon uses a hop-based routing algorithm for load balancing of messages. Moreover, Waon can support range queries, and Waon can reduce the load on the physical network. In this paper, through simulation results, we report confirmation that Waon's load balancing is better than that of existing algorithms. In addition, a simulation result in this paper shows that Waon can reduce the load on the physical network.
{"title":"New Structured P2P Network with Dynamic Load Balancing Scheme","authors":"Atsushi Takeda, Takuma Oide, Akiko Takahashi","doi":"10.1109/WAINA.2011.120","DOIUrl":"https://doi.org/10.1109/WAINA.2011.120","url":null,"abstract":"Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficient. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Each node in a Waon network controls the number of objects assigned to the node for load balancing of objects. In addition, Waon uses a hop-based routing algorithm for load balancing of messages. Moreover, Waon can support range queries, and Waon can reduce the load on the physical network. In this paper, through simulation results, we report confirmation that Waon's load balancing is better than that of existing algorithms. In addition, a simulation result in this paper shows that Waon can reduce the load on the physical network.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125441882","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 give the basic concept of that, Stateful NMR, Stateful NMR attaches reliability evaluation to conventional NMR, where the result of majority voting is modified and corrected by the reliability assessment. However, Stateful TMR has weak point that two module state might change at the same time. Thus, we propose an improved version of Stateful NMR, Resettable Stateful NMR, which improves the fault tolerance by restoring reliability assessment. We evaluate MTTF, both Stateful NMR and Resettable Stateful NMR. The Resettable Stateful TMR obtains higher MTTF than the Stateful NMR.
{"title":"Evaluations of Resettable Stateful NMR","authors":"Katsuyoshi Matsumoto, M. Uehara, H. Mori","doi":"10.1109/WAINA.2011.18","DOIUrl":"https://doi.org/10.1109/WAINA.2011.18","url":null,"abstract":"We give the basic concept of that, Stateful NMR, Stateful NMR attaches reliability evaluation to conventional NMR, where the result of majority voting is modified and corrected by the reliability assessment. However, Stateful TMR has weak point that two module state might change at the same time. Thus, we propose an improved version of Stateful NMR, Resettable Stateful NMR, which improves the fault tolerance by restoring reliability assessment. We evaluate MTTF, both Stateful NMR and Resettable Stateful NMR. The Resettable Stateful TMR obtains higher MTTF than the Stateful NMR.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130214651","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 domain of distributed applications is developing rapidly. Facilities to support distributed applications have till now been designed on a case by case basis for each specialized user application. A systematic study and a generic facility framework for executing distributed applications are currently nonexistent and progress towards their development would have a significant impact in the seamless use of distributed applications. In line with these objectives, we have developed a component-based facility framework for distributed applications. The facility is defined as a high level conceptual facility which serves as an infrastructure providing services for distributed applications. The conceptual facility includes hardware and software (e.g. sensors, actuators and controllers) as sub-layers, which are dispersed physically. In this paper, we describe the framework, and examples are used to illustrate potential implementations of important concepts. The workflow of a distributed application is also provided. An implementation of a distributed application, with a partial version of the designed facility framework, for the water level control system of a nuclear power plant steam generator is used for evaluation of the concepts. Results convince us that the implementation as well as the facility is feasible. Application performance is shown to be affected by the time delay of data transmission and reasons for such delay are examined. A network quality test provides statistical estimates of data transmission delays due to the network. The results demonstrate that network quality is not a bottleneck for implementation for implementation of the component-based distributed application and support the hypothesis that a feasible implementation of such a conceptual facility framework is possible.
{"title":"A Facility Framework for Distributed Application","authors":"Q. Guo, C. Smidts","doi":"10.1109/WAINA.2011.146","DOIUrl":"https://doi.org/10.1109/WAINA.2011.146","url":null,"abstract":"The domain of distributed applications is developing rapidly. Facilities to support distributed applications have till now been designed on a case by case basis for each specialized user application. A systematic study and a generic facility framework for executing distributed applications are currently nonexistent and progress towards their development would have a significant impact in the seamless use of distributed applications. In line with these objectives, we have developed a component-based facility framework for distributed applications. The facility is defined as a high level conceptual facility which serves as an infrastructure providing services for distributed applications. The conceptual facility includes hardware and software (e.g. sensors, actuators and controllers) as sub-layers, which are dispersed physically. In this paper, we describe the framework, and examples are used to illustrate potential implementations of important concepts. The workflow of a distributed application is also provided. An implementation of a distributed application, with a partial version of the designed facility framework, for the water level control system of a nuclear power plant steam generator is used for evaluation of the concepts. Results convince us that the implementation as well as the facility is feasible. Application performance is shown to be affected by the time delay of data transmission and reasons for such delay are examined. A network quality test provides statistical estimates of data transmission delays due to the network. The results demonstrate that network quality is not a bottleneck for implementation for implementation of the component-based distributed application and support the hypothesis that a feasible implementation of such a conceptual facility framework is possible.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129647991","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 initial stage of gastrulation, an early stage of embryogenesis, is called invagination, or primitive streak formation. In the first part of the paper, we analyse by using image processing techniques the cell deformation and motion in he Drosophila melanogaster embryo searching to delimit the first period of invagination without proliferation. Then, in a second part, we propose a biomechanical model, based only on the consideration of elastic and contractile forces exerted on cell walls and on the centrosome through the combination of myosin contraction and cytoskeleton rigidity. Numerical simulations of this model made during the period of gastrulation without proliferation suggest that the model adequately simulates in-vivo cell behaviour, showing the start of the streak formation at the two extremities of the embryo cylinder, followed by a propagation of the invagination to its central part.
{"title":"Modelling and Image Processing of Constriction and Proliferation in the Gastrulation Process of Drosophila melanogaster","authors":"M. Tayyab, A. Lontos, E. Promayon, J. Demongeot","doi":"10.1109/WAINA.2011.152","DOIUrl":"https://doi.org/10.1109/WAINA.2011.152","url":null,"abstract":"The initial stage of gastrulation, an early stage of embryogenesis, is called invagination, or primitive streak formation. In the first part of the paper, we analyse by using image processing techniques the cell deformation and motion in he Drosophila melanogaster embryo searching to delimit the first period of invagination without proliferation. Then, in a second part, we propose a biomechanical model, based only on the consideration of elastic and contractile forces exerted on cell walls and on the centrosome through the combination of myosin contraction and cytoskeleton rigidity. Numerical simulations of this model made during the period of gastrulation without proliferation suggest that the model adequately simulates in-vivo cell behaviour, showing the start of the streak formation at the two extremities of the embryo cylinder, followed by a propagation of the invagination to its central part.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965627","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}
P. Sabbu, G. Umadevi, K. Srinathan, Bruhadeshwar Bezawada
We consider the novel problem of oblivious retrieval of images from an outsourced database server. Due to the complexity of managing images, in modern enterprise networks, individual users and organizations are using the services of external servers to store the images. The problem is to query and retrieve images while simultaneously satisfying the criteria of both the user and the database privacy. Oblivious transfer protocols are capable of ensuring the privacy of both the user and the server privacy at the same time. But in their native form, oblivious transfer protocols may not be suitable for querying and retrieving images due to the large size of the images. In this paper, we describe the first such attempt to develop an oblivious retrieval protocol that can achieve the goals of user and database privacy. which allows the user to query for the images of interest. In this phase, the database server does not know the exact user query and the user does not learn of any other images in the database. In the next phase, the user deploys an oblivious transfer protocol to retrieve the necessary decryption for the selected images without revealing the actual set of decryption keys selected. We have evaluated our protocol using an experimental setting and show that the results are a reasonable trade-off when compared to the security requirements being satisfied. We have implemented a working prototype and tested the protocol on a database of 9000 large real-life images.
{"title":"An Oblivious Image Retrieval Protocol","authors":"P. Sabbu, G. Umadevi, K. Srinathan, Bruhadeshwar Bezawada","doi":"10.1109/WAINA.2011.128","DOIUrl":"https://doi.org/10.1109/WAINA.2011.128","url":null,"abstract":"We consider the novel problem of oblivious retrieval of images from an outsourced database server. Due to the complexity of managing images, in modern enterprise networks, individual users and organizations are using the services of external servers to store the images. The problem is to query and retrieve images while simultaneously satisfying the criteria of both the user and the database privacy. Oblivious transfer protocols are capable of ensuring the privacy of both the user and the server privacy at the same time. But in their native form, oblivious transfer protocols may not be suitable for querying and retrieving images due to the large size of the images. In this paper, we describe the first such attempt to develop an oblivious retrieval protocol that can achieve the goals of user and database privacy. which allows the user to query for the images of interest. In this phase, the database server does not know the exact user query and the user does not learn of any other images in the database. In the next phase, the user deploys an oblivious transfer protocol to retrieve the necessary decryption for the selected images without revealing the actual set of decryption keys selected. We have evaluated our protocol using an experimental setting and show that the results are a reasonable trade-off when compared to the security requirements being satisfied. We have implemented a working prototype and tested the protocol on a database of 9000 large real-life images.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129026274","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}
Underwater Wireless Sensor Networks (UWSNs) are expected to support a variety of civilian and military applications. Sensed data can only be interpreted meaningfully when referenced to the location of the sensor, making localization an important problem. In terrestrial WSNs, this can be achieved through a series of message exchanges (via RF communications) between each sensor and Global Positioning System (GPS) receivers. However, this is infeasible in UWSNs as GPS signals do not propagate through water. Acoustic communications is currently the most viable mode of wireless communications underwater. However, underwater acoustic channels are characterized by harsh physical layer conditions with low bandwidth, high propagation delay and high bit error rate. Moreover, the variable speed of sound, due to variations in temperature, pressure and salinity, and the nonnegligible node mobility due to water currents pose a unique set of challenges for localization in UWSNs. In this paper, we present a multi-stage AUV-aided localization scheme for UWSNs. The proposed method combines the flexibility and localization accuracy of an AUV-aided localization, the energy efficiency of "silent localization" and improved localization coverage with k-stage localization based on sensor nodes. We evaluate the performance of the proposed scheme in terms of the localization coverage, accuracy and communication costs using simulations. We show that while improved performance with multiple stages is traded off with higher communication costs in general, the latter can be minimized while maintaining good performance with an appropriate choice of the acoustic communication range.
{"title":"Multi-stage AUV-aided Localization for Underwater Wireless Sensor Networks","authors":"M. Waldmeyer, H. Tan, Winston K.G. Seah","doi":"10.1109/WAINA.2011.90","DOIUrl":"https://doi.org/10.1109/WAINA.2011.90","url":null,"abstract":"Underwater Wireless Sensor Networks (UWSNs) are expected to support a variety of civilian and military applications. Sensed data can only be interpreted meaningfully when referenced to the location of the sensor, making localization an important problem. In terrestrial WSNs, this can be achieved through a series of message exchanges (via RF communications) between each sensor and Global Positioning System (GPS) receivers. However, this is infeasible in UWSNs as GPS signals do not propagate through water. Acoustic communications is currently the most viable mode of wireless communications underwater. However, underwater acoustic channels are characterized by harsh physical layer conditions with low bandwidth, high propagation delay and high bit error rate. Moreover, the variable speed of sound, due to variations in temperature, pressure and salinity, and the nonnegligible node mobility due to water currents pose a unique set of challenges for localization in UWSNs. In this paper, we present a multi-stage AUV-aided localization scheme for UWSNs. The proposed method combines the flexibility and localization accuracy of an AUV-aided localization, the energy efficiency of \"silent localization\" and improved localization coverage with k-stage localization based on sensor nodes. We evaluate the performance of the proposed scheme in terms of the localization coverage, accuracy and communication costs using simulations. We show that while improved performance with multiple stages is traded off with higher communication costs in general, the latter can be minimized while maintaining good performance with an appropriate choice of the acoustic communication range.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091784","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}
M. Erdmann, A. Finch, Kotaro Nakayama, E. Sumita, T. Hara, S. Nishio
Calculating the similarity of Wikipedia articles in different languages is helpful for bilingual dictionary construction and various other research areas. However, standard methods for document similarity calculation are usually very simple. Therefore, we describe an approach of translating one Wikipedia article into the language of the other article, and then calculating article similarity with standard machine translation evaluation metrics. An experiment revealed that our approach is effective for identifying Wikipedia articles in different languages that are covering the same concept.
{"title":"Calculating Wikipedia Article Similarity Using Machine Translation Evaluation Metrics","authors":"M. Erdmann, A. Finch, Kotaro Nakayama, E. Sumita, T. Hara, S. Nishio","doi":"10.1109/WAINA.2011.132","DOIUrl":"https://doi.org/10.1109/WAINA.2011.132","url":null,"abstract":"Calculating the similarity of Wikipedia articles in different languages is helpful for bilingual dictionary construction and various other research areas. However, standard methods for document similarity calculation are usually very simple. Therefore, we describe an approach of translating one Wikipedia article into the language of the other article, and then calculating article similarity with standard machine translation evaluation metrics. An experiment revealed that our approach is effective for identifying Wikipedia articles in different languages that are covering the same concept.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121538704","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}
M. Mohandes, M. A. Haleem, A. Abul-Hussain, K. Balakrishnan
This paper describes a prototype of a wireless sensor network developed for tracking pilgrims in the Holy areas during Hajj (Pilgrimage). A delay tolerant network principle is used. Energy efficiency, robustness, and reliability are the key factors for the developed system. Every pilgrim will be given a mobile sensor unit that includes a GPS unit, a Microcontroller, antennas and a battery. A network of fixed master units is installed in the Holy area. Upon request or periodically, the sensor unit sends its UID number, latitude, longitude, and time. The close by master unit receives this information and passes it to a server that maps the latitude and longitude information on a Google map or any geographical information system. The developed system can be used to track specific pilgrims. Alternatively any pilgrim can request emergency help using the same system. The location of the person needing help will be identified on the map to make it easy for the help to reach in the most efficient way. The developed system works in coordination with an RFID identification system that was proposed earlier. The developed system was tested successfully during the recent pilgrim season.
{"title":"Pilgrims Tracking Using Wireless Sensor Network","authors":"M. Mohandes, M. A. Haleem, A. Abul-Hussain, K. Balakrishnan","doi":"10.1109/WAINA.2011.123","DOIUrl":"https://doi.org/10.1109/WAINA.2011.123","url":null,"abstract":"This paper describes a prototype of a wireless sensor network developed for tracking pilgrims in the Holy areas during Hajj (Pilgrimage). A delay tolerant network principle is used. Energy efficiency, robustness, and reliability are the key factors for the developed system. Every pilgrim will be given a mobile sensor unit that includes a GPS unit, a Microcontroller, antennas and a battery. A network of fixed master units is installed in the Holy area. Upon request or periodically, the sensor unit sends its UID number, latitude, longitude, and time. The close by master unit receives this information and passes it to a server that maps the latitude and longitude information on a Google map or any geographical information system. The developed system can be used to track specific pilgrims. Alternatively any pilgrim can request emergency help using the same system. The location of the person needing help will be identified on the map to make it easy for the help to reach in the most efficient way. The developed system works in coordination with an RFID identification system that was proposed earlier. The developed system was tested successfully during the recent pilgrim season.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121523532","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 present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.
{"title":"Network Failure Recovery with Tie-Sets","authors":"K. Kadena, K. Nakayama, N. Shinomiya","doi":"10.1109/WAINA.2011.125","DOIUrl":"https://doi.org/10.1109/WAINA.2011.125","url":null,"abstract":"The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114510424","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}
Soft errors on hardware could affect the reliability of computer system. To estimate system reliability, it is important to know the effects of soft errors to system reliability. This paper explores the effects of soft errors to computer system reliability. We propose a new approach to measure system reliability for soft error factor. In our approach, hardware components reliability is concerned first. Then, system reliability which shows the ability to perform required function is concerned. We equal system reliability to software reliability based on the mechanism that soft errors affect system reliability. We build a software reliability model under soft errors condition. In our software model, we analyze the state of software combining with the state of hardware. For program errors which are resulted from soft errors, we give an analysis of error mask. These real errors which could lead to software failure are distinguished. Finally, our experiments illustrate our analyses and validate our approach.
{"title":"Effects of Soft Error to System Reliability","authors":"Lei Xiong, QingPing Tan, Jianjun Xu","doi":"10.1109/WAINA.2011.108","DOIUrl":"https://doi.org/10.1109/WAINA.2011.108","url":null,"abstract":"Soft errors on hardware could affect the reliability of computer system. To estimate system reliability, it is important to know the effects of soft errors to system reliability. This paper explores the effects of soft errors to computer system reliability. We propose a new approach to measure system reliability for soft error factor. In our approach, hardware components reliability is concerned first. Then, system reliability which shows the ability to perform required function is concerned. We equal system reliability to software reliability based on the mechanism that soft errors affect system reliability. We build a software reliability model under soft errors condition. In our software model, we analyze the state of software combining with the state of hardware. For program errors which are resulted from soft errors, we give an analysis of error mask. These real errors which could lead to software failure are distinguished. Finally, our experiments illustrate our analyses and validate our approach.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895256","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
扫码关注我们
求助内容：
应助结果提醒方式：