This paper studies implementation methods of parallel text matching using General Purpose computing on Graphics Processing Unit (GPGPU). It is necessary to accelerate text matching in applications of real-time processing, such as anomaly-detection and decision-making. GPGPU is a technology that can be used to accelerate a variety of applications with highly parallel processing elements in GPUs. Recently, the Parallel-Failure-less Aho-Corasick (PFAC) algorithm has been developed, and an open-source PFAC library is currently available. However, there are several different implementation methods in the host-side, and choosing a good combination of these methods is important to improve the performance. We implemented a prototype system, and evaluated the performance and power consumption varying the implementation methods and input data. The evaluation results show that the performance of the system using GPGPU is better than a system using 4-core CPU with smaller power consumption.
{"title":"Parallel Text Matching Using GPGPU","authors":"Ryosuke Takahashi, Ushio Inoue","doi":"10.1109/SNPD.2012.28","DOIUrl":"https://doi.org/10.1109/SNPD.2012.28","url":null,"abstract":"This paper studies implementation methods of parallel text matching using General Purpose computing on Graphics Processing Unit (GPGPU). It is necessary to accelerate text matching in applications of real-time processing, such as anomaly-detection and decision-making. GPGPU is a technology that can be used to accelerate a variety of applications with highly parallel processing elements in GPUs. Recently, the Parallel-Failure-less Aho-Corasick (PFAC) algorithm has been developed, and an open-source PFAC library is currently available. However, there are several different implementation methods in the host-side, and choosing a good combination of these methods is important to improve the performance. We implemented a prototype system, and evaluated the performance and power consumption varying the implementation methods and input data. The evaluation results show that the performance of the system using GPGPU is better than a system using 4-core CPU with smaller power consumption.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737062","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}
Though, Wireless Sensor Networks have many successful applications in military, smart building, habitat monitoring, etc. it just begun to show its superiority in the medical domain in recent years. Deployment of WSNs in medical domain exert many more stringent requirements on the capability of sensing and in-networking processing, due to the nature of high accessibility and the privacy sensitive requirement of medical environment, the application of WSN such as Wireless Personal Area Network (WPAN) must be carefully examined before practical use. This paper considers the performance of WPANs under different scenarios, which are the WSNs deployed in the medical and healthcare domains. It focuses on the behaviour of sensor nodes while accessing the shared channels during communicating each other. The channel access mechanism described as the slotted CSMA with collision avoidance (CA) in the network compliant the IEEE 802.15.4 standard are often investigated by the Markov chain modelling technique used in many complex systems. The performance matrices provide many insights to the technical designers and service users of WPAN systems.
尽管无线传感器网络在军事、智能建筑、人居监测等领域已经有了很多成功的应用，但近年来在医疗领域才开始显示出它的优势。无线传感器网络在医疗领域的部署对传感能力和网内处理能力提出了更为严格的要求，由于医疗环境的高可访问性和隐私敏感性要求，无线个人区域网络(Wireless Personal Area Network, WPAN)等无线传感器网络的应用在实际使用前必须经过仔细的审查。本文研究了部署在医疗卫生领域的无线传感器网络在不同场景下的性能。它关注传感器节点在相互通信期间访问共享通道时的行为。在符合IEEE 802.15.4标准的网络中，带避碰(CA)的开槽CSMA通道访问机制常被用于许多复杂系统的马尔可夫链建模技术的研究。性能矩阵为WPAN系统的技术设计人员和服务用户提供了许多见解。
{"title":"Theoretical Modelling IEEE 802.15.4 MAC Protocol with Retransmission for Wireless Personal Area Networks in Medical and Healthcare Deployment","authors":"Zhongwei Zhang, Hong Zhou","doi":"10.1109/SNPD.2012.103","DOIUrl":"https://doi.org/10.1109/SNPD.2012.103","url":null,"abstract":"Though, Wireless Sensor Networks have many successful applications in military, smart building, habitat monitoring, etc. it just begun to show its superiority in the medical domain in recent years. Deployment of WSNs in medical domain exert many more stringent requirements on the capability of sensing and in-networking processing, due to the nature of high accessibility and the privacy sensitive requirement of medical environment, the application of WSN such as Wireless Personal Area Network (WPAN) must be carefully examined before practical use. This paper considers the performance of WPANs under different scenarios, which are the WSNs deployed in the medical and healthcare domains. It focuses on the behaviour of sensor nodes while accessing the shared channels during communicating each other. The channel access mechanism described as the slotted CSMA with collision avoidance (CA) in the network compliant the IEEE 802.15.4 standard are often investigated by the Markov chain modelling technique used in many complex systems. The performance matrices provide many insights to the technical designers and service users of WPAN systems.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133079774","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}
This paper proposes a general framework for a system with a semantic browsing and visualization interface called Knowledge Communication, Collaboration and Creation Browser (KC3 Browser) which integrates multimedia contests and web services on the grid networks, and makes a semantic mash-up called knowledge workspace (k-workspace) with various visual gadgets according to user's contexts (e.g. their interests, purpose and computational environments). KC3 Browser also achieves a link-free browsing for seamless knowledge access by generating semantic links based on an arbitrary knowledge models such as ontology and vector space models. It assists users to look down and to figure out various social and natural events from the web contents. We have implemented a prototype of KC3 Browser and tested it to an international project on risk intelligence against natural disaster.
{"title":"KC3 Browser: Semantic Service Mush-up for Global Knowledge Sharing and Discovery","authors":"M. Iwazume, K. Kaneiwa, I. Kobayashi","doi":"10.1109/SNPD.2012.114","DOIUrl":"https://doi.org/10.1109/SNPD.2012.114","url":null,"abstract":"This paper proposes a general framework for a system with a semantic browsing and visualization interface called Knowledge Communication, Collaboration and Creation Browser (KC3 Browser) which integrates multimedia contests and web services on the grid networks, and makes a semantic mash-up called knowledge workspace (k-workspace) with various visual gadgets according to user's contexts (e.g. their interests, purpose and computational environments). KC3 Browser also achieves a link-free browsing for seamless knowledge access by generating semantic links based on an arbitrary knowledge models such as ontology and vector space models. It assists users to look down and to figure out various social and natural events from the web contents. We have implemented a prototype of KC3 Browser and tested it to an international project on risk intelligence against natural disaster.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114047411","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}
Umekawa Kohichi, H. Igaki, Yoshiki Higo, S. Kusumoto
In recent years, the increased failure originated in the software defects, in various information systems causes a serious social problem. In order to build a high-quality software, cultivation of ICT (Information and Communication Technology) human resources like a software engineer is required. A software development PBL (Project-based Learning) is the educational technique which lets students acquire knowledge and skill spontaneously through practical software development. In PBL, on the other hand, it is difficult to evaluate not only the quality of the product but also the quality of the development process in the project. In this paper, we propose the student evaluation metrics to assess the development process in PBL. The student evaluation metrics represent LOC (Lines of Code) and development time for each product developed by a student. By using online storage, these metrics can be measured and visualized automatically. We conducted an experiment to evaluate the accuracy of the metrics about development time. As a result, we confirmed that development time metrics can be measured with approximately 20% of error.
{"title":"A Study of Student Experience Metrics for Software Development PBL","authors":"Umekawa Kohichi, H. Igaki, Yoshiki Higo, S. Kusumoto","doi":"10.1109/SNPD.2012.76","DOIUrl":"https://doi.org/10.1109/SNPD.2012.76","url":null,"abstract":"In recent years, the increased failure originated in the software defects, in various information systems causes a serious social problem. In order to build a high-quality software, cultivation of ICT (Information and Communication Technology) human resources like a software engineer is required. A software development PBL (Project-based Learning) is the educational technique which lets students acquire knowledge and skill spontaneously through practical software development. In PBL, on the other hand, it is difficult to evaluate not only the quality of the product but also the quality of the development process in the project. In this paper, we propose the student evaluation metrics to assess the development process in PBL. The student evaluation metrics represent LOC (Lines of Code) and development time for each product developed by a student. By using online storage, these metrics can be measured and visualized automatically. We conducted an experiment to evaluate the accuracy of the metrics about development time. As a result, we confirmed that development time metrics can be measured with approximately 20% of error.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116153452","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}
For the purpose of retrieving impressive scenes from lifelog videos based on facial expression recognition, an effective equipment to take facial videos is developed in this paper. The important advantage of this equipment is that it is able to take facial videos without excessive fatigue. In addition, we implemented an emotional scene management system. It provides the functions to store facial videos to a video database and to retrieve and display emotional scenes through Web browsers. In order to measure the retrieval performance of emotional scenes, a retrieval experiment was conducted. It was experimentally shown that about 78.6% of the emotional scenes were retrieved successfully.
{"title":"Taking Lifelog Videos and Managing Impressive Scenes","authors":"Atsushi Morikuni, Hiroki Nomiya, T. Hochin","doi":"10.1109/SNPD.2012.57","DOIUrl":"https://doi.org/10.1109/SNPD.2012.57","url":null,"abstract":"For the purpose of retrieving impressive scenes from lifelog videos based on facial expression recognition, an effective equipment to take facial videos is developed in this paper. The important advantage of this equipment is that it is able to take facial videos without excessive fatigue. In addition, we implemented an emotional scene management system. It provides the functions to store facial videos to a video database and to retrieve and display emotional scenes through Web browsers. In order to measure the retrieval performance of emotional scenes, a retrieval experiment was conducted. It was experimentally shown that about 78.6% of the emotional scenes were retrieved successfully.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116834358","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 primary goal of this work is to provide an easy and systematic way of developing safe soft real-time systems. To achieve this goal, we propose a method of generating real-time programs from formally verified models written as systems of timed automata. The models are verified using UPPAAL model checker prior to be processed by our code generators. A characteristic of our code generator is that the generated code runs in a non-real-time environment, i.e., a runtime environment without inherent real-time schedulers. To realize this, the code generator weaves timing checking code fragments within the generated programs. The generated code explicitly checks the real-time clock of its runtime to obey the timing constraints specified in the model. In this paper, we describe how to generate Java/C programs from UPPAAL timed automata and show the benefits of our method using a robot controller case study.
{"title":"A Model-Based Approach to Constructing Safe Soft Real-Time Programs for Non-Real-Time Environments","authors":"Ilankaikone Senthooran, Takuo Watanabe","doi":"10.1109/SNPD.2012.115","DOIUrl":"https://doi.org/10.1109/SNPD.2012.115","url":null,"abstract":"The primary goal of this work is to provide an easy and systematic way of developing safe soft real-time systems. To achieve this goal, we propose a method of generating real-time programs from formally verified models written as systems of timed automata. The models are verified using UPPAAL model checker prior to be processed by our code generators. A characteristic of our code generator is that the generated code runs in a non-real-time environment, i.e., a runtime environment without inherent real-time schedulers. To realize this, the code generator weaves timing checking code fragments within the generated programs. The generated code explicitly checks the real-time clock of its runtime to obey the timing constraints specified in the model. In this paper, we describe how to generate Java/C programs from UPPAAL timed automata and show the benefits of our method using a robot controller case study.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133888412","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}
As graphics processing units (GPUs) gain adoption as general purpose parallel compute devices, several key problems need to be addressed in order for their use to become more practical and more user friendly. One such problem is special functions designed to execute on GPUs called kernel functions are non-preempt able. Once the kernel is issued to the GPU it will remain there till either execution finishes or it is killed. If the kernel uses all the execution units of the GPU, then no other kernels are able to be executed. This paper proposes a way to apply preemption to the executing kernel function. The kernel at some point in its execution will be able to save its state, halt execution, and free up the GPU's execution units for other kernels to run. After a given amount of time the halted kernel will be able to regain control of the GPU and complete its execution as if it never was halted in the first place. Experimental results have demonstrated the effectiveness of the proposed scheme.
{"title":"Preemption of a CUDA Kernel Function","authors":"Jon C. Calhoun, Hai Jiang","doi":"10.1109/SNPD.2012.53","DOIUrl":"https://doi.org/10.1109/SNPD.2012.53","url":null,"abstract":"As graphics processing units (GPUs) gain adoption as general purpose parallel compute devices, several key problems need to be addressed in order for their use to become more practical and more user friendly. One such problem is special functions designed to execute on GPUs called kernel functions are non-preempt able. Once the kernel is issued to the GPU it will remain there till either execution finishes or it is killed. If the kernel uses all the execution units of the GPU, then no other kernels are able to be executed. This paper proposes a way to apply preemption to the executing kernel function. The kernel at some point in its execution will be able to save its state, halt execution, and free up the GPU's execution units for other kernels to run. After a given amount of time the halted kernel will be able to regain control of the GPU and complete its execution as if it never was halted in the first place. Experimental results have demonstrated the effectiveness of the proposed scheme.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651711","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}
Masashi Komori, N. Matsumura, A. Miura, Chika Nagaoka
Twitter messages are real-time, spontaneous reports of what the users are feeling, thinking, and doing. The frequency of posting "Tweets" oscillates periodically in one-day and seven-day cycles. These periodic patterns may be related to the individual users' baseline affective state. In order to investigate individual periodic behavior in social media, we performed a Fourier series expansion and PCA on intra-week Tweet-frequency changes of 11,570 individuals. Moreover, the relationships between the users' baseline mood and the principal component scores were investigated. High frequency in daytime tweets on weekdays was found to be linked to a low positive affective state. The larger number of posting tweets was related to the negative affective state.
{"title":"Relationships between Periodic Behaviors in Micro-blogging and the Users' Baseline Mood","authors":"Masashi Komori, N. Matsumura, A. Miura, Chika Nagaoka","doi":"10.1109/SNPD.2012.39","DOIUrl":"https://doi.org/10.1109/SNPD.2012.39","url":null,"abstract":"Twitter messages are real-time, spontaneous reports of what the users are feeling, thinking, and doing. The frequency of posting \"Tweets\" oscillates periodically in one-day and seven-day cycles. These periodic patterns may be related to the individual users' baseline affective state. In order to investigate individual periodic behavior in social media, we performed a Fourier series expansion and PCA on intra-week Tweet-frequency changes of 11,570 individuals. Moreover, the relationships between the users' baseline mood and the principal component scores were investigated. High frequency in daytime tweets on weekdays was found to be linked to a low positive affective state. The larger number of posting tweets was related to the negative affective state.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125001043","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}
This paper proposes a method to support Personal Software Process (PSP) in a development organization by classify the operations on a computer into a purpose of the user. PSP requires the developers to record and analyze their activity during the development process. There are several methods and systems to support the PSP, they records the operations automatically and also records a purpose of the operations (task) which records manually by the developer. Such manual recording by the developers is a barrier to introduction of the PSP system, and the cause of inaccurate record histories. Our proposal method classifies the operations into the task automatically with the chronological operation history. The method hypothesize that the each task consists of successive operation. The method classify the each operation into the task with a machine learning algorithm, Random Forests. An Experiment result shows the proposal method with chronological operation history classify the operation into the tasks more accurately than the method without the chronological operation history.
{"title":"Task Classification with Chronological Action History for PSP Support","authors":"Ryouta Ohashi, H. Uwano, Takao Nakagawa","doi":"10.1109/SNPD.2012.60","DOIUrl":"https://doi.org/10.1109/SNPD.2012.60","url":null,"abstract":"This paper proposes a method to support Personal Software Process (PSP) in a development organization by classify the operations on a computer into a purpose of the user. PSP requires the developers to record and analyze their activity during the development process. There are several methods and systems to support the PSP, they records the operations automatically and also records a purpose of the operations (task) which records manually by the developer. Such manual recording by the developers is a barrier to introduction of the PSP system, and the cause of inaccurate record histories. Our proposal method classifies the operations into the task automatically with the chronological operation history. The method hypothesize that the each task consists of successive operation. The method classify the each operation into the task with a machine learning algorithm, Random Forests. An Experiment result shows the proposal method with chronological operation history classify the operation into the tasks more accurately than the method without the chronological operation history.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126754747","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}
W. Burakowski, H. Tarasiuk, A. Beben, G. Danilewicz
In this paper we describe the IIP System designed, implemented and currently tested in the frame of the Polish national project entitled "Future Internet Engineering"1 (in Polish "Inzynieria Internetu Przysz"- IIP). The IIP system uses virtualized network infrastructure that allows to set a number of, named, Parallel Internets essentially differing in solutions for the data and control planes. More precisely, we design three Parallel Internets: (1) IPv6 QoS that basically explores Diff Serv and NGN architectures and uses TCP/IP, (2) Content Aware Network (CAN) specially designed for efficient content delivery, and (3) Data Streams Switching (DSS) for handling constant rate traffic with strong QoS requirements. For the IIP System we design a novel network infrastructure, which is based on the virtualization of the network elements (links and nodes). Such approach is on the line with the expectations of the network infrastructure for the Future Internet. In the paper we mainly focus on the system architecture, Parallel Internets and some aspects of network virtualization.
{"title":"Virtualized Network Infrastructure Supporting Co-existence of Parallel Internets","authors":"W. Burakowski, H. Tarasiuk, A. Beben, G. Danilewicz","doi":"10.1109/SNPD.2012.67","DOIUrl":"https://doi.org/10.1109/SNPD.2012.67","url":null,"abstract":"In this paper we describe the IIP System designed, implemented and currently tested in the frame of the Polish national project entitled \"Future Internet Engineering\"1 (in Polish \"Inzynieria Internetu Przysz\"- IIP). The IIP system uses virtualized network infrastructure that allows to set a number of, named, Parallel Internets essentially differing in solutions for the data and control planes. More precisely, we design three Parallel Internets: (1) IPv6 QoS that basically explores Diff Serv and NGN architectures and uses TCP/IP, (2) Content Aware Network (CAN) specially designed for efficient content delivery, and (3) Data Streams Switching (DSS) for handling constant rate traffic with strong QoS requirements. For the IIP System we design a novel network infrastructure, which is based on the virtualization of the network elements (links and nodes). Such approach is on the line with the expectations of the network infrastructure for the Future Internet. In the paper we mainly focus on the system architecture, Parallel Internets and some aspects of network virtualization.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116881422","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
扫码关注我们
求助内容：
应助结果提醒方式：