Dynamic Dictionary Matching in External Memory

In thedynamic dictionary matchingproblem, a dictionaryDcontains a set of patterns that can change over time under insertion and deletion of individual patterns. Given an arbitrary textT, we must efficiently list all the dictionary patterns that occur at each text position. We investigate the I/O complexity of this problem for a large dictionary that must be stored in external storage devices. By following a completely new approach, we devise an efficient solution which is based upon the SB-tree data structure (P. Ferragina and R. Grossi, 1995,in“Proc. ACM Symposium on Theory of Computing,” pp. 693–702), and a novel notion of certificate for the dictionary matching problem. Our data structure can be adapted to efficiently work in main memory and to solve other problems, thus providing a new insight into the nature of the dictionary matching problem.     

Markov Jump Linear Systems with switching transition rates: Mean square stability with dwell-time

The stability of a class of Markov Jump Linear Systems characterized by piecewise-constant transition rates and system dynamics is investigated. For these Switching Markov Jump Linear Systems, mean square stability is analyzed through the time evolution of the second-order moment of the state. The main result is a sufficient condition that guarantees mean square stability under constraints on the dwell-time between switching instants. An alternative condition based on Kronecker calculus is worked out. It is shown that both the stability criteria admit an LMI implementation.     

Straightening tubular flow for side-by-side visualization

Flows through tubular structures are common in many fields, including blood flow in medicine and tubular fluid flows in engineering. The analysis of such flows is often done with a strong reference to the main flow direction along the tubular boundary. In this paper we present an approach for straightening the visualization of tubular flow. By aligning the main reference direction of the flow, i.e., the center line of the bounding tubular structure, with one axis of the screen, we are able to natively juxtapose (1.) different visualizations of the same flow, either utilizing different flow visualization techniques, or by varying parameters of a chosen approach such as the choice of seeding locations for integration-based flow visualization, (2.) the different time steps of a time-dependent flow, (3.) different projections around the center line , and (4.) quantitative flow visualizations in immediate spatial relation to the more qualitative classical flow visualization. We describe how to utilize this approach for an informative interactive visual analysis. We demonstrate the potential of our approach by visualizing two datasets from two different fields: an arterial blood flow measurement and a tubular gas flow simulation from the automotive industry.     

A goal-based framework for contextual requirements modeling and analysis

Requirements engineering (RE) research often ignores or presumes a uniform nature of the context in which the system operates. This assumption is no longer valid in emerging computing paradigms, such as ambient, pervasive and ubiquitous computing, where it is essential to monitor and adapt to an inherently varying context. Besides influencing the software, context may influence stakeholders’ goals and their choices to meet them. In this paper, we propose a goal-oriented RE modeling and reasoning framework for systems operating in varying contexts. We introduce contextual goal models to relate goals and contexts; context analysis to refine contexts and identify ways to verify them; reasoning techniques to derive requirements reflecting the context and users priorities at runtime; and finally, design time reasoning techniques to derive requirements for a system to be developed at minimum cost and valid in all considered contexts. We illustrate and evaluate our approach through a case study about a museum-guide mobile information system.     

A numerical procedure for predicting the performance of high pressure homogenizing valves

This paper describes a numerical procedure for the prediction of the homogenizing performance of high pressure homogenizing valves used in diary plants. The method is based on a strict interaction between a complex CFD code and a simple homogenizing simulation code developed by the authors. This latter implements a mathematical model for the evaluation of droplets break-up, that needs an accurate evaluation of few significant fluid dynamic parameters in the whole fluid dynamic domain inside the valve. Due to the relevant pressure gradients within the flow and to the possibility of cavitation, particular attention has been paid in defining the fluid model, the mesh and the parameters required for CFD simulations. Notwithstanding the quite simple model of the homogenizing process, comparatively with the complexity of phenomena involved, the first results obtained are in general agreement with the experimental data available. These results point out the potential of the procedure proposed as a starting point for further implementation of more complex effects.     

CAD based shape optimization for gas turbine component design

In order to improve product characteristics, engineering design makes increasing use of Robust Design and Multidisciplinary Design Optimisation. Common to both methodologies is the need to vary the object’s shape and to assess the resulting change in performance, both executed within an automatic loop. This shape change can be realised by modifying the parameter values of a suitably parameterised Computer Aided Design (CAD) model. This paper presents the adopted methodology and the achieved results when performing optimisation of a gas turbine disk. Our approach to hierarchical modelling employing design tables is presented, with methods to ensure satisfactory geometry variation by commercial CAD systems. The conducted studies included stochastic and probabilistic design optimisation. To solve the multi-objective optimisation problem, a Pareto optimum criterion was used. The results demonstrate that CAD centric approach enables significant progress towards automating the entire process while achieving a higher quality product with the reduced susceptibility to manufacturing imperfections.     

Numerical approximation of incompressible flows with net flux defective boundary conditions by means of penalty techniques

We consider incompressible flow problems with defective boundary conditions prescribing only the net flux on some inflow and outflow sections of the boundary. As a paradigm for such problems, we simply refer to Stokes flow. After a brief review of the problem and of its well posedness, we discretize the corresponding variational formulation by means of finite elements and looking at the boundary conditions as constraints, we exploit a penalty method to account for them. We perform the analysis of the method in terms of consistency, boundedness and stability of the discrete bilinear form and we show that the application of the penalty method does not affect the optimal convergence properties of the finite element discretization. Since the additional terms introduced to account for the defective boundary conditions are non-local, we also analyze the spectral properties of the equivalent algebraic formulation and we exploit the analysis to set up an efficient solution strategy. In contrast to alternative discretization methods based on Lagrange multipliers accounting for the constraints on the boundary, the present scheme is particularly effective because it only mildly affects the structure and the computational cost of the numerical approximation. Indeed, it does not require neither multipliers nor sub-iterations or additional adjoint problems with respect to the reference problem at hand.     

A Brief Critique of Pure Hypercomputation

Hypercomputation—the hypothesis that Turing-incomputable objects can be computed through infinitary means—is ineffective, as the unsolvability of the halting problem for Turing machines depends just on the absence of a definite value for some paradoxical construction; nature and quantity of computing resources are immaterial. The assumption that the halting problem is solved by oracles of higher Turing degree amounts just to postulation; infinite-time oracles are not actually solving paradoxes, but simply assigning them conventional values. Special values for non-terminating processes are likewise irrelevant, since diagonalization can cover any amount of value assignments. This should not be construed as a restriction of computing power: Turing’s uncomputability is not a ‘barrier’ to be broken, but simply an effect of the expressive power of consistent programming systems.