Matching occupation and self: Does matching theory adequately model children's thinking?

The present exploratory-descriptive cross-national study focused on the career development of 11- to 14-yr.-old children, in particular whether they can match their personal characteristics with their occupational aspirations. Further, the study explored whether their matching may be explained in terms of a fit between person and environment using Holland's theory as an example. Participants included 511 South African and 372 Australian children. Findings relate to two items of the Revised Career Awareness Survey that require children to relate personal-social knowledge to their favorite occupation. Data were analyzed in three stages using descriptive statistics, i.e., mean scores, frequencies, and percentage agreement. The study indicated that children perceived their personal characteristics to be related to their occupational aspirations. However, how this matching takes place is not adequately accounted for in terms of a career theory such as that of Holland.

Behavioural development in a matching-to-sample task and token use by an infant chimpanzee reared by his mother

Animal Cognition, V.6, pp. 259–267

Evaluating the combination of relaxation and argumentation in ontology matching negotiation

No decorrer dos últimos anos, os agentes (inteligentes) de software foram empregues como um método para colmatar as dificuldades associadas com a gestão, partilha e reutilização de um crescente volume de informação, enquanto as ontologias foram utilizadas para modelar essa mesma informação num formato semanticamente explícito e rico. À medida que a popularidade da Web Semântica aumenta e cada vez informação é partilhada sob a forma de ontologias, o problema de integração desta informação amplifica-se. Em semelhante contexto, não é expectável que dois agentes que pretendam cooperar utilizem a mesma ontologia para descrever a sua conceptualização do mundo. Inclusive pode revelar-se necessário que agentes interajam sem terem conhecimento prévio das ontologias utilizadas pelos restantes, sendo necessário que as conciliem em tempo de execução num processo comummente designado por Mapeamento de Ontologias [1]. O processo de mapeamento de ontologias é normalmente oferecido como um serviço aos agentes de negócio, podendo ser requisitado sempre que seja necessário produzir um alinhamento. No entanto, tendo em conta que cada agente tem as suas próprias necessidades e objetivos, assim como a própria natureza subjetiva das ontologias que utilizam, é possível que tenham diferentes interesses relativamente ao processo de alinhamento e que, inclusive, recorram aos serviços de mapeamento que considerem mais convenientes [1]. Diferentes matchers podem produzir resultados distintos e até mesmo contraditórios, criando-se assim conflitos entre os agentes. É necessário que se proceda então a uma tentativa de resolução dos conflitos existentes através de um processo de negociação, de tal forma que os agentes possam chegar a um consenso relativamente às correspondências que devem ser utilizadas na tradução de mensagens a trocar. A resolução de conflitos é considerada uma métrica de grande importância no que diz respeito ao processo de negociação [2]: considera-se que existe uma maior confiança associada a um alinhamento quanto menor o número de conflitos por resolver no processo de negociação que o gerou. Desta forma, um alinhamento com um número elevado de conflitos por resolver apresenta uma confiança menor que o mesmo alinhamento associado a um número elevado de conflitos resolvidos. O processo de negociação para que dois ou mais agentes gerem e concordem com um alinhamento é denominado de Negociação de Mapeamentos de Ontologias. À data existem duas abordagens propostas na literatura: (i) baseadas em Argumentação (e.g. [3] [4]) e (ii) baseadas em Relaxamento [5] [6]. Cada uma das propostas expostas apresenta um número de vantagens e limitações. Foram propostas várias formas de combinação das duas técnicas [2], com o objetivo de beneficiar das vantagens oferecidas e colmatar as suas limitações. No entanto, à data, não são conhecidas experiências documentadas que possam provar tal afirmação e, como tal, não é possível atestar que tais combinações tragam, de facto, o benefício que pretendem. O trabalho aqui apresentado pretende providenciar tais experiências e verificar se a afirmação de melhorias em relação aos resultados das técnicas individuais se mantém. Com o objetivo de permitir a combinação e de colmatar as falhas identificadas, foi proposta uma nova abordagem baseada em Relaxamento, que é posteriormente combinada com as abordagens baseadas em Argumentação. Os seus resultados, juntamente com os da combinação, são aqui apresentados e discutidos, sendo possível identificar diferenças nos resultados gerados por combinações diferentes e possíveis contextos de utilização.

