J. Inf. Process.最新文献

Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku 超级计算机Fugaku上并行排序的性能评价

J. Inf. Process. Pub Date : 2023-05-09 DOI: 10.48550/arXiv.2305.05245

Tomoyuki Tokuue, T. Ishiyama

{"title":"Performance Evaluation of Parallel Sortings on the Supercomputer Fugaku","authors":"Tomoyuki Tokuue, T. Ishiyama","doi":"10.48550/arXiv.2305.05245","DOIUrl":"https://doi.org/10.48550/arXiv.2305.05245","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":430763,"journal":{"name":"J. Inf. Process.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115622974","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

Type checking data structures more complex than trees 类型检查数据结构比树更复杂

J. Inf. Process. Pub Date : 2022-09-12 DOI: 10.48550/arXiv.2209.05149

J. Sano, Naoki Yamamoto, K. Ueda

引用次数: 0

Nearest Neighbor Non-autoregressive Text Generation 最近邻非自回归文本生成

J. Inf. Process. Pub Date : 2022-08-26 DOI: 10.48550/arXiv.2208.12496

Ayana Niwa, Sho Takase, Naoaki Okazaki

引用次数: 5

Improving Logical-Level Natural Language Generation with Topic-Conditioned Data Augmentation and Logical Form Generation 用主题条件数据增强和逻辑形式生成改进逻辑级自然语言生成

J. Inf. Process. Pub Date : 2021-12-12 DOI: 10.2197/ipsjjip.31.332

Ao Liu, Congjian Luo, Naoaki Okazaki

{"title":"Improving Logical-Level Natural Language Generation with Topic-Conditioned Data Augmentation and Logical Form Generation","authors":"Ao Liu, Congjian Luo, Naoaki Okazaki","doi":"10.2197/ipsjjip.31.332","DOIUrl":"https://doi.org/10.2197/ipsjjip.31.332","url":null,"abstract":"Logical Natural Language Generation, i.e., generating textual descriptions that can be logically entailed by a structured table, has been a challenge due to the low fidelity of the generation. citet{chen2020logic2text} have addressed this problem by annotating interim logical programs to control the generation contents and semantics, and presented the task of table-aware logical form to text (Logic2text) generation. However, although table instances are abundant in the real world, logical forms paired with textual descriptions require costly human annotation work, which limits the performance of neural models. To mitigate this, we propose topic-conditioned data augmentation (TopicDA), which utilizes GPT-2 to generate unpaired logical forms and textual descriptions directly from tables. We further introduce logical form generation (LG), a dual task of Logic2text that requires generating a valid logical form based on a text description of a table. We also propose a semi-supervised learning approach to jointly train a Logic2text and an LG model with both labeled and augmented data. The two models benefit from each other by providing extra supervision signals through back-translation. Experimental results on the Logic2text dataset and the LG task demonstrate that our approach can effectively utilize the augmented data and outperform supervised baselines by a substantial margin.","PeriodicalId":430763,"journal":{"name":"J. Inf. Process.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115138487","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

Work-stealing Strategies That Consider Work Amount and Hierarchy 考虑工作量和等级的偷工作策略

J. Inf. Process. Pub Date : 2021-06-15 DOI: 10.2197/ipsjjip.29.478

Ryusuke Nakashima, M. Yasugi, Hiroshi Yoritaka, Tasuku Hiraishi, Seiji Umatani

引用次数: 1

Localization with Portable APs in Ultra-Narrow-Band-based LPWA Networks 基于超窄带LPWA网络的便携式ap定位

J. Inf. Process. Pub Date : 2021-02-15 DOI: 10.2197/ipsjjip.29.149

Miya Fukumoto, Takuya Yoshihiro

{"title":"Localization with Portable APs in Ultra-Narrow-Band-based LPWA Networks","authors":"Miya Fukumoto, Takuya Yoshihiro","doi":"10.2197/ipsjjip.29.149","DOIUrl":"https://doi.org/10.2197/ipsjjip.29.149","url":null,"abstract":": For IoT applications LPWA is a useful communication choice that enables us to connect tiny devices spread over the land to the Internet. Since many low-price IoT devices usually need to work with limited power budget, this kind of low-power long-range communication technique is a strong tool to populate IoT deployment. Since LPWA de- vices are less functional, localization of devices are addressed as one of the important practical problems. UNB (Ultra Narrow Band)-based LPWA networks such as Sigfox are one of the major LPWA services for IoT applications, which have a long communication range more than 10km. However, due to the long-range communications and the property of UNB-based modulation, it is not possible to use state-of-the-art localization techniques with high-accuracy; UNB- based LPWA should use simple methods based on RSSI (Radio Signal Strength Indicator) that involves large position estimation errors. In this paper, we propose a method to improve accuracy of device localization in UNB-based LPWA networks by utilizing portable Access Points (APs). By introducing a distance-based weighting technique, we improve the localization accuracy in combination with stationary and portable APs. We demonstrated that the portable AP and the new weighting technique e ﬀ ectively works in UNB-based LPWA networks.","PeriodicalId":430763,"journal":{"name":"J. Inf. Process.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117101998","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 Adaptive Traffic Signal Control Scheme Based on Back-pressure with Global Information 基于背压全局信息的自适应交通信号控制方案

J. Inf. Process. Pub Date : 2021-02-15 DOI: 10.2197/ipsjjip.29.124

Arnan Maipradit, Tomoya Kawakami, Ying Liu, Juntao Gao, Minuro Ito

引用次数: 1

Split-Paper Testing: A Novel Approach to Evaluate Programming Performance 拆纸测试:一种评估编程性能的新方法

J. Inf. Process. Pub Date : 2020-10-29 DOI: 10.2197/ipsjjip.28.733

Yasuichi Nakayama, Y. Kuno, Hiroyasu Kakuda

{"title":"Split-Paper Testing: A Novel Approach to Evaluate Programming Performance","authors":"Yasuichi Nakayama, Y. Kuno, Hiroyasu Kakuda","doi":"10.2197/ipsjjip.28.733","DOIUrl":"https://doi.org/10.2197/ipsjjip.28.733","url":null,"abstract":": There is a great need to evaluate and / or test programming performance. For this purpose, two schemes have been used. Constructed response (CR) tests let the examinee write programs on a blank sheet (or with a computer keyboard). This scheme can evaluate the programming performance. However, it is di ﬃ cult to apply in a large volume because skilled human graders are required (automatic evaluation is attempted but not widely used yet). Multiple choice (MC) tests let the examinee choose the correct answer from a list (often corresponding to the “hidden” portion of a complete program). This scheme can be used in a large volume with computer-based testing or mark-sense cards. However, many teachers and researchers are suspicious in that a good score does not necessarily mean the ability to write programs from scratch. We propose a third method, split-paper (SP) testing. Our scheme splits a correct program into each of its lines, shu ﬄ es the lines, adds “wrong answer” lines, and prepends them with choice symbols. The examinee answers by using a list of choice symbols corresponding to the correct program, which can be easily graded automatically by using computers. In particular, we propose the use of edit distance (Levenshtein distance) in the scoring scheme, which seems to have a ﬃ nity with the SP scheme. The research question is whether SP tests scored by using an edit-distance-based scoring scheme measure programming performance as do CR tests. Therefore, we conducted an experiment by using college programming classes with 60 students to compare SP tests against CR tests. As a result, SP and CR test scores are correlated for multiple settings, and the results were statistically signiﬁcant. Therefore, we might conclude that SP tests with automatic scoring using edit distance are useful tools for evaluating the programming performance.","PeriodicalId":430763,"journal":{"name":"J. Inf. Process.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842017","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

CENTAURUS: A Dynamic Parser Generator for Parallel Ad Hoc Data Extraction 半人马座:一个动态解析器生成器，用于并行自组织数据提取

J. Inf. Process. Pub Date : 2020-10-23 DOI: 10.2197/ipsjjip.28.724

Shigeyuki Sato, Hiroka Ihara, K. Taura

引用次数: 0

IoT Area Network Simulator For Network Dataset Generation 用于网络数据集生成的物联网局域网模拟器

J. Inf. Process. Pub Date : 2020-10-15 DOI: 10.2197/ipsjjip.28.668

Van Cu Pham, Yoshiki Makino, Khoa Pho, Yuto Lim, Yasuo Tan

引用次数: 2