检索结果-内蒙古大学图书馆

Studies in Big Data 2020年 80卷 91-105页

作者： Ali, Abbas M. Ghafoor, Kayhan Zrar Maghdid, Halgurd S. Mulahuwaish, Aos Department of Software Engineering Salahaddin University-Erbil Erbil Iraq School of Mathematics and Computer Science University of Wolverhampton Wulfruna Street WolverhamptonWV1 1LY United Kingdom Department of Software Engineering Faculty of Engineering Koya University Kurdistan Region Koysinjaq Iraq Department of Computer Science and Information Systems Saginaw Valley State University 7400 Bay Rd Science East 174 University Center Itta BenaMI48710 United States

In this paper, we performed a comparative analysis using machine learning algorithms named support vector machine (SVM), decision tree (DT), k-nearest neighbor (kNN), and convolution neural network (CNN) to classify pneumonia level (mild, progressive, and severe stage) of the COVID-19 confirmed patients. More precisely, the proposed model consists of two phases: first, the model computes the volume and density of lesions and opacities of the CT images using morphological approaches. In the second phase, we use machine learning algorithms to classify the pneumonia level of the confirmed COVID-19 patient. Extensive experiments have been carried out and the results show the accuracy of 91.304%, 91.4%, 87.5%, 95.622% for kNN, SVM, DT, and CNN, respectively. © Springer International Publishing AG 2018.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

Prioritized process test: An alternative to current process testing strategies

arXiv

引用

arXiv 2019年

作者： Bures, Miroslav Ahmed, Bestoun S. Zamli, Kamal Z. Department of Computer Science Faculty of Electrical Engineering Czech Technical University Karlovo nam. 13 Praha 2 121 35 Czech Republic Department of Mathematics and Computer Science Karlstad University Sweden IBM Center of Excellence Faculty of Computer Systems and Software Engineering University Malaysia Pahang Gambang Malaysia

Testing processes and workows in information and Internet of Things systems is a major part of the typical software testing effort. Consistent and efficient path-based test cases are desired to support these tests. Because certain parts of software system workows have a higher business priority than others, this fact has to be involved in the generation of test cases. In this paper, we propose a Prioritized Process Test (PPT), which is a model-based test case generation algorithm that represents an alternative to currently established algorithms that use directed graphs and test requirements to model the system under test. The PPT accepts a directed multigraph as a model to express priorities, and edge weights are used instead of test requirements. To determine the test-coverage level of test cases, a test-depth-level concept is *** compared the presented PPT with five alternatives (i.e., the Process Cycle Test, a naive reduction of test set created by the Process Cycle Test, Brute Force algorithm, Set-covering Based Solution and Matching-based Prefix Graph Solution) for edge coverage and edge-pair coverage. To assess the optimality of the path-based test cases produced by these strategies, we used fourteen metrics based on the properties of these test cases and 59 models that were created for three real-world systems. For all edge coverage, the PPT produced more optimal test cases than the alternatives in terms of the majority of the metrics. For edge-pair coverage, the PPT strategy yielded similar results to those of the alternatives. Thus, the PPT strategy is an applicable alternative, as it reects both the required test coverage level and the business priority in parallel. Copyright © 2019, The Authors. All rights reserved.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Particle Swarm Approach to Multiobjective Quadratic Assignment Problems

A Fuzzy Particle Swarm Approach to Multiobjective Quadratic ...

引用

Asia International Conference on Modeling & Simulation

作者： Mingyan Zhao Ajith Abraham Crina Grosan Hongbo Liu School of Software Dalian University of Technology Dalian China Centre for Quantifiable Quality of Service in Communication Systems Norwegian University of Science and Technology Trondheim Norway Department of Computer Science Faculty of Mathematics and Computer Science Babes Bolyai University Cluj-Napoca Romania School of Computer Science and Engineering Dalian Maritime University Dalian China

