Informatica最新文献_第7页

Color image Steganography Based on Artificial DNA Computing 基于人工DNA计算的彩色图像隐写

4区计算机科学

Informatica Pub Date : 2023-09-28 DOI: 10.31449/inf.v47i8.4772

Najat Hameed Qasim Al-Iedani, Sahera A. Sead

引用次数: 0

Novel algorithm to construct QC-LDPC codes for high data rate applications 一种构造高数据速率QC-LDPC码的新算法

4区计算机科学

Informatica Pub Date : 2023-09-28 DOI: 10.31449/inf.v47i8.4937

Bhuvaneshwari Pitchaimuthu Vairaperumal, Tharini Chandrapragasam

{"title":"Novel algorithm to construct QC-LDPC codes for high data rate applications","authors":"Bhuvaneshwari Pitchaimuthu Vairaperumal, Tharini Chandrapragasam","doi":"10.31449/inf.v47i8.4937","DOIUrl":"https://doi.org/10.31449/inf.v47i8.4937","url":null,"abstract":"A novel algorithm to construct highly sparse, quasi-cyclic low-density parity check codes with large girth and high code rates that can be employed in high data rate applications is proposed. In this paper, a sparse girth six base matrix is designed, which is then substituted by a difference exponent matrix derived from a basic exponent matrix based on the powers of a primitive element in a finite field Fq, to build long code-length and high code rate QC-LDPC codes. The proposed exponent matrix generation is a one-time procedure and hence, less number of computations is involved. According to the simulation results, the proposed QC-LDPC code with high code rate showed faster encoding-decoding speeds and reduced storage overhead compared to conventional LDPC, conventional QC-LDPC codes, and traditional RS codes. Simulation results showed that the QC-LDPC codes constructed using the proposed algorithm performed very well over AWGN channel. Hardware implementation of the proposed high rate QC-LDPC code (N = 1248, R = 0.9) in Software Defined Radio platform using the NI USRP 2920 hardware device displays very low bit error rates compared to conventional QC-LDPC codes and conventional LDPC codes of similar size and rate. Thus, from both the simulation and hardware implementation results, the proposed QC-LDPC codes with high code rate were found to be suitable for high data rate applications such as cloud data storage systems and 5G wireless communication systems.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135388259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Study on Error Feature Analysis and Error Correction in English Translation Through Machine Translatio 基于机器翻译的英语翻译错误特征分析与纠错研究

4区计算机科学

Informatica Pub Date : 2023-09-18 DOI: 10.31449/inf.v47i8.4862

Guifang Tao

引用次数: 0

LP SVM with A Novel Similarity function Outperforms Powerful LP-QP-Kernel-SVM Considering Efficient Classification 基于新颖相似函数的LP支持向量机在分类效率方面优于强大的LP- qp -核支持向量机

IF 2.9 4区计算机科学

Informatica Pub Date : 2023-09-04 DOI: 10.31449/inf.v47i8.4767

Rezaul Karim, Mahmudul Hasan, Amit Kumar Kundu, Ali Ahmed Ave

{"title":"LP SVM with A Novel Similarity function Outperforms Powerful LP-QP-Kernel-SVM Considering Efficient Classification","authors":"Rezaul Karim, Mahmudul Hasan, Amit Kumar Kundu, Ali Ahmed Ave","doi":"10.31449/inf.v47i8.4767","DOIUrl":"https://doi.org/10.31449/inf.v47i8.4767","url":null,"abstract":"While the core quality of SVM comes from its ability to get the global optima, its classification performance also depends on computing kernels. However, while this kernel-complexity generates the power of machine, it is also responsible for the computational load to execute this kernel. Moreover, insisting on a similarity function to be a positive definite kernel demands some properties to be satisfied that seem unproductive sometimes raising a question about which similarity measures to be used for classifier. We model Vapnik’s LPSVM proposing a new similarity function replacing kernel function. Following the strategy of ”Accuracy first, speed second”, we have modelled a similarity function that is mathematically well-defined depending on analysis as well as geometry and complex enough to train the machine for generating solid generalization ability. Being consistent with the theory of learning by Balcan and Blum [1], our similarity function does not need to be a valid kernel function and demands less computational cost for executing compared to its counterpart like RBF or other kernels while provides sufficient power to the classifier using its optimal complexity. Benchmarking shows that our similarity function based LPSVM poses test error 0.86 times of the most powerful RBF based QP SVM but demands only 0.40 times of its computational cost.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"47 1","pages":""},"PeriodicalIF":2.9,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69808614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Low-Resource Neural Machine Translation Improvement Using Data Augmentation Strategies 基于数据增强策略的低资源神经机器翻译改进

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.4761

Thai Nguyen Quoc, Huong Le Thanh, Hanh Pham Van

引用次数: 0

Motion Embedded Images: An Approach to Capture Spatial and Temporal Features for Action Recognition 运动嵌入图像:一种捕捉动作识别的空间和时间特征的方法

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.4755

Tri Le, Nham Huynh-Duc, Chung Thai Nguyen, Minh-Triet Tran

{"title":"Motion Embedded Images: An Approach to Capture Spatial and Temporal Features for Action Recognition","authors":"Tri Le, Nham Huynh-Duc, Chung Thai Nguyen, Minh-Triet Tran","doi":"10.31449/inf.v47i3.4755","DOIUrl":"https://doi.org/10.31449/inf.v47i3.4755","url":null,"abstract":"The demand for human activity recognition (HAR) from videos has witnessed a significant surge in various real-life applications, including video surveillance, healthcare, elderly care, among others. The explotion of short-form videos on social media platforms has further intensified the interest in this domain. This research endeavors to focus on the problem of HAR in general short videos. In contrast to still images, video clips offer both spatial and temporal information, rendering it challenging to extract complementary information on appearance from still frames and motion between frames. This research makes a two-fold contribution. Firstly, we investigate the use of motion-embedded images in a variant of two-stream Convolutional Neural Network architecture, in which one stream captures motion using combined batches of frames, while another stream employs a normal image classification ConvNet to classify static appearance. Secondly, we create a novel dataset of Southeast Asian Sports short videos that encompasses both videos with and without effects, which is a modern factor that is lacking in all currently available datasets used for benchmarking models. The proposed model is trained and evaluated on two benchmarks: UCF-101 and SEAGS-V1. The results reveal that the proposed model yields competitive performance compared to prior attempts to address the same problem.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136349752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Hybrid Deep Learning Approach to Keyword Spotting in Vietnamese Stele Images 越南石碑图像关键字识别的混合深度学习方法

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.4785

Anna Scius-Bertrand, Marc Bui, Andreas Fischer

引用次数: 0

Lightweight Multi-Objective and Many-Objective Problem Formulations for Evolutionary Neural Architecture Search with the Training-Free Performance Metric Synaptic Flow 基于无训练性能度量突触流的进化神经结构搜索的轻量级多目标和多目标问题公式

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.4736

An Vo, Tan Ngoc Pham, Van Bich Nguyen, Ngoc Hoang Luong

{"title":"Lightweight Multi-Objective and Many-Objective Problem Formulations for Evolutionary Neural Architecture Search with the Training-Free Performance Metric Synaptic Flow","authors":"An Vo, Tan Ngoc Pham, Van Bich Nguyen, Ngoc Hoang Luong","doi":"10.31449/inf.v47i3.4736","DOIUrl":"https://doi.org/10.31449/inf.v47i3.4736","url":null,"abstract":"Neural architecture search (NAS) with naive problem formulations and applications of conventional search algorithms often incur prohibitive search costs due to the evaluations of many candidate architectures. For each architecture, its accuracy performance can be properly evaluated after hundreds (or thousands) of computationally expensive training epochs are performed to achieve proper network weights. A so-called zero-cost metric, Synaptic Flow, computed based on random network weight values at initialization, is found to exhibit certain correlations with the neural network test accuracy and can thus be used as an efficient proxy performance metric during the search. Besides, NAS in practice often involves not only optimizing for network accuracy performance but also optimizing for network complexity, such as model size, number of floating point operations, or latency, as well. In this article, we study various NAS problem formulations in which multiple aspects of deep neural networks are treated as multiple optimization objectives. We employ a widely-used multi-objective evolutionary algorithm, i.e., the non-dominated sorting genetic algorithm II (NSGA-II), to approximate the optimal Pareto-optimal fronts for these NAS problem formulations. Experimental results on the NAS benchmark NATS-Bench show the advantages and disadvantages of each formulation.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136349976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Complaints with Target Scope Identification on Social Media 社交媒体上有目标范围识别的投诉

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.4758

Kazuhiro Ito, Taichi Murayama, Shuntaro Yada, Shoko Wakamiya, Eiji Aramaki

{"title":"Complaints with Target Scope Identification on Social Media","authors":"Kazuhiro Ito, Taichi Murayama, Shuntaro Yada, Shoko Wakamiya, Eiji Aramaki","doi":"10.31449/inf.v47i3.4758","DOIUrl":"https://doi.org/10.31449/inf.v47i3.4758","url":null,"abstract":"A complaint is uttered when reality fails to meet one's expectations. Research on complaints, which contributes to our understanding of basic human behavior, has been conducted in the fields of psychology, linguistics, and marketing. Although several approaches have been implemented to the study of complaints, studies have yet focused on a target scope of complaints. Examination of a target scope of complaints is crusial because the functions of complaints, such as evocation of emotion, use of grammar, and intention, are different depending on the target scope. We first tackle the construction and release of a complaint dataset of 6,418 tweets by annotating Japanese texts collected from Twitter with labels of the target scope. Our dataset is available at url{https://github.com/sociocom/JaGUCHI}. We then benchmark the annotated dataset with several machine learning baselines and obtain the best performance of 90.4 F1-score in detecting whether a text was a complaint or not, and a micro-F1 score of 72.2 in identifying the target scope label. Finally, we conducted case studies using our model to demonstrate that identifying a target scope of complaints is useful for sociological analysis.","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136349758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Introduction to special issue "SOICT 2022" 《SOICT 2022》特刊简介

4区计算机科学

Informatica Pub Date : 2023-08-29 DOI: 10.31449/inf.v47i3.5142

Huynh Thi Thanh Binh, Ichiro Ide

引用次数: 0