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

International Conference on software engineering and computer systems (ICSECS)

作者： Yazan A. Alsariera Mazlina A. Majid Kamal Z. Zamli Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia

software product lines (SPLs) represent an engineering method for creating a portfolio of similar software systems for a shared set of software product assets. Owing to the significant growth of SPLs, there is a need for systematic approach for ensuring the quality of the resulting product derivatives. Combinatorial t-way testing (where t indicates the interaction strength) has been known to be effective especially when the number of product's features and constraints in the SPLs of interest are huge. In line with the recent emergence of Search based software engineering (SBSE), this article presents a novel strategy for SPLs tests reduction using Bat-inspired algorithm (BA), called SPLBA. Our experience with SPLBA has been promising as the strategy performed well against existing strategies in the literature.

关键词： Testing Mobile communication software algorithms Arrays Color software engineering computers

来源：评论

学校读者我要写书评

暂无评论

Assessing optimization based strategies for t-way test suite generation: The case for flower-based strategy

Assessing optimization based strategies for t-way test suite...

引用

IEEE International Conference on Control System, Computing and engineering (ICCSCE)

作者： Abdullah B. Nasser Yazan A. Sariera AbdulRahman A. Alsewari Kamal Z. Zamli Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia

Exhaustive testing is extremely difficult to perform owing to the large number of combinations. Thus, sampling and finding the optimal test suite from a set of feasible test cases becomes a central concern. Addressing this issue, the adoption of t-way testing (where t indicates the interaction strength) has come into the limelight. In order to summarize the achievements so far and facilitate future development, the main focus of this paper is, first, to present a critical comparison of adoption optimization algorithms (OA) as a basis of the t-way test suite generation strategy and, second, to propose a new t-way strategy based on Flower Pollination Algorithm, called Flower Strategy (FS). Analytical and experimental results demonstrate the applicability of FS for t-way test suite generation.

关键词： Testing Genetic algorithms Biological cells Optimization Sociology Statistics Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A variable combinatorial test suite strategy based on modified greedy algorithm

A variable combinatorial test suite strategy based on modifi...

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Ameen A. Ba Homaid AbdulRahman A. Alsewari Faculty of Computer Systems and Software Engineering University Malaysia Pahang Gambang Pahang Malaysia

A software should be tested before released to the market to be sure that a software has been achieved the quality assurance measurement objectives. Therefore, one of the testing sorts is the combinatorial interaction testing (CIT) which is intended to discover the faults that are happened by interacting between the software features. Test case generation is the most active area of CIT research. As the problem of generating the most minimum test suite of CIT is NP-hard (i.e. NP where NP terms Non-deterministic Polynomial). Several researchers have been addressed the combinatorial interaction testing issues by developing the various strategies based on a search-based approach or a pure-computational approach, although, these are useful, but most of them have a lack to support the variable strength interaction which is one of CIT techniques. A variable strength interaction is the interaction between some of software features which have higher priority than the interaction between the others software features. This proposed will suggest a new CIT strategy based on a modified greedy algorithm (MGA) with addressing the supporting of variable strength interaction to generate a satisfactory test suite size.

关键词： software testing Internet software systems software engineering computers

来源：评论

学校读者我要写书评

暂无评论

Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm

Sequence and sequence-less T-way test suite generation strat...

引用

Student Conference on Research and Development (SCOReD)

作者： Abdullah B. Nasser Fadhl Hujainah AbdulRahman A. Alsewari Kamal Z. Zamli Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia

ISBN: (纸本)9781467395731

In an attempt to ensure good-quality software, there is need to test all possible inputs. Owing to the fact that the exhaustive testing is hardly feasible, many software testing approaches has been proposed. Combinatorial Interaction Testing (CIT) is very promising technique to minimize the number of test cases. Although useful, most of exiting CIT strategies and tools focus on data inputs and assume “sequence-less” interactions between input parameters. However, reactive systems show sequence related behaviors and their faults may not expose if the sequence of inputs are not considered. In this paper, we propose a new t-way strategy (i.e. t refers to the degree of the combination) strategy, called Flower Strategy (FS), that addresses both sequence and sequence-less test generation. Experimental results show that FS produces test size.