The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possible to simply weight the importance of each flow for the mQAP, it is best to use Pareto optimization to obtain the Pareto front or an approximation of it. Although Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems, research on mQAP has not much been investigated. This paper introduces a fuzzy particle swarm algorithm to handle the Multiobjective Quadratic Assignment Problem (mQAP). In the fuzzy scheme, the representations of the position and velocity of the particles in the conventional PSO is extended from the real vectors to fuzzy matrices. A new mapping is introduced between the particles in the swarm and the problem space in an efficient way. We evaluated the performance of the proposed approach. Empirical results illustrate that the approach can be applied for solving mQAP's very effectively.

关键词： Particle swarm optimization computer science Ant colony optimization Asia Mathematical model computer simulation Fuzzy systems Communication system software software quality Quality of service

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2009 spring symposia

Reports of the AAAI 2009 spring symposia

引用

作者： Bao, Jie Bojars, Uldis Choudhury, Tanzeem Ding, Li Greaves, Mark Kapoor, Ashish Louchart, Sandy Mehta, Manish Nebel, Bernhard Nirenburg, Sergei Oates, Tim Roberts, David L. Sanfilippo, Antonio Stojanovic, Nenad Stubbs, Kristen Thomaz, Andrea L. Tsui, Katherine Woelfl, Stefan Tetherless World Constellation Rensselaer Polytechnic Institute United States Social Software Unit of DERI Galway Ireland Computer Science Department Dartmouth College United States Knowledge Systems at Vulcan Inc United States Adaptive Systems and Interaction Group Microsoft Research Redmond United States School for Mathematics and Computer Sciences Heriot-Watt University United Kingdom School ot Interactive Computing Georgia Institute of Technology United States Department of Computer Science University of Freiburg Germany Computer Science and Electrical Engineering Department University of Maryland Baltimore County United States Pacific Northwest National Laboratory Richland WA United States University of Karlsruhe Germany IRobot Corporation United States University of Massachusetts Lowell United States

The Association for the Advancement of Artificial Intelligence, in cooperation with Stanford University's Department of computer science, was pleased to present the 2009 Spring Symposium Series, held Monday through Wednesday, March 23-25, 2009, at Stanford University. The titles of the nine symposia were Agents That Learn from Human Teachers, Benchmarking of Qualitative Spatial and Temporal Reasoning systems, Experimental Design for Real- World systems, Human Behavior Modeling, Intelligent Event Processing, Intelligent Narrative Technologies II, Learning by Reading and Learning to Read, Social Semantic Web: Where Web 2.0 Meets Web 3.0, and Technosocial Predictive Analytics. The goal of the Agents That Learn from Human Teachers symposium was to investigate how we can enable software and robotics agents to leam from real-time interaction with an everyday human partner. The aim of the Benchmarking of Qualitative Spatial and Temporal Reasoning systems symposium was to initiate the development of a problem repository in the field of qualitative spatial and temporal reasoning and identify a graded set of challenges for future midterm and long-term research. The Experimental Design symposium discussed the challenges of evaluating AI systems. The Human Behavior Modeling symposium explored reasoning methods for understanding various aspects of human behavior, especially in the context of designing intelligent systems that interact with humans. The Intelligent Event Processing symposium discussed the need for more Al-based approaches in event pro-cessing and defined a kind of research agenda for the field, coined as intelligent complex event processing (iCEP). The Intelligent Narrative Technologies IIAAAI symposium discussed innovations, progress, and novel techniques in the research domain. The Learning by Reading and Learning to Read symposium explored two aspects of making natural language texts semantically accessible to, and processable by, machines. The Social Semantic

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

SCS: A Secure Cloud Storage Framework with Enhanced Integrity and Auditability Using Consortium Blockchain System

SCS: A Secure Cloud Storage Framework with Enhanced Integrit...

引用

IEEE International Conference on Smart Internet of Things (SmartIoT)

作者： Aguru Aswani Devi Erukala Suresh Babu Mekala Srinivasa Rao Rajesh Kaluri Thippa Reddy Gadekallu Department of Computer Science & Engineering SRM University AP Amaravati Andhra Pradesh India Department of Computer Science & Engineering National Institute of Technology Warangal India Department of Computer Science & Engineering Lakireddy Bali Reddy College of Engineering India Department of Software and Systems Engineering Vellore Institute of Technology Vellore India The College of Mathematics and Computer Science Zhejiang A&F University Hangzhou China Division of Research and Development Lovely Professional University Phagwara India

