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

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

作者： Ashis Kumar Mandal M N M Kahar Faculty of Computer Systems & Software Engineering University Malaysia Pahang Kuantan Pahang

Constructing a quality solution for the examination timetable problem is a difficult task. This paper presents a partial exam assignment approach with great deluge algorithm as the improvement mechanism in order to generate good quality timetable. In this approach, exams are ordered based on graph heuristics and only selected exams (partial exams) are scheduled first and then improved using great deluge algorithm. The entire process continues until all of the exams have been scheduled. We implement the proposed technique on the Toronto benchmark datasets. Experimental results indicate that in all problem instances, this proposed method outperforms traditional great deluge algorithm and when comparing with the state-of-the-art approaches, our approach produces competitive solution for all instances, with some cases outperform other reported result.

关键词： Heuristic algorithms Optimization software algorithms Algorithm design and analysis Europe Benchmark testing Search problems

来源：评论

学校读者我要写书评

暂无评论

Combination of graph heuristic with hill climbing search for solving capacitated examination timetabling problem

Combination of graph heuristic with hill climbing search for...

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Ashis Kumar Mandal M N M Kahar Faculty of Computer Systems & Software Engineering University Malaysia Pahang Kuantan Pahang

Examination timetabling problem is a nontrivial task due to its NP-hard nature as well as the involvement of numerous constraints. Moreover, solving capacitated examination timetabling is more challenging compared to un-capacitated one. This paper implements graph heuristic with hill climbing search to solve the capacitated examination timetabling considering partial examination assignment concepts. The algorithm starts with ordering all the exams according to graph heuristic approach and then partial exams are considered for construction. Afterwards, the qualities of these exams are improved using hill climbing search. The entire process continues until scheduling all the exams. The effects of different graph heuristic orderings and exam assignment values on the quality of the solutions are studied. We test the proposed approach on ITC2007 benchmark exam datasets which contains highly constraint capacitated datasets. Experimental results reveal that the approach is able to produce quality solutions for all datasets and competitive results with competition results.

关键词： software engineering computers Search problems Linear programming Simulated annealing Color Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A survey of medical image processing tools

A survey of medical image processing tools

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Lay-Khoon Lee Siau-Chuin Liew Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Gambang Pahang Malaysia

ISBN: (纸本)9781467367233

A precise analysis of medical image is an important stage in the contouring phase throughout radiotherapy preparation. Medical images are mostly used as radiographic techniques in diagnosis, clinical studies and treatment planning. Medical image processing tool are also similarly as important. With a medical image processing tool, it is possible to speed up and enhance the operation of the analysis of the medical image. This paper describes medical image processing software tool which attempts to secure the same kind of programmability advantage for exploring applications of the pipelined processors. These tools simulate complete systems consisting of several of the proposed processing components, in a configuration described by a graphical schematic diagram. In this paper, fifteen different medical image processing tools will be compared in several aspects. The main objective of the comparison is to gather and analysis on the tool in order to recommend users of different operating systems on what type of medical image tools to be used when analysing different types of imaging. A result table was attached and discussed in the paper.

关键词： Biomedical image processing Medical diagnostic imaging Image segmentation software

来源：评论

学校读者我要写书评

暂无评论

LS-SVM hyper-parameters optimization based on GWO algorithm for time series forecasting

LS-SVM hyper-parameters optimization based on GWO algorithm ...

引用

International Conference on software engineering and computer systems (ICSECS)

作者： Zuriani Mustaffa Mohd Herwan Sulaiman Mohamad Nizam Mohmad Kahar Faculty of Computer Systems & Software Engineering Universiti Malaysia Pahang Kuantan Pahang Malaysia

The importance of optimizing Least Squares Support Vector Machines (LSSVM) embedded control parameters has motivated researchers to search for proficient optimization techniques. In this study, a new metaheuristic algorithm, viz., Grey Wolf Optimizer (GWO), is employed to optimize the parameters of interest. Realized in commodity time series data, the proposed technique is compared against two comparable techniques, including single GWO and LSSVM optimized by Artificial Bee Colony (ABC) algorithm (ABC-LSSVM). Empirical results suggested that the GWO-LSSVM is capable to produce lower error rates as compared to the identified algorithms for the price of interested time series data.

关键词： Forecasting Support vector machines Time series analysis Optimization Mathematical model Predictive models software engineering

来源：评论

学校读者我要写书评

暂无评论

SPLBA: An interaction strategy for testing software product lines using the Bat-inspired algorithm

SPLBA: An interaction strategy for testing software product ...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：