Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207320
K. Tashiro, M. Matsumoto
Development documents of a railway signaling system based on ADS (Autonomous Decentralized System) [1] architecture has conformity with RAMS (Reliability, Availability, Maintainability and Safety) standard IEC 62278. A project to replace existing ATP (Automatic Train Protection) system in Tokyo metropolitan commuter lines with new one had been successfully carried out from 1996 to 2004 keeping continuity of service through the construction including extension of renewal sections. An examination on the documents of the project showed that ADS design concept realized suitable documentation architecture as well as reasonable procedure of allocation of safety-related functions and hardware devices both to meet with the requirements of documentation manners from the RAMS standard.
{"title":"Comparison of documents of an Automatic Train Protection system project with RAMS standard","authors":"K. Tashiro, M. Matsumoto","doi":"10.1109/ISADS.2009.5207320","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207320","url":null,"abstract":"Development documents of a railway signaling system based on ADS (Autonomous Decentralized System) [1] architecture has conformity with RAMS (Reliability, Availability, Maintainability and Safety) standard IEC 62278. A project to replace existing ATP (Automatic Train Protection) system in Tokyo metropolitan commuter lines with new one had been successfully carried out from 1996 to 2004 keeping continuity of service through the construction including extension of renewal sections. An examination on the documents of the project showed that ADS design concept realized suitable documentation architecture as well as reasonable procedure of allocation of safety-related functions and hardware devices both to meet with the requirements of documentation manners from the RAMS standard.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126440851","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-03-23DOI: 10.1109/ISADS.2009.5207324
T. Fragopoulos, J. Gialelis, D. Serpanos
As dynamicity in networks and interoperability in DRM systems become the critical aspects in networked ecosystems, new emerging frameworks for secure, user-converged digital content delivery are required. In this work, we argue that the IPMP and REL components of MPEG-21 framework should be utilized in order to achieve a user-adaptive and interoperable DRM architecture.
{"title":"Adaptive DRM framework in user-converged multimedia ecosystems, utilizing MPEG-21 semantics","authors":"T. Fragopoulos, J. Gialelis, D. Serpanos","doi":"10.1109/ISADS.2009.5207324","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207324","url":null,"abstract":"As dynamicity in networks and interoperability in DRM systems become the critical aspects in networked ecosystems, new emerging frameworks for secure, user-converged digital content delivery are required. In this work, we argue that the IPMP and REL components of MPEG-21 framework should be utilized in order to achieve a user-adaptive and interoperable DRM architecture.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131473213","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-03-23DOI: 10.1109/ISADS.2009.5207318
Vassilios Mavroeidis, S. Koubias, S. Goutsos
Aim of this research is to propose an accurate model of measuring business excellence by applying the theory of System Dynamics. This theory defines the interaction of system variables giving the opportunity of a reliable and fair score as well as objective decision-making with regard to the areas that are susceptible of continuous improvement. This paper utilises the principles of the System Dynamics in order to propose a new method for measuring business excellence and thus contributing to a thorough evaluation of an enterprise which implements a Business Excellence Model. The proposed business excellence system is adopted and applied as the Hellenic National Quality Award scheme. The study only adopts empirical data from the application of the proposed business excellence system due to the early stages of implementation in the market. Future research may use more data to better tune the proposed method. Based on the more accurate analytical results achieved by the proposed model, the Hellenic national authority of managing the Hellenic scheme of business excellence might use the proposed model for measuring business excellence and to drive continuous improvement and competitiveness according to its strategy.
{"title":"Application of System Dynamics theory in the evaluation of an integrated Business Excellence system","authors":"Vassilios Mavroeidis, S. Koubias, S. Goutsos","doi":"10.1109/ISADS.2009.5207318","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207318","url":null,"abstract":"Aim of this research is to propose an accurate model of measuring business excellence by applying the theory of System Dynamics. This theory defines the interaction of system variables giving the opportunity of a reliable and fair score as well as objective decision-making with regard to the areas that are susceptible of continuous improvement. This paper utilises the principles of the System Dynamics in order to propose a new method for measuring business excellence and thus contributing to a thorough evaluation of an enterprise which implements a Business Excellence Model. The proposed business excellence system is adopted and applied as the Hellenic National Quality Award scheme. The study only adopts empirical data from the application of the proposed business excellence system due to the early stages of implementation in the market. Future research may use more data to better tune the proposed method. Based on the more accurate analytical results achieved by the proposed model, the Hellenic national authority of managing the Hellenic scheme of business excellence might use the proposed model for measuring business excellence and to drive continuous improvement and competitiveness according to its strategy.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134471699","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-03-23DOI: 10.1109/ISADS.2009.5207327
Luis Carlos Coronado García, Carlos Hernández-López, C. P. Leguízamo
A Public Key Infrastructure (PKI) must provide the mechanisms for assuring secure transactions and high reliability of its services. The use of public key cryptography satisfies the first requirement[1], while the second has been traditionally satisfied by the use of distributed architectures, among these the Autonomous Decentralized Systems (ADS) [2] are specially interesting since can provide on line expandability, maintenance and fault tolerance; however, the implementation of a PKI based on ADS rise new challenges, among the most important are: how to assure the uniqueness of public keys in such system and, since ADS architectures usually rely on specialized hardware for their implementation, how to implement such architecture without that specialized hardware.This paper explores the use of an ADS architecture based on software in order to provide high reliability to a PKI, assuring the uniqueness of its public keys.
{"title":"A uniqueness verifying Public Key Infrastructure based on Autonomous Decentralized System architecture","authors":"Luis Carlos Coronado García, Carlos Hernández-López, C. P. Leguízamo","doi":"10.1109/ISADS.2009.5207327","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207327","url":null,"abstract":"A Public Key Infrastructure (PKI) must provide the mechanisms for assuring secure transactions and high reliability of its services. The use of public key cryptography satisfies the first requirement[1], while the second has been traditionally satisfied by the use of distributed architectures, among these the Autonomous Decentralized Systems (ADS) [2] are specially interesting since can provide on line expandability, maintenance and fault tolerance; however, the implementation of a PKI based on ADS rise new challenges, among the most important are: how to assure the uniqueness of public keys in such system and, since ADS architectures usually rely on specialized hardware for their implementation, how to implement such architecture without that specialized hardware.This paper explores the use of an ADS architecture based on software in order to provide high reliability to a PKI, assuring the uniqueness of its public keys.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122129386","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-03-23DOI: 10.1109/ISADS.2009.5207350
Xin Wu, Xia Yin, Zhiliang Wang, Min Tang
In order to better understand BGP dynamics, a time-based approach has been developed to cluster BGP updates into routing events. Its basic idea is to cluster consecutive BGP updates of the same prefix into one routing events if the updates are separated by a time interval less than a threshold. Most of static threshold methods might incorrectly group multiple events into one if the threshold is too high, or divide a single event into multiple ones if the threshold is too low. On the other hand, previous dynamic threshold approach did not present a persuasive way to calculate one of its key parameters. In this paper we present a three-step dynamic threshold method to cluster BGP updates into routing events. We evaluate our approach using updates of BGP beacon prefixes downloaded from Route Views. The experiment result shows that our dynamic threshold approach could cluster updates into routing events more precisely than previous methods, and thus improve the accuracy of the BGP measurement studies.
{"title":"A three-step dynamic threshold method to cluster BGP updates into routing events","authors":"Xin Wu, Xia Yin, Zhiliang Wang, Min Tang","doi":"10.1109/ISADS.2009.5207350","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207350","url":null,"abstract":"In order to better understand BGP dynamics, a time-based approach has been developed to cluster BGP updates into routing events. Its basic idea is to cluster consecutive BGP updates of the same prefix into one routing events if the updates are separated by a time interval less than a threshold. Most of static threshold methods might incorrectly group multiple events into one if the threshold is too high, or divide a single event into multiple ones if the threshold is too low. On the other hand, previous dynamic threshold approach did not present a persuasive way to calculate one of its key parameters. In this paper we present a three-step dynamic threshold method to cluster BGP updates into routing events. We evaluate our approach using updates of BGP beacon prefixes downloaded from Route Views. The experiment result shows that our dynamic threshold approach could cluster updates into routing events more precisely than previous methods, and thus improve the accuracy of the BGP measurement studies.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973410","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-03-23DOI: 10.1109/ISADS.2009.5207358
Vassilis Stoumpos, A. Delis
The predicates in a non-equi-join can be anything but equality relations. Non-equi-join predicates can be as simple as an inequality expression between two join relation fields, or as complex as a user-defined function that carries out arbitrary complex comparisons. The nature of non-equi-join calls for predicate evaluation over all possible combinations of tuples in a two-way join. In this paper, we consider the family of fragment and replicate join algorithms that facilitates non-equijoin evaluation and adapt it in a Smart Disk environment. We use Smart Disk as an umbrella term for a variety of different storage devices featuring an embedded processor that may offload data processing from the main CPU. Our approach partially replicates one of the join relations in order to harness all processing capacity in the system. However, partial replication introduces problems with synchronizing concurrent algorithmic steps, load balancing, and selection among different join evaluation alternatives.We use a processing model to avoid performance pitfalls and autonomously select algorithm parameters. Through experimentation we find our proposed algorithms to utilize all system resources and, thus, yield better performance.
{"title":"Fragment and replicate algorithms for non-equi-join evaluation on Smart Disks","authors":"Vassilis Stoumpos, A. Delis","doi":"10.1109/ISADS.2009.5207358","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207358","url":null,"abstract":"The predicates in a non-equi-join can be anything but equality relations. Non-equi-join predicates can be as simple as an inequality expression between two join relation fields, or as complex as a user-defined function that carries out arbitrary complex comparisons. The nature of non-equi-join calls for predicate evaluation over all possible combinations of tuples in a two-way join. In this paper, we consider the family of fragment and replicate join algorithms that facilitates non-equijoin evaluation and adapt it in a Smart Disk environment. We use Smart Disk as an umbrella term for a variety of different storage devices featuring an embedded processor that may offload data processing from the main CPU. Our approach partially replicates one of the join relations in order to harness all processing capacity in the system. However, partial replication introduces problems with synchronizing concurrent algorithmic steps, load balancing, and selection among different join evaluation alternatives.We use a processing model to avoid performance pitfalls and autonomously select algorithm parameters. Through experimentation we find our proposed algorithms to utilize all system resources and, thus, yield better performance.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817084","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-03-23DOI: 10.1109/ISADS.2009.5207331
Atsushi Ito, T. Ohta, S. Inoue
To keep safety is one of the most important duties of government. In 2007, Ministry of Internal Affairs and Communications of Japan tested 16 different models of security system for children on school route. One of the models was constructed and tested at an area of a school in Hiroshima City from September to December of 2007. A consortium was established by Hiroshima City, Hiroshima City University, Chugoku Electric Power Co., Inc, KDDI Corporation, etc. to conduct this project. For this model project, we developed new security system for children on school route by using mobile ad hoc network that is constructed based on mobile phone with Bluetooth function. About 700 students used this system for four months. In this paper, we present the outline of this system and the result of the trial. We also describe that this system has good performance and accuracy to keep safety of students on the way to school.
{"title":"Security system for children on school route","authors":"Atsushi Ito, T. Ohta, S. Inoue","doi":"10.1109/ISADS.2009.5207331","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207331","url":null,"abstract":"To keep safety is one of the most important duties of government. In 2007, Ministry of Internal Affairs and Communications of Japan tested 16 different models of security system for children on school route. One of the models was constructed and tested at an area of a school in Hiroshima City from September to December of 2007. A consortium was established by Hiroshima City, Hiroshima City University, Chugoku Electric Power Co., Inc, KDDI Corporation, etc. to conduct this project. For this model project, we developed new security system for children on school route by using mobile ad hoc network that is constructed based on mobile phone with Bluetooth function. About 700 students used this system for four months. In this paper, we present the outline of this system and the result of the trial. We also describe that this system has good performance and accuracy to keep safety of students on the way to school.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439499","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-03-23DOI: 10.1109/ISADS.2009.5207390
Hideharu Kojima, Y. Kakuda, Juichi Takahashi, T. Ohta
Recently, the embedded software, which is implemented in high definition TVs, recorders and cellar phones and so on, are complicated. There are several reasons. One of the reasons is that embedded software will be implemented with libraries for concurrent processing such as pthread in C language. Developers have to be aware that concurrent programming by using multithread, multi-process and so on. However, concurrent programming is harder than sequential programming. It is possible to cause defects such as race conditions, dead lock and so on. In this paper, we employ ACP (all concurrent paths) and CMFG (concurrent module flow graph) to execute white box testing for the source code of the concurrent software. The number of test cases of ACP becomes huge when the number of blocks increases. In this paper, we propose to suppress the number of test cases of ACP and measure the coverage of ACP by a tool.
{"title":"A model for concurrent states and its coverage criteria","authors":"Hideharu Kojima, Y. Kakuda, Juichi Takahashi, T. Ohta","doi":"10.1109/ISADS.2009.5207390","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207390","url":null,"abstract":"Recently, the embedded software, which is implemented in high definition TVs, recorders and cellar phones and so on, are complicated. There are several reasons. One of the reasons is that embedded software will be implemented with libraries for concurrent processing such as pthread in C language. Developers have to be aware that concurrent programming by using multithread, multi-process and so on. However, concurrent programming is harder than sequential programming. It is possible to cause defects such as race conditions, dead lock and so on. In this paper, we employ ACP (all concurrent paths) and CMFG (concurrent module flow graph) to execute white box testing for the source code of the concurrent software. The number of test cases of ACP becomes huge when the number of blocks increases. In this paper, we propose to suppress the number of test cases of ACP and measure the coverage of ACP by a tool.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216213","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-03-23DOI: 10.1109/ISADS.2009.5207380
J. Vardakas, M. Logothetis
We investigate the performance of the IEEE 802.11e in respect of end-to-end delay, which is estimated by the sum of queuing delay and MAC delay. The MAC delay analysis is performed based on elementary probability theory (conditional probabilities) while avoiding the complex Markov Chain method. A comprehensive study of the MAC delay is presented by providing higher moments of the MAC delay distribution. To this end, we use the Z-transform of the backoff duration. The first moment corresponds to the mean MAC delay, while the second moment corresponds to the Standard Deviation of the MAC delay; the latter depicts the jitter. We also estimate the probability mass function (pmf) of the MAC delay through the Lattice Poisson Algorithm. As far as the queuing delay is concerned, we provide the mean queuing delay by considering a queuing system with one queue per Access Category (AC) per mobile station, with a single server (the wireless medium), common to all mobile stations, and a Markov Modulated Poisson Process as input, that expresses the bursty nature of Internet traffic. The presented analytical model provides results of the mean end-to-end delay for both saturated and non-saturated channel conditions.
{"title":"End-to-end delay analysis of the IEEE 802.11e with MMPP input-traffic","authors":"J. Vardakas, M. Logothetis","doi":"10.1109/ISADS.2009.5207380","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207380","url":null,"abstract":"We investigate the performance of the IEEE 802.11e in respect of end-to-end delay, which is estimated by the sum of queuing delay and MAC delay. The MAC delay analysis is performed based on elementary probability theory (conditional probabilities) while avoiding the complex Markov Chain method. A comprehensive study of the MAC delay is presented by providing higher moments of the MAC delay distribution. To this end, we use the Z-transform of the backoff duration. The first moment corresponds to the mean MAC delay, while the second moment corresponds to the Standard Deviation of the MAC delay; the latter depicts the jitter. We also estimate the probability mass function (pmf) of the MAC delay through the Lattice Poisson Algorithm. As far as the queuing delay is concerned, we provide the mean queuing delay by considering a queuing system with one queue per Access Category (AC) per mobile station, with a single server (the wireless medium), common to all mobile stations, and a Markov Modulated Poisson Process as input, that expresses the bursty nature of Internet traffic. The presented analytical model provides results of the mean end-to-end delay for both saturated and non-saturated channel conditions.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132295015","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-03-23DOI: 10.1109/ISADS.2009.5207329
Keiji Kamijyo, H. Kawasaki, T. Arisawa, K. Bekki, H. Osumi, Daisuke Yagyu
Autonomous decentralized system (ADS) architecture has been used mainly to realize high assurance control system. However, ADS architecture proposed previously is too simple to apply large-scale complicated system. In this paper, we clarify that large-scale ADS is represented by hierarchical three layers structure and many ADS sub-systems are connected by gateways and agents using railway transport operation control system (ATOS) as an example. ATOS is a system which has been growing and changing continuously. We show that both gateway and agent are effective for system assurance in functional system expansion for large-scale ADS. ATOS: Autonomous Decentralized Transport Operation Control System
{"title":"An assurance method for functional system expansion of Tokyo metropolitan railway system","authors":"Keiji Kamijyo, H. Kawasaki, T. Arisawa, K. Bekki, H. Osumi, Daisuke Yagyu","doi":"10.1109/ISADS.2009.5207329","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207329","url":null,"abstract":"Autonomous decentralized system (ADS) architecture has been used mainly to realize high assurance control system. However, ADS architecture proposed previously is too simple to apply large-scale complicated system. In this paper, we clarify that large-scale ADS is represented by hierarchical three layers structure and many ADS sub-systems are connected by gateways and agents using railway transport operation control system (ATOS) as an example. ATOS is a system which has been growing and changing continuously. We show that both gateway and agent are effective for system assurance in functional system expansion for large-scale ADS. ATOS: Autonomous Decentralized Transport Operation Control System","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129068620","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
扫码关注我们
求助内容：
应助结果提醒方式：