Multifunctional magnetic mesoporous bioactive glass scaffolds with a hierarchical pore structure

Hyperthermia and local drug delivery have been proposed the potential therapeutic approaches for bone defects resulting from malignant bone tumors. Development of bioactive materials with magnetic and drug-delivery properties may potentially meet this target. The aim of this study is to develop a multifunctional mesoporous bioactive glass (MBG) scaffold system for both hyperthermia and local-drug delivery application potentially. For this aim, Iron (Fe) containing MBG (Fe-MBG) scaffolds with hierarchically large pores (300-500 µm) and fingerprint-like mesopores (4.5 nm) have been successfully prepared. The effect of Fe on the mesopore structure, physiochemical, magnetism, drug delivery and biological properties of MBG scaffolds has been systematically investigated. The results showed that the morphology of the mesopore varied from straight channels to curved fingerprint-like channels after incorporated parts of Fe into MBG scaffolds. The magnetism magnitude of MBG scaffolds can be tailored by controlling Fe contents. Furthermore, the incorporating of Fe into mesoporous MBG glass scaffolds enhanced the mitochondrial activity and bone-relative gene (ALP and OCN) expression of human bone marrow mesenchymal stem cells (BMSCs) on the scaffolds. The obtained Fe-MBG scaffolds also possessed high specific surface areas and sustained drug delivery. Therefore, Fe-MBG scaffolds are magnetic, degradable and bioactive. The multifunction of Fe-MBG scaffolds indicates that there is a great potential for Fe-MBG scaffolds to be used for the therapy and regeneration of large-bone defects caused by malignant bone tumors through the combination of hyperthermia, local drug delivery and their osteoconductivity.

Advanced tissue engineering scaffold design for regeneration of the complex hierarchical periodontal structure

AIM: This study investigated the ability of an osteoconductive biphasic scaffold to simultaneously regenerate alveolar bone, periodontal ligament and cementum. MATERIALS AND METHODS: A biphasic scaffold was built by attaching a fused deposition modelled bone compartment to a melt electrospun periodontal compartment. The bone compartment was coated with a calcium phosphate (CaP) layer for increasing osteoconductivity, seeded with osteoblasts and cultured in vitro for 6 weeks. The resulting constructs were then complemented with the placement of PDL cell sheets on the periodontal compartment, attached to a dentin block and subcutaneously implanted into athymic rats for 8 weeks. Scanning electron microscopy, X-ray diffraction, alkaline phosphatase and DNA content quantification, confocal laser microscopy, micro computerized tomography and histological analysis were employed to evaluate the scaffold's performance. RESULTS: The in vitro study showed that alkaline phosphatase activity was significantly increased in the CaP-coated samples and they also displayed enhanced mineralization. In the in vivo study, significantly more bone formation was observed in the coated scaffolds. Histological analysis revealed that the large pore size of the periodontal compartment permitted vascularization of the cell sheets, and periodontal attachment was achieved at the dentin interface. CONCLUSIONS: This work demonstrates that the combination of cell sheet technology together with an osteoconductive biphasic scaffold could be utilized to address the limitations of current periodontal regeneration techniques.

K-tree : large scale document clustering

We introduce K-tree in an information retrieval context. It is an efficient approximation of the k-means clustering algorithm. Unlike k-means it forms a hierarchy of clusters. It has been extended to address issues with sparse representations. We compare performance and quality to CLUTO using document collections. The K-tree has a low time complexity that is suitable for large document collections. This tree structure allows for efficient disk based implementations where space requirements exceed that of main memory.

Iteratively specified tree-based regression : theory and trip generation example

Focuses on a study which introduced an iterative modeling method that combines properties of ordinary least squares (OLS) with hierarchical tree-based regression (HTBR) in transportation engineering. Information on OLS and HTBR; Comparison and contrasts of OLS and HTBR; Conclusions.

Modeling crash outcome probabilities at rural intersections: Application of hierarchical binomial logistic models

