This paper describes the use of new generation of PLC's and WinCC software in creating collaborative systems for managing, controlling and supervising building electric equipment. These systems assure all the requirements of a building and offer to the operators and maintenance technicians a more user friendly interface, accessible from distance and from many places. The communication between PLC's and WinCC software is made using Industrial Ethernet making the monitoring and control more flexible.
{"title":"Collaborative Systems for Building Automation","authors":"I. Sita","doi":"10.1109/iNCoS.2012.98","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.98","url":null,"abstract":"This paper describes the use of new generation of PLC's and WinCC software in creating collaborative systems for managing, controlling and supervising building electric equipment. These systems assure all the requirements of a building and offer to the operators and maintenance technicians a more user friendly interface, accessible from distance and from many places. The communication between PLC's and WinCC software is made using Industrial Ethernet making the monitoring and control more flexible.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902474","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}
Yuri Takahashi, C. Takano, Yusuke Sakumoto, M. Aida
The TCP global synchronization problem is a phenomenon that packet losses or window control actions of different flows are synchronized. It causes degradation of the utilization of network bandwidth. RED is a well known approach to avoid this problem. However, discard of packets occurs in some probability even if they are in low-rate flow, and it might be unfair. In this paper, we propose new transmission rate control by using chaotic nature appearing in coupled oscillators. Our control can avoid the synchronization problem despite no use of random numbers and improve the network utilization.
{"title":"Transmission Rate Control Utilizing Chaotic Nature of Coupled Oscillators","authors":"Yuri Takahashi, C. Takano, Yusuke Sakumoto, M. Aida","doi":"10.1109/iNCoS.2012.69","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.69","url":null,"abstract":"The TCP global synchronization problem is a phenomenon that packet losses or window control actions of different flows are synchronized. It causes degradation of the utilization of network bandwidth. RED is a well known approach to avoid this problem. However, discard of packets occurs in some probability even if they are in low-rate flow, and it might be unfair. In this paper, we propose new transmission rate control by using chaotic nature appearing in coupled oscillators. Our control can avoid the synchronization problem despite no use of random numbers and improve the network utilization.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133064412","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 : 2012-09-19DOI: 10.1504/IJES.2013.057087
Yan-cheng Ji, Guoan Zhang, Xiaoge Zhang, Xun Huang
To improve the resource utilization of traditional two-way wireless relay system, an optimal power allocation (OPA) algorithm for a space-time cooperative network coding scheme employing amplify-and-forward protocol (AF-ST-CNC) is proposed. The system performance in terms of outage probability and its approximation in high signal-to-noise (SNR) regimes are first derived, and by minimizing the larger outage probability of the two sources with respect to the characteristic of network coding, optimal power factors are obtained for some special cases are presented. The proposed algorithm only needs the average channel gain information and has low computation complexity, which facilitates the practical implementation. Simulation results show that the proposed AF-ST-CNC with OPA algorithm outperforms the AF-ST-CNC with equal power allocation (EPA) algorithm and the space-time cooperative network coding scheme employing amplify-and-forward protocol (DF-ST-CNC) with OPA algorithm in terms of outage performance.
{"title":"Outage-Optimal Power Allocation for Space-Time Cooperative Network Coding with Amplify-and-Forward","authors":"Yan-cheng Ji, Guoan Zhang, Xiaoge Zhang, Xun Huang","doi":"10.1504/IJES.2013.057087","DOIUrl":"https://doi.org/10.1504/IJES.2013.057087","url":null,"abstract":"To improve the resource utilization of traditional two-way wireless relay system, an optimal power allocation (OPA) algorithm for a space-time cooperative network coding scheme employing amplify-and-forward protocol (AF-ST-CNC) is proposed. The system performance in terms of outage probability and its approximation in high signal-to-noise (SNR) regimes are first derived, and by minimizing the larger outage probability of the two sources with respect to the characteristic of network coding, optimal power factors are obtained for some special cases are presented. The proposed algorithm only needs the average channel gain information and has low computation complexity, which facilitates the practical implementation. Simulation results show that the proposed AF-ST-CNC with OPA algorithm outperforms the AF-ST-CNC with equal power allocation (EPA) algorithm and the space-time cooperative network coding scheme employing amplify-and-forward protocol (DF-ST-CNC) with OPA algorithm in terms of outage performance.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129312377","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}
Software as a Service (SaaS) provides a useful and convenient way for cloud users to enjoy cloud service, but security problems have caused great influence on the development and popularization of SaaS. As a commercial model, SaaS involves different roles of participants who could be dishonest and malicious. This paper presents a security protocol to address several security issues in SaaS and protect the rights and interests of all participants. Our design is based on identity-based proxy signatures from pairings. The analysis shows that the presented protocol can effectively strengthen the security of SaaS in cloud computing.
软件即服务(Software as a Service, SaaS)为云用户享受云服务提供了一种实用便捷的方式，但安全问题对SaaS的发展和普及造成了很大影响。作为一种商业模型，SaaS涉及到不同角色的参与者，他们可能是不诚实的和恶意的。本文提出了一种安全协议，以解决SaaS中的几个安全问题，保护所有参与者的权益。我们的设计基于来自对的基于身份的代理签名。分析表明，该协议可以有效地增强云计算环境下SaaS的安全性。
{"title":"Identity-Based Proxy Signature for Cloud Service in SaaS","authors":"Xi Cao, Li Xu, Yuexin Zhang, Wei Wu","doi":"10.1109/iNCoS.2012.37","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.37","url":null,"abstract":"Software as a Service (SaaS) provides a useful and convenient way for cloud users to enjoy cloud service, but security problems have caused great influence on the development and popularization of SaaS. As a commercial model, SaaS involves different roles of participants who could be dishonest and malicious. This paper presents a security protocol to address several security issues in SaaS and protect the rights and interests of all participants. Our design is based on identity-based proxy signatures from pairings. The analysis shows that the presented protocol can effectively strengthen the security of SaaS in cloud computing.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125705736","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 message deliveries based on the store-carry-forward routing schemes, such as Epidemic Routing(ER), are one of useful methods for communication under challenged environments. However, these methods commonly have their own limitations in reach ability of messages to destinations and scalability. For example, as the distance to the destination increases, the delivery delay of a message between source and destination nodes generally becomes longer and even the reach ability decreases. To overcome these problems, the Virtual Segment(VS) method was proposed, which combines the ER method and a wired/wireless high-speed network connecting all base nodes(BN) located on the area. This can improve the reach ability and solve the scalability problem. In this paper, we evaluate the effectiveness of the VS method by simulation with the use of actual road network topology after the Great East Japan Earthquake in 2011. The results show that the VS method achieve higher successfully delivered probability and shorter delivery delay than the ER method, even if the traffic volume is much smaller than an usual one. It follows that the VS method is effective not only qualitatively but also quantitatively even in a challenged network environment such as in a disaster.
{"title":"Performance Evaluation of Virtual Segment Method Based on Actual Road Network Topology at the Time of the Great East Japan Earthquake","authors":"Y. Kimura, H. Tsuji, H. Miwa","doi":"10.1109/iNCoS.2012.97","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.97","url":null,"abstract":"The message deliveries based on the store-carry-forward routing schemes, such as Epidemic Routing(ER), are one of useful methods for communication under challenged environments. However, these methods commonly have their own limitations in reach ability of messages to destinations and scalability. For example, as the distance to the destination increases, the delivery delay of a message between source and destination nodes generally becomes longer and even the reach ability decreases. To overcome these problems, the Virtual Segment(VS) method was proposed, which combines the ER method and a wired/wireless high-speed network connecting all base nodes(BN) located on the area. This can improve the reach ability and solve the scalability problem. In this paper, we evaluate the effectiveness of the VS method by simulation with the use of actual road network topology after the Great East Japan Earthquake in 2011. The results show that the VS method achieve higher successfully delivered probability and shorter delivery delay than the ER method, even if the traffic volume is much smaller than an usual one. It follows that the VS method is effective not only qualitatively but also quantitatively even in a challenged network environment such as in a disaster.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124767502","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}
Network coding is a promising technique to improve the throughput performance of wireless networks. In this paper, we propose a novel network-coding-based hybrid retransmission request protocol for two-way relaying system. The proposed protocol can retransmit more information in a given time interval by introducing network coding in the retransmission process, thus improving the throughput. Furthermore, we derive the frame error rate and delay performance using the L-ary pulse amplitude modulation by solving Markov state transition equations. Applying these results, the closed-form approximate solution of the throughput is acquired. Numerical results have validated our analytical results, and demonstrated that the proposed protocol outperforms the traditional hybrid retransmission request protocol for two-way relaying system by a throughput gain of about 9% when the relay lies close to the midpoint of the two users.
{"title":"Network-Coding-Based Hybrid-ARQ for Two-Way Relaying","authors":"Xiaoye Shi, J. Ge, Yan-cheng Ji, Chuiqiang Sun","doi":"10.1109/iNCoS.2012.11","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.11","url":null,"abstract":"Network coding is a promising technique to improve the throughput performance of wireless networks. In this paper, we propose a novel network-coding-based hybrid retransmission request protocol for two-way relaying system. The proposed protocol can retransmit more information in a given time interval by introducing network coding in the retransmission process, thus improving the throughput. Furthermore, we derive the frame error rate and delay performance using the L-ary pulse amplitude modulation by solving Markov state transition equations. Applying these results, the closed-form approximate solution of the throughput is acquired. Numerical results have validated our analytical results, and demonstrated that the proposed protocol outperforms the traditional hybrid retransmission request protocol for two-way relaying system by a throughput gain of about 9% when the relay lies close to the midpoint of the two users.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125658158","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}
Florin Pop, M. Lovin, Catalin Negru, V. Cristea, N. Bessis, Stelios Sotiriadis
Monitoring large scale distributed systems such as Grids environments represents a means for obtaining a quantitative and qualitative measurement of performance by collecting information relevant to environment and applications running on the Grid. This paper proposes a solution for Grid monitoring on Grid Gain middleware platform using both indirect information gathered inside the platform and an addition tool based on Mona LISA and Ap Mon. A useful feature would be to allow the monitoring system to present the operator with suggestions computed based on the history of monitored parameters for jobs with a longer execution time or based on some theoretical, model based assumptions that relate existing configuration to the values of some performance parameters.
{"title":"Grid Configuration and Application Monitoring in GridGain","authors":"Florin Pop, M. Lovin, Catalin Negru, V. Cristea, N. Bessis, Stelios Sotiriadis","doi":"10.1109/iNCoS.2012.82","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.82","url":null,"abstract":"Monitoring large scale distributed systems such as Grids environments represents a means for obtaining a quantitative and qualitative measurement of performance by collecting information relevant to environment and applications running on the Grid. This paper proposes a solution for Grid monitoring on Grid Gain middleware platform using both indirect information gathered inside the platform and an addition tool based on Mona LISA and Ap Mon. A useful feature would be to allow the monitoring system to present the operator with suggestions computed based on the history of monitored parameters for jobs with a longer execution time or based on some theoretical, model based assumptions that relate existing configuration to the values of some performance parameters.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127112462","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}
Actually, any company needs to collaborate with others to improve their performance and productivity. Ontologies can provide a way to promote collaboration between companies. They contribute on reducing the syntax and semantic conflicts that may occur during the collaboration process. Data warehouse technology is a serious candidate for data-sharing architecture that may be employed within the collaborating companies. The spectacular adoption of domain ontologies by several communities facilitates the explosion of semantic databases sources (SDB) that become candidate for building the semantic data warehouses (SDW). This situation motivates us to deeply formalize the structure of semantic sources in order to propose an automatic construction of a semantic data warehouse SDW. In this paper, we first proposed a generic framework for handling semantic sources. Secondly, the generic ETL steps are incorporated to our framework. Our proposal is validated through a case study, considering Oracle SDB, where each source references a global ontology of the Lehigh University Bench Mark.
实际上，任何公司都需要与他人合作来提高他们的绩效和生产力。本体可以提供一种促进公司之间协作的方法。它们有助于减少协作过程中可能发生的语法和语义冲突。数据仓库技术是可以在合作公司中使用的数据共享体系结构的重要候选。一些社区对领域本体的广泛采用促进了语义数据库源(SDB)的爆炸式增长，这些数据源成为构建语义数据仓库(SDW)的候选对象。这种情况促使我们深入形式化语义源的结构，以提出语义数据仓库SDW的自动构建。在本文中，我们首先提出了一个处理语义源的通用框架。其次，将通用ETL步骤合并到我们的框架中。我们的建议通过一个案例研究得到了验证，考虑到Oracle SDB，其中每个源都引用了Lehigh University Bench Mark的全局本体。
{"title":"Generic Methodology for Semantic Data Warehouse Design: From Schema Definition to ETL","authors":"Nabila Berkani, Selma Khouri, Ladjel Bellatreche","doi":"10.1109/iNCoS.2012.108","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.108","url":null,"abstract":"Actually, any company needs to collaborate with others to improve their performance and productivity. Ontologies can provide a way to promote collaboration between companies. They contribute on reducing the syntax and semantic conflicts that may occur during the collaboration process. Data warehouse technology is a serious candidate for data-sharing architecture that may be employed within the collaborating companies. The spectacular adoption of domain ontologies by several communities facilitates the explosion of semantic databases sources (SDB) that become candidate for building the semantic data warehouses (SDW). This situation motivates us to deeply formalize the structure of semantic sources in order to propose an automatic construction of a semantic data warehouse SDW. In this paper, we first proposed a generic framework for handling semantic sources. Secondly, the generic ETL steps are incorporated to our framework. Our proposal is validated through a case study, considering Oracle SDB, where each source references a global ontology of the Lehigh University Bench Mark.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126200211","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 : 2012-09-19DOI: 10.1504/IJES.2013.057085
Chungang Yang, Min Sheng, Jiandong Li, Hongyan Li, Jing Li
We investigate the energy-aware joint power and rate control in the overlay cognitive radio networks, and we expect to achieve the optimal performance tradeoff between individual fairness and network energy efficiency. Therefore, a quality of energy efficiency-based Nash bargaining cooperative game (QoE2-NBCG) is formulated with the aid of the newly-built 'energy-per-bit' individual utility function design in this paper. Mathematically, a multi-constrained optimization problem is formulated with Nash product function as the optimization object, which is consisted of the novel individual QoE2 utility function design. To reduce the implementation complexity, we utilize decomposition technique to decouple this multi-constrained problem. In addition, the existence and uniqueness of the socially optimal NB solutions are validated via theorems.
{"title":"Energy-Aware Joint Power and Rate Control in Overlay Cognitive Radio Networks: A Nash Bargaining Perspective","authors":"Chungang Yang, Min Sheng, Jiandong Li, Hongyan Li, Jing Li","doi":"10.1504/IJES.2013.057085","DOIUrl":"https://doi.org/10.1504/IJES.2013.057085","url":null,"abstract":"We investigate the energy-aware joint power and rate control in the overlay cognitive radio networks, and we expect to achieve the optimal performance tradeoff between individual fairness and network energy efficiency. Therefore, a quality of energy efficiency-based Nash bargaining cooperative game (QoE2-NBCG) is formulated with the aid of the newly-built 'energy-per-bit' individual utility function design in this paper. Mathematically, a multi-constrained optimization problem is formulated with Nash product function as the optimization object, which is consisted of the novel individual QoE2 utility function design. To reduce the implementation complexity, we utilize decomposition technique to decouple this multi-constrained problem. In addition, the existence and uniqueness of the socially optimal NB solutions are validated via theorems.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121176643","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}
With the rapid growth of data, it is desirable to outsource data on remote storage server. The emergency of cloud computing makes the dream true and more and more sensitive data are being centralized into cloud for sharing. Since the public cloud server cannot be fully trusted in protecting them, encryption is a promising way to keep confidentiality but leads to high communication and computation overhead for some useful data operations. Searchable encryption initiated by Song et al. provides an efficient solution to support for keyword-based search directly on encrypted data. Nevertheless, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, the keyword search over encrypted data with differential privileges is addressed. We provide a novel framework for secure outsourcing and sharing of encrypted data on hybrid cloud. The framework is full-featured: i) it enables authorized users to perform keyword-based search directly on encrypted data without sharing the same private key, ii) it provides two-layered access control to achieve fine-grained sharing of encrypted data. The security analysis shows that the proposed generic construction satisfies the requirements of message privacy and keyword privacy.
{"title":"A Novel Framework for Outsourcing and Sharing Searchable Encrypted Data on Hybrid Cloud","authors":"Jingwei Li, Chunfu Jia, Jin Li, Zheli Liu","doi":"10.1109/iNCoS.2012.28","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.28","url":null,"abstract":"With the rapid growth of data, it is desirable to outsource data on remote storage server. The emergency of cloud computing makes the dream true and more and more sensitive data are being centralized into cloud for sharing. Since the public cloud server cannot be fully trusted in protecting them, encryption is a promising way to keep confidentiality but leads to high communication and computation overhead for some useful data operations. Searchable encryption initiated by Song et al. provides an efficient solution to support for keyword-based search directly on encrypted data. Nevertheless, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, the keyword search over encrypted data with differential privileges is addressed. We provide a novel framework for secure outsourcing and sharing of encrypted data on hybrid cloud. The framework is full-featured: i) it enables authorized users to perform keyword-based search directly on encrypted data without sharing the same private key, ii) it provides two-layered access control to achieve fine-grained sharing of encrypted data. The security analysis shows that the proposed generic construction satisfies the requirements of message privacy and keyword privacy.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284336","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
扫码关注我们
求助内容：
应助结果提醒方式：