Pub Date : 2018-09-01DOI: 10.2991/IJNDC.2018.6.4.4
S. Rao, V. Kalaichelvi, R. Karthikeyan
{"title":"Tracing a Weld Line using Artificial Neural Networks","authors":"S. Rao, V. Kalaichelvi, R. Karthikeyan","doi":"10.2991/IJNDC.2018.6.4.4","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.6.4.4","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151338","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-01DOI: 10.2991/ijndc.2018.6.4.5
Takanori Yokoi, Haruaki Tamada
The dynamic software birthmark methods are the methods to detect the stolen programs based on the runtime behavior of the target programs. For this, the dynamic birthmark methods extract the characteristics of programs themselves by running the target programs. Then, the extracted characteristics are compared and calculated the similarities between two characteristics. If the similarity is greater than the given threshold, either of programs is suspected the stolen program from the other. Based on the process, many researchers proposed various dynamic software birthmark methods focused on different aspect of the runtime behaviors. However, the problem is that above detection procedure consumes much time cost. The main cause is the extraction requires the suitable inputs, and the cost for preparing inputs is quite high. Because, the preparation of inputs need the understanding the target programs, and the dynamic birthmarks generally require several inputs for reliable results.
{"title":"Improvement of the Dynamic Software Birthmark Process by Reducing the Time of the Extraction","authors":"Takanori Yokoi, Haruaki Tamada","doi":"10.2991/ijndc.2018.6.4.5","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.4.5","url":null,"abstract":"The dynamic software birthmark methods are the methods to detect the stolen programs based on the runtime behavior of the target programs. For this, the dynamic birthmark methods extract the characteristics of programs themselves by running the target programs. Then, the extracted characteristics are compared and calculated the similarities between two characteristics. If the similarity is greater than the given threshold, either of programs is suspected the stolen program from the other. Based on the process, many researchers proposed various dynamic software birthmark methods focused on different aspect of the runtime behaviors. However, the problem is that above detection procedure consumes much time cost. The main cause is the extraction requires the suitable inputs, and the cost for preparing inputs is quite high. Because, the preparation of inputs need the understanding the target programs, and the dynamic birthmarks generally require several inputs for reliable results.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127349245","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-01DOI: 10.2991/ijndc.2018.6.4.6
Yosuke Isobe, Haruaki Tamada
To protect the software from cracking, the obfuscation methods were proposed. An obfuscation method is to change programs hard to understand by preserving input/output specification. Various obfuscation methods are proposed [2–4], and are implemented to tools, such as Dash-O2, ProGuard3, and etc. In particular, the Identifier Renaming Method (IRM) is widely used, which changes the identifiers in the programs to meaningless names. Because it is easy to implement and to understand the approach [5,6]. However, IRM did not sufficiently discuss the tolerance against attacks, and strength of the protection. Because the relationships between the meanings of identifiers and strength of the protection are not clear.
{"title":"Design and Evaluation of the De-obfuscation Method against the Identifier Renaming Methods","authors":"Yosuke Isobe, Haruaki Tamada","doi":"10.2991/ijndc.2018.6.4.6","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.4.6","url":null,"abstract":"To protect the software from cracking, the obfuscation methods were proposed. An obfuscation method is to change programs hard to understand by preserving input/output specification. Various obfuscation methods are proposed [2–4], and are implemented to tools, such as Dash-O2, ProGuard3, and etc. In particular, the Identifier Renaming Method (IRM) is widely used, which changes the identifiers in the programs to meaningless names. Because it is easy to implement and to understand the approach [5,6]. However, IRM did not sufficiently discuss the tolerance against attacks, and strength of the protection. Because the relationships between the meanings of identifiers and strength of the protection are not clear.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134092946","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-01DOI: 10.2991/IJNDC.2018.6.4.3
Jongho Seol, Abhilash Kancharla, N. Park, N. Park, Indy Park
A P2P file sharing system, namely Interplanetary File Systems (IPFS) [2,3], provides a service to store huge files in off-chain local storage and partition them into pieces, for each of which with a hash code created and assigned to be posted back in blockchain for reference, referred to as crypto link. IPFS manages hash codes on blockchain in a versioned manner based on the contentaddressed distributed P2P model [4]. It is investigated in this research how to assure the efficacy of managing crypto links along with the performance of the processes with respect to the dependability of blockchain. The dependability [5] in this research is defined with reference to crypto links in a proportional manner and its performance, as referred to as the crypto speed, in an inversely proportional manner, respectively. Also note that the dependability is proportional to the cost such that the more the number of crypto links come in place, the higher its cost is. It is a standard and intuitive practice to partition a large output file into smaller pieces at a certain threshold size provided in the blockchain analytics engine (e.g., 250 KB/partition in IPFS/Hadoop). Crypto link (CL) is defined by the hash address (i.e., a pointer link) stored in the blockchain for a partition of an output file off from a backend blockchain analytics engine. Note that IPFS manages a crypto link to every partition of a file of interest whereas the proposed crypto link scheme is at a reduced number in order to address the cost and performance issue such that one crypto link to the entire file and the links between partitions within a file are maintained by local chains of links. Crypto speed (CS) is defined by the rate of the number of crypto links over the total turnaround time to encrypt all the crypto links (hash addressing) per file. Thus, notice that without loss of generality, the crypto speed increases inverselinearly along with the number of crypto links. A binomial-based [6] dependability model can be expressed as a rather straightforward function of the total number of partitions and the number of crypto links as proposed in this research. At the same time a cost model can be expressed as a function of the ratio of the number of A RT I C L E I N F O
P2P文件共享系统，即星际文件系统(IPFS)[2,3]，提供了一种服务，将巨大的文件存储在链下本地存储中，并将其划分为多个部分，每个部分都有一个创建并分配的哈希码，以发布回区块链中以供参考，称为加密链接。IPFS基于内容寻址的分布式P2P模型，以版本化的方式管理区块链上的哈希码[4]。本研究探讨了如何确保管理加密链接的有效性以及与区块链可靠性相关的流程性能。在本研究中，可靠性[5]分别以加密链路成比例和其性能(即加密速度)成反比来定义。还要注意，可靠性与成本成正比，因此加密链接的数量越多，其成本就越高。在区块链分析引擎中，按照一定的阈值大小(例如，IPFS/Hadoop中的250 KB/分区)将一个大的输出文件分割成更小的文件是一种标准和直观的做法。加密链接(CL)是由存储在区块链中的哈希地址(即指针链接)定义的，用于从后端区块链分析引擎输出文件的分区。请注意，IPFS管理到感兴趣的文件的每个分区的加密链接，而提议的加密链接方案的数量减少，以解决成本和性能问题，以便一个加密链接到整个文件，文件内分区之间的链接由本地链接链维护。加密速度(CS)由加密链接的数量与每个文件加密所有加密链接(散列寻址)的总周转时间的比率定义。因此，请注意，在不损失通用性的情况下，加密速度随着加密链路的数量呈反比增长。基于二项[6]的可靠性模型可以表示为本研究提出的分区总数和加密链接数的一个相当简单的函数。同时，成本模型可以表示为a / RT / C / L / E / N / F / O数量之比的函数
{"title":"The Dependability of Crypto Linked Off-chain File Systems in Backend Blockchain Analytics Engine","authors":"Jongho Seol, Abhilash Kancharla, N. Park, N. Park, Indy Park","doi":"10.2991/IJNDC.2018.6.4.3","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.6.4.3","url":null,"abstract":"A P2P file sharing system, namely Interplanetary File Systems (IPFS) [2,3], provides a service to store huge files in off-chain local storage and partition them into pieces, for each of which with a hash code created and assigned to be posted back in blockchain for reference, referred to as crypto link. IPFS manages hash codes on blockchain in a versioned manner based on the contentaddressed distributed P2P model [4]. It is investigated in this research how to assure the efficacy of managing crypto links along with the performance of the processes with respect to the dependability of blockchain. The dependability [5] in this research is defined with reference to crypto links in a proportional manner and its performance, as referred to as the crypto speed, in an inversely proportional manner, respectively. Also note that the dependability is proportional to the cost such that the more the number of crypto links come in place, the higher its cost is. It is a standard and intuitive practice to partition a large output file into smaller pieces at a certain threshold size provided in the blockchain analytics engine (e.g., 250 KB/partition in IPFS/Hadoop). Crypto link (CL) is defined by the hash address (i.e., a pointer link) stored in the blockchain for a partition of an output file off from a backend blockchain analytics engine. Note that IPFS manages a crypto link to every partition of a file of interest whereas the proposed crypto link scheme is at a reduced number in order to address the cost and performance issue such that one crypto link to the entire file and the links between partitions within a file are maintained by local chains of links. Crypto speed (CS) is defined by the rate of the number of crypto links over the total turnaround time to encrypt all the crypto links (hash addressing) per file. Thus, notice that without loss of generality, the crypto speed increases inverselinearly along with the number of crypto links. A binomial-based [6] dependability model can be expressed as a rather straightforward function of the total number of partitions and the number of crypto links as proposed in this research. At the same time a cost model can be expressed as a function of the ratio of the number of A RT I C L E I N F O","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120834890","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-07-01DOI: 10.2991/ijndc.2018.6.3.3
Sylvanus A. Ehikioya
Peer-to-peer (P2P) electronic commerce has become increasingly popular over the last few years. This popularity of P2P is due mainly to the many advantages it offers, such as the ease of sharing of computer resources and reducing cost. This paper uses both semi-formal and formal specification methods to model a P2P digital product marketplace. First, models are written in UML, as this is expected to be relatively easy to understand and economic. Then, the models are transformed into a formal notation, object-Z notation. A formally specified and verified model of e-commerce transactions will provide a correct, fail-safe, and robust transaction processing environment for ecommerce. By using both semi-formal and formal methods in the design of the P2P system, we can reason about and create a correct and reliable system quickly and efficiently.
{"title":"A Formal Model of Peer-to-Peer Digital Product Marketplace","authors":"Sylvanus A. Ehikioya","doi":"10.2991/ijndc.2018.6.3.3","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.3.3","url":null,"abstract":"Peer-to-peer (P2P) electronic commerce has become increasingly popular over the last few years. This popularity of P2P is due mainly to the many advantages it offers, such as the ease of sharing of computer resources and reducing cost. This paper uses both semi-formal and formal specification methods to model a P2P digital product marketplace. First, models are written in UML, as this is expected to be relatively easy to understand and economic. Then, the models are transformed into a formal notation, object-Z notation. A formally specified and verified model of e-commerce transactions will provide a correct, fail-safe, and robust transaction processing environment for ecommerce. By using both semi-formal and formal methods in the design of the P2P system, we can reason about and create a correct and reliable system quickly and efficiently.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129420165","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-07-01DOI: 10.2991/ijndc.2018.6.3.1
Kazuki Yamauchi, Hirohisa Aman, S. Amasaki, Tomoyuki Yokogawa, Minoru Kawahara
To support successful quality managements of open source software (OSS) projects, this paper proposes to measure the balance of developers’ contributions to a source file as an entropy. Through an analysis of data collected from 10 popular OSS projects, the following trends are reported: a source file is more faultprone as the developers’ contributions to the file are more imbalanced (lower entropy), and the proposed metric can be useful for predicting fault-prone programs.
{"title":"An Entropy-Based Metric of Developer Contribution in Open Source Development and Its Application toF ault-ProneP rogram Analysis","authors":"Kazuki Yamauchi, Hirohisa Aman, S. Amasaki, Tomoyuki Yokogawa, Minoru Kawahara","doi":"10.2991/ijndc.2018.6.3.1","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.3.1","url":null,"abstract":"To support successful quality managements of open source software (OSS) projects, this paper proposes to measure the balance of developers’ contributions to a source file as an entropy. Through an analysis of data collected from 10 popular OSS projects, the following trends are reported: a source file is more faultprone as the developers’ contributions to the file are more imbalanced (lower entropy), and the proposed metric can be useful for predicting fault-prone programs.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129420518","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-07-01DOI: 10.2991/ijndc.2018.6.3.2
Liaq Mudassar, Y. Byun
Neural Networks have been performing state of the art for almost a decade now; when it comes to classification and prediction domains. Within last few years, neural networks have been improved tremendously and their performance is even better than humans in some domains, e.g. AlphaGo vs Lee Sedol and Image Net Challenge-2009. It’s a beneficial factor for any parking lot to know that what would be a parking position at any given point in time. If we are able to know in advance that are we going to get parking tomorrow afternoon in a busy super store parking lot, its very beneficial to plan accordingly. In this paper, we predict customer influx in a specific departmental store by analyzing the data of its parking lot. We use this parking data to predict the customer influx and outflux for that parking lot as this parking influx is directly proportional to the customer influx in the store. We use Recurrent Neural Network on the top of two years of historical data. We generate promising results using this dataset by predicting the traffic flow for each hour for next 7 days. We further improve our performance on this dataset by incorporating three more environmental factors along with the parking logs.
近十年来，神经网络一直在发挥最先进的作用;当涉及到分类和预测领域。在过去的几年里，神经网络已经得到了巨大的改进，它们在某些领域的表现甚至比人类更好，例如AlphaGo vs Lee Sedol和Image Net Challenge-2009。对于任何停车场来说知道任意时间点的停车位置都是很有好处的。如果我们能够提前知道明天下午我们将在一个繁忙的超市停车场停车，这对相应地计划是非常有益的。本文通过对某百货店停车场的数据分析，预测了该百货店的客流量。我们使用这个停车数据来预测该停车场的顾客流入和流出，因为这个停车流量与商店的顾客流入成正比。我们使用递归神经网络对两年的历史数据进行分析。我们使用该数据集通过预测未来7天内每小时的交通流量产生了有希望的结果。通过将另外三个环境因素与停车日志结合起来，我们进一步提高了该数据集的性能。
{"title":"Customer Prediction using Parking Logs with Recurrent Neural Networks","authors":"Liaq Mudassar, Y. Byun","doi":"10.2991/ijndc.2018.6.3.2","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.3.2","url":null,"abstract":"Neural Networks have been performing state of the art for almost a decade now; when it comes to classification and prediction domains. Within last few years, neural networks have been improved tremendously and their performance is even better than humans in some domains, e.g. AlphaGo vs Lee Sedol and Image Net Challenge-2009. It’s a beneficial factor for any parking lot to know that what would be a parking position at any given point in time. If we are able to know in advance that are we going to get parking tomorrow afternoon in a busy super store parking lot, its very beneficial to plan accordingly. In this paper, we predict customer influx in a specific departmental store by analyzing the data of its parking lot. We use this parking data to predict the customer influx and outflux for that parking lot as this parking influx is directly proportional to the customer influx in the store. We use Recurrent Neural Network on the top of two years of historical data. We generate promising results using this dataset by predicting the traffic flow for each hour for next 7 days. We further improve our performance on this dataset by incorporating three more environmental factors along with the parking logs.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115291579","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-07-01DOI: 10.2991/ijndc.2018.6.3.6
Byeongdo Kang, Jongseo Lee
This paper introduces the practical guidelines for function point analysis in the Republic of Korea. Korean government recommends that Function Point Analysis should be adopted as a standard method for measuring the functional size of software. Function Point was proposed by an international organization. We will present the procedure of counting Function Point with adjustment factors. The functional size and development cost of software can be estimated from the number of Function Point
{"title":"Estimating Procedure for Function Point and Development Cost in South Korea","authors":"Byeongdo Kang, Jongseo Lee","doi":"10.2991/ijndc.2018.6.3.6","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.3.6","url":null,"abstract":"This paper introduces the practical guidelines for function point analysis in the Republic of Korea. Korean government recommends that Function Point Analysis should be adopted as a standard method for measuring the functional size of software. Function Point was proposed by an international organization. We will present the procedure of counting Function Point with adjustment factors. The functional size and development cost of software can be estimated from the number of Function Point","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121397532","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-04-01DOI: 10.2991/ijndc.2018.6.2.1
Taketo Tsunoda, H. Washizaki, Y. Fukazawa, S. Inoue, Y. Hanai, Masanobu Kanazawa
{"title":"Developer Experience Considering Work Difficulty in Software Development","authors":"Taketo Tsunoda, H. Washizaki, Y. Fukazawa, S. Inoue, Y. Hanai, Masanobu Kanazawa","doi":"10.2991/ijndc.2018.6.2.1","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.2.1","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114074621","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-04-01DOI: 10.2991/ijndc.2018.6.2.4
Sylvanus A. Ehikioya, Cong Zhang
Electronic commerce applications have strict timing constraints on the interactions between e-commerce servers and customers. Customers prefer real-time services, which mean immediate response from the server shortly after submission of a request. This trend of demand gives e-commerce servers high pressure, both on the software and the architecture they currently use. In this paper, we propose a real-time architecture for e-commerce servers that addresses the problem efficiently. We adopt a framework that permits the appropriate treatment of dynamic behaviours that are data interdependent, and reasoning about the communication protocols and internal mechanisms of client / server relationships in a real-time multi-agents based e-commerce application architecture.
{"title":"Real-time Multi-Agents Architecture for E-commerce Servers","authors":"Sylvanus A. Ehikioya, Cong Zhang","doi":"10.2991/ijndc.2018.6.2.4","DOIUrl":"https://doi.org/10.2991/ijndc.2018.6.2.4","url":null,"abstract":"Electronic commerce applications have strict timing constraints on the interactions between e-commerce servers and customers. Customers prefer real-time services, which mean immediate response from the server shortly after submission of a request. This trend of demand gives e-commerce servers high pressure, both on the software and the architecture they currently use. In this paper, we propose a real-time architecture for e-commerce servers that addresses the problem efficiently. We adopt a framework that permits the appropriate treatment of dynamic behaviours that are data interdependent, and reasoning about the communication protocols and internal mechanisms of client / server relationships in a real-time multi-agents based e-commerce application architecture.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391832","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
扫码关注我们
求助内容：
应助结果提醒方式：