Multi-objective optimization of skeletal structures under static and seismic loading conditions

Almost every real world problem involves simultaneous optimization of several incommensurable and often competing objectives which constitutes a multi-objective optimization problem. In multi-objective optimization problems the optimal solution is not unique as in single-objective optimization problems. This paper is concerned with large-scale structural optimization of skeletal structures such as space frames and trusses, under static and/or seismic loading conditions with multiple objectives. Combinatorial optimization methods and in particular algorithms based on evolution strategies are implemented for the solution of this type of problems. In treating seismic loading conditions a number of accelerograms are produced from the elastic design response spectrum of the region. These accelerograms constitute the multiple loading conditions under which the structures are optimally designed. This approach for treating seismic loading is compared with an approximate design approach, based on simplifications adopted by the seismic codes, in the framework of multi-objective optimization.     

On the modeling of the annual corrosion rate in main cables of suspension bridges using combined soft computing model and a novel nature-inspired algorithm

Neural Computing and Applications - Suspension bridges are critical components of transport infrastructure around the world. Therefore, their operating conditions should be effectively monitored to...     

Branch-and-bound processing of ranked queries

Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In this paper, we propose a simple yet powerful technique for processing such queries based on multi-dimensional access methods and branch-and-bound search. The advantages of the proposed methodology are: (i) it is space efficient, requiring only a single index on the given relation (storing each tuple at most once), (ii) it achieves significant (i.e., orders of magnitude) performance gains with respect to the current state-of-the-art, (iii) it can efficiently handle data updates, and (iv) it is applicable to other important variations of ranked search (including the support for non-monotone preference functions), at no extra space overhead. We confirm the superiority of the proposed methods with a detailed experimental study.     

Comparing top-k XML lists

Systems that produce ranked lists of results are abundant. For instance, Web search engines return ranked lists of Web pages. There has been work on distance measure for list permutations, like Kendall tau and Spearman's footrule, as well as extensions to handle top-k lists, which are more common in practice. In addition to ranking whole objects (e.g., Web pages), there is an increasing number of systems that provide keyword search on XML or other semistructured data, and produce ranked lists of XML sub-trees. Unfortunately, previous distance measures are not suitable for ranked lists of sub-trees since they do not account for the possible overlap between the returned sub-trees. That is, two sub-trees differing by a single node would be considered separate objects. In this paper, we present the first distance measures for ranked lists of sub-trees, and show under what conditions these measures are metrics. Furthermore, we present algorithms to efficiently compute these distance measures. Finally, we evaluate and compare the proposed measures on real data using three popular XML keyword proximity search systems.     

Determining Attributes to Maximize Visibility of Objects

In recent years, there has been significant interest in the development of ranking functions and efficient top-k retrieval algorithms to help users in ad hoc search and retrieval in databases (e.g., buyers searching for products in a catalog). We introduce a complementary problem: How to guide a seller in selecting the best attributes of a new tuple (e.g., a new product) to highlight so that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. We develop several formulations of this problem. Although the problems are NP-complete, we give several exact and approximation algorithms that work well in practice. One type of exact algorithms is based on Integer Programming (IP) formulations of the problems. Another class of exact methods is based on maximal frequent item set mining algorithms. The approximation algorithms are based on greedy heuristics. A detailed performance study illustrates the benefits of our methods on real and synthetic data.     

Information discovery across multiple streams

In this paper we address the issue of continuous keyword queries on multiple textual streams and explore techniques for extracting useful information from them. The paper represents, to our best knowledge, the first approach that performs keyword search on a multiplicity of textual streams. The scenario that we consider is quite intuitive; let’s assume that a research or financial analyst is searching for information on a topic, continuously polling data from multiple (and possibly heterogeneous) text streams, such as RSS feeds, blogs, etc. The topic of interest can be described with the aid of several keywords. Current filtering approaches would just identify single text streams containing some of the keywords. However, it would be more flexible and powerful to search across multiple streams, which may collectively answer the analyst’s question. We present such model that takes in consideration the continuous flow of text in streams and uses efficient pipelined algorithms such that results are output as soon as they are available. The proposed model is evaluated analytically and experimentally, where the Enron dataset and a variety of blog datasets are used for our experiments.     

A Hybrid Particle Swarm—Gradient Algorithm for Global Structural Optimization

