2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)最新文献

筛选
英文 中文
Sociolinguistics and programming 社会语言学和程序设计
F. Naz, J. Rice
{"title":"Sociolinguistics and programming","authors":"F. Naz, J. Rice","doi":"10.1109/PACRIM.2015.7334812","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334812","url":null,"abstract":"This paper focuses on the use of machine learning techniques for the analysis of computer programs in order to acquire information about an author's gender. There are few existing studies that address the relationship between linguistics and programming; however, in many areas where language is analyzed it is possible to mine important information about the users of that language associated with set of attribute or coding style. In this work we use open source implementations of machine learning algorithms, specifically, nearest neighbor (K*), decision tree (J48), and Bayes classifier (Naïve Bayes). These algorithms were applied to C++ programs which were associated with sociolinguistic information about the program authors. Our goal was to classify the programs according to the gender of the author. As indicated by our initial results we have been able to achieve precision of 72.3%, recall of 72%, and f-measure of 71.9% which demonstrates that we can predict the gender of the authors of C++ programs.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122903221","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
Interleaved generic-point parallel scalar multiplication 交错泛点并行标量乘法
T. Al-Somani
{"title":"Interleaved generic-point parallel scalar multiplication","authors":"T. Al-Somani","doi":"10.1109/PACRIM.2015.7334816","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334816","url":null,"abstract":"This paper presents an efficient scheme for generic-point postcomputation-based parallel scalar multiplication. The proposed scheme processes more than one request simultaneously by interleaving parallel scalar multiplications. The results show that the proposed scheme outperforms the previous postcomputation-based methods when the consecutive requests number is eight or more. Furthermore, the proposed scheme is scalable for any number of parallel processors and performs better as the number of consecutive requests increases. Accordingly, the proposed scheme is very attractive for use in high-performance end servers that use parallel elliptic curve processors.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115965431","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
Review and analysis of web prefetching web预取的回顾与分析
YuFeng Deng, S. Manoharan
{"title":"Review and analysis of web prefetching","authors":"YuFeng Deng, S. Manoharan","doi":"10.1109/PACRIM.2015.7334806","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334806","url":null,"abstract":"Web caching is widely used to cache resources that have already been used and reuse them in near future. Prefetching, in comparison, is a technique to cache resources that have never been used. The core of prefetching is prediction - predicting which resources might be used in the the near future. Prefetching is a technology that has been actively studied in the recent years. Most of the modern browsers have built-in mechanisms for prefetching. Some modern websites also add prefetching support to enhance performance. Although prefetch can reduce user-perceived latency, it may increase bandwidth requirements, cause security issues, and trigger unexpected actions. This paper reviews prefetching features of some of the most popular modern web browsers and websites and discusses the problems that prefetching could cause.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124986171","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}
引用次数: 7
Partitioning algorithms for improving efficiency of topic modeling parallelization 提高主题建模并行化效率的划分算法
Hung Nghiep Tran, A. Takasu
{"title":"Partitioning algorithms for improving efficiency of topic modeling parallelization","authors":"Hung Nghiep Tran, A. Takasu","doi":"10.1109/PACRIM.2015.7334854","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334854","url":null,"abstract":"Topic modeling is a very powerful technique in data analysis and data mining but it is generally slow. Many parallelization approaches have been proposed to speed up the learning process. However, they are usually not very efficient because of the many kinds of overhead, especially the load-balancing problem. We address this problem by proposing three partitioning algorithms, which either run more quickly or achieve better load balance than current partitioning algorithms. These algorithms can easily be extended to improve parallelization efficiency on other topic models similar to LDA, e.g., Bag of Timestamps, which is an extension of LDA with time information. We evaluate these algorithms on two popular datasets, NIPS and NYTimes. We also build a dataset containing over 1,000,000 scientific publications in the computer science domain from 1951 to 2010 to experiment with Bag of Timestamps parallelization, which we design to demonstrate the proposed algorithms' extensibility. The results strongly confirm the advantages of these algorithms.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114198394","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
An optimization-based mesh-generation method for image representation 一种基于优化的图像表示网格生成方法
Seyedali Mostafavian, M. Adams
{"title":"An optimization-based mesh-generation method for image representation","authors":"Seyedali Mostafavian, M. Adams","doi":"10.1109/PACRIM.2015.7334840","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334840","url":null,"abstract":"In earlier work, Tu and Adams proposed the ERDED method, an effective technique for generating triangle-mesh models of digital images through explicit representation of discontinuities. In this paper, we propose a modified version of the ERDED method that generates a triangle mesh which better approximates the original image using an optimization-based algorithm. The proposed method is shown to produce image approximations of higher quality than those obtained by the ERDED method, both in terms of squared error and subjective quality. Moreover, this improvement in quality comes at a relatively modest computational cost, with the proposed method typically taking only a few seconds of computation time.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"20 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998147","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
Implementation and performance analysis of 3-D cone and frustum filters 三维锥锥滤波器的实现与性能分析
Hussam Shubayli, C. Edussooriya, I. Moazzen, P. Agathoklis, L. Bruton
{"title":"Implementation and performance analysis of 3-D cone and frustum filters","authors":"Hussam Shubayli, C. Edussooriya, I. Moazzen, P. Agathoklis, L. Bruton","doi":"10.1109/PACRIM.2015.7334879","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334879","url":null,"abstract":"Two novel computationally efficient implementations for 3-D FIR cone filters are proposed in this paper. In the proposed implementations, the well-known 1-D quadrature mirror cosine modulated and 1-D directly designed temporal filter banks are cascaded with 2-D FIR circularly symmetric lowpass spatial filters to approximate the cone-shaped passband. Furthermore, the 3-D FIR frustum filters are derived from the proposed 3-D FIR cone filter implementations. The proposed implementations provide additional 2 dB signal-to-interference-and-noise ratio improvement compared to previously reported 3-D FIR cone and frustum filter implementations with reduced or equivalent computational complexity.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115908110","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
Ingredient substitute recommendation for allergy-safe cooking based on food context 根据食物环境对过敏安全烹饪的替代成分推荐
A. Ooi, Toshiya Iiba, Kosuke Takano
{"title":"Ingredient substitute recommendation for allergy-safe cooking based on food context","authors":"A. Ooi, Toshiya Iiba, Kosuke Takano","doi":"10.1109/PACRIM.2015.7334878","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334878","url":null,"abstract":"With the increasing number of food-allergenic patients, we have many online services providing allergy-safe food recipes; however, the number of the allergy-safe food recipes is much smaller than ordinary food recipes. It is deemed that we can have more allergy-safe food recipes, if allergy-free ingredients could be extracted from the large number of the ordinary food recipes. However, it is difficult to extract substitute ingredients suitable for certain food only by specifying allergy ingredients in the recipe, because not every potential substitute ingredient works the same way in a recipe. In this study, we propose an ingredient substitute suggestion method for allergy-safe cooking based on food context as extracted by examining recipe similarity. By considering food context for allergy ingredients, the precision of extracting allergy-free ingredients can be improved. In the experiments, we confirm the feasibility of our proposed method.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125943801","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}
引用次数: 8
Improvement of strong migration method to manage multithreaded agents and implementation of mechanisms for sharing information of agents in AgentSphere 在AgentSphere中改进了多线程代理管理的强迁移方法,实现了代理信息共享机制
K. Hasumi, M. Kai
{"title":"Improvement of strong migration method to manage multithreaded agents and implementation of mechanisms for sharing information of agents in AgentSphere","authors":"K. Hasumi, M. Kai","doi":"10.1109/PACRIM.2015.7334839","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334839","url":null,"abstract":"We the authors of this study use mobile agents with capability of strong migration to develop AgentSphere, a platform for an autonomous parallel and distributed processing system that significantly reduces loads of the complex execution control for its users. We have successfully executed the strong migration of agents on JVM by converting their source codes. However, there has been an issue that the overhead becomes larger accompanied by migration such as when saving or restoring the data in the stack area, or when migration to the resuming position occurs during the execution of the program. In order to improve this issue, a new mechanism for the strong migration using JavaFlow was built. We report that we also built the information sharing mechanism using a distributed hash table so both the user and the system can share information of each agent effectively.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645677","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
Scalable RDF triple store using summary of hashed information and Bit comparison 可扩展的RDF三重存储,使用散列信息的摘要和位比较
Minho Bae, Hosik Park, Gibeom Lee, Junho Eum, Sangyoon Oh
{"title":"Scalable RDF triple store using summary of hashed information and Bit comparison","authors":"Minho Bae, Hosik Park, Gibeom Lee, Junho Eum, Sangyoon Oh","doi":"10.1109/PACRIM.2015.7334828","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334828","url":null,"abstract":"In this paper, we proposed a scalable RDF triple store for massive-scale RDF data that processes the SPARQL query with many join operations in efficient manner. Graph characteristic of RDF data model hinders scalable and efficient indexing and querying over RDF triples. To address the problem, our query processing uses the pruning algorithm based on Bit-structure and summarized information to minimize data-reading. Our approach guarantees scalability and flexibility even for massive-scale RDF data by storing RDF triples in distributed fashion, providing the modifiable structure, and optimizing memory footprint of usage. The experiments shows that our system is better performing for queries with many join operations while uses less memory footprints.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"133 39","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969975","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}
引用次数: 3
Enhancing RF energy harvesting performance with cooperative beam selection for wireless sensors 无线传感器协同波束选择提高射频能量收集性能
Wei Li, Tianming Wu, Hong-Chuan Yang
{"title":"Enhancing RF energy harvesting performance with cooperative beam selection for wireless sensors","authors":"Wei Li, Tianming Wu, Hong-Chuan Yang","doi":"10.1109/PACRIM.2015.7334892","DOIUrl":"https://doi.org/10.1109/PACRIM.2015.7334892","url":null,"abstract":"RF energy harvesting is a promising potential solution to provide convenient and perpetual energy supplies to low-power wireless sensor networks. In this paper, we investigate the energy harvesting performance of a wireless sensor node powered by harvesting RF energy from an existing multiple-antenna transmitter. Specifically, we propose a random unitary beamforming (RUB) based cooperative beam selection scheme to enhance the energy harvesting performance at the sensor. Under a constant total transmission power constraint, the multiple-antenna transmitter selects the best active beams for data transmission, while satisfying the energy harvesting requirement at the sensor. We derive an exact closed-form expression for the distribution function of harvested energy in a coherence time at the sensor, as well as the throughput of the existing system over Rayleigh fading channels. We further investigate the performance tradeoff of the average harvested energy at the sensor versus the throughput of the existing system.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077338","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
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学术文献互助群
群 号:604180095
Book学术官方微信