发布求助
文献互助 智能选刊 最新文献

2012 Third International Conference on Networking and Distributed Computing最新文献

筛选
英文 中文
The Application of Data Mining and the Newsboy Model in B2B E-Commerce Supply Chain 数据挖掘与报童模型在B2B电子商务供应链中的应用
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.57
Dao-Lei Liang
{"title":"The Application of Data Mining and the Newsboy Model in B2B E-Commerce Supply Chain","authors":"Dao-Lei Liang","doi":"10.1109/ICNDC.2012.57","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.57","url":null,"abstract":"In recent years, with the high-speed development of Internet and the rise of B2B e-commerce, it is necessary for coping with resource allocation, dynamic order, flexible pricing, market scheduling and other problems as fast as possible to establish efficient and flexible supply chain decision-making system. Firstly products of different life cycle were clustered in the paper. Then the C5.0 classification tree algorithm was used to establish the product sales model and establish Bass curve fitting function. Next, the newsboy procurement sales model was improved and the pricing and production models of B2B manufacturer with sales curve were established. What's more, the sales data of dozens of clothe of large-scale garment enterprises were analyzed by a experiment, and the results is good. the study in the paper is significant for the development of B2B supply chain in theory and practice.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122621966","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}
引用次数: 0
Reformat Named Data Networking with Cryptographic Message Syntax 用加密消息语法重新格式化命名数据网络
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.13
Erlong Min, Zhen Chen, R. Chen, Dongsheng Wang
{"title":"Reformat Named Data Networking with Cryptographic Message Syntax","authors":"Erlong Min, Zhen Chen, R. Chen, Dongsheng Wang","doi":"10.1109/ICNDC.2012.13","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.13","url":null,"abstract":"The CCNx reference implementation uses XML and ccnb to describe and encode the Interest and Data packet, but currently most security communication uses CMS based on ASN.1 and BER to characterize the protocol packet. Therefore, in order to be compatible with these existing crypto technology and products, we propose to reformat the Interest and Data packet with CMS. In addition, BER encoding causes almost no increase in packet size compared to ccnb encoding, but it used less time spent on functions related to packet name decoding than XML-decoded.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"389 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122883689","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}
引用次数: 2
Suboptimum Multiuser Receivers for Coded IDMA Systems 编码IDMA系统的次优多用户接收机
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.39
Pen Haibo, Jiang Jianhua, Wu Shao-hao, L. Yilong
{"title":"Suboptimum Multiuser Receivers for Coded IDMA Systems","authors":"Pen Haibo, Jiang Jianhua, Wu Shao-hao, L. Yilong","doi":"10.1109/ICNDC.2012.39","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.39","url":null,"abstract":"Conventional receiver structures of coded IDMA systems consist of an elementary signal estimator (ESE) and K soft-in soft-out (SISO) decoders, which will bring high complexity to the systems. In this paper, we propose two relatively simple structures to combine decoding and multiuser detection (MUD). The first approach is partitioned approach that treats the MUD and decoding separately. The second approach is the harddecision combined approach that combines the MUD and harddecision decoding. We discuss the advantages and disadvantages of each approach. The numerical results show that the integrated approach even outperforms than the conventional receiver when the number of users is small (K <;8). Partitioned approach can achieve good performance as the conventional receiver performs.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121687083","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}
引用次数: 0
Optimized Methods to Estimate Lower and Upper Bounds for Approximate Cycle Matching in Homogeneous Symmetric Pub/Sub System 齐次对称Pub/Sub系统中近似循环匹配下界和上界的优化估计方法
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.55
Botao Wang, Lijun Wang, Pingping Liu, Yanbo Bi
{"title":"Optimized Methods to Estimate Lower and Upper Bounds for Approximate Cycle Matching in Homogeneous Symmetric Pub/Sub System","authors":"Botao Wang, Lijun Wang, Pingping Liu, Yanbo Bi","doi":"10.1109/ICNDC.2012.55","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.55","url":null,"abstract":"In this paper we consider the problem of estimating lower and upper bounds for approximate cycle matching in homogeneous symmetric publish/subscribe system. The approximate cycle matching aims to find cycle matchings as many as possible with limited space, where a probability threshold is used to prune the space used to store the intermediate results of the approximate cycle matching. It is necessary to estimate the lower and upper bounds of the space to be saved according to the probability threshold. The existing method partitions a 2d space of possible subscriptions into rectangle zones by the probability threshold. The possible subscriptions in different zones are counted to estimate the lower and upper bounds. In order to get tighter bounds, we propose an estimation method based on the space partition with curves and prove that there exist such kind of curves, and then propose an estimation method based on dimension reduction in the case that the data distribution is previously known. The proposed methods are evaluated in a simulated environment. The results show that the proposed methods estimate the bounds tighter than the existing method, and the estimation is improved by nearly 20% in the best case.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131744409","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}
引用次数: 1
A Trusted Opportunistic Routing Algorithm for Vanet 一种基于Vanet的可信机会路由算法
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.28
Jie Zhizhong, Huang Chuanhe, Xu Liya, Wang Bo, Chen Xi, Fan Xiying
{"title":"A Trusted Opportunistic Routing Algorithm for Vanet","authors":"Jie Zhizhong, Huang Chuanhe, Xu Liya, Wang Bo, Chen Xi, Fan Xiying","doi":"10.1109/ICNDC.2012.28","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.28","url":null,"abstract":"VANET is an emerging paradigm in the domain of wireless network, and a reliable and efficient routing protocol is in urgent need among vehicles connections. As a possible solution, opportunistic routing (OR) has received much attention recently. This research focuses on the aspect of soft security by building a trust opportunistic forwarding model in VANET. It incorporates the trust mechanism into OR to enhance the security of routing in resisting malicious attacks. And a minimum cost routing algorithm (TMCOR) is put forward. The simulation results show that TMCOR outperforms ExOR in terms of throughput, average delay and security gains.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116838555","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}
引用次数: 28
An Easy Matrix Computation Based Simulator of NDN 一种简便的基于矩阵计算的NDN模拟器
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.17
Xiaoke Jiang, J. Bi, Youjie Wang, Pingping Li, Zhaogeng Li
{"title":"An Easy Matrix Computation Based Simulator of NDN","authors":"Xiaoke Jiang, J. Bi, Youjie Wang, Pingping Li, Zhaogeng Li","doi":"10.1109/ICNDC.2012.17","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.17","url":null,"abstract":"This paper presents an easy matrix computation based simulator of NDN network architecture. This simulator is just like Newtonian mechanics in some way, once given the system initial state, routing table, content distribution, initial data requesting information of NDN network, the simulator can figure out all of the subsequent network state based on matrix operation. This simulator turns packet process event, such as interest generating, interest forwarding, content hitting and transmitting, to matrix computation on the network scale. This simulator is much easier to use than NS3 and CCNx, but it can provide similar simulation result and more details. And the computational complexity depends on number of involved contents and nodes, which makes analysis between small group of nodes and contents very simple and fast.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121061339","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}
引用次数: 2
Research on the Restraint Mechanism for the Low-carbon Operation of Industrial Cluster 产业集群低碳运行的约束机制研究
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.51
Sun-tao Qin, Ji-feng Xu
{"title":"Research on the Restraint Mechanism for the Low-carbon Operation of Industrial Cluster","authors":"Sun-tao Qin, Ji-feng Xu","doi":"10.1109/ICNDC.2012.51","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.51","url":null,"abstract":"The article analyzed the dynamic mechanism of the low-carbon operation of industrial clusters from the preferences of the individuals in the industrial cluster in two aspects, i.e., saving cost and improving performance, trying to find out the solutions and instructive approaches for the overall low-carbon operation of industrial clusters based on the dynamic mechanism.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115918651","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}
引用次数: 0
A strategy for mesh client mobility support in wireless mesh networks 无线网状网络中网状客户端移动性支持策略
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.24
Lican Huang, Zhiwen Yan, Zhen Liu, Hao Huang
{"title":"A strategy for mesh client mobility support in wireless mesh networks","authors":"Lican Huang, Zhiwen Yan, Zhen Liu, Hao Huang","doi":"10.1109/ICNDC.2012.24","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.24","url":null,"abstract":"Mesh Client (MC) may be frequently move from the current SMAP to another SMAP in the Wireless Mesh Networks (WMN). The most of the present research papers on WMN assume that the MC is static or quasi static. However, MC may constantly move actually, which connection interruption and packet loss may occur. To solve these problems this paper presents a mobility support strategy for WMN, which consists of two parts: address assignment and mobility management.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670899","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}
引用次数: 2
A Virtual View Synthesis Algorithm Based on Image Inpainting 一种基于图像绘制的虚拟视图合成算法
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.44
Huayang Wu, Jie Feng, Huaxiong Zhang, Qiankun Lv
{"title":"A Virtual View Synthesis Algorithm Based on Image Inpainting","authors":"Huayang Wu, Jie Feng, Huaxiong Zhang, Qiankun Lv","doi":"10.1109/ICNDC.2012.44","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.44","url":null,"abstract":"The virtual view synthesis is a key technique in 3D video applications. In this paper, a new algorithm based on image in painting is proposed. Firstly, the depth image is processed by automatic segmentation to recognize the foreground and background. In order to reduce the big holes generated by view warping, in painting is processed on the edge between foreground and background according to the disparity. Then depth image based rendering(DIBR) is processed to foreground image. Finally the two generated images are merged to obtain the virtual view image. Experimental results show that the proposed method can obtain satisfactory rendering results.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127316784","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}
引用次数: 2
Development of Communication Interface for Vortex Flowmeter Platform Based on Embedded µC / OS-III 基于嵌入式µC / OS-III的涡流流量计平台通信接口开发
2012 Third International Conference on Networking and Distributed Computing Pub Date : 2012-10-21 DOI: 10.1109/ICNDC.2012.43
Huang Jing, Chen Hao, Zhang Hanbo
{"title":"Development of Communication Interface for Vortex Flowmeter Platform Based on Embedded µC / OS-III","authors":"Huang Jing, Chen Hao, Zhang Hanbo","doi":"10.1109/ICNDC.2012.43","DOIUrl":"https://doi.org/10.1109/ICNDC.2012.43","url":null,"abstract":"In order to accomplish the field bus and intelligence transformation for traditional vortex flow meter, we design a platform embedded µC/OS-III and develop a complete set of HART and RS485 communication interface on this platform. It can be easily composed with traditional vortex flow meter to achieve function of remote control and collection in the case of minor change to the originals. With this platform's help, traditional vortex flow meter can upgrade quickly and improve the market competitiveness.","PeriodicalId":151593,"journal":{"name":"2012 Third International Conference on Networking and Distributed Computing","volume":"1560 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122358783","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}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信