ISBN: (数字)9798350366440

ISBN: (纸本)9798350366457

The widespread adoption of cloud storage enables users to remotely access resources through a self-service model. Utilizing pay-per-use storage services provided by cloud service providers (CSPs) requires users to commit financially to their resources. This paper introduces a Secure Cloud Storage (SCS) framework, offering a secure architecture for cloud storage using a consortium blockchain network to address trust issues. This framework substitutes the third-party auditor with peers of a consortium blockchain network, which handles the role of data storage and verification. Storage space is divided into uncommitted and committed segments. Uncommitted storage is used for storing unverified documents, while committed storage is reserved for documents that have been validated through a consensus mechanism. In contrast, committed storage is des-ignated for the storage of committed documents. Documents validated by a consensus threshold of peer nodes are moved from uncommitted to committed storage. The implementation of the SCS framework is conducted using Hyperledger Fabric, a modular blockchain platform optimized for permissioned networks. The security analysis demonstrates that SCS effectively protects cloud storage against attacks, including unauthorized access attacks, data integrity attacks, and malicious server attacks, while maintaining data integrity and auditability. The performance evaluation shows that document upload and retrieval times, block acceptance, execution times, and latency are all improved compared to state-of-the-art cloud storage techniques.

关键词： Performance evaluation Cloud computing Data integrity Memory Peer-to-peer computing Servers Security Internet of Things Secure storage Self-service

来源：评论

学校读者我要写书评

暂无评论

A Skipping SvS Intersection Algorithm

A Skipping SvS Intersection Algorithm

引用

International Conference on Computing, engineering and Information, ICC

作者： Jaratdech Chatchaval Veera Boonjing Pisit Chanvarasuth Software Systems Engineering Laboratory Mathematics and Computer Science Department Faculty of Science King Mongkut''s Institute of Technology Ladkrabang Thailand School of Management Technology Sirindhorn International Institute of Technology Thammasat University Pathum Thani Thailand

In this paper, we propose to improve the SvS algorithm by skipping elements of the smaller set for reducing a search boundary. The boundary of skipped element is determined by boundaries of elements prior to and next to it. We perform experiments on uniformly distributed random datasets to compare our algorithm with the standard SvS. We use regression analysis to get an equation for determining an appropriate skipping number. Our results show that the skipping SvS algorithm using the equation obtained can reduce approximately 41% on the number of comparisons of the standard SvS algorithm.

关键词： Equations software algorithms software systems systems engineering and theory Laboratories mathematics computer science Conference management Technology management engineering management

来源：评论

学校读者我要写书评

暂无评论

Checking Session-Oriented Interactions between Web Services

Checking Session-Oriented Interactions between Web Services

引用

Euromicro Conference on software engineering and Advanced Applications (SEAA)

作者： Pavel Parizek Jiri Adamek Faculty of Mathematics and Physics Department of Software Engineering Distributed Systems Research Group Charles University Prague Czech Republic Institute of Computer Science Academy of Sciences슠of the슠Czech Republic Czech Republic

Although Web services are generally envisioned as being stateless, some of them are implicitly stateful. The reason is that the Web services often work as front-ends to enterprise systems and are used in a session-oriented way by the clients. Contrary to the case of stateless services, for a stateful Web service there exist constraints to the order in which the operations of the service may be invoked. However, specification of such constraints is not a standard part of a Web service interface, and compliance with such constraints is not checked by the standard Web service development tools. Therefore, we propose in this paper to extend a web service interface by a constraint definition that is based on behavior protocols. Also, we implemented a tool that checks whether a given BPEL code complies with the constraints of all stateful web services it communicates with. The key idea behind the tool is to translate the BPEL code into Java and then to check the Java program using Java PathFinder with behavior protocol extension.

关键词： Web services Java software engineering Simple object access protocol Standards development XML Application software mathematics Physics computer science

来源：评论

学校读者我要写书评

暂无评论

Determining an appropriate number of FOUPs in semiconductor wafer fabrication facilities 08

