297 resultados para Matching de grafos
Resumo:
The continuous growth of the XML data poses a great concern in the area of XML data management. The need for processing large amounts of XML data brings complications to many applications, such as information retrieval, data integration and many others. One way of simplifying this problem is to break the massive amount of data into smaller groups by application of clustering techniques. However, XML clustering is an intricate task that may involve the processing of both the structure and the content of XML data in order to identify similar XML data. This research presents four clustering methods, two methods utilizing the structure of XML documents and the other two utilizing both the structure and the content. The two structural clustering methods have different data models. One is based on a path model and other is based on a tree model. These methods employ rigid similarity measures which aim to identifying corresponding elements between documents with different or similar underlying structure. The two clustering methods that utilize both the structural and content information vary in terms of how the structure and content similarity are combined. One clustering method calculates the document similarity by using a linear weighting combination strategy of structure and content similarities. The content similarity in this clustering method is based on a semantic kernel. The other method calculates the distance between documents by a non-linear combination of the structure and content of XML documents using a semantic kernel. Empirical analysis shows that the structure-only clustering method based on the tree model is more scalable than the structure-only clustering method based on the path model as the tree similarity measure for the tree model does not need to visit the parents of an element many times. Experimental results also show that the clustering methods perform better with the inclusion of the content information on most test document collections. To further the research, the structural clustering method based on tree model is extended and employed in XML transformation. The results from the experiments show that the proposed transformation process is faster than the traditional transformation system that translates and converts the source XML documents sequentially. Also, the schema matching process of XML transformation produces a better matching result in a shorter time.
Resumo:
The study aimed to examine shiftworkers fatigue and the longitudinal relationships that impact on fatigue such as team climate, work life conflict, control of shifts and shift type in shift working nurses. We used a quantitative survey methodology and analysed data with a moderated hierarchical multiple regression. After matching across two time periods 18 months apart, the sample consisted of 166 nurses from one Australian hospital. Of these nurses, 61 worked two rotating day shifts (morning & afternoon/evening) and 105 were rotating shiftworkers who worked three shifts (morning afternoon/evening and nights). The findings suggest that control over shift scheduling can have significant effects on fatigue for both two-shift and three-shift workers. A significant negative relationship between positive team climate and fatigue was moderated by shift type. At both Time 1 and Time 2, work life conflict was the strongest predictor of concurrent fatigue, but over time it was not.
Resumo:
Abstract Aims. To investigate the relationship between three types of organizational resources (job control, social support and organizational justice) and the impact of job demands on nurse’s well-being and attitudes towards their work. Background. The negative impact of work-related stress on nurse’s health and attitudes towards their work has been established. Increasingly, research is focusing on the role of organizational resources in reducing the impact of work related stress. Design. Cross-sectional survey. Method. Data collected in November 2008 from 226 Australian nurses and midwives were analysed using the full Job Strain Model with the addition of organizational justice variables. Multiple regression analyses explored the relationships among job control, job demands, three sources of social support and four types of organizational justice on well-being and work attitudes. Results. The overall regression models explained a significant amount of variance in well-being, job satisfaction and organizational commitment. Significant main effects were evident for support variables and organizational justice variables on well-being and job satisfaction. Interactions between job control and supervisor support and between job demands and supervisor support were evident for job satisfaction. Conclusions. Supervisor support and organizational justice have significant relationships with nurses’ well-being and job satisfaction. More broadly, the findings suggest that, in the triple-matching approach from a work-stressor to a resource to a work outcome, personal, supervisory and organizational resources may be substitutable. These findings provide nurse management with empirical endorsement for the development and delivery of the organization’s resources for nursing staff.
Resumo:
In this paper, we present SMART (Sequence Matching Across Route Traversals): a vision- based place recognition system that uses whole image matching techniques and odometry information to improve the precision-recall performance, latency and general applicability of the SeqSLAM algorithm. We evaluate the system’s performance on challenging day and night journeys over several kilometres at widely varying vehicle velocities from 0 to 60 km/h, compare performance to the current state-of- the-art SeqSLAM algorithm, and provide parameter studies that evaluate the effectiveness of each system component. Using 30-metre sequences, SMART achieves place recognition performance of 81% recall at 100% precision, outperforming SeqSLAM, and is robust to significant degradations in odometry.
Resumo:
As researchers interested in the pursuit of high quality/high equity literacy learning outcomes, we focus on the learning experiences of five early years French students, with a special regard for those who are already considered as being at-risk of educational failure. We narrow the empirical focus to a single lesson on a mechanical concept of print, that is matching lower and upper case alphabet letters. In doing so, we examine a deeply philosophical question: Which pedagogical practices dis/enable what sorts of early years students as literacy learners? We extend Cazden’s (2006) notion of ‘weaving’ knowledge across dimensions of knowing to describe how the case study teacher ‘weaves’ visible and invisible pedagogies over the four movements of a lesson. The findings reveal different pedagogical framings (Bernstein, 1996) have potentially different cognitive and social effects that constitute different kinds of literacy knowledge and oppressive subject positions for at-risk students (Young, 1990).
Resumo:
Using American panel data from the National Education Longitudinal Study of 1988, this article investigates the effect of working during grade 12 on attainment.We employ, for the first time in the related literature, a semiparametric propensity score matching approach combined with difference-in-differences. We address selection on both observables and unobservables associated with part-time work decisions, without the need for instrumental variable. Once such factors are controlled for, little to no effects on reading and math scores are found. Overall, our results therefore suggest a negligible academic cost from part-time working by the end of high school.
Resumo:
Motivation: Gene silencing, also called RNA interference, requires reliable assessment of silencer impacts. A critical task is to find matches between silencer oligomers and sites in the genome, in accordance with one-to-many matching rules (G-U matching, with provision for mismatches). Fast search algorithms are required to support silencer impact assessments in procedures for designing effective silencer sequences.Results: The article presents a matching algorithm and data structures specialized for matching searches, including a kernel procedure that addresses a Boolean version of the database task called the skyline search. Besides exact matches, the algorithm is extended to allow for the location-specific mismatches applicable in plants. Computational tests show that the algorithm is significantly faster than suffix-tree alternatives. © The Author 2010. Published by Oxford University Press. All rights reserved.
Resumo:
Osteochondral grafts are common treatment options for joint focal defects due to their excellent functionality. However, the difficulty is matching the topography of host and graft(s) surfaces flush to one another. Incongruence could lead to disintegration particularly when the gap reaches subchondoral region. The aim of this study is therefore to investigate cell response to gap geometry when forming cartilage-cartilage bridge at the interface. The question is what would be the characteristics of such a gap if the cells could bridge across to fuse the edges? To answer this, osteochondral plugs devoid of host cells were prepared through enzymatic decellularization and artificial clefts of different sizes were created on the cartilage surface using laser ablation. High density pellets of heterologous chondrocytes were seeded on the defects and cultured with chondrogenic differentiation media for 35 days. The results showed that the behavior of chondrocytes was a function of gap topography. Depending on the distance of the edges two types of responses were generated. Resident cells surrounding distant edges demonstrated superficial attachment to one side whereas clefts of 150 to 250 µm width experienced cell migration and anchorage across the interface. The infiltration of chondrocytes into the gaps provided extra space for their proliferation and laying matrix; as the result faster filling of the initial void space was observed. On the other hand, distant and fit edges created an incomplete healing response due to the limited ability of differentiated chondrocytes to migrate and incorporate within the interface. It seems that the initial condition of the defects and the curvature profile of the adjacent edges were the prime determinants of the quality of repair; however, further studies to reveal the underlying mechanisms of cells adapting to and modifying the new environment would be of particular interest.
Resumo:
A major challenge for robot localization and mapping systems is maintaining reliable operation in a changing environment. Vision-based systems in particular are susceptible to changes in illumination and weather, and the same location at another time of day may appear radically different to a system using a feature-based visual localization system. One approach for mapping changing environments is to create and maintain maps that contain multiple representations of each physical location in a topological framework or manifold. However, this requires the system to be able to correctly link two or more appearance representations to the same spatial location, even though the representations may appear quite dissimilar. This paper proposes a method of linking visual representations from the same location without requiring a visual match, thereby allowing vision-based localization systems to create multiple appearance representations of physical locations. The most likely position on the robot path is determined using particle filter methods based on dead reckoning data and recent visual loop closures. In order to avoid erroneous loop closures, the odometry-based inferences are only accepted when the inferred path's end point is confirmed as correct by the visual matching system. Algorithm performance is demonstrated using an indoor robot dataset and a large outdoor camera dataset.
Resumo:
In a people-to-people matching systems, filtering is widely applied to find the most suitable matches. The results returned are either too many or only a few when the search is generic or specific respectively. The use of a sophisticated recommendation approach becomes necessary. Traditionally, the object of recommendation is the item which is inanimate. In online dating systems, reciprocal recommendation is required to suggest a partner only when the user and the recommended candidate both are satisfied. In this paper, an innovative reciprocal collaborative method is developed based on the idea of similarity and common neighbors, utilizing the information of relevance feedback and feature importance. Extensive experiments are carried out using data gathered from a real online dating service. Compared to benchmarking methods, our results show the proposed method can achieve noticeable better performance.
Resumo:
The design of applications for dynamic ridesharing or carpooling is often formulated as a matching problem of connecting people with an aligned set of transport needs within a reasonable interval of time and space. This problem formulation relegates social connections to being secondary factors. Technology assisted ridesharing applications that put the matching problem first have revealed that they suffer from being unable to address the factor of social comfort, even after adding friend features or piggybacking on social networking sites. This research aims to understand the fabric of social interactions through which ridesharing happens. We take an online observation approach in order to understand the fabric of social interactions for ridesharing that is happening in highly subscribed online groups of local residents. This understanding will help researchers to identify design challenges and opportunities to support ridesharing in local communities. This paper contributes a fundamental understanding of how social interactions and social comfort precede rideshare requests in local communities.
Resumo:
Robust descriptor matching across varying lighting conditions is important for vision-based robotics. We present a novel strategy for quantifying the lighting variance of descriptors. The strategy works by utilising recovered low dimensional mappings from Isomap and our measure of the lighting variance of each of these mappings. The resultant metric allows different descriptors to be compared given a dataset and a set of keypoints. We demonstrate that the SIFT descriptor typically has lower lighting variance than other descriptors, although the result depends on semantic class and lighting conditions.
Resumo:
In this paper we present a novel place recognition algorithm inspired by recent discoveries in human visual neuroscience. The algorithm combines intolerant but fast low resolution whole image matching with highly tolerant, sub-image patch matching processes. The approach does not require prior training and works on single images (although we use a cohort normalization score to exploit temporal frame information), alleviating the need for either a velocity signal or image sequence, differentiating it from current state of the art methods. We demonstrate the algorithm on the challenging Alderley sunny day – rainy night dataset, which has only been previously solved by integrating over 320 frame long image sequences. The system is able to achieve 21.24% recall at 100% precision, matching drastically different day and night-time images of places while successfully rejecting match hypotheses between highly aliased images of different places. The results provide a new benchmark for single image, condition-invariant place recognition.
Resumo:
A security system based on the recognition of the iris of human eyes using the wavelet transform is presented. The zero-crossings of the wavelet transform are used to extract the unique features obtained from the grey-level profiles of the iris. The recognition process is performed in two stages. The first stage consists of building a one-dimensional representation of the grey-level profiles of the iris, followed by obtaining the wavelet transform zerocrossings of the resulting representation. The second stage is the matching procedure for iris recognition. The proposed approach uses only a few selected intermediate resolution levels for matching, thus making it computationally efficient as well as less sensitive to noise and quantisation errors. A normalisation process is implemented to compensate for size variations due to the possible changes in the camera-to-face distance. The technique has been tested on real images in both noise-free and noisy conditions. The technique is being investigated for real-time implementation, as a stand-alone system, for access control to high-security areas.
Resumo:
A large number of methods have been published that aim to evaluate various components of multi-view geometry systems. Most of these have focused on the feature extraction, description and matching stages (the visual front end), since geometry computation can be evaluated through simulation. Many data sets are constrained to small scale scenes or planar scenes that are not challenging to new algorithms, or require special equipment. This paper presents a method for automatically generating geometry ground truth and challenging test cases from high spatio-temporal resolution video. The objective of the system is to enable data collection at any physical scale, in any location and in various parts of the electromagnetic spectrum. The data generation process consists of collecting high resolution video, computing accurate sparse 3D reconstruction, video frame culling and down sampling, and test case selection. The evaluation process consists of applying a test 2-view geometry method to every test case and comparing the results to the ground truth. This system facilitates the evaluation of the whole geometry computation process or any part thereof against data compatible with a realistic application. A collection of example data sets and evaluations is included to demonstrate the range of applications of the proposed system.