It is important to examine the nature of the relationships between roadway, environmental, and traffic factors and motor vehicle crashes, with the aim to improve the collective understanding of causal mechanisms involved in crashes and to better predict their occurrence. Statistical models of motor vehicle crashes are one path of inquiry often used to gain these initial insights. Recent efforts have focused on the estimation of negative binomial and Poisson regression models (and related deviants) due to their relatively good fit to crash data. Of course analysts constantly seek methods that offer greater consistency with the data generating mechanism (motor vehicle crashes in this case), provide better statistical fit, and provide insight into data structure that was previously unavailable. One such opportunity exists with some types of crash data, in particular crash-level data that are collected across roadway segments, intersections, etc. It is argued in this paper that some crash data possess hierarchical structure that has not routinely been exploited. This paper describes the application of binomial multilevel models of crash types using 548 motor vehicle crashes collected from 91 two-lane rural intersections in the state of Georgia. Crash prediction models are estimated for angle, rear-end, and sideswipe (both same direction and opposite direction) crashes. The contributions of the paper are the realization of hierarchical data structure and the application of a theoretically appealing and suitable analysis approach for multilevel data, yielding insights into intersection-related crashes by crash type.

Fast exact nearest neighbour matching in high dimensions using d-D Sort

Data structures such as k-D trees and hierarchical k-means trees perform very well in approximate k nearest neighbour matching, but are only marginally more effective than linear search when performing exact matching in high-dimensional image descriptor data. This paper presents several improvements to linear search that allows it to outperform existing methods and recommends two approaches to exact matching. The first method reduces the number of operations by evaluating the distance measure in order of significance of the query dimensions and terminating when the partial distance exceeds the search threshold. This method does not require preprocessing and significantly outperforms existing methods. The second method improves query speed further by presorting the data using a data structure called d-D sort. The order information is used as a priority queue to reduce the time taken to find the exact match and to restrict the range of data searched. Construction of the d-D sort structure is very simple to implement, does not require any parameter tuning, and requires significantly less time than the best-performing tree structure, and data can be added to the structure relatively efficiently.

Networks in the shadow of markets and hierarchies : calling the shots in the visual effects industry

The nature and organisation of creative industries and the creative economy has received increased attention in recent academic and policy literatures (Florida 2002; Grabher 2002; Scott 2006a). Constituted as one variant on new economy narratives, creativity, alongside knowledge, has been presented as a key competitive asset, Such industries – ranging from advertising, to film and new media – are seen as not merely expanding their scale and scope, but as leading edge proponents of a more general trend towards new forms of organization and economic coordination (Davis and Scase 2000). The idea of network forms (and the consequent displacement of markets and hierarchies) has been at the heart of attempts to differentiate the field economically and spatially. Across both the discussion of production models and work/employment relations is the assertion of the enhanced importance of trust and non-market relations in coordinating structures and practices. This reflects an influential view in sociological, management, geography and other literatures that social life is ‘intrinsically networked’ (Sunley 2008: 12) and that we can confidently use the term ‘network society’ to describe contemporary structures and practices (Castells 1996). Our paper is sceptical of the conceptual and empirical foundations of such arguments. We draw on a number of theoretical resources, including institutional theory, global value chain analysis and labour process theory (see Smith and McKinlay 2009) to explore how a more realistic and grounded analysis of the nature of and limits to networks can be articulated. Given space constraints, we cannot address all the dimensions of network arguments or evidence. Our focus is on inter and intra-firm relations and draws on research into a particular creative industry – visual effects – that is a relatively new though increasingly important global production network. Through this examination a different model of the creative industries and creative work emerges – one in which market rules and patterns of hierarchical interaction structure the behaviour of economic actors and remain a central focus of analysis. The next section outlines and unpacks in more detail arguments concerning the role and significance of networks, markets and hierarchies in production models and work organisation in creative industries and the ‘creative economy’.

