Scalability issues with using FSMWeb to test web applications

Web applications are fast becoming more widespread, larger, more interactive, and more essential to the international use of computers. It is well understood that web applications must be highly dependable, and as a field we are just now beginning to understand how to model and test Web applications. One straightforward technique is to model Web applications as finite state machines. However, large numbers of input fields, input choices and the ability to enter values in any order combine to create a state space explosion problem. This paper evaluates a solution that uses constraints on the inputs to reduce the number of transitions, thus compressing the FSM. The paper presents an analysis of the potential savings of the compression technique and reports actual savings from two case studies.     

Linear,parameter-varying control of a supercavitating vehicle

A systematic approach to parameter-dependent control synthesis of a high-speed supercavitation vehicle (HSSV) is presented. The aim of the control design is to provide robust reference tracking across a large flight envelope, while directly accounting for the interaction of liquid and gas phases with the vehicle. A nonlinear dynamic HSSV model is presented and discussed relative to the actual vehicle. A linear, parameter-varying (LPV) controller is synthesized for angle rate tracking in the presence of model uncertainty. The control design takes advantage of coupling in the governing equations to achieve improved performance. Multiple LPV controllers synthesized for smaller overlapping regions of the parameter space are blended together, providing a single controller for the full flight envelope. Time-domain simulations implemented on high-fidelity simulations, provide insight into the performance and robustness of the proposed scheme.     

A Monte Carlo Simulation approach for the modeling of free-molecule squeeze-film damping of flexible microresonators

Squeeze-film damping on microresonators is a significant damping source even when the surrounding gas is highly rarefied. This article presents a general modeling approach based on Monte Carlo (MC) simulations for the prediction of squeeze-film damping on resonators in the free-molecule regime. The generality of the approach is demonstrated in its capability of simulating resonators of any shape and with any accommodation coefficient. The approach is validated using both the analytical results of the free-space damping and the experimental data of the squeeze-film damping on a clamped–clamped plate resonator oscillating at its first flexure mode. The effect of oscillation modes on the quality factor of the resonator has also been studied and semi-analytical approximate models for the squeeze-film damping with diffuse collisions have been developed.     

Sources of New Ideas for Charity Fundraising: An Empirical Study

Intense competition in the UK charity fundraising market and the near continuous need for charities to acquire new supporters, reactivate lapsed donors and encourage first time donors to make further gifts has resulted in charities needing repeatedly to initiate novel fundraising campaigns. The starting point for an innovative campaign is an idea or set of ideas that will attract public attention, differentiate a charity from other fundraising organizations and distinguish the charity's current marketing activities from those undertaken in the past. An important but neglected issue in the charity idea creation field is the question of where and how fundraising organizations source their ideas for new campaigns. This empirical study identified (i) the main sources of fresh ideas for fundraising employed by a sample of 417 British charities, and (ii) certain antecedents of a charity's use of various categories of sources. Potential connections between particular types of idea source and managerial satisfaction with both the creative quality of the ideas obtained and the financial revenues derived from these ideas were also examined.     

A biased random‐key genetic algorithm for OSPF and DEFT routing to minimize network congestion

Interior gateway routing protocols like Open Shortest Path First (OSPF) and Distributed Exponentially Weighted Flow Splitting (DEFT) send flow through forward links toward the destination node. OSPF routes only on shortest‐weight paths, whereas DEFT sends flow on all forward links, but with an exponential penalty on longer paths. Finding suitable weights for these protocols is known as the weight setting problem (WSP). In this paper, we present a biased random‐key genetic algorithm for WSP using both protocols. The algorithm uses dynamic flow and dynamic shortest path computations. We report computational experiments that show that DEFT achieves less network congestion when compared with OSPF, while, however, yielding larger delays.     

Tight bounds for parallel randomized load balancing

