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

A Probabilistic Framework for Temporal Cognitive Diagnosis in Online Learning Systems 在线学习系统中的时态认知诊断概率框架

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-022-1332-5

Jia-Yu Liu, Fei Wang, Hai-Ping Ma, Zhen-Ya Huang, Qi Liu, En-Hong Chen, Yu Su

{"title":"A Probabilistic Framework for Temporal Cognitive Diagnosis in Online Learning Systems","authors":"Jia-Yu Liu, Fei Wang, Hai-Ping Ma, Zhen-Ya Huang, Qi Liu, En-Hong Chen, Yu Su","doi":"10.1007/s11390-022-1332-5","DOIUrl":"https://doi.org/10.1007/s11390-022-1332-5","url":null,"abstract":"Cognitive diagnosis is an important issue of intelligent education systems, which aims to estimate students’ proficiency on specific knowledge concepts. Most existing studies rely on the assumption of static student states and ignore the dynamics of proficiency in the learning process, which makes them unsuitable for online learning scenarios. In this paper, we propose a unified temporal item response theory (UTIRT) framework, incorporating temporality and randomness of proficiency evolving to get both accurate and interpretable diagnosis results. Specifically, we hypothesize that students’ proficiency varies as a Wiener process and describe a probabilistic graphical model in UTIRT to consider temporality and randomness factors. Furthermore, based on the relationship between student states and exercising answers, we hypothesize that the answering result at time k contributes most to inferring a student's proficiency at time k, which also reflects the temporality aspect and enables us to get analytical maximization (M-step) in the expectation maximization (EM) algorithm when estimating model parameters. Our UTIRT is a framework containing unified training and inferencing methods, and is general to cover several typical traditional models such as Item Response Theory (IRT), multidimensional IRT (MIRT), and temporal IRT (TIRT). Extensive experimental results on real-world datasets show the effectiveness of UTIRT and prove its superiority in leveraging temporality theoretically and practically over TIRT.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657134","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

wrBench: Comparing Cache Architectures and Coherency Protocols on ARMv8 Many-Core Systems wrBench：比较 ARMv8 多核系统上的高速缓存架构和一致性协议

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-021-1251-x

Wan-Rong Gao, Jian-Bin Fang, Chun Huang, Chuan-Fu Xu, Zheng Wang

{"title":"wrBench: Comparing Cache Architectures and Coherency Protocols on ARMv8 Many-Core Systems","authors":"Wan-Rong Gao, Jian-Bin Fang, Chun Huang, Chuan-Fu Xu, Zheng Wang","doi":"10.1007/s11390-021-1251-x","DOIUrl":"https://doi.org/10.1007/s11390-021-1251-x","url":null,"abstract":"Cache performance is a critical design constraint for modern many-core systems. Since the cache often works in a “black-box” manner, it is difficult for the software to reason about the cache behavior to match the running software to the underlying hardware. To better support code optimization, we need to understand and characterize the cache behavior. While cache performance characterization is heavily studied on traditional x86 architectures, there is little work for understanding the cache implementations on emerging ARMv8-based many-cores. This paper presents a comprehensive study to evaluate the cache architecture design on three representative ARMv8 multi-cores, Phytium 2000+, ThunderX2, and Kunpeng 920 (KP920). To this end, we develop wrBench, a micro-benchmark suite to measure the realized latency and bandwidth of caches at different memory hierarchies when performing core-to-core communication. Our evaluation provides inter-core latency and bandwidth in different cache levels and coherency states for the three ARMv8 many-cores. The quantitative performance data is shown in tables. We mine the characteristics of caches and coherency protocols by analyzing the data for the three processors, Phytium 2000+, ThunderX2, and KP920. Our paper also provides discussions and guidelines for optimizing memory access on ARMv8 many-cores.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657221","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

Unsupervised Domain Adaptation on Sentence Matching Through Self-Supervision 通过自我监督实现句子匹配的无监督领域自适应

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-022-1479-0

Gui-Rong Bai, Qing-Bin Liu, Shi-Zhu He, Kang Liu, Jun Zhao

{"title":"Unsupervised Domain Adaptation on Sentence Matching Through Self-Supervision","authors":"Gui-Rong Bai, Qing-Bin Liu, Shi-Zhu He, Kang Liu, Jun Zhao","doi":"10.1007/s11390-022-1479-0","DOIUrl":"https://doi.org/10.1007/s11390-022-1479-0","url":null,"abstract":"Although neural approaches have yielded state-of-the-art results in the sentence matching task, their performance inevitably drops dramatically when applied to unseen domains. To tackle this cross-domain challenge, we address unsupervised domain adaptation on sentence matching, in which the goal is to have good performance on a target domain with only unlabeled target domain data as well as labeled source domain data. Specifically, we propose to perform self-supervised tasks to achieve it. Different from previous unsupervised domain adaptation methods, self-supervision can not only flexibly suit the characteristics of sentence matching with a special design, but also be much easier to optimize. When training, each self-supervised task is performed on both domains simultaneously in an easy-to-hard curriculum, which gradually brings the two domains closer together along the direction relevant to the task. As a result, the classifier trained on the source domain is able to generalize to the unlabeled target domain. In total, we present three types of self-supervised tasks and the results demonstrate their superiority. In addition, we further study the performance of different usages of self-supervised tasks, which would inspire how to effectively utilize self-supervision for cross-domain scenarios.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657374","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

Shapelet Based Two-Step Time Series Positive and Unlabeled Learning 基于小形的两步时间序列正向和非标记学习

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-022-1320-9

Han-Bo Zhang, Peng Wang, Ming-Ming Zhang, Wei Wang

引用次数: 0

Visual Topic Semantic Enhanced Machine Translation for Multi-Modal Data Efficiency 视觉主题语义增强型机器翻译提高多模态数据效率

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-023-1302-6

Chao Wang, Si-Jia Cai, Bei-Xiang Shi, Zhi-Hong Chong

{"title":"Visual Topic Semantic Enhanced Machine Translation for Multi-Modal Data Efficiency","authors":"Chao Wang, Si-Jia Cai, Bei-Xiang Shi, Zhi-Hong Chong","doi":"10.1007/s11390-023-1302-6","DOIUrl":"https://doi.org/10.1007/s11390-023-1302-6","url":null,"abstract":"The scarcity of bilingual parallel corpus imposes limitations on exploiting the state-of-the-art supervised translation technology. One of the research directions is employing relations among multi-modal data to enhance performance. However, the reliance on manually annotated multi-modal datasets results in a high cost of data labeling. In this paper, the topic semantics of images is proposed to alleviate the above problem. First, topic-related images can be automatically collected from the Internet by search engines. Second, topic semantics is sufficient to encode the relations between multi-modal data such as texts and images. Specifically, we propose a visual topic semantic enhanced translation (VTSE) model that utilizes topic-related images to construct a cross-lingual and cross-modal semantic space, allowing the VTSE model to simultaneously integrate the syntactic structure and semantic features. In the above process, topic similar texts and images are wrapped into groups so that the model can extract more robust topic semantics from a set of similar images and then further optimize the feature integration. The results show that our model outperforms competitive baselines by a large margin on the Multi30k and the Ambiguous COCO datasets. Our model can use external images to bring gains to translation, improving data efficiency.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657107","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

M-LSM: An Improved Multi-Liquid State Machine for Event-Based Vision Recognition M-LSM：用于基于事件的视觉识别的改进型多液态机器

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-021-1326-8

Lei Wang, Sha-Sha Guo, Lian-Hua Qu, Shuo Tian, Wei-Xia Xu

引用次数: 0

A Novel Three-Staged Generative Model for Skeletonizing Chinese Characters with Versatile Styles 一种新颖的三阶段生成模型，用于以多种风格对汉字进行骨骼化处理

IF 1.9 3区计算机科学

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

Ye-Chuan Tian, Song-Hua Xu, Cheickna Sylla

{"title":"A Novel Three-Staged Generative Model for Skeletonizing Chinese Characters with Versatile Styles","authors":"Ye-Chuan Tian, Song-Hua Xu, Cheickna Sylla","doi":"10.1007/s11390-023-1337-8","DOIUrl":"https://doi.org/10.1007/s11390-023-1337-8","url":null,"abstract":"Skeletons of characters provide vital information to support a variety of tasks, e.g., optical character recognition, image restoration, stroke segmentation and extraction, and style learning and transfer. However, automatically skeletonizing Chinese characters poses a steep computational challenge due to the large volume of Chinese characters and their versatile styles, for which traditional image analysis approaches are error-prone and fragile. Current deep learning based approach requires a heavy amount of manual labeling efforts, which imposes serious limitations on the precision, robustness, scalability and generalizability of an algorithm to solve a specific problem. To tackle the above challenge, this paper introduces a novel three-staged deep generative model developed as an image-to-image translation approach, which significantly reduces the model’s demand for labeled training samples. The new model is built upon an improved G-net, an enhanced X-net, and a newly proposed F-net. As compellingly demonstrated by comprehensive experimental results, the new model is able to iteratively extract skeletons of Chinese characters in versatile styles with a high quality, which noticeably outperforms two state-of-the-art peer deep learning methods and a classical thinning algorithm in terms of F-measure, Hausdorff distance, and average Hausdorff distance.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657101","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

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions 部分布尔函数的精确单查询量子算法的特征

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-022-1361-0

Ze-Kun Ye, Lv-Zhou Li

{"title":"Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions","authors":"Ze-Kun Ye, Lv-Zhou Li","doi":"10.1007/s11390-022-1361-0","DOIUrl":"https://doi.org/10.1007/s11390-022-1361-0","url":null,"abstract":"The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity than its classical counterpart. In the history of quantum algorithms, the Deutsch algorithm and the Deutsch-Jozsa algorithm play a fundamental role and both are exact one-query quantum algorithms. This leads us to consider the problem: what functions can be computed by exact one-query quantum algorithms? This problem has been addressed in the literature for total Boolean functions and symmetric partial Boolean functions, but is still open for general partial Boolean functions. Thus, in this paper, we continue to characterize the computational power of exact one-query quantum algorithms for general partial Boolean functions. First, we present several necessary and sufficient conditions for a partial Boolean function to be computed by exact one-query quantum algorithms. Second, inspired by these conditions, we discover some new representative functions that can be computed by exact one-query quantum algorithms but have an essential difference from the already known ones. Specially, it is worth pointing out that before our work, the known functions that can be computed by exact one-query quantum algorithms are all symmetric functions and the quantum algorithm used is essentially the Deutsch-Jozsa algorithm, whereas the functions discovered in this paper are generally asymmetric and new algorithms to compute these functions are required. Thus, this expands the class of functions that can be computed by exact one-query quantum algorithms.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657365","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

Community-Preserving Social Graph Release with Node Differential Privacy 具有节点差异隐私的社群保护型社交图谱发布

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-021-1270-7

Sen Zhang, Wei-Wei Ni, Nan Fu

{"title":"Community-Preserving Social Graph Release with Node Differential Privacy","authors":"Sen Zhang, Wei-Wei Ni, Nan Fu","doi":"10.1007/s11390-021-1270-7","DOIUrl":"https://doi.org/10.1007/s11390-021-1270-7","url":null,"abstract":"The goal of privacy-preserving social graph release is to protect individual privacy while preserving data utility. Community structure, which is an important global pattern of nodes, is a crucial data utility as it is fundamental to many graph analysis tasks. Yet, most existing methods with differential privacy (DP) commonly fall into edge-DP to sacrifice security in exchange for utility. Moreover, they reconstruct graphs from the local feature-extraction of nodes, resulting in poor community preservation. Motivated by this, we develop PrivCom, a strict node-DP graph release algorithm to maximize the utility on the community structure while maintaining a higher level of privacy. In this algorithm, to reduce the huge sensitivity, we devise a Katz index based private graph feature extraction method, which can capture global graph structure features while greatly reducing the global sensitivity via a sensitivity regulation strategy. Yet, under the condition that the sensitivity is fixed, the feature captured by the Katz index, which is presented in matrix form, requires privacy budget splits. As a result, plenty of noise is injected, mitigating global structural utility. To bridge this gap, we design a private eigenvector estimation method, which yields noisy eigenvectors from extracted low-dimensional vectors. Then, a dynamic privacy budget allocation method with provable utility guarantees is developed to preserve the inherent relationship between eigenvalues and eigenvectors, so that the utility of the generated noise Katz matrix is well maintained. Finally, we reconstruct the synthetic graph via calculating its Laplacian with the noisy Katz matrix. Experimental results confirm our theoretical findings and the efficacy of PrivCom.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139659448","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

Hardware Acceleration for SLAM in Mobile Systems 移动系统中 SLAM 的硬件加速

IF 1.9 3区计算机科学

Journal of Computer Science and Technology Pub Date : 2023-11-30 DOI: 10.1007/s11390-021-1523-5

Zhe Fan, Yi-Fan Hao, Tian Zhi, Qi Guo, Zi-Dong Du

{"title":"Hardware Acceleration for SLAM in Mobile Systems","authors":"Zhe Fan, Yi-Fan Hao, Tian Zhi, Qi Guo, Zi-Dong Du","doi":"10.1007/s11390-021-1523-5","DOIUrl":"https://doi.org/10.1007/s11390-021-1523-5","url":null,"abstract":"The emerging mobile robot industry has spurred a flurry of interest in solving the simultaneous localization and mapping (SLAM) problem. However, existing SLAM platforms have difficulty in meeting the real-time and low-power requirements imposed by mobile systems. Though specialized hardware is promising with regard to achieving high performance and lowering the power, designing an efficient accelerator for SLAM is severely hindered by a wide variety of SLAM algorithms. Based on our detailed analysis of representative SLAM algorithms, we observe that SLAM algorithms advance two challenges for designing efficient hardware accelerators: the large number of computational primitives and irregular control flows. To address these two challenges, we propose a hardware accelerator that features composable computation units classified as the matrix, vector, scalar, and control units. In addition, we design a hierarchical instruction set for coping with a broad range of SLAM algorithms with irregular control flows. Experimental results show that, compared against an Intel x86 processor, on average, our accelerator with the area of 7.41 mm2 achieves 10.52x and 112.62x better performance and energy savings, respectively, across different datasets. Compared against a more energy-efficient ARM Cortex processor, our accelerator still achieves 33.03x and 62.64x better performance and energy savings, respectively.","PeriodicalId":50222,"journal":{"name":"Journal of Computer Science and Technology","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139657106","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