A framework for a dense matching algorithm : Results using matching metrics and order statistic filters

An algorithm for computing dense correspondences between images of a stereo pair or image sequence is presented. The algorithm can make use of both standard matching metrics and the rank and census filters, two filters based on order statistics which have been applied to the image matching problem. Their advantages include robustness to radiometric distortion and amenability to hardware implementation. Results obtained using both real stereo pairs and a synthetic stereo pair with ground truth were compared. The rank and census filters were shown to significantly improve performance in the case of radiometric distortion. In all cases, the results obtained were comparable to, if not better than, those obtained using standard matching metrics. Furthermore, the rank and census have the additional advantage that their computational overhead is less than these metrics. For all techniques tested, the difference between the results obtained for the synthetic stereo pair, and the ground truth results was small.

Order statistic filters for image matching

The rank and census are two filters based on order statistics which have been applied to the image matching problem for stereo pairs. Advantages of these filters include their robustness to radiometric distortion and small amounts of random noise, and their amenability to hardware implementation. In this paper, a new matching algorithm is presented, which provides an overall framework for matching, and is used to compare the rank and census techniques with standard matching metrics. The algorithm was tested using both real stereo pairs and a synthetic pair with ground truth. The rank and census filters were shown to significantly improve performance in the case of radiometric distortion. In all cases, the results obtained were comparable to, if not better than, those obtained using standard matching metrics. Furthermore, the rank and census have the additional advantage that their computational overhead is less than these metrics. For all techniques tested, the difference between the results obtained for the synthetic stereo pair, and the ground truth results was small.

Preparation and thermal energy storage properties of paraffin/calcined diatomite composites as form-stable phase change materials

A composite paraffin-based phase change material (PCM) was prepared by blending composite paraffin and calcined diatomite through the fusion adsorption method. In this study, raw diatomite was purified by thermal treatment in order to improve the adsorption capacity of diatomite, which acted as a carrier material to prepare shape-stabilized PCMs. Two forms of paraffin (paraffin waxes and liquid paraffin) with different melting points were blended together by the fusion method, and the optimum mixed proportion with a suitable phase-transition temperature was obtained through differential scanning calorimetry (DSC) analysis. Then the prepared composite paraffin was adsorbed in calcined diatomite. The prepared paraffin/calcined diatomite composites were characterized by the scanning electron microscope (SEM) and Fourier transformation infrared (FT-IR) analysis techniques. Thermal energy storage properties of the composite PCMs were determined by DSC method. DSC results showed that there was an optimum adsorption ratio between composite paraffin and calcined diatomite and the phase-transition temperature and the latent heat of the composite PCMs were 33.04 ◦C and 89.54 J/g, respectively. Thermal cycling test of composite PCMs showed that the prepared material is thermally reliable and chemically stable. The obtained paraffin/calcined diatomite composites have proper latent heat and melting temperatures, and show practical significance and good potential application value.

Integrating collaborative filtering and matching-based search for product recommendation

Currently, recommender systems (RS) have been widely applied in many commercial e-commerce sites to help users deal with the information overload problem. Recommender systems provide personalized recommendations to users and thus help them in making good decisions about which product to buy from the vast number of product choices available to them. Many of the current recommender systems are developed for simple and frequently purchased products like books and videos, by using collaborative-filtering and content-based recommender system approaches. These approaches are not suitable for recommending luxurious and infrequently purchased products as they rely on a large amount of ratings data that is not usually available for such products. This research aims to explore novel approaches for recommending infrequently purchased products by exploiting user generated content such as user reviews and product click streams data. From reviews on products given by the previous users, association rules between product attributes are extracted using an association rule mining technique. Furthermore, from product click streams data, user profiles are generated using the proposed user profiling approach. Two recommendation approaches are proposed based on the knowledge extracted from these resources. The first approach is developed by formulating a new query from the initial query given by the target user, by expanding the query with the suitable association rules. In the second approach, a collaborative-filtering recommender system and search-based approaches are integrated within a hybrid system. In this hybrid system, user profiles are used to find the target user’s neighbour and the subsequent products viewed by them are then used to search for other relevant products. Experiments have been conducted on a real world dataset collected from one of the online car sale companies in Australia to evaluate the effectiveness of the proposed recommendation approaches. The experiment results show that user profiles generated from user click stream data and association rules generated from user reviews can improve recommendation accuracy. In addition, the experiment results also prove that the proposed query expansion and the hybrid collaborative filtering and search-based approaches perform better than the baseline approaches. Integrating the collaborative-filtering and search-based approaches has been challenging as this strategy has not been widely explored so far especially for recommending infrequently purchased products. Therefore, this research will provide a theoretical contribution to the recommender system field as a new technique of combining collaborative-filtering and search-based approaches will be developed. This research also contributes to a development of a new query expansion technique for infrequently purchased products recommendation. This research will also provide a practical contribution to the development of a prototype system for recommending cars.

Career-path analysis using optimal matching and self-organizing maps