Product feature taxonomy learning based on user reviews

In recent years, the Web 2.0 has provided considerable facilities for people to create, share and exchange information and ideas. Upon this, the user generated content, such as reviews, has exploded. Such data provide a rich source to exploit in order to identify the information associated with specific reviewed items. Opinion mining has been widely used to identify the significant features of items (e.g., cameras) based upon user reviews. Feature extraction is the most critical step to identify useful information from texts. Most existing approaches only find individual features about a product without revealing the structural relationships between the features which usually exist. In this paper, we propose an approach to extract features and feature relationships, represented as a tree structure called feature taxonomy, based on frequent patterns and associations between patterns derived from user reviews. The generated feature taxonomy profiles the product at multiple levels and provides more detailed information about the product. Our experiment results based on some popularly used review datasets show that our proposed approach is able to capture the product features and relations effectively.

Structured feature extraction using association rules

As of today, opinion mining has been widely used to iden- tify the strength and weakness of products (e.g., cameras) or services (e.g., services in medical clinics or hospitals) based upon people's feed- back such as user reviews. Feature extraction is a crucial step for opinion mining which has been used to collect useful information from user reviews. Most existing approaches only find individual features of a product without the structural relationships between the features which usually exists. In this paper, we propose an approach to extract features and feature relationship, represented as tree structure called a feature hi- erarchy, based on frequent patterns and associations between patterns derived from user reviews. The generated feature hierarchy profiles the product at multiple levels and provides more detailed information about the product. Our experiment results based on some popularly used review datasets show that the proposed feature extraction approach can identify more correct features than the baseline model. Even though the datasets used in the experiment are about cameras, our work can be ap- plied to generate features about a service such as the services in hospitals or clinics.

Social networks in arid Australia : a review of concepts and evidence

Arid systems are markedly different from non-arid systems. This distinctiveness extends to arid-social networks, by which we mean social networks which are influenced by the suite of factors driving arid and semi-arid regions. Neither the process of how aridity interacts with social structure, nor what happens as a result of this interaction, is adequately understood. This paper postulates three relative characteristics which make arid-social networks distinct: that they are tightly bound, are hierarchical in structure and, hence, prone to power abuses, and contain a relatively higher proportion of weak links, making them reactive to crisis. These ideas were modified from workshop discussions during 2006. Although they are neither tested nor presented as strong beliefs, they are based on the anecdotal observations of arid-system scientists with many years of experience. This paper does not test the ideas, but rather examines them in the context of five arid-social network case studies with the aim of hypotheses building. Our cases are networks related to pastoralism, Aboriginal outstations, the ‘Far West Coast Aboriginal Enterprise Network’ and natural resources in both the Lake-Eyre basin and the Murray–Darling catchment. Our cases highlight that (1) social networks do not have clear boundaries, and that how participants perceive their network boundaries may differ from what network data imply, (2) although network structures are important determinants of system behaviour, the role of participants as individuals is still pivotal, (3) and while in certain arid cases weak links are engaged in crisis, the exact structure of all weak links in terms of how they place participants in relation to other communities is what matters.

Primary control level of parallel distributed energy resources converters in system of multiple interconnected autonomous microgrids within self-healing networks

To minimise the number of load sheddings in a microgrid (MG) during autonomous operation, islanded neighbour MGs can be interconnected if they are on a self-healing network and an extra generation capacity is available in the distributed energy resources (DER) of one of the MGs. In this way, the total load in the system of interconnected MGs can be shared by all the DERs within those MGs. However, for this purpose, carefully designed self-healing and supply restoration control algorithm, protection systems and communication infrastructure are required at the network and MG levels. In this study, first, a hierarchical control structure is discussed for interconnecting the neighbour autonomous MGs where the introduced primary control level is the main focus of this study. Through the developed primary control level, this study demonstrates how the parallel DERs in the system of multiple interconnected autonomous MGs can properly share the load of the system. This controller is designed such that the converter-interfaced DERs operate in a voltage-controlled mode following a decentralised power sharing algorithm based on droop control. DER converters are controlled based on a per-phase technique instead of a conventional direct-quadratic transformation technique. In addition, linear quadratic regulator-based state feedback controllers, which are more stable than conventional proportional integrator controllers, are utilised to prevent instability and weak dynamic performances of the DERs when autonomous MGs are interconnected. The efficacy of the primary control level of the DERs in the system of multiple interconnected autonomous MGs is validated through the PSCAD/EMTDC simulations considering detailed dynamic models of DERs and converters.

