Pub Date : 2019-05-28DOI: 10.1504/IJSSC.2019.100011
Nishi Gupta, Satbir Jain
One of the most used networks is the wireless sensor network. Such networks sense the environment and collect data when an event occurs. This data is transmitted to the base station, called the sink for analysis and decision regarding any action required. Sensor nodes sense events and forward data to the sink. This transmission is an energy consuming task and sensor networks are generally energy constraint. Hierarchical approach of using cluster heads has proven to be a good method to deal with this energy crisis and results in better performance of the network in terms of connectivity and communication. Routing algorithm chooses an optimal route from the sensor nodes to the sink for actual data delivery. This paper introduces a mobile relay node in the clustering scheme to enhance the performance of the network by maintaining the clusters and reducing the re-clustering overhead.
{"title":"Mobile relay assisted dynamic clustering in wireless sensor networks","authors":"Nishi Gupta, Satbir Jain","doi":"10.1504/IJSSC.2019.100011","DOIUrl":"https://doi.org/10.1504/IJSSC.2019.100011","url":null,"abstract":"One of the most used networks is the wireless sensor network. Such networks sense the environment and collect data when an event occurs. This data is transmitted to the base station, called the sink for analysis and decision regarding any action required. Sensor nodes sense events and forward data to the sink. This transmission is an energy consuming task and sensor networks are generally energy constraint. Hierarchical approach of using cluster heads has proven to be a good method to deal with this energy crisis and results in better performance of the network in terms of connectivity and communication. Routing algorithm chooses an optimal route from the sensor nodes to the sink for actual data delivery. This paper introduces a mobile relay node in the clustering scheme to enhance the performance of the network by maintaining the clusters and reducing the re-clustering overhead.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77392976","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 : 2019-05-28DOI: 10.1504/IJSSC.2019.100007
Masaya Sato, H. Taniguchi, Toshihiro Yamauchi
Security or system management software is essential for keeping systems secure. To deter attacks on essential services, hiding information related to essential services is helpful. This paper describes the design, the implementation, and the evaluation of a method to make files invisible to all services except their corresponding essential services and provides access methods to those files in a virtual machine (VM). In the proposed method, the virtual machine monitor (VMM) monitors the system call, which invoked by an essential process to access essential files, and requests proxy execution to the proxy process on another VM. The VMM returns the result and skips the execution of the original system call on the protection target VM. Thus, access to essential files by the essential service is skipped on the protection target VM, but the essential service can access the file content.
{"title":"Design and implementation of hiding method for file manipulation of essential services by system call proxy using virtual machine monitor","authors":"Masaya Sato, H. Taniguchi, Toshihiro Yamauchi","doi":"10.1504/IJSSC.2019.100007","DOIUrl":"https://doi.org/10.1504/IJSSC.2019.100007","url":null,"abstract":"Security or system management software is essential for keeping systems secure. To deter attacks on essential services, hiding information related to essential services is helpful. This paper describes the design, the implementation, and the evaluation of a method to make files invisible to all services except their corresponding essential services and provides access methods to those files in a virtual machine (VM). In the proposed method, the virtual machine monitor (VMM) monitors the system call, which invoked by an essential process to access essential files, and requests proxy execution to the proxy process on another VM. The VMM returns the result and skips the execution of the original system call on the protection target VM. Thus, access to essential files by the essential service is skipped on the protection target VM, but the essential service can access the file content.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77506960","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 : 2019-05-28DOI: 10.1504/IJSSC.2019.100016
Yasuo Ebara, H. Hazama
To promote information communication technology (ICT) utilisation in the practical training of industry subjects in elementary and secondary education, we consider that it is important to discuss the effective utilisation method of large-scale display systems. In this paper, we studied on effective practical training by utilising multiple large-scale display systems in conjunction with the interface for screen operation that was developed as part of this study. In this approach, we constructed multiple large-scale display environments using the interface for screen operation in combination with the Scalable Amplified Group Environment (SAGE2). Moreover, to verify the effectiveness of this display environment, we tried the simulated practical training with a teacher using this display environment. As the results, we showed that, by combining the interface for screen operation and multiple display systems, this environment has excellent potential to facilitate effective practical training.
{"title":"Study on effective practical training with multiple large-scale display systems in elementary and secondary education","authors":"Yasuo Ebara, H. Hazama","doi":"10.1504/IJSSC.2019.100016","DOIUrl":"https://doi.org/10.1504/IJSSC.2019.100016","url":null,"abstract":"To promote information communication technology (ICT) utilisation in the practical training of industry subjects in elementary and secondary education, we consider that it is important to discuss the effective utilisation method of large-scale display systems. In this paper, we studied on effective practical training by utilising multiple large-scale display systems in conjunction with the interface for screen operation that was developed as part of this study. In this approach, we constructed multiple large-scale display environments using the interface for screen operation in combination with the Scalable Amplified Group Environment (SAGE2). Moreover, to verify the effectiveness of this display environment, we tried the simulated practical training with a teacher using this display environment. As the results, we showed that, by combining the interface for screen operation and multiple display systems, this environment has excellent potential to facilitate effective practical training.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83462730","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015578
Yukimasa Oguri, Shogo Matsuno, M. Ohyama
We present a high-accuracy recognition method for various activities using smartphone sensors based on device positions. Many researchers have attempted to estimate various activities, particularly using sensors such as the built-in accelerometer of a smartphone. Considerable research has been conducted under conditions such as placing a smartphone in a trouser pocket; however, few have focused on the changing context and influence of the smartphone position. Herein, we present a method for recognising seven types of activities considering three smartphone positions, and conducted two experiments to estimate each activity and identify the actual state under continuous movement at a university campus. The results indicate that the seven states can be classified with an average accuracy of 98.53% for three different smartphone positions. We also correctly identified these activities with 91.66% accuracy. Using our method, we can create practical services such as healthcare applications with a high degree of accuracy.
{"title":"Recognition of a variety of activities considering smartphone positions","authors":"Yukimasa Oguri, Shogo Matsuno, M. Ohyama","doi":"10.1504/IJSSC.2018.10015578","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015578","url":null,"abstract":"We present a high-accuracy recognition method for various activities using smartphone sensors based on device positions. Many researchers have attempted to estimate various activities, particularly using sensors such as the built-in accelerometer of a smartphone. Considerable research has been conducted under conditions such as placing a smartphone in a trouser pocket; however, few have focused on the changing context and influence of the smartphone position. Herein, we present a method for recognising seven types of activities considering three smartphone positions, and conducted two experiments to estimate each activity and identify the actual state under continuous movement at a university campus. The results indicate that the seven states can be classified with an average accuracy of 98.53% for three different smartphone positions. We also correctly identified these activities with 91.66% accuracy. Using our method, we can create practical services such as healthcare applications with a high degree of accuracy.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78953703","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015583
R. Muthalagu
This work address the problem of designing joint optimum transceiver for both single-user (SU) and multi-user (MU) MIMO system. Most of the previous works on both SU and MU-MIMO system, the joint precoder and decoder designs are based on the total transmit power constraint (TTPC) with proper modulation techniques. On the other hand, in practice, individual transmit power constraint (ITPC) is more realistic as the power at each antenna at the transmitter is restricted independently by the linearity of the power amplifier. In this work, a minimum total mean squared error (TMSE) design is formulated as a non-convex optimisation problem. This formulation is under equal power allocation (EPA) and the power constraint that jointly meets both EPA and TTPC (i.e., ITPC). The closed-form optimum linear precoder and decoder for SU-MIMO systems with an improper modulation are determined by solving this non-convex optimisation problem. It considers both the perfect and imperfect channel state information (CSI) is available at both the transmitter and receiver. The simulation results show the performance improvement of the proposed work over conventional work in terms of bit error rate (BER).
{"title":"Both the single user and multi user MIMO system design with individual transmit power constraint and improper constellation","authors":"R. Muthalagu","doi":"10.1504/IJSSC.2018.10015583","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015583","url":null,"abstract":"This work address the problem of designing joint optimum transceiver for both single-user (SU) and multi-user (MU) MIMO system. Most of the previous works on both SU and MU-MIMO system, the joint precoder and decoder designs are based on the total transmit power constraint (TTPC) with proper modulation techniques. On the other hand, in practice, individual transmit power constraint (ITPC) is more realistic as the power at each antenna at the transmitter is restricted independently by the linearity of the power amplifier. In this work, a minimum total mean squared error (TMSE) design is formulated as a non-convex optimisation problem. This formulation is under equal power allocation (EPA) and the power constraint that jointly meets both EPA and TTPC (i.e., ITPC). The closed-form optimum linear precoder and decoder for SU-MIMO systems with an improper modulation are determined by solving this non-convex optimisation problem. It considers both the perfect and imperfect channel state information (CSI) is available at both the transmitter and receiver. The simulation results show the performance improvement of the proposed work over conventional work in terms of bit error rate (BER).","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84417999","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015575
Sumon Kumar Debnath, N. Funabiki, M. Saha, Md. Selim Al Mamun, W. Kao
Recently, a wireless local-area networks (WLANs) has become prevalent around the world due to the low-cost and flexible internet access by wireless communications between user hosts and access points (APs) in the network. Previously, we proposed the active AP configuration algorithm for the elastic WLAN system that dynamically optimises the network configuration by activating/deactivating APs and assigning the channels and associated hosts depending on network situations. However, it assumed that only single-input-single-output (SISO) links are used, although multiple-input-multiple-output (MIMO) links have become popular for fast communications. Currently, most commercial APs can use MIMO, while a subset of hosts can use it, referred as MIMO hosts in this paper. Then, by optimising the locations of MIMO hosts, the performance of the network is expected to be improved. In this paper, we present the MIMO host location optimisation as the extension of the active AP configuration algorithm. Through simulations in two network topologies using the WIMNET simulator, the throughput improvements by this proposal are confirmed.
{"title":"MIMO host location optimisation in active access-point configuration algorithm for elastic WLAN system","authors":"Sumon Kumar Debnath, N. Funabiki, M. Saha, Md. Selim Al Mamun, W. Kao","doi":"10.1504/IJSSC.2018.10015575","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015575","url":null,"abstract":"Recently, a wireless local-area networks (WLANs) has become prevalent around the world due to the low-cost and flexible internet access by wireless communications between user hosts and access points (APs) in the network. Previously, we proposed the active AP configuration algorithm for the elastic WLAN system that dynamically optimises the network configuration by activating/deactivating APs and assigning the channels and associated hosts depending on network situations. However, it assumed that only single-input-single-output (SISO) links are used, although multiple-input-multiple-output (MIMO) links have become popular for fast communications. Currently, most commercial APs can use MIMO, while a subset of hosts can use it, referred as MIMO hosts in this paper. Then, by optimising the locations of MIMO hosts, the performance of the network is expected to be improved. In this paper, we present the MIMO host location optimisation as the extension of the active AP configuration algorithm. Through simulations in two network topologies using the WIMNET simulator, the throughput improvements by this proposal are confirmed.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90302077","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015577
T. Nakagawa, Naohiro Hayashibara
Protocols which solve agreement problems are essential building blocks for fault-tolerant distributed applications. Especially, many consensus protocols have been proposed in recent decades. Paxos is the most famous consensus protocol, but it is difficult to understand and even more to implement. The recently proposed raft consensus protocol is a leader based consensus protocol. It is a simple enough to understand itself. Given the popularity of cloud-based elastic environments, it should consider adapting such environments. This paper proposes a resource management mechanism for raft protocol. It realises a dynamic raft cluster by introducing the flexible resource management and the notion of suspended nodes. In this mechanism, a leader node arouses suspended nodes when some nodes failed, or nodes come up against a heavy load. It can realise an appropriate configuration on the number of nodes in a service. As a result, it can reduce energy consumption during execution. Then, we show the performance evaluation of the proposed protocol regarding the number of messages sent by nodes and the number of execution steps for consensus executions. We also show the message-efficiency and the cost for the resource management mechanism by comparing the proposed protocol with raft protocol.
{"title":"Resource management for raft consensus protocol","authors":"T. Nakagawa, Naohiro Hayashibara","doi":"10.1504/IJSSC.2018.10015577","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015577","url":null,"abstract":"Protocols which solve agreement problems are essential building blocks for fault-tolerant distributed applications. Especially, many consensus protocols have been proposed in recent decades. Paxos is the most famous consensus protocol, but it is difficult to understand and even more to implement. The recently proposed raft consensus protocol is a leader based consensus protocol. It is a simple enough to understand itself. Given the popularity of cloud-based elastic environments, it should consider adapting such environments. This paper proposes a resource management mechanism for raft protocol. It realises a dynamic raft cluster by introducing the flexible resource management and the notion of suspended nodes. In this mechanism, a leader node arouses suspended nodes when some nodes failed, or nodes come up against a heavy load. It can realise an appropriate configuration on the number of nodes in a service. As a result, it can reduce energy consumption during execution. Then, we show the performance evaluation of the proposed protocol regarding the number of messages sent by nodes and the number of execution steps for consensus executions. We also show the message-efficiency and the cost for the resource management mechanism by comparing the proposed protocol with raft protocol.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81385923","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015593
Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara
Linked data are directed graph data with descriptive labels using uniform resource identifiers (URI) and based on resource description framework (RDF). Linked data which are published as open data on the web are called linked open data (LOD). LOD is popular as a technology for constructing the semantic web because it can create a knowledge base by linking various resources. However, a large amount of the linked data does not have sufficient links since resources defined by URI type are scarce. Therefore, this paper presents a new resource propagation algorithm (RPA) which predicts links between resources in the linked data, and complements the knowledge bases by considering predicates in the RDF structure. The presented experiment demonstrates that the RPA was able to complement semantic links between resources considering each predicate.
{"title":"Resource propagation algorithm considering predicates to complement knowledge bases in linked data","authors":"Toshitaka Maki, Kazuki Takahashi, T. Wakahara, A. Kodate, N. Sonehara","doi":"10.1504/IJSSC.2018.10015593","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015593","url":null,"abstract":"Linked data are directed graph data with descriptive labels using uniform resource identifiers (URI) and based on resource description framework (RDF). Linked data which are published as open data on the web are called linked open data (LOD). LOD is popular as a technology for constructing the semantic web because it can create a knowledge base by linking various resources. However, a large amount of the linked data does not have sufficient links since resources defined by URI type are scarce. Therefore, this paper presents a new resource propagation algorithm (RPA) which predicts links between resources in the linked data, and complements the knowledge bases by considering predicates in the RDF structure. The presented experiment demonstrates that the RPA was able to complement semantic links between resources considering each predicate.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84625663","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015582
S. Kato, N. Wada
This paper discusses on a system which estimates food textures using hybrid model of neural network and fuzzy logic. The system consists of equipment which obtains a load change and a sound signal while a sharp probe is stabbing a food, and a computer system which estimates numerical degrees of the food textures. Firstly, the neural network assumes numerical membership degrees of the food. The fuzzy logic infers a numerical degree of the food texture considering the estimated membership degrees. In the experiment, the validity of our proposed system is discussed. Finally future prospect is mentioned.
{"title":"Estimation system of food texture using neural network and fuzzy logic","authors":"S. Kato, N. Wada","doi":"10.1504/IJSSC.2018.10015582","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015582","url":null,"abstract":"This paper discusses on a system which estimates food textures using hybrid model of neural network and fuzzy logic. The system consists of equipment which obtains a load change and a sound signal while a sharp probe is stabbing a food, and a computer system which estimates numerical degrees of the food textures. Firstly, the neural network assumes numerical membership degrees of the food. The fuzzy logic infers a numerical degree of the food texture considering the estimated membership degrees. In the experiment, the validity of our proposed system is discussed. Finally future prospect is mentioned.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76614857","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 : 2018-09-05DOI: 10.1504/IJSSC.2018.10015576
Eiichiro Kodama, B. B. Bista, Jiahong Wang, T. Takata
Since mobile ad hoc networks (MANETs) do not have fixed or predefined infrastructures, nodes need to frequently flood control messages to discovery and maintain routes, which causes performance problems in traffic and energy consumption, contention, and collision. A general solution is to construct a virtual backbone as the basis of routing and broadcasting, and the connected dominating set (CDS) has been widely used. This paper presents a distributed approach to constructing and maintaining a k-hop CDS in the MANET with two classes of nodes. A unique characteristic that differentiates the proposed approach from existing ones is that, any value can be specified for k, and a larger k contributes to a smaller CDS. If k is large enough, the resulting CDS will contain only a single node. Especially, the constructed CDS will be more robust, and will be little affected by the topology change of a MANET.
{"title":"Construction and maintenance of k-hop CDS in MANET with two classes of mobile terminals","authors":"Eiichiro Kodama, B. B. Bista, Jiahong Wang, T. Takata","doi":"10.1504/IJSSC.2018.10015576","DOIUrl":"https://doi.org/10.1504/IJSSC.2018.10015576","url":null,"abstract":"Since mobile ad hoc networks (MANETs) do not have fixed or predefined infrastructures, nodes need to frequently flood control messages to discovery and maintain routes, which causes performance problems in traffic and energy consumption, contention, and collision. A general solution is to construct a virtual backbone as the basis of routing and broadcasting, and the connected dominating set (CDS) has been widely used. This paper presents a distributed approach to constructing and maintaining a k-hop CDS in the MANET with two classes of nodes. A unique characteristic that differentiates the proposed approach from existing ones is that, any value can be specified for k, and a larger k contributes to a smaller CDS. If k is large enough, the resulting CDS will contain only a single node. Especially, the constructed CDS will be more robust, and will be little affected by the topology change of a MANET.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73433272","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
扫码关注我们
求助内容：
应助结果提醒方式：