关键词： Testing Algorithm design and analysis Memory management Switches Sociology Statistics Conferences

来源：评论

学校读者我要写书评

暂无评论

Adopting search-based algorithms for pairwise testing

Adopting search-based algorithms for pairwise testing

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Abdullah B. Nasser AbdulRahman A. Alsewari Kamal Z. Zamli Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia

Owing to an exponential increase in computational time associated with increasing number of components, exhaustive testing is impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing work are focusing on the use of Search-Based algorithms as the basis of the implementation algorithm. This paper presents a critical comparison of Search-Based algorithm for generating the pairwise test suite. An analysis of existing SB pairwise strategies shows the positive and negative points for each strategy thereby highlighting promising future directions in this area.

关键词： Testing software algorithms Genetic algorithms Biological cells software engineering Heuristic algorithms computers

来源：评论

学校读者我要写书评

暂无评论

Quantum State Tomography via Reduced Density Matrices

引用

Physical Review Letters 2017年第2期118卷 020401-020401页

作者： Tao Xin Dawei Lu Joel Klassen Nengkun Yu Zhengfeng Ji Jianxin Chen Xian Ma Guilu Long Bei Zeng Raymond Laflamme State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Institute for Quantum Computing University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Physics University of Guelph Guelph N1G 2W1 Ontario Canada Centre for Quantum Computation and Intelligent Systems Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia Department of Mathematics and Statistics University of Guelph Guelph N1G 2W1 Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences 100190 Beijing China Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland USA Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Canadian Institute for Advanced Research Toronto M5G 1Z8 Ontario Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada

Quantum state tomography via local measurements is an efficient tool for characterizing quantum states. However, it requires that the original global state be uniquely determined (UD) by its local reduced density matrices (RDMs). In this work, we demonstrate for the first time a class of states that are UD by their RDMs under the assumption that the global state is pure, but fail to be UD in the absence of that assumption. This discovery allows us to classify quantum states according to their UD properties, with the requirement that each class be treated distinctly in the practice of simplifying quantum state tomography. Additionally, we experimentally test the feasibility and stability of performing quantum state tomography via the measurement of local RDMs for each class. These theoretical and experimental results demonstrate the advantages and possible pitfalls of quantum state tomography with local measurements.

关键词： Quantum entanglement Quantum information processing Quantum tomography Random matrix theory

来源：评论

学校读者我要写书评

暂无评论

A review on parallel medical image processing on GPU

A review on parallel medical image processing on GPU

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Hui Liang Khor Siau-Chuin Liew Jasni Mohd Zain Faculty of Computer Systems and Software Engineering University Malaysia Pahang Lebuhraya Tun Razak Malaysia

An efficient implementation are necessary, as most medical imaging methods are computational expensive, and the amount of medical imaging data is growing. Graphic processing units (GPUs) can solve large data parallel problems at a higher speed than the traditional CPU, while being more affordable and energy efficient than distributed systems. This review investigates the use of GPUs to accelerate medical imaging methods. A set of criteria for efficient use of GPUs are defined. The review concludes that most medical image processing methods may benefit from GPU processing due to the methods' data parallel structure and high thread count. However, factors such as synchronization, branch divergence and memory usage can limit the speedup.

关键词： Graphics processing units Instruction sets Synchronization Biomedical imaging Parallel processing Algorithm design and analysis Biomedical image processing

来源：评论

学校读者我要写书评

暂无评论

Estimating the efficiency of Information Technology for Domain-Specific Mathematical Modelling

Estimating the efficiency of Information Technology for Doma...

引用

International Conference on computer, Communications, and Control Technology (I4CT)