Interconnected autonomous microgrids in smart grids with self-healing

In order to minimize the number of load shedding in a Microgrid during autonomous operation, islanded neighbour microgrids can be interconnected if they are on a self-healing network and an extra generation capacity is available in Distributed Energy Resources (DER) in one of the microgrids. In this way, the total load in the system of interconnected microgrids can be shared by all the DERs within these microgrids. However, for this purpose, carefully designed self-healing and supply restoration control algorithm, protection systems and communication infrastructure are required at the network and microgrid levels. In this chapter, first a hierarchical control structure is discussed for interconnecting the neighbour autonomous microgrids where the introduced primary control level is the main focus. Through the developed primary control level, it demonstrates how the parallel DERs in the system of multiple interconnected autonomous microgrids can properly share the load in the system. This controller is designed such that the converter-interfaced DERs operate in a voltage-controlled mode following a decentralized power sharing algorithm based on droop control. The switching in the converters is controlled using a linear quadratic regulator based state feedback which is more stable than conventional proportional integrator controllers and this prevents instability among parallel DERs when two microgrids are interconnected. The efficacy of the primary control level of DERs in the system of multiple interconnected autonomous microgrids is validated through simulations considering detailed dynamic models of DERs and converters.

Spatial prediction on a river network

This article develops methods for spatially predicting daily change of dissolved oxygen (Dochange) at both sampled locations (134 freshwater sites in 2002 and 2003) and other locations of interest throughout a river network in South East Queensland, Australia. In order to deal with the relative sparseness of the monitoring locations in comparison to the number of locations where one might want to make predictions, we make a classification of the river and stream locations. We then implement optimal spatial prediction (ordinary and constrained kriging) from geostatistics. Because of their directed-tree structure, rivers and streams offer special challenges. A complete approach to spatial prediction on a river network is given, with special attention paid to environmental exceedances. The methodology is used to produce a map of Dochange predictions for 2003. Dochange is one of the variables measured as part of the Ecosystem Health Monitoring Program conducted within the Moreton Bay Waterways and Catchments Partnership.

Mining discriminative Itemsets in data streams

This paper presents a single pass algorithm for mining discriminative Itemsets in data streams using a novel data structure and the tilted-time window model. Discriminative Itemsets are defined as Itemsets that are frequent in one data stream and their frequency in that stream is much higher than the rest of the streams in the dataset. In order to deal with the data structure size, we propose a pruning process that results in the compact tree structure containing discriminative Itemsets. Empirical analysis shows the sound time and space complexity of the proposed method.

BOSTER : an efficient algorithm for mining frequent unordered induced subtrees

Extracting frequent subtrees from the tree structured data has important applications in Web mining. In this paper, we introduce a novel canonical form for rooted labelled unordered trees called the balanced-optimal-search canonical form (BOCF) that can handle the isomorphism problem efficiently. Using BOCF, we define a tree structure guided scheme based enumeration approach that systematically enumerates only the valid subtrees. Finally, we present the balanced optimal search tree miner (BOSTER) algorithm based on BOCF and the proposed enumeration approach, for finding frequent induced subtrees from a database of labelled rooted unordered trees. Experiments on the real datasets compare the efficiency of BOSTER over the two state-of-the-art algorithms for mining induced unordered subtrees, HybridTreeMiner and UNI3. The results are encouraging.