Computer aided design and finite element modeling to predict bulk mechanical properties of bone scaffolds using triply periodic minimal surfaces (progettazione assistita al calcolatore ed analisi con il metodo degli elementi finiti per predire il comportamento meccanico di scaffolds ossei creati con l'uso di superfici minime periodiche in tre direzioni)

The aim of Tissue Engineering is to develop biological substitutes that will restore lost morphological and functional features of diseased or damaged portions of organs. Recently computer-aided technology has received considerable attention in the area of tissue engineering and the advance of additive manufacture (AM) techniques has significantly improved control over the pore network architecture of tissue engineering scaffolds. To regenerate tissues more efficiently, an ideal scaffold should have appropriate porosity and pore structure. More sophisticated porous configurations with higher architectures of the pore network and scaffolding structures that mimic the intricate architecture and complexity of native organs and tissues are then required. This study adopts a macro-structural shape design approach to the production of open porous materials (Titanium foams), which utilizes spatial periodicity as a simple way to generate the models. From among various pore architectures which have been studied, this work simulated pore structure by triply-periodic minimal surfaces (TPMS) for the construction of tissue engineering scaffolds. TPMS are shown to be a versatile source of biomorphic scaffold design. A set of tissue scaffolds using the TPMS-based unit cell libraries was designed. TPMS-based Titanium foams were meant to be printed three dimensional with the relative predicted geometry, microstructure and consequently mechanical properties. Trough a finite element analysis (FEA) the mechanical properties of the designed scaffolds were determined in compression and analyzed in terms of their porosity and assemblies of unit cells. The purpose of this work was to investigate the mechanical performance of TPMS models trying to understand the best compromise between mechanical and geometrical requirements of the scaffolds. The intention was to predict the structural modulus in open porous materials via structural design of interconnected three-dimensional lattices, hence optimising geometrical properties. With the aid of FEA results, it is expected that the effective mechanical properties for the TPMS-based scaffold units can be used to design optimized scaffolds for tissue engineering applications. Regardless of the influence of fabrication method, it is desirable to calculate scaffold properties so that the effect of these properties on tissue regeneration may be better understood.

Uniqueness of black holes with bubbles in minimal supergravity

We generalize uniqueness theorems for non-extremal black holes with three mutually independent Killing vector fields in five-dimensional minimal supergravity in order to account for the existence of non-trivial two-cycles in the domain of outer communication. The black hole space-times we consider may contain multiple disconnected horizons and be asymptotically flat or asymptotically Kaluza–Klein. We show that in order to uniquely specify the black hole space-time, besides providing its domain structure and a set of asymptotic and local charges, it is necessary to measure the magnetic fluxes that support the two-cycles as well as fluxes in the two semi-infinite rotation planes of the domain diagram.

Ectopic expression of the minimal whiE polyketide synthase generates a library of aromatic polyketides of diverse sizes and shapes

The single recombinant expressing the Streptomyces coelicolor minimal whiE (spore pigment) polyketide synthase (PKS) is uniquely capable of generating a large array of well more than 30 polyketides, many of which, so far, are novel to this recombinant. The characterized polyketides represent a diverse set of molecules that differ in size (chain length) and shape (cyclization pattern). This combinatorial biosynthetic library is, by far, the largest and most complex of its kind described to date and indicates that the minimal whiE PKS does not independently control polyketide chain length nor dictate the first cyclization event. Rather, the minimal PKS enzyme complex must rely on the stabilizing effects of additional subunits (i.e., the cyclase whiE-ORFVI) to ensure that the chain reaches the full 24 carbons and cyclizes correctly. This dramatic loss of control implies that the growing polyketide chain does not remain enzyme bound, resulting in the spontaneous cyclization of the methyl terminus. Among the six characterized dodecaketides, four different first-ring cyclization regiochemistries are represented, including C7/C12, C8/C13, C10/C15, and C13/C15. The dodecaketide TW93h possesses a unique 2,4-dioxaadamantane ring system and represents a new structural class of polyketides with no related structures isolated from natural or engineered organisms, thus supporting the claim that engineered biosynthesis is capable of producing novel chemotypes.

Defining the minimal length of sequence homology required for selective gene isolation by TAR cloning

The transformation-associated recombination (TAR) cloning technique allows selective and accurate isolation of chromosomal regions and genes from complex genomes. The technique is based on in vivo recombination between genomic DNA and a linearized vector containing homologous sequences, or hooks, to the gene of interest. The recombination occurs during transformation of yeast spheroplasts that results in the generation of a yeast artificial chromosome (YAC) containing the gene of interest. To further enhance and refine the TAR cloning technology, we determined the minimal size of a specific hook required for gene isolation utilizing the Tg.AC mouse transgene as a targeted region. For this purpose a set of vectors containing a B1 repeat hook and a Tg.AC-specific hook of variable sizes (from 20 to 800 bp) was constructed and checked for efficiency of transgene isolation by a radial TAR cloning. When vectors with a specific hook that was ≥60 bp were utilized, ∼2% of transformants contained circular YACs with the Tg.AC transgene sequences. Efficiency of cloning dramatically decreased when the TAR vector contained a hook of 40 bp or less. Thus, the minimal length of a unique sequence required for gene isolation by TAR is ∼60 bp. No transgene-positive YAC clones were detected when an ARS element was incorporated into a vector, demonstrating that the absence of a yeast origin of replication in a vector is a prerequisite for efficient gene isolation by TAR cloning.

On a problem of Katona on minimal separating systems /

"This work was supported in part by the National Science Foundation under Grant No. US NSF GJ41538."

On minimal models of process systems

Minimal representations are known to have no redundant elements, and are therefore of great importance. Based on the notions of performance and size indices and measures for process systems, the paper proposes conditions for a process model being minimal in a set of functionally equivalent models with respect to a size norm. Generalized versions of known procedures to obtain minimal process models for a given modelling goal, model reduction based on sensitivity analysis and incremental model building are proposed and discussed. The notions and procedures are illustrated and compared on a simple example, that of a simple nonlinear fermentation process with different modelling goals and on a case study of a heat exchanger modelling. (C) 2004 Elsevier Ltd. All rights reserved.

Minimal disease activity for rheumatoid arthritis: A preliminary definition

Agreement on response criteria in rheumatoid arthritis (RA) has allowed better standardization and interpretation of clinical trial reports. With recent advances in therapy, the proportion of patients achieving a satisfactory state of minimal disease activity (MDA) is becoming a more important measure with which to compare different treatment strategies. The threshold for MDA is between high disease activity and remission and, by definition, anyone in remission will also be in MDA. True remission is still rare in RA; in addition, the American College of Rheumatology definition is difficult to apply in the context of trials. Participants at OMERACT 6 in 2002 agreed on a conceptual definition of minimal disease activity (MDA): "that state of disease activity deemed a useful target of treatment by both the patient and the physician, given current treatment possibilities and limitations." To prepare for a preliminary operational definition of MDA for use in clinical trials, we asked rheumatologists to assess 60 patient profiles describing real RA patients seen in routine clinical practice. Based on their responses, several candidate definitions for MDA were designed and discussed at the OMERACT 7 in 2004. Feedback from participants and additional on-site analyses in a cross-sectional database allowed the formulation of 2 preliminary, equivalent definitions of MDA: one based on the Disease Activity Score 28 (DAS28) index, and one based on meeting cutpoints in 5 out the 7 WHO/ILAR core set measures. Researchers applying these definitions first need to choose whether to use the DAS28 or the core set definition, because although each selects a similar proportion in a population, these are not always the same patients. In both MDA definitions, an initial decision node places all patients in MDA who have a tender joint count of 0 and a swollen joint count of 0, and an erythrocyte sedimentation rate (ESR) no greater than 10 mm. If this condition is not met: center dot The DAS28 definition places patients in MDA when DAS28

A flaw in the use of minimal defining sets for secret sharing schemes

It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implications for the use of minimal defining sets in secret sharing schemes.

Hand in hand:privatising five star hotels in Egypt through the stock market will enhance the latter's role as well as set an example of the benefits that could be gained from privatisation

This thesis examines the possibility of privatising public owned five star hotels in Egypt through its stock market in order to give a boost to the Egyptian privatisation programme and to help activate its stock market. To explore these aspects, two main technical exercises were executed. First the writer constructed, for the first time in Egypt, a daily price index for Cairo Stock Exchange and an index for the tourism sector, in order to analyze the efficiency of the capital market. This technical analysis showed that Cairo stock exchange is inefficient, stagnant and undergoes minimal fluctuations, especially when compared to other developed and emerging markets. Second, given the importance and complexity of the valuation of SOEs prior to their privatisation, a sample of three five star hotels that could be prime candidates for privatisation via the stock market in Egypt were selected and a detailed financial analysis for the three hotels was concluded. The result was a valuation range for the three hotels using various valuation methods. Nevertheless it was found out that the final value of hotels will be determined by the market itself. Depite the inefficiency of Cairo Stock Exchange, the thesis did not rule out privatisation through the stock market. On the contrary it cited several examples of developing countries that were able to successfully privatise some of their SOEs via their rudimentary capital markets. Finally, the thesis recommended that five star hotels could be pefect candidates for privatisation via the stock market in Egypt. This is because five star hotels are profitable, privately managed, non strategic and not highly capital intensive businesses. In addition, they do not suffer from overstaffing and the industry in which they operate i.e. tourism sector, has high growth prospects and is of an international nature. Therefore it is anticipated that privatisation of five star hotels can attract a lot of investors because of the relatively high returns. This in turn will help activate and popularize the capital market in Egypt. At the same time the benefits of privatisation would be more visible which will give more momentum to the privatisation programme and make it more politically acceptable.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Regular homomorphisms of minimal sets

The classification of minimal sets is a central theme in abstract topological dynamics. Recently this work has been strengthened and extended by consideration of homomorphisms. Background material is presented in Chapter I. Given a flow on a compact Hausdorff space, the action extends naturally to the space of closed subsets, taken with the Hausdorff topology. These hyperspaces are discussed and used to give a new characterization of almost periodic homomorphisms. Regular minimal sets may be described as minimal subsets of enveloping semigroups. Regular homomorphisms are defined in Chapter II by extending this notion to homomorphisms with minimal range. Several characterizations are obtained. In Chapter III, some additional results on homomorphisms are obtained by relativizing enveloping semigroup notions. In Veech's paper on point distal flows, hyperspaces are used to associate an almost one-to-one homomorphism with a given homomorphism of metric minimal sets. In Chapter IV, a non-metric generalization of this construction is studied in detail using the new notion of a highly proximal homomorphism. An abstract characterization is obtained, involving only the abstract properties of homomorphisms. A strengthened version of the Veech Structure Theorem for point distal flows is proved. In Chapter V, the work in the earlier chapters is applied to the study of homomorphisms for which the almost periodic elements of the associated hyperspace are all finite. In the metric case, this is equivalent to having at least one fiber finite. Strong results are obtained by first assuming regularity, and then assuming that the relative proximal relation is closed as well.

Nested Sampling and its Applications in Stable Compressive Covariance Estimation and Phase Retrieval with Near-Minimal Measurements

Compressed covariance sensing using quadratic samplers is gaining increasing interest in recent literature. Covariance matrix often plays the role of a sufficient statistic in many signal and information processing tasks. However, owing to the large dimension of the data, it may become necessary to obtain a compressed sketch of the high dimensional covariance matrix to reduce the associated storage and communication costs. Nested sampling has been proposed in the past as an efficient sub-Nyquist sampling strategy that enables perfect reconstruction of the autocorrelation sequence of Wide-Sense Stationary (WSS) signals, as though it was sampled at the Nyquist rate. The key idea behind nested sampling is to exploit properties of the difference set that naturally arises in quadratic measurement model associated with covariance compression. In this thesis, we will focus on developing novel versions of nested sampling for low rank Toeplitz covariance estimation, and phase retrieval, where the latter problem finds many applications in high resolution optical imaging, X-ray crystallography and molecular imaging. The problem of low rank compressive Toeplitz covariance estimation is first shown to be fundamentally related to that of line spectrum recovery. In absence if noise, this connection can be exploited to develop a particular kind of sampler called the Generalized Nested Sampler (GNS), that can achieve optimal compression rates. In presence of bounded noise, we develop a regularization-free algorithm that provably leads to stable recovery of the high dimensional Toeplitz matrix from its order-wise minimal sketch acquired using a GNS. Contrary to existing TV-norm and nuclear norm based reconstruction algorithms, our technique does not use any tuning parameters, which can be of great practical value. The idea of nested sampling idea also finds a surprising use in the problem of phase retrieval, which has been of great interest in recent times for its convex formulation via PhaseLift, By using another modified version of nested sampling, namely the Partial Nested Fourier Sampler (PNFS), we show that with probability one, it is possible to achieve a certain conjectured lower bound on the necessary measurement size. Moreover, for sparse data, an l1 minimization based algorithm is proposed that can lead to stable phase retrieval using order-wise minimal number of measurements.