Design complexity control in truss optimization

Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented.     

Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform

Traditionally, computer programs have been developed using the sequential programming paradigm. With the advent of parallel computing systems, such as multicore processors and distributed environments, the sequential paradigm became a barrier to the utilisation of the available resources, since the program is restricted to a single processing unit. To address this issue, we propose a transparent automatic parallelisation tool with a binary rewriter. The steps of our approach are: the disassembly of the Intel x86 application, its transformation into an intermediary language; the analysis of this intermediary representation to obtain the flow and dependency graphs; the partitioning of the application into parallel units, using the obtained graphs; and, finally, the reassembly of the application back into the original Intel x86 architecture. By transforming the compiled application software, we aim at obtaining a program which can better explore the parallel resources, with no extra effort required from users or developers.     

QoS aggregation for service orchestrations based on workflow pattern rules and MCDM method: evaluation at design time and runtime

Service consumers satisfaction is considered today as one of the main concern to be ensured by service providers, especially with the spread of concurrency and the increase of functionally equivalent services. This satisfaction is closely related to quality of service (QoS) perceived by service consumers. In this context, we propose an approach to determine the satisfaction degree corresponding to the QoS of service-based applications, with regard to service consumers’ QoS expectations. Our approach is based on a preference model, which is built only on the basis of service consumer’s provided information. This preference model is also based on the 2-additive Choquet operator that takes into account preferential dependencies. In this paper, we target both design time and runtime aggregation of QoS of service-based applications.     

Note: a high transmission Faraday optical isolator in the 9.2 μm range

We have fabricated and characterized an n-doped InSb Faraday isolator in the mid-IR range (9.2 μm). A high isolation ratio (31(2) dB) and low insertion loss (1.9(3) dB) are obtained. Temperature dependance is analyzed. Further possible improvements are discussed, including the realization of a two-stage isolator. A similar design can be used to cover a wide wavelength range (λ ~ 7.5-30 μm).     

Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm

The introduction of learning to the search mechanisms of optimization algorithms has been nominated as one of the viable approaches when dealing with complex optimization problems, in particular with multi-objective ones. One of the forms of carrying out this hybridization process is by using multi-objective optimization estimation of distribution algorithms (MOEDAs). However, it has been pointed out that current MOEDAs have an intrinsic shortcoming in their model-building algorithms that hamper their performance. In this work, we put forward the argument that error-based learning, the class of learning most commonly used in MOEDAs is responsible for current MOEDA underachievement. We present adaptive resonance theory (ART) as a suitable learning paradigm alternative and present a novel algorithm called multi-objective ART-based EDA (MARTEDA) that uses a Gaussian ART neural network for model-building and a hypervolume-based selector as described for the HypE algorithm. In order to assert the improvement obtained by combining two cutting-edge approaches to optimization an extensive set of experiments are carried out. These experiments also test the scalability of MARTEDA as the number of objective functions increases.     

Discrete‐time output feedback for Markov jump systems with uncertain transition probabilities

This article addresses the output feedback control for discrete‐time Markov jump linear systems. With fully known transition probability, sufficient conditions for an internal model based controller design are obtained. For the case where the transition probabilities are uncertain and belong to a convex polytope with known vertices, we provide a sufficient LMI condition that guarantees the norm of the closed‐loop system is below a prescribed level. That condition can be improved through an iterative procedure. Additionally, we are able to deal with the case of cluster availability of the Markov mode, provided that some system matrices do not vary within a given cluster, an assumption that is suitable to deal with packet dropout models for networked control systems. A numerical example shows the applicability of the design and compares it with previous results. Copyright © 2012 John Wiley & Sons, Ltd.     

Image Compression and Video Segmentation Using Hierarchical Self-Organization

Both image compression based on color quantization and image segmentation are two typical tasks in the field of image processing. Several techniques based on splitting algorithms or cluster analyses have been proposed in the literature. Self-organizing maps have been also applied to these problems, although with some limitations due to the fixed network architecture and the lack of representation in hierarchical relations among data. In this paper, both problems are addressed using growing hierarchical self-organizing models. An advantage of these models is due to the hierarchical architecture, which is more flexible in the adaptation process to input data, reflecting inherent hierarchical relations among data. Comparative results are provided for image compression and image segmentation. Experimental results show that the proposed approach is promising for image processing, and the powerful of the hierarchical information provided by the proposed model.     

Design with shape grammars and reinforcement learning

Shape grammars are a powerful and appealing formalism for automatic shape generation in computer-based design systems. This paper presents a proposal complementing the generative power of shape grammars with reinforcement learning techniques. We use simple (naive) shape grammars capable of generating a large variety of different designs. In order to generate those designs that comply with given design requirements, the grammar is subject to a process of machine learning using reinforcement learning techniques. Based on this method, we have developed a system for architectural design, aimed at generating two-dimensional layout schemes of single-family housing units. Using relatively simple grammar rules, we learn to generate schemes that satisfy a set of requirements stated in a design guideline. Obtained results are presented and discussed.     

Young's modulus repeatability assessment using cycling compression loading on cancellous bone

For various applications, precision of the Young's modulus of cancellous bone specimens is needed. However, measurement variability is rarely given. The aim of this study was to assess the Young's modulus repeatability using a uniaxial cyclic compression protocol on embedded specimens of human cancellous bone. Twelve specimens from 12 human calcanei were considered. The specimens were first defatted and then 1 or 2 mm at the ends were embedded in an epoxy resin. The compression experiment consists in applying 20 compressive cycles between 0.2 per cent and 0.6 per cent strain with a 2 Hz loading frequency. The coefficient of variation of the current protocol was found to be 1.2 percent. This protocol showed variability similar to the end-cap technique (considered as a reference). It can be applied on porous specimen (especially human bone) and requires minimal bone length to limit end-artifact variability. The current method could be applied in association with noninvasive measurements (such as ultrasound) with full compatibility. This possibility opens the way for bone damage follow-up based on Young's modulus monitoring.     

Dual-color fluorescence lifetime correlation spectroscopy to quantify protein-protein interactions in live cell

Dual-color fluorescence correlation spectroscopy is an interesting method to quantify protein interaction in living cells. But, when performing these experiments, one must compensate for a known spectral bleed through artifact that corrupts cross-correlation data. In this article, problems with crosstalk were overcome with an approach based on fluorescence lifetime correlation spectroscopy (FLCS). We show that FLCS applied to dual-color EGFP and mCherry cross-correlation allows the determination of protein-protein interactions in living cells without the need of spectral bleed through calibration. The methodology was validated by using EGFP-mCherry tandem in comparison with coexpressed EGFP and mCherry in live cell. The dual-color FLCS experimental procedure where the different laser intensities do not have to be controlled during experiment is really very helpful to study quantitatively protein interactions in live sample.