Pairwise testing, which requires that every combination of valid values of each pair of system factors be covered by at lease one test case, plays an important role in software testing since many faults are caused by ...
详细信息
Pairwise testing, which requires that every combination of valid values of each pair of system factors be covered by at lease one test case, plays an important role in software testing since many faults are caused by unexpected 2-way interactions among system factors. In real systems, constraints usually exist between values, which means that some values cannot coexist in a valid test. Although meta-heuristic strategies like simulated annealing can generally discover smaller pairwise test suite in the presence of constraints, they may cost more time to perform search, compared with greedy algorithms. We propose a new method, improved extremal optimization, for constructing constrained pairwise test suites. Experimental results show that improved extremal optimization gives similar size of resulting pairwise test suite and yields a 13% reduction in solution time over simulated annealing.
Sensor nodes in wireless networks often use batteries as their source of energy, but replacing or recharging exhausted batteries in a deployed network can be difficult and costly. Therefore, prolonging battery life be...
详细信息
Facing changing environments and evolving business, service composition happens all time. However, services do not always interact properly because of mismatches between their interfaces. In this paper, we use labelle...
详细信息
Facing changing environments and evolving business, service composition happens all time. However, services do not always interact properly because of mismatches between their interfaces. In this paper, we use labelled interface automata, an extension of interface automata, to illustrate mismatching interfaces and resolution approaches. We model service interfaces with labelled interface automata and propose a theorem for mismatch detecting. Then we characterize mismatches between pairs of interfaces by identifying and classifying them into six basic scenarios, and illustrate the resolution approach of mismatches. Our method formalizes the interface adaptation problem and provides convenience to detect mismatches and build adaptors for service interactions.
In this brief, we set up the finite time stability (FnTSta) theory for dynamical systems with bounded timevarying delays via aperiodically intermittent control (AIC) and quantized control (QC). A more general QC is de...
详细信息
The finite time stability (FnTSta) theory of delayed systems has not been set up until now. In this paper, we propose a two-phases-method (2PM), to achieve this object. In the first phase, we prove that the time for n...
详细信息
In this paper, we studied the finite time anti-synchronization of master-slave coupled complex-valued neural networks (CVNNs) with bounded asynchronous time-varying delays. With the decomposing technique and the gener...
详细信息
In this note, we study the prescribed-time (PT) synchronization of multiweighted and directed complex networks (MWDCNs) via pinning control. Unlike finite-time and fixed-time synchronization, the time for synchronizat...
详细信息
Octonion-valued neural networks (OVNNs) are a type of neural networks for which the states and weights are octonions. In this paper, the global µ-stability and finite-time stability problems for octonion-valued n...
详细信息
This paper presents a novel clustering algorithm based on clustering coefficient. It includes two steps: First, k-nearest-neighbor method and correlation convergence are employed for a preliminary clustering. Then, th...
详细信息
Existing planning and scheduling solutions for container terminal logistics systems (CTLS) are not sufficient today due to the highly complexity and uncertain environments. This paper reviews the advantages and shortc...
详细信息
Existing planning and scheduling solutions for container terminal logistics systems (CTLS) are not sufficient today due to the highly complexity and uncertain environments. This paper reviews the advantages and shortcomings of the existing solutions and proposes a container terminal conceptual parallel computing model for scheduling and execution based on multi-processor systems. It is built on the computational architecture and fundamental principles of distributed, cooperative, parallel, heterogeneous, and reconfigurable computation in essence. The proposed approach is demonstrated and validated by investigating the stress testing, tailor-made processor affinity, load migration and load balancing of a typical container terminal logistics service case with comprehensive computational experiments.
暂无评论