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

Integrating simulation and numerical analysis in the evaluation of generalized stochastic petri nets

学校读者我要写书评

暂无评论

Integrating simulation and numerical analysis in the evaluat...

作者： Zimmermann, Armin Hotz, Thomas Department of Computer Science and Automation Systems and Software Engineering Group Technische Universität Ilmenau Helmholtzplatz 5 Ilmenau98693 Germany Institute for Mathematics Group for Probability Theory and Mathematical Statistics Technische Universität Ilmenau Weimarer Straße 25 Ilmenau98693 Germany

The standard existing performance evaluation methods for discrete-state stochastic models such as Petri nets either generate the reachability graph followed by a numerical solution of equations or use some variant of simulation. Both methods have characteristic advantages and disadvantages depending on the size of the reachability graph and type of performance measure. This article proposes a hybrid performance evaluation algorithm for the steady-state solution of Generalized Stochastic Petri Nets that integrates elements of both methods. It automatically adapts its behavior depending on the available size of main memory and number of model states. As such, the algorithm unifies simulation and numerical analysis in a joint framework. It is proved to result in an unbiased estimator whose variance tends to zero with increasing simulation time. The article extends earlier results with an algorithm variant that starts with a small maximum number of particles and increases them during the run to increase the efficiency in cases that are rapidly solved by regular simulation. The algorithm's applicability is demonstrated through case studies, including an example where it outperforms the standard methods. © 2019 Copyright held by the owner/author(s).

关键词： Petri nets

A Review of Artificial Fish Swarm Algorithms: Recent Advances and Applications

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Yazdani, Danial College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Department of Electrical and Computer Engineering University of Windsor Canada College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Institute for Intelligent Systems Research and Innovation Deakin University Australia College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China School of Computer Science and Engineering Southern University of Science and Technology China

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming and following behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the continuous AFSA, encompassing the original ASFA, its improvements and hybrid models, as well as their associated applications. We focus on articles published in high-quality journals since 2013. Our review provides insights into AFSA parameters modifications, procedure and sub-functions. The main reasons for these enhancements and the comparison results with other hybrid methods are discussed. In addition, hybrid, multi-objective and dynamic AFSA models that have been proposed to solve continuous optimization problems are elucidated. We also analyse possible AFSA enhancements and highlight future research directions for advancing AFSA-based models. Copyright © 2020, The Authors. All rights reserved.

关键词： Multiobjective optimization

F2A2: Flexible Fully-decentralized Approximate Actor-critic for Cooperative Multi-agent Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Wenhao Jin, Bo Wang, Xiangfeng Yan, Junchi Zha, Hongyuan School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518172 China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai200062 China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai200240 China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a flexible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multiagent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Gradient methods

Generation and application of constrained interaction test suites using base forbidden tuples with mixed neighborhood tabu search

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hasan, Imad H. Ahmed, Bestoun S. Potrus, Moayad Y. Zamli, Kamal Z. Erbil44002 Iraq Department of Mathematics and Computer Science Karlstad University Karlstad651 88 Sweden Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Gambang Pahang26300 Malaysia

To ensure the quality of current highly configurable software systems, intensive testing is needed to test all the configuration combinations and detect all the possible faults. This task becomes more challenging for most modern software systems when constraints are given for the configurations. Here, intensive testing is almost impossible, especially considering the additional computation required to resolve the constraints during the test generation process. In addition, this testing process is exhaustive and time-consuming. Combinatorial interaction strategies can systematically reduce the number of test cases to construct a minimal test suite without affecting the effectiveness of the tests. This paper presents a new efficient search-based strategy to generate constrained interaction test suites to cover all possible combinations. The paper also shows a new application of constrained interaction testing in software fault searches. The proposed strategy initially generates the set of all possible t − tuple combinations;then, it filters out the set by removing the forbidden t − tuples using the base forbidden tuple (BFT) approach. The strategy also utilizes a mixed neighborhood tabu search (TS) to construct optimal or near-optimal constrained test suites. The efficiency of the proposed method is evaluated through a comparison against two well-known state-of-the-art tools. The evaluation consists of three sets of experiments for 35 standard benchmarks. Additionally, the effectiveness and quality of the results are assessed using a real-world case study. Experimental results show that the proposed strategy outperforms one of the competitive strategies, ACTS, for approximately 83% of the benchmarks and achieves similar results to CASA for 65% of the benchmarks when the interaction strength is 2. For an interaction strength of 3, the proposed method outperforms other competitive strategies for approximately 60% and 42% of the benchmarks. The proposed strategy can also

关键词： software testing

AMOGA: A Static-Dynamic Model Generation Strategy for Mobile Apps Testing

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Salihu, Ibrahim-Anka Ibrahim, Rosziati Ahmed, Bestoun S. Zamli, Kamal Z. Usman, Asmau Department of Software Engineering Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Batu Pahat Johor86400 Malaysia Department of Software Engineering Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Batu Pahat Johor86400 Malaysia Department of Mathematics and Computer Science Karlstad University Karlstad Sweden Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang GambangPahang26300 Malaysia Department of Software Engineering Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Batu Pahat Johor86400 Malaysia

