Chi-Yuan Chen, Yu-Shan Liang, Chia-Mu Yu, Chih-Hsiang Ho, S. Kuo
{"title":"Increasing Reliability for IEEE 802.16j Mobile Multi-hop Relay Networks Planning","authors":"Chi-Yuan Chen, Yu-Shan Liang, Chia-Mu Yu, Chih-Hsiang Ho, S. Kuo","doi":"10.1109/PRDC.2009.51","DOIUrl":"https://doi.org/10.1109/PRDC.2009.51","url":null,"abstract":"IEEE 802.16 network is a new generation of broadband networks. Recently, relay stations in IEEE 802.16j are proposed to perform as lightweight base station solutions to extend coverage and/or increase throughput. However, the 802.16j networks are tree-based structure which suffers from the single point of failure problem. In this paper, we define the coverage problem to place the base stations (BSs) and relay stations (RSs) at the lowest cost to support desired utilities and constrained by reliability limit. We develop two heuristic algorithms to solve coverage problems. We decide the proposed algorithms whose performance is quite near to the optimal selection by implementing a number of randomly selected graphs.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116352618","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":"Why Do Software Projects Fail? Reasons and a Solution Using a Bayesian Classifier to Predict Potential Risk","authors":"T. Kikuno","doi":"10.1109/PRDC.2005.61","DOIUrl":"https://doi.org/10.1109/PRDC.2005.61","url":null,"abstract":"Summary form only given. The dependability of an information system critically relies on that of its software. Reportedly, however, 70% of software projects fail in various ways. Obviously the system developed by a failed project can be problematic in assuring dependability. Clarifying the reasons why software projects fail and taking preventive measures are therefore key to successful development of dependable information systems. We present the results of our attempt to address this important issue. In this research attempt: (1) we designed a questionnaire that can be used to collect necessary data from software engineers. (2) We developed an analysis method that can identify reasons for project failures from the results of the questionnaire. This method uses a Bayesian classifier as its basis. (3) We conducted a large-scale experiment using field data obtained from industry. The results suggest that our method is useful to predict the success or failure of a software development project.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134050587","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":"Dependable Computing in the Context of Mobility, Nomadicity, Ubiquity, and Pervasiveness","authors":"W. Fuchs","doi":"10.1109/PRDC.2005.29","DOIUrl":"https://doi.org/10.1109/PRDC.2005.29","url":null,"abstract":"Summary form only given. This paper examines four aspects of computing and communications that are widely accepted and commonly confused: mobility, nomadicity, ubiquity, and pervasiveness. These attributes of present and future digital devices provide significant opportunities for new markets and important challenges in design for dependability. The relationship between dependability and the public is presented. Alternative approaches to dependability appropriate for consumers are discussed. Particular digital devices considered include cell phones, PDAs, notebook computers, and RFID.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126981682","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":"Implications of Dependable Computing in Banking Industry","authors":"S. Pyo","doi":"10.1109/PRDC.2001.992693","DOIUrl":"https://doi.org/10.1109/PRDC.2001.992693","url":null,"abstract":"Summary form only given. Information systems (IS) play a crucial role in banking institutions' day-to-day business and the level of service customers expect from banking industry is becoming ever more demanding. Satisfying those demands is one of the most important critical success factors for sustaining competitive edge, especially in today's hard economic time. In this fiercely competitive world, a bank's major system failure could be fatal for its reputation and business itself. Quick and systematic recovery from the WTC (Wor1d Trade Center) disaster gives us valuable lessons for Korean banking institutions. The weaknesses of Korean banks in terms of \"Dependable Computing\" lie not in the area of adopting various state-of-the-art technologies but more in its culture. We need to step up our efforts especially on the areas such as contingency plan and disaster recovery. The author outlines: Business implications in terms of customer satisfaction; What can IS departments do to ensure dependable computing; What Korean banks are doing today? and Next steps for Korean banks.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655242","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}
Lunwei Wang, Lianyue He, Xiangke Liao, Huaimin Wang
{"title":"Research on Control Flags-based Weighted Authentication Trustworthiness Model","authors":"Lunwei Wang, Lianyue He, Xiangke Liao, Huaimin Wang","doi":"10.1109/PRDC.2005.54","DOIUrl":"https://doi.org/10.1109/PRDC.2005.54","url":null,"abstract":"In this paper, weighted factors are given to authentication rules to express their importance, and the control flags are given to multiple authentication rules to express their stack relationship and reflect their effect on the authentication conclusions. Based on the research on weighted model in fuzzy logic, this paper puts forwards the control flags-based weighted authentication trustworthiness model. The model firstly calculates the trustworthiness of a single weighted authentication rule, then, according to the control flags corresponding to each authentication rule, calculates the user's authentication trustworthiness under multiple authentication rules. By comparing user's authentication trustworthiness with system access trustworthiness threshold, the system forms the final authentication conclusion. The model describes the uncertainties in authentication system comprehensively, and enhances the security under multiple authentication rules.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121031675","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":"Privacy-Preserving Bayesian Network Structure Learning on Distributed Heterogeneous Data","authors":"Hongmei Wang, Zheng Zhao, Zhi-Wei Sun","doi":"10.1109/PRDC.2005.49","DOIUrl":"https://doi.org/10.1109/PRDC.2005.49","url":null,"abstract":"Privacy concerns often prevent different parties from sharing their data in order to carry out data mining applications on their joint data. Privacy-preserving data mining provides a solution by creating distributed data mining algorithm in which the underlying data is not revealed. In this paper, we address a particular data mining problem, learning the structure of Bayesian network on distributed heterogeneous data. In this setting, three or more parties owning confidential databases wish to learn the structure on the combination of their databases without revealing anything about their data to each other. We provide a private generalized scalar product share protocol for learning the empirical entropy. Then we give an effective and privacy-preserving version of the B&BMDL algorithm to construct the structure of a Bayesian network for the parties' joint data. In comparison to the previously known solution for this problem (Wright and Yang, 2004), which is based on K2 algorithm, our solution provides complete accuracy, full privacy, ideal universality, and better performance. In particular, our solution provides fully private, in that the only thing the parties learn about each other's inputs is the desired output and the number of stochastic variables' value, and more universal, in that the databases partitioned vertically are among three or more parties, and completely accurate, in that the structure computed are exactly what they would be if the data was centralized. In addition, our solution works for both binary and non-binary discrete data.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128180697","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 Novel Approach to Kernel Construction of China Bridge CA","authors":"J. Leng, DongQin Xie","doi":"10.1109/PRDC.2005.11","DOIUrl":"https://doi.org/10.1109/PRDC.2005.11","url":null,"abstract":"This paper gives a general overview of the PKI interoperability efforts sighting the different interoperability models being used. It also gives a detailed analysis of the bridge certification authority (BCA), the favoured model in interoperability efforts in China. This paper presents a model using B-level lightweight security kernel (BSK) in China BCA framework. The BSK model is used to highlight kernel security level of China BCA implementation. BSK introduces security object model based three classes of objects and message dispatch model. It also presents the BSK message dispatch algorithm targeted for TCSEC class B1 or above to enforce performance adopting a route cache policy over all subjects and objects it controls.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116636793","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 Architecture and Design Principles of COTS Components Based Generic Fault-Tolerant Computer","authors":"Zhonghong Ou, Youguang Yuan, Xiaoyong Zhao","doi":"10.1109/PRDC.2005.53","DOIUrl":"https://doi.org/10.1109/PRDC.2005.53","url":null,"abstract":"A novel fault-tolerant architecture based on COTS components is put forward and implemented in this paper. In order to make observable the internal states of COTS components, and in order to concurrently perform fault-tolerance function and normal function and control the behavior of each COTS component, the authors have devised an intelligent hardware module dedicated to fault-tolerance processing, which can significantly offload application processors. This architecture digs every inherent fault-detection mechanism and adopts layered fault protection mechanism to raise fault-tolerance coverage. This architecture is efficient, flexible, scalable and transparent with respect to fault-tolerance. It is Byzantine fault safe and also supports online repair. The authors also raise some design tradeoffs when designing COTS components based fault-tolerant computer.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115073336","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 BIST Solution for System-on-Chip","authors":"Ling Zhang, Jishun Kuang","doi":"10.1109/PRDC.2005.9","DOIUrl":"https://doi.org/10.1109/PRDC.2005.9","url":null,"abstract":"The paper presents a new solution to the test of core-based systems based on the low-power BIST scheme. Cores in the system are divided into several groups. Each group has a BIST scheme. The cores in the same group share the low-power BIST that consists of a LFSR and a mapping logic, and the cores are tested in sequence. The cores not in the same group are tested concurrently. The target of the solution is to minimize the test time under the power constraint. Simulative experimental results show that our solution saves a significant amount of test time under the power constraint, and the hardware overhead is not high.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462916","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 Reliable Routing Algorithm Based on Fuzzy Applicability of F sets in MANET","authors":"Rong Hu, Zhi-gang Hu, Hao Ma","doi":"10.1109/PRDC.2005.13","DOIUrl":"https://doi.org/10.1109/PRDC.2005.13","url":null,"abstract":"In mobile ad hoc networks, each host moves in an arbitrary manner and thus routes are subject to frequent disconnections. Furthermore, rebuilding routes operations consume lots of the network resources and the nodes energy. In this paper, a novel reliable routing algorithm using fuzzy applicability is proposed to increase the route reliability and reduce the number of broken routes during the routing selection. The algorithm uses fuzzy applicability to express the matching degree between each neighboring node. It produces a routing sprouting tree from source node to destination node utilizing the IRS (immediate reachable set) and RS (reachable set) of each node. Finally, by comparing the applicability of each route in the routing sprouting tree, the most proper route can be computed. The algorithm provides not only a select mechanism for searching the next routing node, but also a global reliability for the whole selected route. The simulation results show that the algorithm can reduce the number of broken routes efficiently when applying the proposed algorithm to the AODV (adhoc on demand distance vector) routing protocol.","PeriodicalId":123010,"journal":{"name":"Pacific Rim International Symposium on Dependable Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125741784","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}