Journal of Computer Science and Technology最新文献_第7页

A Dataset and Post-Processing Method for Pointing Device Human-Machine Interface Evaluation 指向设备人机界面评价的数据集及后处理方法

3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-10-25 DOI: 10.24215/16666038.23.e11

Rocío Madou, Federico N. Guerrero, Enrique M. Spinelli

引用次数: 0

Publication of Linked Open Data – A Systematic Literature Review for Identifying Problems and Technical Tools Supporting the Process 链接开放数据的出版-识别问题和支持该过程的技术工具的系统文献综述

3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-10-25 DOI: 10.24215/16666038.23.e16

Jairo H. Silva Aguilar, Rommel Torres T., Elsa Estevez

{"title":"Publication of Linked Open Data – A Systematic Literature Review for Identifying Problems and Technical Tools Supporting the Process","authors":"Jairo H. Silva Aguilar, Rommel Torres T., Elsa Estevez","doi":"10.24215/16666038.23.e16","DOIUrl":"https://doi.org/10.24215/16666038.23.e16","url":null,"abstract":"On the Internet, we find a large amount of information from government institutions that has been published in open format. However, only a part of these data is available in standard formats such as Resource Description Framework (RDF), and to a lesser extent, is published as Linked Open Data (LOD). The main objective of the research presented in this paper is to identify problems and tools used in the process of publishing LOD with the purpose of establishing a basis for the construction of a future framework that will help public institutions to facilitate such processes. To fulfill the objective, we conducted a systematic literature review in order to assess the state-of-the-art in this matter. The contribution of this work is to identify the frequent problems that arise in the LOD publishing process. It also provides a detail of the frameworks proposed in scientific papers grouping the technical tools by phases that correspond to the LOD publication life cycle. In addition, it compiles the characteristics of the ETL (Extract-Transform-Load) tools that predominate in this review, such as Pentaho Data Integration (Kettle) and OpenRefine.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"44 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135218923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Intermediate Task Fine-Tuning in Cancer Classification 癌症分类中的中间任务微调

3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-10-25 DOI: 10.24215/16666038.23.e12

Mario Alejandro García, Martín Nicolás Gramática, Juan Pablo Ricapito

引用次数: 0

A Model of Reusable Assets in AIE Software Systems AIE软件系统中的可重用资产模型

3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-10-25 DOI: 10.24215/16666038.23.e13

Agustina Buccella, Alejandra Cechich, Carolina Villegas, Ayelén Montenegro, Angel Muñoz, Andrea Rodriguez

引用次数: 0

A Methodology for Generating Virtual Reality Immersion Metrics based on System Variables 一种基于系统变量的虚拟现实沉浸度量生成方法

3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-10-25 DOI: 10.24215/16666038.23.e08

Matias Selzer, Silvia M. Castro

{"title":"A Methodology for Generating Virtual Reality Immersion Metrics based on System Variables","authors":"Matias Selzer, Silvia M. Castro","doi":"10.24215/16666038.23.e08","DOIUrl":"https://doi.org/10.24215/16666038.23.e08","url":null,"abstract":"Technological advances in recent years have promoted the development of virtual reality systems that have awide variety of hardware and software characteristics, providing varying degrees of immersion. Immersionis an objective property of the virtual reality system that depends on both its hardware and softwarecharacteristics. Virtual reality systems are currently attempting to improve immersion as much as possible.However, there is no metric to measure the level of immersion of a virtual reality system based onits characteristics. To date, the influence of these hardware and software variables on immersion hasonly been considered individually or in small groups. The way these system variables simultaneously affectimmersion has not been analyzed either. In this paper, we propose immersion metrics for virtualreality systems based on their hardware and software variables, as well as the development process that ledto their formulation. From the conducted experiment and the obtained data, we followed a methodology togenerate immersion models based on the variables of the system. The immersion metrics presented in thiswork offer a useful tool in the area of virtual reality and immersive technologies, not only to measurethe immersion of any virtual reality system but also to analyze the relationship and importance of thevariables of these systems.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"18 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135170815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dalea: A Persistent Multi-Level Extendible Hashing with Improved Tail Performance Dalea:具有改进尾部性能的持久多级可扩展散列

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-09-30 DOI: 10.1007/s11390-023-2957-8

Zi-Wei Xiong, De-Jun Jiang, Jin Xiong, Ren Ren

{"title":"Dalea: A Persistent Multi-Level Extendible Hashing with Improved Tail Performance","authors":"Zi-Wei Xiong, De-Jun Jiang, Jin Xiong, Ren Ren","doi":"10.1007/s11390-023-2957-8","DOIUrl":"https://doi.org/10.1007/s11390-023-2957-8","url":null,"abstract":"Persistent memory (PM) promises byte-addressability, large capacity, and durability. Main memory systems, such as key-value stores and in-memory databases, benefit from such features of PM. Due to the great popularity of hashing index in main memory systems, a number of research efforts are made to provide high average performance persistent hashing. However, suboptimal tail performance in terms of tail throughput and tail latency is still observed for existing persistent hashing. In this paper, we analyze major sources of suboptimal tail performance from key design issues of persistent hashing. We identify the global hash structure and concurrency control as remaining explorable design spaces for improving tail performance. We propose Directory-sharing Multi-level Extendible Hashing (Dalea) for PM. Dalea designs ancestor link-based extendible hashing as well as fine-grained transient lock to address the two main sources (rehashing and locking) affecting tail performance. The evaluation results show that, compared with state-of-the-art persistent hashing Dash, Dalea achieves increased tail throughput by 4.1x and reduced tail latency by 5.4x. Moreover, in order to provide design guidelines for improving tail performance, we adopt Dalea as a testbed to identify different impacts of four factors on tail performance, including fine-grained rehashing, transient locking, memory pre-allocation, and fingerprinting.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"4 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Chinese Named Entity Recognition Augmented with Lexicon Memory 词汇记忆增强的中文命名实体识别

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-09-30 DOI: 10.1007/s11390-021-1153-y

Yi Zhou, Xiao-Qing Zheng, Xuan-Jing Huang

引用次数: 4

VTensor: Using Virtual Tensors to Build a Layout-Oblivious AI Programming Framework VTensor:使用虚拟张量构建无关布局的AI编程框架

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-09-30 DOI: 10.1007/s11390-022-1457-6

Feng Yu, Jia-Cheng Zhao, Hui-Min Cui, Xiao-Bing Feng, Jingling Xue

{"title":"VTensor: Using Virtual Tensors to Build a Layout-Oblivious AI Programming Framework","authors":"Feng Yu, Jia-Cheng Zhao, Hui-Min Cui, Xiao-Bing Feng, Jingling Xue","doi":"10.1007/s11390-022-1457-6","DOIUrl":"https://doi.org/10.1007/s11390-022-1457-6","url":null,"abstract":"Tensors are a popular programming interface for developing artificial intelligence (AI) algorithms. Layout refers to the order of placing tensor data in the memory and will affect performance by affecting data locality; therefore the deep neural network library has a convention on the layout. Since AI applications can use arbitrary layouts, and existing AI systems do not provide programming abstractions to shield the layout conventions of libraries, operator developers need to write a lot of layout-related code, which reduces the efficiency of integrating new libraries or developing new operators. Furthermore, the developer assigns the layout conversion operation to the internal operator to deal with the uncertainty of the input layout, thus losing the opportunity for layout optimization. Based on the idea of polymorphism, we propose a layout-agnostic virtual tensor programming interface, namely the VTensor framework, which enables developers to write new operators without caring about the underlying physical layout of tensors. In addition, the VTensor framework performs global layout inference at runtime to transparently resolve the required layout of virtual tensors, and runtime layout-oriented optimizations to globally minimize the number of layout transformation operations. Experimental results demonstrate that with VTensor, developers can avoid writing layout-dependent code. Compared with TensorFlow, for the 16 operations used in 12 popular networks, VTensor can reduce the lines of code (LOC) of writing a new operation by 47.82% on average, and improve the overall performance by 18.65% on average.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"4 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cognition: Accurate and Consistent Linear Log Parsing Using Template Correction 认知:使用模板校正进行准确一致的线性日志解析

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-09-30 DOI: 10.1007/s11390-021-1691-3

Ran Tian, Zu-Long Diao, Hai-Yang Jiang, Gao-Gang Xie

{"title":"Cognition: Accurate and Consistent Linear Log Parsing Using Template Correction","authors":"Ran Tian, Zu-Long Diao, Hai-Yang Jiang, Gao-Gang Xie","doi":"10.1007/s11390-021-1691-3","DOIUrl":"https://doi.org/10.1007/s11390-021-1691-3","url":null,"abstract":"Logs contain runtime information for both systems and users. As many of them use natural language, a typical log-based analysis needs to parse logs into the structured format first. Existing parsing approaches often take two steps. The first step is to find similar words (tokens) or sentences. Second, parsers extract log templates by replacing different tokens with variable placeholders. However, we observe that most parsers concentrate on precisely grouping similar tokens or logs. But they do not have a well-designed template extraction process, which leads to inconsistent accuracy on particular datasets. The root cause is the ambiguous definition of variable placeholders and similar templates. The consequences include abuse of variable placeholders, incorrectly divided templates, and an excessive number of templates over time. In this paper, we propose our online log parsing approach Cognition. It redefines variable placeholders via a strict lower bound to avoid ambiguity first. Then, it applies our template correction technique to merge and absorb similar templates. It eliminates the interference of commonly used parameters and thus isolates template quantity. Evaluation through 16 public datasets shows that Cognition has better accuracy and consistency than the state-of-the-art approaches. It also saves up to 52.1% of time cost on average than the others.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"9 4 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Model Checking for Probabilistic Multiagent Systems 概率多智能体系统的模型检验

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-09-30 DOI: 10.1007/s11390-022-1218-6

Chen Fu, Andrea Turrini, Xiaowei Huang, Lei Song, Yuan Feng, Li-Jun Zhang

{"title":"Model Checking for Probabilistic Multiagent Systems","authors":"Chen Fu, Andrea Turrini, Xiaowei Huang, Lei Song, Yuan Feng, Li-Jun Zhang","doi":"10.1007/s11390-022-1218-6","DOIUrl":"https://doi.org/10.1007/s11390-022-1218-6","url":null,"abstract":"In multiagent systems, agents usually do not have complete information of the whole system, which makes the analysis of such systems hard. The incompleteness of information is normally modelled by means of accessibility relations, and the schedulers consistent with such relations are called uniform. In this paper, we consider probabilistic multiagent systems with accessibility relations and focus on the model checking problem with respect to the probabilistic epistemic temporal logic, which can specify both temporal and epistemic properties. However, the problem is undecidable in general. We show that it becomes decidable when restricted to memoryless uniform schedulers. Then, we present two algorithms for this case: one reduces the model checking problem into a mixed integer non-linear programming (MINLP) problem, which can then be solved by Satisfiability Modulo Theories (SMT) solvers, and the other is an approximate algorithm based on the upper confidence bounds applied to trees (UCT) algorithm, which can return a result whenever queried. These algorithms have been implemented in an existing model checker and then validated on experiments. The experimental results show the efficiency and extendability of these algorithms, and the algorithm based on UCT outperforms the one based on MINLP in most cases.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":"14 1","pages":""},"PeriodicalIF":1.9,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138540026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0