Int. J. Softw. Informatics最新文献_第5页

Time Series Data Cleaning under Multi-Speed Constraints 多速度约束下的时间序列数据清理

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/IJSI.1673-7288.00239

Fei Gao, Shaoxu Song, Jianmin Wang

引用次数: 3

Transfer-based Adversarial Attack with Rectified Adam and Color Invariance 基于纠偏亚当和颜色不变性的转移对抗攻击

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00283

Jia Ding, Zhiwu Xu

引用次数: 0

Image Style Transfering Based on StarGAN and Class Encoder 基于StarGAN和类编码器的图像样式传输

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00267

Xinzheng Xu, Jianying Chang, Shifei Ding

引用次数: 0

Preface to the Special Issue on Robust Machine Learning for Open Scenarios 开放场景鲁棒机器学习特刊前言

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00265

Enhong Chen, Yufeng Li, Q. Zou

引用次数: 0

Smooth Intervention Model of Individual Interactive Behavior 个体互动行为的平滑干预模型

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00256

Xinyu Liu, Zhaohui Zhang, Ziming Wei, Pengwei Wang

引用次数: 0

AlphaQO: Robust Learned Query Optimizer AlphaQO:稳健学习查询优化器

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00275

Xiang Yu, Chengliang Chai, Xinning Zhang, N. Tang, Ji Sun, Guoliang Li

引用次数: 0

Multi-path Back-propagation Method for Neural Network Verification 神经网络验证的多路径反向传播方法

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00281

Ye Zheng, Xiaomu Shi, Jiaxiang Liu

引用次数: 0

Deep Learning Test Optimization Method Using Multi-objective Optimization 基于多目标优化的深度学习测试优化方法

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00282

Yanzhou Mu, Zan Wang, Xiang Chen, Junjie Chen, Jingke Zhao, Jianmin Wang

引用次数: 2

Towards an Interoperable Metamodel Suite: Size Assessment as One Input 迈向可互操作的元模型套件:规模评估作为一个输入

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.13039/501100000923

B. Henderson-Sellers, M. A. Qureshi, Cesar Gonzalez-Perez

{"title":"Towards an Interoperable Metamodel Suite: Size Assessment as One Input","authors":"B. Henderson-Sellers, M. A. Qureshi, Cesar Gonzalez-Perez","doi":"10.13039/501100000923","DOIUrl":"https://doi.org/10.13039/501100000923","url":null,"abstract":"In recent years, many metamodels have been introduced in the software engi- neering literature and standards. These metamodels vary in their focus across, for example, process, product, organizational and measurement aspects of software development and have typically been developed independently of each other with shared concepts being only ac- cidental. There is thus an increasing concern in the standards communities that possible con∞icts of structure and semantics between these various metamodels will hinder their widespread adoption. The complexity of these metamodels has also increased signiflcantly and is another barrier in their appreciation. This complexity is compounded when more than one metamodel is used in the lifecycle of a software project. Therefore there is a need to have interoperable metamodels. As a flrst step towards engendering interoperability and/or possible mergers between metamodels, we examine the size and complexity of various meta- models. To do this, we have used the Rossi and Brinkkemper metrics-based approach to evaluate the size and complexity of several standard metamodels including UML 2.3, BPMN 2.0, ODM, SMM and OSM. The size and complexity of these metamodels is also compared with the previous version of UML, BPMN and Activity diagrams. The comparatively large sizes of BPMN 2.0 and UML 2.3 suggest that future integration with these metamodels might be more di-cult than with the other metamodels under study (especially ODM, SSM and OSM).","PeriodicalId":218849,"journal":{"name":"Int. J. Softw. Informatics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132368923","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}

引用次数: 6

Minimal-unsatisfiable-core-driven Local Explainability Analysis for Random Forest 随机森林的最小-不满意核驱动局部可解释性分析

Int. J. Softw. Informatics Pub Date : 1900-01-01 DOI: 10.21655/ijsi.1673-7288.00280

Shucen Ma, Jianqi Shi, Yanhong Huang, S. Qin, Zhé Hóu

引用次数: 1