An innovative <Emphasis Type="BoldItalic">H</Emphasis><Subscript><Emphasis Type="BoldItalic">∞</Emphasis></Subscript>–norm based worst case scenario approach for dynamic compliance optimization with applications to viscoelastic beams

A novel frequency–based definition of dynamic compliance is introduced within the framework of H _∞ –norm based structural dynamics in the presence of load uncertainties. The system itself is supposed to depend on a vector of design parameters with respect to which an optimal design is pursued. A three-step worst-case-scenario is then developed that finds the minimum-compliance structure capable of accounting for the entire norm–bounded load sets. Once the problem is initialized, the current worst load is found that is used as input to the minimization of the structural compliance and the procedure is repeated until convergence. Numerical examples are eventually proposed that deal with viscoelastic beams discretized via a truly–mixed finite–element scheme.     

Time-relevant stability of 2D systems

For many 2D systems, one of the independent variables plays a distinct role in the evolution of the trajectories; since often this special independent variable is time, we call such systems ‘time-relevant’. In this paper, we introduce a stability notion for time-relevant systems described by higher-order difference equations. We give algebraic tests in terms of the location of the zeros of the determinant of a polynomial matrix describing the system. We also give an LMI characterization of time-relevant stability involving only constant matrices.     

Interactive visual analysis of contrast-enhanced ultrasound data based on small neighborhood statistics

Contrast-enhanced ultrasound (CEUS) has recently become an important technology for lesion detection and characterization in cancer diagnosis. CEUS is used to investigate the perfusion kinetics in tissue over time, which relates to tissue vascularization. In this paper we present a pipeline that enables interactive visual exploration and semi-automatic segmentation and classification of CEUS data.For the visual analysis of this challenging data, with characteristic noise patterns and residual movements, we propose a robust method to derive expressive enhancement measures from small spatio-temporal neighborhoods. We use this information in a staged visual analysis pipeline that leads from a more local investigation to global results such as the delineation of anatomic regions according to their perfusion properties. To make the visual exploration interactive, we have developed an accelerated framework based on the OpenCL library, that exploits modern many-cores hardware. Using our application, we were able to analyze datasets from CEUS liver examinations, being able to identify several focal liver lesions, segment and analyze them quickly and precisely, and eventually characterize them.     

Objective quantification of acetylcholine receptor aggregation using fast Fourier transforms

A new approach for objectively analyzing the aggregation of acetylcholine receptors (AChRs) through power spectrum analysis derived from fast Fourier transform (FFT) of images has been developed. Presently, detection of AChR aggregates at neuromuscular junctions is not easily accomplished. Though the formation of AChR clusters results in periodic gray-level variations that differ with time, no study reporting their correlation with frequency information in the Fourier domain for aggregates' detection purposes exists. To this end, we processed time-lapse images of AChR aggregates' formation on murine myotubes to extract peak values of power spectra. To validate interpretation of the Fourier spectra analysis, a computer routine was developed to semi-automatically count AChR aggregates. We found: (1) logarithmic maxima of Fourier spectra correlated significantly with experimentation time; (2) cluster count correlated significantly with time only after clusters were discernable from images, signifying that this method heavily depended on definitive growth data and thresholding values; (3) exponents of Fourier maxima versus time and cluster count versus time profiles during this phase compared favorably, indicating that both methods were analyzing identical cluster growth rates. Our observations suggest that analysis via FFT power spectrum is sensitive and robust enough to automatically quantify AChR aggregates.     

The multimod application framework: a rapid application development tool for computer aided medicine

This paper describes a new application framework (OpenMAF) for rapid development of multimodal applications in computer-aided medicine. MAF applications are multimodal in data, in representation, and in interaction. The framework supports almost any type of biomedical data, including DICOM datasets, motion-capture recordings, or data from computer simulations (e.g. finite element modeling). The interactive visualization approach (multimodal display) helps the user interpret complex datasets, providing multiple representations of the same data. In addition, the framework allows multimodal interaction by supporting the simultaneous use of different input-output devices like 3D trackers, stereoscopic displays, haptics hardware and speech recognition/synthesis systems. The Framework has been designed to run smoothly even on limited power computers, but it can take advantage of all hardware capabilities. The Framework is based on a collection of portable libraries and it can be compiled on any platform that supports OpenGL, including Windows, MacOS X and any flavor of Unix/linux.     

Modelling Calculi with Name Mobility using Graphs with Equivalences

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites. Rewriting over graphs with equivalences, i.e., (typed hyper)-graphs equipped with an equivalence over nodes provides a technically convenient replacement of graph rewriting with coalescing rules, for which a truly concurrent semantics can be easily defined. The expressivity of such a formalism is tested in a setting where coalescing rules typically play a basic role: the encoding of calculi with name passing as graph rewriting systems. Specifically, we show how the (monadic fragment) of the solo calculus, one of the dialect of those calculi whose distinctive feature is name fusion, can be encoded as a rewriting system over graph with equivalences.     

Design and control of an IPMC wormlike robot.

This paper presents an innovative wormlike robot controlled by cellular neural networks (CNNs) and made of an ionic polymer-metal composite (IPMC) self-actuated skeleton. The IPMC actuators, from which it is made of, are new materials that behave similarly to biological muscles. The idea that inspired the work is the possibility of using IPMCs to design autonomous moving structures. CNNs have already demonstrated their powerfulness as new structures for bio-inspired locomotion generation and control. The control scheme for the proposed IPMC moving structure is based on CNNs. The wormlike robot is totally made of IPMCs, and each actuator has to carry its own weight. All the actuators are connected together without using any other additional part, thereby constituting the robot structure itself. Worm locomotion is performed by bending the actuators sequentially from "tail" to "head," imitating the traveling wave observed in real-world undulatory locomotion. The activation signals are generated by a CNN. In the authors' opinion, the proposed strategy represents a promising solution in the field of autonomous and light structures that are capable of reconfiguring and moving in line with spatial-temporal dynamics generated by CNNs.     

Ambient occlusion and edge cueing to enhance real time molecular visualization

The paper presents a set of combined techniques to enhance the real-time visualization of simple or complex molecules (up to order of 106 atoms) space fill mode. The proposed approach includes an innovative technique for efficient computation and storage of ambient occlusion terms, a small set of GPU accelerated procedural impostors for space-fill and ball-and-stick rendering, and novel edge-cueing techniques. As a result, the user's understanding of the three-dimensional structure under inspection is strongly increased (even for still images), while the rendering still occurs in real time.     

A hypergraph model for constraint logic programming and applications to bus drivers' scheduling

In a previous paper, a hypergraph model for the satisfiability of Datalog formulas was proposed. Here, we extend that approach in order to deal with a class ofconstraint logic programming (CLP) formulas, that is, Datalog formulas in the presence of constraints. A CLP formula is represented by means of a weighted hypergraph and the problem of evaluating this formula is reduced to a sequence of shortest path computations on hypergraphs. To evaluate the performance of this approach, the bus drivers' scheduling problem is formulated as the problem of checking the satisfiability of a CLP formula and it is solved by means of the hypergraph-based algorithm embedded within a local search procedure. Preliminary experimental results are quite encouraging and suggest that the proposed approach may provide an efficient way to tackle hard real-life combinatorial problems.This research was partially supported by the Progetto Finalizzato Trasporti 2 of the Italian National Research Council, under Contract No. 91.02479.PF74.