Business model analysis of Mobitto: How to solve the chicken and egg problem of a multi-sided platform?

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Median stable matching for college admission

We give a simple and concise proof that so-called generalized median stable matchings are well-defined stable matchings for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings.

Procedurally fair and stable matching

We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give various examples of probability distributions on the set of stable matchings and discuss properties that differentiate employment by lotto and the random order mechanism. Finally, we consider an adjustment of the random order mechanism, the equitable random order mechanism, that combines aspects of procedural and "endstate'' fairness. Aldershof et al. (1999) and Ma (1996) that exist on the probability distribution induced by both mechanisms. Finally, we consider an adjustment of the random order mechanism, the equitable random order mechanism.

Matching and Sorting in a Global Economy

We develop a neoclassical trade model with heterogeneous factors of production. We consider a world with two factors, labor and .managers., each with a distribution of ability levels. Production combines a manager of some type with a group of workers. The output of a unit depends on the types of the two factors, with complementarity between them, while exhibiting diminishing returns to the number of workers. We examine the sorting of factors to sectors and the matching of factors within sectors, and we use the model to study the determinants of the trade pattern and the effects of trade on the wage and salary distributions. Finally, we extend the model to include search frictions and consider the distribution of employment rates.

Hierarchical conditional random fields for parts based models matching

A parts based model is a parametrization of an object class using a collection of landmarks following the object structure. The matching of parts based models is one of the problems where pairwise Conditional Random Fields have been successfully applied. The main reason of their effectiveness is tractable inference and learning due to the simplicity of involved graphs, usually trees. However, these models do not consider possible patterns of statistics among sets of landmarks, and thus they sufffer from using too myopic information. To overcome this limitation, we propoese a novel structure based on a hierarchical Conditional Random Fields, which we explain in the first part of this memory. We build a hierarchy of combinations of landmarks, where matching is performed taking into account the whole hierarchy. To preserve tractable inference we effectively sample the label set. We test our method on facial feature selection and human pose estimation on two challenging datasets: Buffy and MultiPIE. In the second part of this memory, we present a novel approach to multiple kernel combination that relies on stacked classification. This method can be used to evaluate the landmarks of the parts-based model approach. Our method is based on combining responses of a set of independent classifiers for each individual kernel. Unlike earlier approaches that linearly combine kernel responses, our approach uses them as inputs to another set of classifiers. We will show that we outperform state-of-the-art methods on most of the standard benchmark datasets.

Percutaneous closure of patent foramen ovale: head-to-head comparison of two different devices

Percutaneous closure of patent foramen ovale (PFO) has been proposed as the treatment of choice for young high-risk patients who suffered cryptogenic stroke and/or peripheral paradoxical embolism. We sought to compare prospectively two different devices used for percutaneous PFO closure.Prospective data were collected on 40 high risk patients (females: 38%, mean age : 44 +/- 11 years, interatrial septal aneurysm >10 mm: 68%) who underwent percutaneous PFO closure after cryptogenic stroke (n = 38) or peripheral paradoxical embolism (n = 2). Chronologically, 20 patients were first treated by a PFO-Star (Cardia, Burnsville, MI) device. Then, 20 other patients received a Starflex occluder (NMT, Boston, MA). The primary endpoint was complete PFO closure at 6 months as assessed by transthoracic contrast echocardiography. Secondary endpoints were major peri- or post procedural complications and clinical recurrence at 1 year follow-up.Baseline clinical and anatomical characteristics were comparable for both groups. Complete PFO closure was observed in 50% (PFO-Star) and 90% (Starflex) of patients (p=0.001) respectively. Major peri-procedural complications occurred in the PFO-star group only: right-sided device thrombus (1 patient) and aorto-right atrial fistula (1 patient). At 1 year follow-up, no clinical recurrence occurred.In conclusion, despite the absence of clinical recurrence in this high-risk population with presumed paradoxical embolism, complete PFO closure at 6 months follow-up was significantly related to the type of closure device used

Adaptations of two specialist herbivores to movement on the hairy leaf surface of their host, Solanum guaraniticum Hassl (Solanaceae)