作者： Vitaliy Mezhuyev Mazlina Abdul Majid Ravi Samikannu Faculty of Computer Systems and Software Engineering University Malaysia Pahang Gambang Malaysia Faculty of Electrical Engineering Selvam college of technology India

The paper analyses the efficiency of the Information Technology (IT) for Domain-Specific Mathematical Modelling (DSMM). IT DSMM was developed to meet the shortcomings of the IT for Domain-Specific Modelling (DSM). IT DSMM allows us to develop metamodels in the different mathematical semantics and thus to increase the level of adequateness of models to the modelled domains. It also reduces an amount of operations needed for the development of metamodels and models of software systems. The optimization problem of choosing the most effective IT by selection and comparison of the multiple features inherent to DSM, DSMM and GPM (General Purpose Modelling) is solved.

关键词： Unified modeling language Mathematical model Computational modeling Object oriented modeling Grammar computers

来源：评论

学校读者我要写书评

暂无评论

Queueing theory study of round robin versus priority dynamic quantum time round robin scheduling algorithms

Queueing theory study of round robin versus priority dynamic...

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Maysoon A. Mohammed Mazlina AbdulMajid Balsam A. Mustafa Rana Fareed Ghani Faculty of Computer Systems & Software Engineering Universiti Malaysia Pahang Kunatan Malaysia Department of Computer Sciences University of Technology Baghdad Iraq

The queue size distribution and average waiting time for a time-shared system using round-robin (RR) scheduling, with and without overhead, are determined. In this study, the incoming processes are prioritized, and dynamic quantum times are assigned depending on the level of priority. With these parameters, RR versus priority dynamic quantum time round robin scheduling algorithm is analyzed to explore the effect of changing the quantum time of processes and determine the optimum context switches, turnaround time, and waiting time.

关键词： Queueing analysis computers Context Heuristic algorithms Round robin Servers

来源：评论

学校读者我要写书评

暂无评论

Quantum state and process tomography via adaptive measurements

引用

Science China(Physics,Mechanics & Astronomy) 2016年第10期59卷 25-32页

作者： HengYan Wang WenQiang Zheng NengKun Yu KeRen Li DaWei Lu Tao Xin Carson Li ZhengFeng Ji David Kribs Bei Zeng XinHua Peng JiangFeng Du Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of ChinaHefei 230026China Department of Applied Physics Zhejiang University of TechnologyHangzhou 310023China Institute for Quantum Computing University of WaterlooWaterloo N2L 3G1Canada 4Department of Mathematics&Statistics University of GuelphGuelph N1G 2W1Canada Centre for Quantum Computation&Intelligent Systems Faculty of Engineering and Information TechnologyUniversity of Technology SydneySydney NSW 2007Australia State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua UniversityBeijing 100084China Department of Physics University of GuelphGuelph N1G 2W1Canada State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Canadian Institute for Advanced Research Toronto M5G 1Z8Canada

We investigate quantum state tomography(QST) for pure states and quantum process tomography(QPT) for unitary channels via adaptive measurements. For a quantum system with a d-dimensional Hilbert space, we first propose an adaptive protocol where only 2d. 1 measurement outcomes are used to accomplish the QST for all pure states. This idea is then extended to study QPT for unitary channels, where an adaptive unitary process tomography(AUPT) protocol of d2+d.1measurement outcomes is constructed for any unitary channel. We experimentally implement the AUPT protocol in a 2-qubit nuclear magnetic resonance system. We examine the performance of the AUPT protocol when applied to Hadamard gate, T gate(/8 phase gate), and controlled-NOT gate,respectively, as these gates form the universal gate set for quantum information processing purpose. As a comparison, standard QPT is also implemented for each gate. Our experimental results show that the AUPT protocol that reconstructing unitary channels via adaptive measurements significantly reduce the number of experiments required by standard QPT without considerable loss of fidelity.

关键词： quantum tomography state reconstruction nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：