Given a distributed system of \(n\) balls and \(n\) bins, how evenly can we distribute the balls to the bins, minimizing communication? The fastest non-adaptive and symmetric algorithm achieving a constant maximum bin load requires \(\varTheta (\log \log n)\) rounds, and any such algorithm running for \(r\in {\mathcal {O}}(1)\) rounds incurs a bin load of \(\varOmega ((\log n/\log \log n)^{1/r})\). In this work, we explore the fundamental limits of the general problem. We present a simple adaptive symmetric algorithm that achieves a bin load of 2 in \(\log ^* n+{\mathcal {O}}(1)\) communication rounds using \({\mathcal {O}}(n)\) messages in total. Our main result, however, is a matching lower bound of \((1-o(1))\log ^* n\) on the time complexity of symmetric algorithms that guarantee small bin loads. The essential preconditions of the proof are (i) a limit of \({\mathcal {O}}(n)\) on the total number of messages sent by the algorithm and (ii) anonymity of bins, i.e., the port numberings of balls need not be globally consistent. In order to show that our technique yields indeed tight bounds, we provide for each assumption an algorithm violating it, in turn achieving a constant maximum bin load in constant time.     

Examining the predictive relationship between personality and emotion traits and students’ agent-directed emotions: towards emotionally-adaptive agent-based learning environments

The current study examined the relationships between learners’ (\(N = 123\)) personality traits, the emotions they typically experience while studying (trait studying emotions), and the emotions they reported experiencing as a result of interacting with four pedagogical agents (agent-directed emotions) in MetaTutor, an advanced multi-agent learning environment. Overall, significant relationships between a subset of trait emotions (trait anger, trait anxiety) and personality traits (agreeableness, conscientiousness, and neuroticism) were found for four agent-directed emotions (enjoyment, pride, boredom, and neutral) though the relationships differed between pedagogical agents. These results demonstrate that some trait emotions and personality traits can be used to predict learners’ emotions directed toward specific pedagogical agents (with different roles). Results provide suggestions for adapting pedagogical agents to support learners’ (with certain characteristics; e.g., high in neuroticism or agreeableness) experience of adaptive emotions (e.g., enjoyment) and minimize their experience on non-adaptive emotions (e.g., boredom). Such an approach presents a scalable and easily implementable method for creating emotionally-adaptive, agent-based learning environments, and improving learner-pedagogical agent interactions in order to support learning.     

A novel model for arc territory design: promoting Eulerian districts

The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region. This problem arises in numerous applications such as postal delivery, meter readings, winter gritting, road maintenance, and municipal solid waste collection. An integer linear programming model is proposed where a novel set of node parity constraints to favor Eulerian districts is introduced. Series of instances were solved to assess the impact of these parity constraints on the objective function and deadhead distance. Networks with up to 401 nodes and 764 edges were successfully solved. The model is useful at a tactical level as it can be used to promote workload balance, compactness, deadhead distance reduction and parity in districts.     

A Declarative Approach to Network Device Configuration Correctness

Configuration Logic (CL) is a formal language that allows a network engineer to express constraints in terms of the actual parameters found in the configuration of network devices. We present an efficient algorithm that can automatically check a pool of devices for conformance to a set of CL constraints; moreover, this algorithm can point to the part of the configuration responsible for the error when a constraint is violated. Contrary to other validation approaches that require dumping the configuration of the whole network to a central location in order to be verified, we also present an algorithm that analyzes the correct formulas and greatly helps reduce the amount of data that need to be transferred to that central location, pushing as much of the evaluation of the formula locally on each device. The procedure is also backwards-compatible, in such a way that a device that does not (or only partially) supports a local evaluation may simply return a subset or all of its configuration. These capabilities have been integrated into a network management tool called ValidMaker.     

The subspace global skyline query processing over dynamic databases

The global skyline, as an important variant of the skyline, has been widely applied in multi-criteria decision making, business planning and data mining. In this paper, we extend our early work and propose the maintenance methods to process the subspace global skyline (SGS) queries in dynamic databases. In the previous work, we proposed the index structure RB-tree, which can effectively manage the data to accelerate the subspace global skyline calculation. Also, the basic single SGS algorithm based on RB-tree (SSRB) and the optimized single SGS algorithm (OSSRB) were proposed to process a single SGS query. In addition, the multiple SGS algorithm (MSRB) was proposed to calculate multiple SGS queries by sharing the scan spaces of different queries. In this paper, we design some data structures and propose the maintenance approaches of SSRB, OSSRB and MSRB to cope with updates that happen to data sets. Thus our extended algorithms can be adopted for dynamic data sets. Finally, the experimental results show that the proposed algorithms OSSRB and MSRB have good performance to process SGS queries and they can be easily maintained with dynamic datasets.