Plant trichomes can difficult the attachment and movement of small insects. Here, we examine the hypothesis that the success on the use of densely haired hosts by two cassidine species is determined by differential morphology and behavior. Larvae of Gratiana graminea (Klug, 1829) and Gratiana conformis (Boheman, 1854) move on the leaf surface of their host, Solanum guaraniticum Hassl by anchoring their tarsungulus on the trichome rays or by inserting the tarsungulus tip directly into epidermis. This kind of movement is only possible due to a similar tarsungulus shape among the species. Tarsungulus growth pattern is also similar between species, being relatively small on the posterior aperture, matching the diameter of the host plant trichome rays. The tarsungulus shape associated with differences on ontogenetic growth and attachment pattern allow these two Cassidinae larvae to efficiently move on the pubescent leaf surface of their host.

General preferences for consumption goods in the random matching model of commodity money

This paper generalizes the original random matching model of money byKiyotaki and Wright (1989) (KW) in two aspects: first, the economy ischaracterized by an arbitrary distribution of agents who specialize in producing aparticular consumption good; and second, these agents have preferences suchthat they want to consume any good with some probability. The resultsdepend crucially on the size of the fraction of producers of each goodand the probability with which different agents want to consume eachgood. KW and other related models are shown to be parameterizations ofthis more general one.

Molecular characterization of HLA-C incompatibilities in HLA-ABDR-matched unrelated bone marrow donor-recipient pairs. Sequence of two new Cw alleles (Cw*02023 and Cw*0707) and recognition by cytotoxic T lymphocytes.

While the influence of HLA-AB and -DRB1 matching on the outcome of bone marrow transplantation (BMT) with unrelated donors is clear, the evaluation of HLA-C has been hampered by its poor serological definition. Because the low resolution of standard HLA-C typing could explain the significant number of positive cytotoxic T lymphocyte precursor frequency (CTLpf) tests found among HLA-AB-subtype, DRB1/B3/B5-subtype matched patient/donor pairs, we have identified by sequencing the incompatibilities recognized by CD8+ CTL clones obtained from such positive CTLpf tests. In most cases the target molecules were HLA-C antigens that had escaped detection by serology (e.g. Cw*1601, 1502 or 0702). Direct recognition of HLA-C by a CTL clone was demonstrated by lysis of the HLA class I-negative 721.221 cell line transfected with Cw*1601 cDNA. Because of the functional importance of Cw polymorphism, a PCR-SSO oligotyping procedure was set up allowing the resolution of 29 Cw alleles. Oligotyping of a panel of 382 individuals (including 101 patients and their 272 potential unrelated donors, 5 related donors and 4 platelet donors) allowed to determine HLA-C and HLA A-B-Cw-DRB1 allelic frequencies, as well as a number of A-Cw, B-Cw, and DRB1-Cw associations. Two new HLA-Cw alleles (Cw*02023 and Cw*0707) were identified by DNA sequencing of PCR-amplified exon 2-intron 2-exon 3 amplicons. Furthermore, we determined the degree of HLA-C compatibility in 287 matched pairs that could be formed from 73 patients and their 184 potential unrelated donors compatible for HLA-AB by serology and for HLA-DRB1/ B3/B5 by oligotyping. Cw mismatches were identified in 42.1% of these pairs, and AB-subtype oligotyping showed that 30% of these Cw-incompatible pairs were also mismatched for A or B-locus subtype. The degree of HLA-C incompatibility was strongly influenced by the linkage with B alleles and by the ABDR haplotypes. Cw alleles linked with B*4403, B*5101, B18, and B62 haplotypes were frequently mismatched. Apparently high resolution DNA typing for HLA-AB does not result in full matching at locus C. Since HLA-C polymorphism is recognized by alloreactive CTLs, such incompatibilities might be as relevant as AB-subtype mismatches in clinical transplantation.

MSISpIC: A Probabilistic Scan Matching Algorithm Using a Mechanical Scanned Imaging Sonar

This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results

Using the optical mouse sensor as a two-euro counterfeit coin detector

In this paper, the sensor of an optical mouse is presented as a counterfeit coin detector applied to the two-Euro case. The detection process is based on the short distance image acquisition capabilities of the optical mouse sensor where partial images of the coin under analysis are compared with some partial reference coin images for matching. Results show that, using only the vision sense, the counterfeit acceptance and rejection rates are very similar to those of a trained user and better than those of an untrained user.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.