In the past few years, mobile devices have been increasingly replacing traditional computers as their capabilities such as CPU computation, memory, RAM size, and many more, are being enhanced almost to the level of conventional computers. These capabilities are being exploited by mobile apps developers to produce apps that offer more functionalities and optimized performance. To ensure acceptable quality and to meet their specifications (e.g., design), mobile apps need to be tested thoroughly. As the testing process is often tedious, test automation can be the key to alleviating such laborious activities. In the context of the Android-based mobile apps, researchers and practitioners have proposed many approaches to automate the testing process mainly on the creation of the test suite. Although useful, most existing approaches rely on reverse engineering a model of the application under test for test case creation. Often, such approaches exhibit a lack of comprehensiveness as the application model does not capture the dynamic behavior of the applications extensively due to the incompleteness of reverse engineering approaches. To address this issue, this paper proposes AMOGA, a strategy that uses a hybrid, static-dynamic approach for generating user interface model from mobile apps for model-based testing. AMOGA implements a novel crawling technique that uses the event list of UI element associated with each event to dynamically exercise the events ordering at the run-time to explore the applications’ behavior. An experimental evaluation was performed to assess the effectiveness of our strategy by measuring the code coverage and the fault detection capability through the use of mutation testing concept. Results of the experimental assessment showed that AMOGA represents an alternative approach for model-based testing of mobile apps by generating comprehensive models to improve the coverage of the applications. The strategy proved its effectiveness by achieving high co

关键词： Model checking

Upsilon-SVR Polynomial Kernel for Predicting the Defect Density in New software Projects 17

学校读者我要写书评

暂无评论

Upsilon-SVR Polynomial Kernel for Predicting the Defect Dens...

17th IEEE International Conference on Machine Learning and Applications, ICMLA 2018

作者： Lopez-Martin, Cuauhtemoc Azzeh, Mohammad Bou-Nassif, Ali Banitaan, Shadi Department of Information Systems Universidad de Guadalajara Mexico Department of Software Engineering Applied Science Private University Amman Jordan Department of Electrical and Computer Engineering University of Sharjah Sharjah United Arab Emirates Department of Mathematics Computer Science and Software Engineering University of Detroit Mercy DetroitMI United States

ISBN: (纸本)9781538668047

An important product measure to determine the effectiveness of software processes is the defect density (DD). In this study, we propose the application of support vector regression (SVR) to predict the DD of new software projects obtained from the International software Benchmarking Standards Group (ISBSG) Release 2018 data set. Two types of SVR (i.e., ϵ-SVR and υ-SVR) were applied to train and test these projects. Each SVR used four types of kernels. The prediction accuracy of each SVR was compared to that of a statistical regression (i.e., a simple linear regression, SLR). Statistical significance test showed that υ-SVR with polynomial kernel was better than that of SLR when new software projects were developed on mainframes and coded in programming languages of third generation. © 2018 IEEE.

关键词： Defect density

Lightweight Attribute-Based Keyword Search with Policy Protection for Cloud-Assisted IoT

学校读者我要写书评

暂无评论

Lightweight Attribute-Based Keyword Search with Policy Prote...

IEEE Conference on Dependable and Secure Computing

作者： Jianfei Sun Hu Xiong Robert H. Deng Yinghui Zhang Ximeng Liu Mingsheng Cao School of Information and Software Engineering University of Electronic Science and Technology of China School of Information Systems Singapore Management University School of Cyberspace Security Xi'an University of Post and Telecommunications College of Mathematics and Computer Science Fuzhou University

The following topics are dealt with: cryptography; Internet of Things; data privacy; security of data; cloud computing; cryptocurrencies; learning (artificial intelligence); computer network security; telecommunicatio... 详细信息

关键词： Productivity Cloud computing Data privacy Keyword search Encryption Internet of Things Standards

Prioritized process test: An alternative to current process testing strategies

学校读者我要写书评

暂无评论

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 review of uncertainty quantification in deep learning: Techniques, applications and challenges

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Abdar, Moloud Pourpanah, Farhad Hussain, Sadiq Rezazadegan, Dana Liu, Li Ghavamzadeh, Mohammad Fieguth, Paul Cao, Xiaochun Khosravi, Abbas Rajendra Acharya, U. Makarenkov, Vladimir Nahavandi, Saeid Deakin University Australia College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University Shenzhen518060 China Dibrugarh University Dibrugarh India Department of Computer Science and Software Engineering Swinburne University of Technology Melbourne Australia Center for Machine Vision and Signal Analysis University of Oulu Oulu Finland Google research United States Department of Systems Design Engineering University of Waterloo Waterloo Canada State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Department of Electronics and Computer Engineering Ngee Ann Polytechnic Clementi Singapore Department of Computer Science University of Quebec in Montreal MontrealQC Canada

—Uncertainty quantification (UQ) plays a pivotal role in the reduction of uncertainties during both optimization and decision making, applied to solve a variety of real-world applications in science and engineering. Bayesian approximation and ensemble learning techniques are two of the most widely-used UQ methods in the literature. In this regard, researchers have proposed different UQ methods and examined their performance in a variety of applications such as computer vision (e.g., self-driving cars and object detection), image processing (e.g., image restoration), medical image analysis (e.g., medical image classification and segmentation), natural language processing (e.g., text classification, social media texts and recidivism risk-scoring), bioinformatics, etc. This study reviews recent advances in UQ methods used in deep learning, investigates the application of these methods in reinforcement learning, and highlight the fundamental research challenges and directions associated with the UQ field. Copyright © 2020, The Authors. All rights reserved.

关键词： Image segmentation