Journal of Information Processing最新文献_第3页

A Real-time Background Replacement System Based on Estimated Depth for AR Applications AR应用中基于估计深度的实时背景替换系统

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.758

Yoshihiro Tsuboki, Tomoya Kawakami, Satoru Matsumoto, Tomoki Yoshihisa, Yuuichi Teranishi

引用次数: 0

Investigating Weird Latency Deterioration of Solid-state Drives 调查固态硬盘奇怪的延迟恶化

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.743

Daiki Natori, Takahiro Hirofuchi, Ryousei Takano, Saneyasu Yamaguchi

引用次数: 0

Do Developers Present Proficient Code Snippets in Their README Files? An Analysis of PyPI Libraries in GitHub 开发人员是否在他们的自述文件中呈现熟练的代码片段?GitHub中的PyPI库分析

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.679

Supavas Sitthithanasakul, Bodin Chinthanet, Raula Gaikovina Kula, Natthakit Netsiwawichian, Pattara Leelaprute, Bundit Manaskasemsak, Arnon Rungsawang, Kenichi Matsumoto

{"title":"Do Developers Present Proficient Code Snippets in Their README Files? An Analysis of PyPI Libraries in GitHub","authors":"Supavas Sitthithanasakul, Bodin Chinthanet, Raula Gaikovina Kula, Natthakit Netsiwawichian, Pattara Leelaprute, Bundit Manaskasemsak, Arnon Rungsawang, Kenichi Matsumoto","doi":"10.2197/ipsjjip.31.679","DOIUrl":"https://doi.org/10.2197/ipsjjip.31.679","url":null,"abstract":"A README file plays an essential role as the face of a software project and the initial point of contact for developers in Open Source Software (OSS) projects. The code snippet ranks among the most important content in the README file for demonstrating the usage of software and APIs. While easy to comprehend, code snippets are preferred by clients in order to quickly understand software usage and features. However, proficient code snippets are sometimes found in README files. In this paper, we first investigate the prevalence of each competency level of Python code snippets in the README files. Then, we analyze the relationships between the usage of proficient code snippets and topics of libraries. From our empirical study on 1, 620 README files of PyPI libraries, we find that developers mainly present 92% of basic elements in code snippets. However, developers are likely to present proficient elements in code snippets from topics about Application Framework, Quality Assurance, and User Interface. We therefore (i) encourage developers to mainly present basic code snippets in their README files to attract more newcomers, and (ii) suggest that clients try to understand proficient code snippets if they are adopting libraries from previously mentioned topics.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135443093","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 Evaluation of Parallel Sortings on the Supercomputer Fugaku 超级计算机Fugaku上并行排序的性能评价

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.452

Tomoyuki Tokuue, Tomoaki Ishiyama

{"title":"Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku","authors":"Tomoyuki Tokuue, Tomoaki Ishiyama","doi":"10.2197/ipsjjip.31.452","DOIUrl":"https://doi.org/10.2197/ipsjjip.31.452","url":null,"abstract":"Sorting is one of the most basic algorithms, and developing highly parallel sorting programs is becoming increasingly important in high-performance computing because the number of CPU cores per node in modern supercomputers tends to increase. In this study, we have implemented two multi-threaded sorting algorithms based on samplesort and compared their performance on the supercomputer Fugaku. The first algorithm divides an input sequence into multiple blocks, sorts each block, and then selects pivots by sampling from each block at regular intervals. Each block is then partitioned using the pivots, and partitions in different blocks are merged into a single sorted sequence. The second algorithm differs from the first one in only selecting pivots, where the binary search is used to select pivots such that the number of elements in each partition is equal. We compare the performance of the two algorithms with different sequential sorting and multiway merging algorithms. We demonstrate that the second algorithm with BlockQuicksort (a quicksort accelerated by reducing conditional branches) for sequential sorting and the selection tree for merging shows consistently high speed and high parallel efficiency for various input data types and data sizes.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136116571","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

Content-based Retrieval of 3D CAD Subassemblies Using 3D Radon Transform 基于内容的三维CAD子组件三维Radon变换检索

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.734

Kaoru Katayama, Youta Yamaji, Shotaro Toyoizumi, Takashi Hirashima

{"title":"Content-based Retrieval of 3D CAD Subassemblies Using 3D Radon Transform","authors":"Kaoru Katayama, Youta Yamaji, Shotaro Toyoizumi, Takashi Hirashima","doi":"10.2197/ipsjjip.31.734","DOIUrl":"https://doi.org/10.2197/ipsjjip.31.734","url":null,"abstract":"We propose a content-based method for retrieving the 3D CAD assemblies which contain or are contained in the assembly given as a query from a database. The retrieval is based on ranking assemblies in the database according to their content rates which are different criteria from the similarities of shapes. The content rate is computed by comparing the projections of components constituting an assembly in the database with those of components constituting the query. We use the 3D Radon transform to obtain the projections. In existing methods for retrieving CAD models, projections of each model onto 2D planes, which are a set of two-dimensional data, are often used to compute the similarity between them. The proposed method simplifies the process of comparing the projections of components because the projections using the 3D Radon transform are a set of one-dimensional data. The method has the unique feature of identifying the component layouts, which reflect the technical know-how and information of the product designers. The components which have the same shapes but different properties such as material names are also distinguished based on their layouts without depending on the labels assigned to the properties. Other than our previous method, no existing methods possess such features. We show that the proposed method has better performance in the retrieval precision and processing time than the previous method.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135703759","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

Refinement Types for Call-by-name Programs 按名称调用程序的细化类型

Journal of Information Processing Pub Date : 2023-01-01 DOI: 10.2197/ipsjjip.31.708

Ryosuke Sato

引用次数: 0

Software Analytics for Manual Activities using Developer Work Elements 使用开发人员工作元素的手工活动的软件分析

Journal of Information Processing Pub Date : 2020-01-01 DOI: 10.2197/IPSJJIP.28.279

Peraphon Sopahtsathit

{"title":"Software Analytics for Manual Activities using Developer Work Elements","authors":"Peraphon Sopahtsathit","doi":"10.2197/IPSJJIP.28.279","DOIUrl":"https://doi.org/10.2197/IPSJJIP.28.279","url":null,"abstract":": Software Engineering is a diverse and highly flexible discipline that can be practiced using a development model of developer choosing. Unfortunately, existing state-of-the-practice software engineering development models do not take human effort into consideration as there is no applicable metrics to gauge the associating manual activity. This study presents a novel discretization technique as a software analytic to estimate the manual effort expended on software development process. The proposed technique classifies three manual activity domains, namely, abstract, concrete, and unclassified. The units of classification are called Developer Work Elements (DevWE). The sequence of DevWE denotes a development analytic in three visual aids, namely, symbolic flow map, operation chart, and workload breakdown chart. These give rise to the determination of efforts expended which are measured by COSMIC Function Point. The result can be combined with those traditional software measurable activities to yield accurate total project effort estimation. Major contributions of this prospectus encompass (1) discretization DevWE analytic for manual effort estimation, (2) the visual three-chart aids support for operation trace, monitor, improve, and control, and (3) finding on almost half the effort estimation of a software project is manual activity.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"28 1","pages":"279-291"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68500885","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

Generalized Hierarchical Word Sequence Framework for Language Modeling 用于语言建模的广义层次词序列框架

Journal of Information Processing Pub Date : 2017-06-15 DOI: 10.5715/JNLP.24.395

Xiaoyi Wu, Kevin Duh, Yuji Matsumoto

引用次数: 0

Extending Various Thesauri by Finding Synonym Sets from a Formal Concept Lattice 通过从形式概念格中查找同义词集来扩展各种同义词库

Journal of Information Processing Pub Date : 2017-06-15 DOI: 10.5715/JNLP.24.323

Madori Ikeda, Akihiro Yamamoto

{"title":"Extending Various Thesauri by Finding Synonym Sets from a Formal Concept Lattice","authors":"Madori Ikeda, Akihiro Yamamoto","doi":"10.5715/JNLP.24.323","DOIUrl":"https://doi.org/10.5715/JNLP.24.323","url":null,"abstract":"In this paper, we solve the problem of extending various thesauri using a single method. Thesauri should be extended when unregistered terms are identified. Various thesauri are available, each of which is constructed according to a unique design principle. We formalise the extension of one thesaurus as a single classification problem in machine learning, with the goal of solving different classification problems. Applying existing classification methods to each thesaurus is time consuming, particularly if many thesauri must be extended. Thus, we propose a method to reduce the time required to extend multiple thesauri. In the proposed method, we first generate clusters of terms without the thesauri that are candidates for synonym sets based on formal concept analysis using the syntactic information of terms in a corpus. Reliable syntactic parsers are easy to use; thus, syntactic information is more available for many terms than semantic information. With syntactic information, for each thesaurus and for all unregistered terms, we can search candidate clusters quickly for a correct synonym set for fast classification. Experimental results demonstrate that the proposed method is faster than existing methods and classification accuracy is comparable.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"24 1","pages":"323-349"},"PeriodicalIF":0.0,"publicationDate":"2017-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48694991","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

Construction of a Multilingual Annotated Corpus for Deeper Sentiment Understanding in Social Media 构建多语言注释语料库以加深对社交媒体情感的理解

Journal of Information Processing Pub Date : 2017-03-15 DOI: 10.5715/JNLP.24.205

Yujie Lu, Kotaro Sakamoto, Hideyuki Shibuki, Tatsunori Mori

引用次数: 7