This paper is devoted to the analysis of career paths and employability. The state-of-the-art on this topic is rather poor in methodologies. Some authors propose distances well adapted to the data, but are limiting their analysis to hierarchical clustering. Other authors apply sophisticated methods, but only after paying the price of transforming the categorical data into continuous, via a factorial analysis. The latter approach has an important drawback since it makes a linear assumption on the data. We propose a new methodology, inspired from biology and adapted to career paths, combining optimal matching and self-organizing maps. A complete study on real-life data will illustrate our proposal.

Integrating collaborative filtering and matching-based search for product recommendations

Currently, recommender systems (RS) have been widely applied in many commercial e-commerce sites to help users deal with the information overload problem. Recommender systems provide personalized recommendations to users and, thus, help in making good decisions about which product to buy from the vast amount of product choices. Many of the current recommender systems are developed for simple and frequently purchased products like books and videos, by using collaborative-filtering and content-based approaches. These approaches are not directly applicable for recommending infrequently purchased products such as cars and houses as it is difficult to collect a large number of ratings data from users for such products. Many of the ecommerce sites for infrequently purchased products are still using basic search-based techniques whereby the products that match with the attributes given in the target user’s query are retrieved and recommended. However, search-based recommenders cannot provide personalized recommendations. For different users, the recommendations will be the same if they provide the same query regardless of any difference in their interest. In this article, a simple user profiling approach is proposed to generate user’s preferences to product attributes (i.e., user profiles) based on user product click stream data. The user profiles can be used to find similarminded users (i.e., neighbours) accurately. Two recommendation approaches are proposed, namely Round- Robin fusion algorithm (CFRRobin) and Collaborative Filtering-based Aggregated Query algorithm (CFAgQuery), to generate personalized recommendations based on the user profiles. Instead of using the target user’s query to search for products as normal search based systems do, the CFRRobin technique uses the attributes of the products in which the target user’s neighbours have shown interest as queries to retrieve relevant products, and then recommends to the target user a list of products by merging and ranking the returned products using the Round Robin method. The CFAgQuery technique uses the attributes of the products that the user’s neighbours have shown interest in to derive an aggregated query, which is then used to retrieve products to recommend to the target user. Experiments conducted on a real e-commerce dataset show that both the proposed techniques CFRRobin and CFAgQuery perform better than the standard Collaborative Filtering and the Basic Search approaches, which are widely applied by the current e-commerce applications.

Electrospinning and crosslinking of low-molecular-weight poly(trimethylene carbonate-co-L-lactide) as an elastomeric scaffold for vascular engineering

The growth of suitable tissue to replace natural blood vessels requires a degradable scaffold material that is processable into porous structures with appropriate mechanical and cell growth properties. This study investigates the fabrication of degradable, crosslinkable prepolymers of l-lactide-co-trimethylene carbonate into porous scaffolds by electrospinning. After crosslinking by γ-radiation, dimensionally stable scaffolds were obtained with up to 56% trimethylene carbonate incorporation. The fibrous mats showed Young’s moduli closely matching human arteries (0.4–0.8 MPa). Repeated cyclic extension yielded negligible change in mechanical properties, demonstrating the potential for use under dynamic physiological conditions. The scaffolds remained elastic and resilient at 30% strain after 84 days of degradation in phosphate buffer, while the modulus and ultimate stress and strain progressively decreased. The electrospun mats are mechanically superior to solid films of the same materials. In vitro, human mesenchymal stem cells adhered to and readily proliferated on the three-dimensional fiber network, demonstrating that these polymers may find use in growing artificial blood vessels in vivo.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

A social matching system : using implicit and explicit information for personalized recommendation in online dating service

Online dating websites enable a specific form of social networking and their efficiency can be increased by supporting proactive recommendations based on participants' preferences with the use of data mining. This research develops two-way recommendation methods for people-to-people recommendation for large online social networks such as online dating networks. This research discovers the characteristics of the online dating networks and utilises these characteristics in developing efficient people-to-people recommendation methods. Methods developed support improved recommendation accuracy, can handle data sparsity that often comes with large data sets and are scalable for handling online networks with a large number of users.

Practical guidance for the use of a pattern-matching technique in case-study research : a case presentation

This paper reports on a study that demonstrates how to apply pattern matching as an analytical method in case-study research. Case-study design is appropriate for the investigation of highly-contextualized phenomena that occur within the social world. Case-study design is considered a pragmatic approach that permits employment of multiple methods and data sources in order to attain a rich understanding of the phenomenon under investigation. The findings from such multiple methods can be reconciled in case-study analysis, specifically through a pattern-matching technique. Although this technique is theoretically explained in the literature, there is scant guidance on how to apply the method practically when analyzing data. This paper demonstrates the steps taken during pattern matching in a completed case-study project that investigated the influence of cultural diversity in a multicultural nursing workforce on the quality and safety of patient care. The example highlighted in this paper contributes to the practical understanding of the pattern-matching process, and can also make a substantial contribution to case-study methods.

A novel T-DNA vector design for selection of transgenic lines with simple transgene integration and stable transgene expression

