2017 International Conference on Computer, Information and Telecommunication Systems (CITS)最新文献

筛选
英文 中文
Web Service framework to translate text into sign language Web服务框架,将文本翻译成手语
Teranai Vichyaloetsiri, Pongpisit Wuttidittachotti
{"title":"Web Service framework to translate text into sign language","authors":"Teranai Vichyaloetsiri, Pongpisit Wuttidittachotti","doi":"10.1109/CITS.2017.8035336","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035336","url":null,"abstract":"This research presents a new framework using web services to translate text into a sign language animated GIF. When users enter a sentence, the web service will analyzes the sentence using the longest words from a dictionary, then produces a series of images per word and integrates all images into an animated GIF. This will help the hearing impairment to access more facilities. In addition, the framework can support entrepreneurs to create content that is able to communicate with and accessible by people with hearing loss. This framework is provided by a Web Service (Representational State Transfer: REST) and sends information through JavaScript Object Notation (JSON). REST and JSON are convenient to use and can be utilized by many platforms and devices. Finally, this framework could be further developed to other basic services for the hearing impaired.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267264","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}
引用次数: 10
Genetically Inspired Contact Plan Design in Small Satellite Networks 小型卫星网络中受基因启发的接触计划设计
Cuiqin Dai, Huang Tang
{"title":"Genetically Inspired Contact Plan Design in Small Satellite Networks","authors":"Cuiqin Dai, Huang Tang","doi":"10.1109/CITS.2017.8035308","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035308","url":null,"abstract":"Aiming at scheduling links efficiently, Contact Plan Design (CPD) has been playing an increasingly prominent role in the resource-limited Small Satellite Networks (SSNs). In CPD, the transfer stages of bundles should be coordinated arrange. Neglecting such feature in the bundle transmission undoubtedly deteriorate the network performance. For this issue, an algorithm named Genetically Inspired Contact Plan (GICP) is proposed by jointly considering the features of Contact Plans (CPs) and Genetic Approaches (GAs). The first main step in the proposed scheme is encoding, which represents CPs as strings of binary values that easy to process. Then, the strings are repaired and evaluated that satisfy the requirements. Finally, a genetically inspired operation that simulate the biological competition is introduced to obtain CPs with lower delivery time. The simulation results show that GICP can outperform the traditional GAs in terms of delivery time and target fitness.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123602204","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
3D face reconstruction based on progressive cascade regression 基于递进级联回归的三维人脸重建
Lihua Han, Quan Xiao, X. Liang
{"title":"3D face reconstruction based on progressive cascade regression","authors":"Lihua Han, Quan Xiao, X. Liang","doi":"10.1109/CITS.2017.8035340","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035340","url":null,"abstract":"In order to better learn the distributions of 2D and 3D faces and the mapping between them with limited training samples, a new 3D face reconstruction method based on progressive cascade regression is proposed. Firstly, it learns the mapping between 2D and 3D facial landmarks to estimate the initial 3D facial landmarks with a coupled space learning method. Secondly, a deformed space is constructed with the difference between the estimated initial landmarks and the ground truth of training samples; and more accurate 3D facial landmarks are reconstructed by modifying the initial 3D ones with shape compensations which are calculated by minimizing an objective function. Finally, the realistic 3D faces are reconstructed by a method that is based on a simple sparse regulation and shape deformation. The results on BJUT 3D face database demonstrate the effectiveness of the proposed method. In addition, compared with some typical methods, the method can get better subjective and objective results, especially in details.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132897626","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
Quality management system of GMAW based on network GMAW基于网络的质量管理体系
Xiaoxiao Zhou, Kehong Wang, Yuehai Feng, Yong Huang
{"title":"Quality management system of GMAW based on network","authors":"Xiaoxiao Zhou, Kehong Wang, Yuehai Feng, Yong Huang","doi":"10.1109/CITS.2017.8035313","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035313","url":null,"abstract":"From process formulation, welding production to quality inspection, welding quality management needs the cooperation of many departments. In actual production, the repeated works, omissions, and other problems of the establishment of welding procedure specification (WPS) occur from time to time. Dynamic changes of welding current and voltage signals can reflect the performance of electric arc; unstable arc will result in the instability of welding process, and then cause the bad forming and quality. A system that can both manage the welding procedure and monitor the online welding quality is badly needed. Therefore, a quality management system of gas metal arc welding (GMAW) based on network was proposed. The system contains the management of welding procedure, and the online process monitor of GMAW. The management of welding procedure can not only manage the WPS, welding procedure qualification records (PQR), and the related information, but also establish new WPS based on cases or rules or the combination of the two. The WPS and welding parameters were connected by joint number cross database. The online monitor of welding process contains online acquisition, network transmission, analysis, and storage of the welding current and arc voltage parameters. And then the stability of welding process was evaluated based on the analysis results, such as the statistics and the current - voltage map, as well as the approximate entropy-support vector machine method.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131810064","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
The effect of spatial autocorrelation on spatial co-location pattern mining 空间自相关对空间共位模式挖掘的影响
Jiangli Duan, Lizhen Wang, Xin Hu
{"title":"The effect of spatial autocorrelation on spatial co-location pattern mining","authors":"Jiangli Duan, Lizhen Wang, Xin Hu","doi":"10.1109/CITS.2017.8035297","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035297","url":null,"abstract":"spatial co-location pattern mining is an important part of spatial data mining, and the purpose is to discover the coexistence spatial feature sets whose instances are frequently located together in a geographic space. However, it ignores the existence of autocorrelation features that is not associated with surrounding features. For example, “cactus” and “jerusalem artichoke” are two common plants in the desert, and it is easy to get prevalent pattern {cactus, jerusalem artichoke} for the existing spatial co-location pattern mining frameworks, but biologists have determined that “jerusalem artichoke” is a spatial autocorrelation feature so that above pattern is meaningless. To avoid getting prevalent patterns that contain spatial autocorrelation features, we propose an algorithm to find and remove the spatial autocorrelation feature from spatial data sets, so that we can get really meaningful prevalent co-location patterns, and the experimental results over synthetic/real data sets show the effectiveness and feasibility of our method.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133124831","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}
引用次数: 4
On achieving optimal congestion control for elastic traffic in cognitive radio ad hoc networks under predictable contact 可预测接触下认知无线电自组织网络弹性流量最优拥塞控制研究
Long Zhang, Yuqiong Cao, Haitao Xu
{"title":"On achieving optimal congestion control for elastic traffic in cognitive radio ad hoc networks under predictable contact","authors":"Long Zhang, Yuqiong Cao, Haitao Xu","doi":"10.1109/CITS.2017.8035276","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035276","url":null,"abstract":"In this paper, we investigate the congestion control problem for elastic traffic over cognitive radio ad hoc networks under predictable contact. In particular, we develop a differential game based framework achieving optimal congestion control, aiming to adjust the rate of flows from upstream secondary users (SUs) to bottleneck SU. The proposed framework can balance the predictable contact, noncooperation, and rate based congestion control among SUs while utilizing the spectrum opportunities vacated by primary users. Further, we also devise an optimal rate regulation algorithm, which guarantees the constraint of the saturation value of the buffer of bottleneck SU. The simulation results demonstrate the effectiveness and feasibility of our proposed congestion control scheme.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131276740","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 simple method to obtain relations among factor basis elements for special hyperelliptic curves 一种求特殊超椭圆曲线因子基元关系的简单方法
Jie Zhu, Maozhi Xu
{"title":"A simple method to obtain relations among factor basis elements for special hyperelliptic curves","authors":"Jie Zhu, Maozhi Xu","doi":"10.1109/CITS.2017.8035334","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035334","url":null,"abstract":"The main approach to solve hyperelliptic curve DLP is index calculus algorithm. One of the most important steps is to obtain relations among the factor basis elements. Although Nagao and Joux proposed decomposition methods respectively, their algorithms required solving a multi-variate system of non-linear equations. We propose a new method to find the relations among factor basis elements for a class of special hyperelliptic curves y2+y = x2g+1 + A0 over finite field K with the characteristic 2. Let G(x,y) = R(x)+yT(x) and H(x) be the norm of G(x,y). We prove that supp(div(G(x,y))) ⊆ supp(div(H(x)). Then we show how to obtain relations among factor basis, by solving several linear equations and univariate equations with relatively low degree. Let g be the genus of hyperelliptic curve. After (6g+3)! trials we may obtain a single relation. We also give some examples to illustrate the effectiveness of our algorithm when g = 2,3.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121858730","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
Performance analysis of VoWIFI on RAN 无线局域网上VoWIFI的性能分析
Yan Yang, Yong Qiu, Zhang Tao
{"title":"Performance analysis of VoWIFI on RAN","authors":"Yan Yang, Yong Qiu, Zhang Tao","doi":"10.1109/CITS.2017.8035274","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035274","url":null,"abstract":"With the rapid development of wireless technology, free or cheap voice communication has become more and more popular. But this cost-effective voice technology based on Wi-Fi, Voice over WIFI (VoWIFI), is lacking mature management and control system, especially there is still no relevant research on its RAN performance. This paper has three mainly contributes: 1) in the indoor environment, we studied the relationship between voice quality and signal quality of Wi-Fi; 2) in order to achieving high performance to improve the users' QoE, two types of voice quality are compared of the VoWIFI with VoWIFI only and VoWIFI adding download service, 3) according to the experimental data, an estimate method is proposed and verified for the VoWIFI performance based on signal quality of Wi-Fi.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"7 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114446","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
An improved changing-topology moving mesh method in OpenFOAM OpenFOAM中一种改进的变拓扑移动网格方法
Jinyu Wang, Xinhai Xu, Chao Li, Yuhua Tang
{"title":"An improved changing-topology moving mesh method in OpenFOAM","authors":"Jinyu Wang, Xinhai Xu, Chao Li, Yuhua Tang","doi":"10.1109/CITS.2017.8035337","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035337","url":null,"abstract":"In this paper, an improved changing-topology moving mesh method is developed in OpenFOAM (a widely used CFD software) to solve the moving boundary problem. We use mesh smoothing and edge swapping to improve the mesh quality, together with edge bisection and edge contraction to control the mesh resolution. In order to increase the mesh motion efficiency, a local refinement algorithm is realized. In addition, to ensure the regenerated mesh quality is higher than the original mesh, an improved checking algorithm is implemented during the mesh motion. The effectiveness of our method is demonstrated by simulations of the NACA0012 airfoil with translation, rotation and fish-like undulating locomotion.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704114","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
E-commerce purchase prediction approach by user behavior data 基于用户行为数据的电子商务购买预测方法
Ru Jia, Ru Li, Meiju Yu, Shanshan Wang
{"title":"E-commerce purchase prediction approach by user behavior data","authors":"Ru Jia, Ru Li, Meiju Yu, Shanshan Wang","doi":"10.1109/CITS.2017.8035294","DOIUrl":"https://doi.org/10.1109/CITS.2017.8035294","url":null,"abstract":"while e-commerce has grown quickly in recent years, more and more people are used to utilize this popular channel to purchase products and services on the Internet. Therefore, it becomes very important for shopping sites to predict precisely which items their customers would buy so as to increase sales or improve customer satisfaction. Traditional algorithms such as Collaborative Filtering, has been very popular in predicting users' preferences in movie, book, or music recommendation areas, but they face the problem that rating data is very sparse or even not available in shopping domain. Compared to the small amount of ratings in e-commerce shopping sites, the quantity of user clicking data is abundant and also contains sufficient information about users' purchase preferences. Therefore, in this paper we propose a prediction method based on probability statistics making use of user clicking behavior data. To evaluate the proposed approach, we use the data set provided by Ali Mobile Recommendation Competition held in 2015 which consisted of the huge amount of the clicking behavior log from 10,000 mobile users in one month. The experimental results show that our proposed method significantly alleviates the problem of data sparseness which traditional algorithms fail to deal with.","PeriodicalId":314150,"journal":{"name":"2017 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127572647","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}
引用次数: 17
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学术官方微信