Determining an appropriate number of FOUPs in semiconductor ...

引用

Simulation Winter Conference

作者： Jens Zimmermann Scott J. Mason John W. Fowler Lars Monch Enterprise-wide Software Systems Department of Mathematics and Computer Science University of Hagen Hagen Germany Department of Industrial Engineering University of Arkansas Fayetteville AR USA Department of Industrial Engineering Arizona State University Tempe AZ USA

ISBN: (纸本)9781424427086

In this paper, multiple orders per job type formation and release strategies are described for semiconductor wafer fabrication facilities (wafer fabs). Different orders are grouped into one job because orders of an individual customer very often fill only a portion of a front-opening unified pod (FOUP). A FOUP is assigned to each job and is used to move the job throughout the wafer fab after the job formation. We determine an appropriate number of FOUPs for a given order release rate that will yield acceptable values for on-time delivery performance, cycle time, and throughput via discrete event simulation.

关键词： Fabrication Job shop scheduling Industrial engineering Throughput Discrete event simulation Semiconductor device manufacture Computational modeling software systems mathematics computer science

来源：评论

学校读者我要写书评

暂无评论

Dimensionality Reduction Assisted Tensor Clustering

Dimensionality Reduction Assisted Tensor Clustering

引用

International Joint Conference on Neural Networks

作者： Yanfeng Sun Junbin Gao Xia Hong Yi Guo Chris J. Harris Beijing Municipal Key Lab of Multimedia and Intelligent Software Technology Beijing University of Technology School of Computing and Mathematics Charles Sturt University School of Systems Engineering University of Reading CSIRO Mathematics Informatics and Statistics Electronics and Computer Science University of Southampton

ISBN: (纸本)9781479914821

This paper is concerned with tensor clustering with the assistance of dimensionality reduction approaches. A class of formulation for tensor clustering is introduced based on tensor Tucker decomposition models. In this formulation, an extra tensor mode is formed by a collection of tensors of the same dimensions and then used to assist a Tucker decomposition in order to achieve data dimensionality reduction. We design two types of clustering models for the tensors: PCA Tensor Clustering model and Non-negative Tensor Clustering model, by utilizing different regularizations. The tensor clustering can thus be solved by the optimization method based on the alternative coordinate scheme. Interestingly, our experiments show that the proposed models yield comparable or even better performance compared to most recent clustering algorithms based on matrix factorization.

关键词： Tensor Tucker Decomposition Tensor Clustering Matrix Factorization Tensor PCA

来源：评论

学校读者我要写书评

暂无评论

Data sharing and privacy for patient IoT devices using blockchain 7th

Data sharing and privacy for patient IoT devices using block...

引用

7th International Conference on Smart City and Informatization, iSCI 2019

作者： Srivastava, Gautam Parizi, Reza M. Dehghantanha, Ali Choo, Kim-Kwang Raymond Department of Mathematics and Computer Science Brandon University BrandonMBR7A 6A9 Canada Research Center for Interneural Computing China Medical University Taichung40402 Taiwan College of Computing and Software Engineering Kennesaw State University KennesawGA30144 United States Cyber Science Lab School of Computer Science University of Guelph GuelphONN1G 2W1 Canada Department of Information Systems and Cyber Security University of Texas at San Antonio San AntonioTX78249 United States

ISBN: (纸本)9789811513008

Once a fitness fad, wearable and other related Internet of Things (IoT) devices are fast becoming common place in many different smart city applications such as healthcare. However, IoT devices, particularly inexpensive devices, often trade security and privacy for usability. One solution to protect privacy in the healthcare domain which has begun to be explored is blockchain-based technology. However, there are a number of limitations underpinning the use of blockchain, which limits its adoption particularly in applications that require low energy and computational footprints. In this paper, we present a transactional protocol for remote patient monitoring using directed acyclic graphs. We use a newer blockchain protocol called GHOSTDAG in both a public blockchain and a private blockchain. Our novel proposed solution aims to resolve known security issues for healthcare, without affecting scalability (a feature of classic blockchain architecture). © Springer Nature Singapore Pte Ltd. 2019.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：