Plants transformed with Agrobacterium frequently contain T-DNA concatamers with direct-repeat (d/r) or inverted-repeat (i/r) transgene integrations, and these repetitive T-DNA insertions are often associated with transgene silencing. To facilitate the selection of transgenic lines with simple T-DNA insertions, we constructed a binary vector (pSIV) based on the principle of hairpin RNA (hpRNA)-induced gene silencing. The vector is designed so that any transformed cells that contain more than one insertion per locus should generate hpRNA against the selective marker gene, leading to its silencing. These cells should, therefore, be sensitive to the selective agent and less likely to regenerate. Results from Arabidopsis and tobacco transformation showed that pSIV gave considerably fewer transgenic lines with repetitive insertions than did a conventional T-DNA vector (pCON). Furthermore, the transgene was more stably expressed in the pSIV plants than in the pCON plants. Rescue of plant DNA flanking sequences from pSIV plants was significantly more frequent than from pCON plants, suggesting that pSIV is potentially useful for T-DNA tagging. Our results revealed a perfect correlation between the presence of tail-to-tail inverted repeats and transgene silencing, supporting the view that read-through hpRNA transcript derived from i/r T-DNA insertions is a primary inducer of transgene silencing in plants. © CSIRO 2005.

Stiffness-damping matching method of an ECAS system based on LQG control

A novel method of matching stiffness and continuous variable damping of an ECAS (electronically controlled air suspension) based on LQG (linear quadratic Gaussian) control was proposed to simultaneously improve the road-friendliness and ride comfort of a two-axle school bus. Taking account of the suspension nonlinearities and target-height-dependent variation in suspension characteristics, a stiffness model of the ECAS mounted on the drive axle of the bus was developed based on thermodynamics and the key parameters were obtained through field tests. By determining the proper range of the target height for the ECAS of the fully-loaded bus based on the design requirements of vehicle body bounce frequency, the control algorithm of the target suspension height (i.e., stiffness) was derived according to driving speed and road roughness. Taking account of the nonlinearities of a continuous variable semi-active damper, the damping force was obtained through the subtraction of the air spring force from the optimum integrated suspension force, which was calculated based on LQG control. Finally, a GA (genetic algorithm)-based matching method between stepped variable damping and stiffness was employed as a benchmark to evaluate the effectiveness of the LQG-based matching method. Simulation results indicate that compared with the GA-based matching method, both dynamic tire force and vehicle body vertical acceleration responses are markedly reduced around the vehicle body bounce frequency employing the LQG-based matching method, with peak values of the dynamic tire force PSD (power spectral density) decreased by 73.6%, 60.8% and 71.9% in the three cases, and corresponding reduction are 71.3%, 59.4% and 68.2% for the vehicle body vertical acceleration. A strong robustness to variation of driving speed and road roughness is also observed for the LQG-based matching method.

Flexible design of decoupling and matching networks for two strongly coupled antennas

The flexible design of decoupling and matching networks for coupled antennas is introduced. The network includes three parts: circuits for impedance transformation, an element for odd-mode decoupling and conventional matching networks. It is found that all three parts are determined by one parameter of the ABCD matrix of the impedance transformation circuit. Thus a large variety of circuits with different element values can be used for decoupling which relaxes the practical design constraints.

Efficient fuzzy matching and intersection on private datasets

At Eurocrypt’04, Freedman, Nissim and Pinkas introduced a fuzzy private matching problem. The problem is defined as follows. Given two parties, each of them having a set of vectors where each vector has T integer components, the fuzzy private matching is to securely test if each vector of one set matches any vector of another set for at least t components where t < T. In the conclusion of their paper, they asked whether it was possible to design a fuzzy private matching protocol without incurring a communication complexity with the factor (T t ) . We answer their question in the affirmative by presenting a protocol based on homomorphic encryption, combined with the novel notion of a share-hiding error-correcting secret sharing scheme, which we show how to implement with efficient decoding using interleaved Reed-Solomon codes. This scheme may be of independent interest. Our protocol is provably secure against passive adversaries, and has better efficiency than previous protocols for certain parameter values.

How stable is the well-being of Australian mothers who care for young children with special health care needs?

Ninety-seven percent of children who have special health care needs are cared for by their mothers. These mothers cite that their informal care work can be intrinsically rewarding, however, the role is not without substantial difficulties and consequences. We investigated differences in the health and well-being of mothers whose young children do and do not have special health care needs. Quantitative data are drawn from Growing Up in Australia: The Longitudinal Study of Australian Children. This study employs a matched-case control methodology to compare the experiences of a group of 292 mothers whose children are identified as having long term special health care needs to those mothers whose children are typically developing at two time points; Wave 1 (2004) and Wave 3 (2008). The findings support previous research that mothers of children with special health care needs have poorer general health and mental health than mothers whose children do not have special needs. Mothers of children with special health care needs also perceived life as more difficult. Longitudinally, this study also shows that maternal well-being remains relatively stable during the years when children are transitioning to formal schooling. Implications for policy makers, practitioners and early childhood professionals are discussed.