Abstract: The particle swarm optimization (PSO) method is an instance of a successful application of the philosophy of bounded rationality and decentralized decision making for solving global optimization problems. A number of advantages with respect to other evolutionary algorithms are attributed to PSO making it a prospective candidate for optimum structural design. The PSO‐based algorithm is robust and well suited to handle nonlinear, nonconvex design spaces with discontinuities, exhibiting fast convergence characteristics. Furthermore, hybrid algorithms can exploit the advantages of the PSO and gradient methods. This article presents in detail the basic concepts and implementation of an enhanced PSO algorithm combined with a gradient‐based quasi‐Newton sequential quadratic programming (SQP) method for handling structural optimization problems. The proposed PSO is shown to explore the design space thoroughly and to detect the neighborhood of the global optimum. Then the mathematical optimizer, starting from the best estimate of the PSO and using gradient information, accelerates convergence toward the global optimum. A nonlinear weight update rule for PSO and a simple, yet effective, constraint handling technique for structural optimization are also proposed. The performance, the functionality, and the effect of different setting parameters are studied. The effectiveness of the approach is illustrated in some benchmark structural optimization problems. The numerical results confirm the ability of the proposed methodology to find better optimal solutions for structural optimization problems than other optimization algorithms.     

Sustainability analysis and benchmarking of olive mill wastewater treatment methods

A large number of publications are available in the literature regarding olive mill wastewater treatment methods. However, none of the proposed methods can be considered as a best available method in terms of its effectiveness, and its environmental and economic impact. Using a literature survey, data were collected and evaluated in order for a sustainability and benchmarking analysis to be developed. Physicochemical, biological and advanced oxidation methods were evaluated and judged in terms of their effectiveness, environmental impact and cost. Effectiveness of each method was estimated in terms of COD and phenolic compounds reduction, environmental impact in terms of CO₂ production, while for the economic impact the operational costs were taken into account. Finally, a procedure is suggested for selection of the most appropriate method based on user preferences (in terms of effectiveness, environmental impact and cost). The present analysis showed that the most effective processes in terms of organics reduction are membrane filtration, electrolysis, supercritical water oxidation and photo‐Fenton. Lower environmental impact was found with anaerobic digestion, coagulation and lime processes, while the lowest cost category involves biocomposting and membrane filtration, thanks to the exploitation of byproducts (biocompost and phenolic compounds, respectively). © 2013 Society of Chemical Industry     

Structure and Thermal Stability of wtRop and RM6 Proteins through All-Atom Molecular Dynamics Simulations and Experiments

In the current work we study, via molecular simulations and experiments, the folding and stability of proteins from the tertiary motif of 4-α-helical bundles, a recurrent motif consisting of four amphipathic α-helices packed in a parallel or antiparallel fashion. The focus is on the role of the loop region in the structure and the properties of the wild-type Rop (wtRop) and RM6 proteins, exploring the key factors which can affect them, through all-atom molecular dynamics (MD) simulations and supporting by experimental findings. A detailed investigation of structural and conformational properties of wtRop and its RM6 loopless mutation is presented, which display different physical characteristics even in their native states. Then, the thermal stability of both proteins is explored showing RM6 as more thermostable than wtRop through all studied measures. Deviations from native structures are detected mostly in tails and loop regions and most flexible residues are indicated. Decrease of hydrogen bonds with the increase of temperature is observed, as well as reduction of hydrophobic contacts in both proteins. Experimental data from circular dichroism spectroscopy (CD), are also presented, highlighting the effect of temperature on the structural integrity of wtRop and RM6. The central goal of this study is to explore on the atomic level how a protein mutation can cause major changes in its physical properties, like its structural stability.     

The effects of serum from patients with acute liver failure on the growth and metabolism of Hep G2 cells

In many bioartificial liver systems currently being designed and evaluated for use in fulminant hepatic failure, direct contact is required between the patient's blood and the liver cells in the device. The efficacy of such devices will be influenced by the interaction of fulminant hepatic failure (FHF) patient serum with the cells. We have found that FHF serum inhibits the growth rate and the synthesis of DNA, RNA, and protein; disturbs glutathione homeostasis; and induces morphological changes in cultured human Hep G2 cells. These interactions should influence the design of bioartificial liver devices based on proliferating cell lines and indicate the requirement to pretreat FHF patient plasma to reduce the toxin load.